Sciweavers

73 search results - page 13 / 15
» Thin Junction Trees
Sort
View
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
14 years 1 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
UAI
2000
13 years 11 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 9 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
PAMI
2006
168views more  PAMI 2006»
13 years 9 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
14 years 4 months ago
Flying Fast and Low Among Obstacles
— Safe autonomous flight is essential for widespread acceptance of aircraft that must fly close to the ground. We have developed a method of collision avoidance that can be use...
Sebastian Scherer, Sanjiv Singh, Lyle Chamberlain,...