Filters








72 Hits in 3.6 sec

Kinematic Structure Correspondences via Hypergraph Matching

Hyung Jin Chang, Tobias Fischer, Maxime Petit, Martina Zambelli, Yiannis Demiris
2016 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)  
In this paper, we present a novel framework for finding the kinematic structure correspondence between two objects in videos via hypergraph matching.  ...  Our main contributions can be summarised as follows: (i) casting the kinematic structure correspondence problem into a hypergraph matching problem, incorporating multi-order similarities with normalising  ...  Hypergraph Matching for Kinematic Structure Correspondence In order to estimate the correspondences between two kinematic structures, we use hypergraph matching methods.  ... 
doi:10.1109/cvpr.2016.457 dblp:conf/cvpr/ChangFPZD16 fatcat:iwrlf634hfblrmtdigdm6ft22q

Learning Kinematic Structure Correspondences Using Multi-Order Similarities

Hyung Jin Chang, Tobias Fischer, Maxime Petit, Martina Zambelli, Yiannis Demiris
2017 IEEE Transactions on Pattern Analysis and Machine Intelligence  
In this paper, we present a novel framework for finding the kinematic structure correspondences between two articulated objects in videos via hypergraph matching.  ...  Index Terms-Articulated kinematic structure correspondences, hypergraph matching, subgraph isomorphism aggregation, kinematic correlation, combinatorial local motion similarity, humanoid robotics. !  ...  In Section 3, we present a framework for estimating the kinematic structure correspondences via hypergraph matching.  ... 
doi:10.1109/tpami.2017.2777486 pmid:29989982 fatcat:e55c5eqe7jeh5i2pnmw5y5nvea

Joint Probabilistic Hypergraph Matching Labeled Multi-Bernoulli Filter for Rigid Target Tracking

Yuan Huang, Liping Wang, Xueying Wang, Wei An
2019 Applied Sciences  
In this paper, the structure of the rigid target is represented as a hypergraph, and the problem of data association is formulated as a hypergraph matching problem.  ...  However, the performance of hypergraph matching degrades if there are missed detections and clutter.  ...  of a hypergraph to matching another hypergraph.  ... 
doi:10.3390/app10010099 fatcat:6ijfydywtbe7tgralpm6uq53vy

Spectral analysis of mixing in 2D high-Reynolds flows [article]

Hassan Arbabi, Igor Mezic
2020 arXiv   pre-print
., the kinematics in the core of mean flow is like rigid-body rotation.  ...  The MATLAB implementation of advection, mix-norm and hypergraphs computation along with the flow data used in the paper is available at https://github.com/ arbabiha/Mixing-analysis-2d-flows.  ...  Those techniques, just to name a few, include the theory of Lagrangian coherent structures (Haller 2015) , topological analysis via braid dynamics (Boyland et al. 2000; Budišić & Thiffeault 2015) , theory  ... 
arXiv:1903.10044v2 fatcat:eq237abtsfeene4pjvz43iqnii

Algorithmic Causal Sets and the Wolfram Model [article]

Jonathan Gorard
2021 arXiv   pre-print
The formal relationship between two differing approaches to the description of spacetime as an intrinsically discrete mathematical structure, namely causal set theory and the Wolfram model, is studied,  ...  structure yields a significantly more robust technique for estimating spacelike distances when compared against several standard distance and predistance estimator functions in causal set theory.  ...  in which a causal set is effectively generated algorithmically via an abstract rewriting system defined over hypergraphs.  ... 
arXiv:2011.12174v2 fatcat:gvhdmdra3bfkrmo32t5222izhm

A General Approach to Model Biomedical Data from 3D Unorganised Point Clouds with Medial Scaffolds [article]

Frederic Fol Leymarie, Ming-Ching Chang, Celina Imielinska, Benjamin B. Kimia
2010 Eurographics Workshop on Visual Computing for Biomedicine  
The radius field of theMS provides an intuitive definition for morphological measurements, while the graph structure made explicit by theMS is useful for shape registration and matching applications.  ...  We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08].  ...  extracting salient axial symmetries and high curvature surface ridges, and object registration by matching the corresponding compact MS graph structures.  ... 
doi:10.2312/vcbm/vcbm10/065-074 fatcat:o5v3amrtnja6hf2caweewlmsry

Modelling the way mathematics is actually done

Joseph Corneli, Ursula Martin, Dave Murray-Rust, Alison Pease, Raymond Puzio, Gabriela Rino Nesin
2017 Proceedings of the 5th ACM SIGPLAN International Workshop on Functional Art, Music, Modeling, and Design - FARM 2017  
In order to make the structures that these modelling tools produce accessible to computational reasoning, we encode representations in a higherorder nested semantic network.  ...  The authors acknowledge the financial support of the EPSRC via Ursula Martin's fellowship "The Social Machine of Mathematics" (EP/K040251/1).  ...  Auxilliary material, including computer programs, data sets, and full versions of diagrams quoted above are available via this URL: http://metameso.org/ar/.  ... 
doi:10.1145/3122938.3122942 dblp:conf/icfp/CorneliMMPPN17 fatcat:3avruyjwpnd5nkmjdyl6mtu6jq

Author Index

2010 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition  
Isoperimetric Cut on a Directed Graph Liu, Qingshan Image Retrieval via Probabilistic Hypergraph Ranking Exploring Facial Expression with Compositional Features Liu, Shaohui Visual Tracking via  ...  Huang, Yuchi Image Retrieval via Probabilistic Hypergraph Ranking Automatic Image Annotation Using Group Sparsity Huang, Zhongyang Nonparametric Label-to-Region by Search Huber, Martin Lymph Node  ... 
doi:10.1109/cvpr.2010.5539913 fatcat:y6m5knstrzfyfin6jzusc42p54

Scheduling (Dagstuhl Seminar 20081)

Nicole Megow, David Shmoys, Ola Svensson
2020 Dagstuhl Reports  
A polynomial time algorithm by Annamalai et al. gives a 12.33-approximation and is based on a modification of Haxell's hypergraph matching argument.  ...  Requests need to be matched in pairs. Pending requests can be matched at any time after their arrival.  ... 
doi:10.4230/dagrep.10.2.50 dblp:journals/dagstuhl-reports/MegowSS20 fatcat:dtrzez6ogbhdjc56hbnv3hyuhy

Single-pixel interior filling function approach for detecting and correcting errors in particle tracking

Stanislav Burov, Patrick Figliozzi, Binhua Lin, Stuart A. Rice, Norbert F. Scherer, Aaron R. Dinner
2016 Proceedings of the National Academy of Sciences of the United States of America  
Unbiased SPIFFs correspond to uniform pixel filling, whereas biased ones exhibit pixel locking, in which the estimated particle positions concentrate toward the centers of pixels.  ...  The framework is applied to solve globally optimal collision-free inverse kinematics problems, wherein large solution databases are used to produce near-optimal solutions in a submillisecond time on a  ...  , and the semantic structure.  ... 
doi:10.1073/pnas.1619104114 pmid:28028226 pmcid:PMC5240672 fatcat:imzi4n3bmjguzjakwdalknvkmi

A Review of Tracking, Prediction and Decision Making Methods for Autonomous Driving [article]

Florin Leon, Marius Gavrilescu
2019 arXiv   pre-print
The study uses both environment structure (in the form of kinematic vehicular constraints, which can be modeled very accurately), and the assumption that human drivers optimize their trajectories according  ...  Mixed Methods The authors of [105] take a model-based approach to prediction, in order to make use of structured prior knowledge of vehicle kinematics, and the assumption that other drivers plan trajectories  ... 
arXiv:1909.07707v1 fatcat:h2ttehcuzrc2dnnmqzigilcyri

Feature Matching with Affine-Function Transformation Models

Hongsheng Li, Xiaolei Huang, Junzhou Huang, Shaoting Zhang
2014 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Feature matching is an important problem and has extensive uses in computer vision. However, existing feature matching methods support either a specific or a small set of transformation models.  ...  In this paper, we propose a unified feature matching framework which supports a large family of transformation models.  ...  Zass and Shashua [31] for the first time tried to solve the feature matching problem via hypergraph matching, whose high-order edges can encode more complex geometric invariants.  ... 
doi:10.1109/tpami.2014.2324568 pmid:26353148 fatcat:7bpkryby3nckvjlq25c7hsdihm

A development cycle for automated self-exploration of robot behaviors

Thomas M. Roehr, Daniel Harnack, Hendrik Wöhrle, Felix Wiebe, Moritz Schilling, Oscar Lima, Malte Langosz, Shivesh Kumar, Sirko Straube, Frank Kirchner
2021 AI Perspectives  
These processes are based on a graph-based representation of a robot's structure, including hardware and software components.  ...  [16] uses hypergraphs to model all aspects of structure in system design, software design and other domains.  ...  As a result, the known structural requirements for a functionality can be matched against (partial) structures of a composite system to test whether this functionality is supported.  ... 
doi:10.1186/s42467-021-00008-9 fatcat:qbrcgbc3ejd5lmvzrpzakzsz5q

A Development Cycle for Automated Self-Exploration of Robot Behaviors [article]

Thomas M. Roehr, Daniel Harnack, Hendrik Wöhrle, Felix Wiebe, Moritz Schilling, Oscar Lima, Malte Langosz, Shivesh Kumar, Sirko Straube, Frank Kirchner
2021 arXiv   pre-print
These processes are based on a graph-based representation of a robot's structure, including hardware and software components.  ...  [16] uses hypergraphs to model all aspects of structure in system design, software design and other domains.  ...  As a result, the known structural requirements for a functionality can be matched against (partial) structures of a composite system to test whether this functionality is supported.  ... 
arXiv:2007.14928v2 fatcat:v2h5j74mgbfofn5wb6nx6yav3a

Multitarget data association with higher-order motion models

R. T. Collins
2012 2012 IEEE Conference on Computer Vision and Pattern Recognition  
It is similar to the iterated conditional modes (ICM) algorithm, but applied at each step to a block of variables representing correspondences between two adjacent frames, with the optimal conditional  ...  In contrast, data association can also be formulated as a Quadratic Boolean Optimization (QBO) problem [7, 13] , including the problem of two frame association via graph matching [9] .  ...  It is similar to the iterated conditional modes (ICM) algorithm, but is applied at each step to a block of variables representing possible correspondences between two adjacent frames.  ... 
doi:10.1109/cvpr.2012.6247870 dblp:conf/cvpr/Collins12 fatcat:cyjk6ji5izdq5abhtul4bhgr44
« Previous Showing results 1 — 15 out of 72 results