Sciweavers

8 search results - page 1 / 2
» Pairwise Matching of 3D Fragments Using Cluster Trees
Sort
View
IJCV
2008
157views more  IJCV 2008»
13 years 4 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
RECOMB
2004
Springer
14 years 4 months ago
Multiple Genome Alignment by Clustering Pairwise Matches
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
Jeong-Hyeon Choi, Kwangmin Choi, Hwan-Gue Cho, Sun...
ICCV
2007
IEEE
13 years 11 months ago
Latent Model Clustering and Applications to Visual Recognition
We consider clustering situations in which the pairwise affinity between data points depends on a latent ”context” variable. For example, when clustering features arising fro...
Simon Polak, Amnon Shashua
SCVMA
2004
Springer
13 years 10 months ago
Segregation of Moving Objects Using Elastic Matching
We present a method for figure-ground segregation of moving objects from monocular video sequences. The approach is based on tracking extracted contour fragments, in contrast to ...
Vishal Jain, Benjamin B. Kimia, Joseph L. Mundy
PAMI
2007
166views more  PAMI 2007»
13 years 4 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila