9842 search results - page 1596 / 1969 » The Complexity of the Matching-Cut Problem |
188
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a decentralized approach to multiple target tracking. The novelty of this approach lies in the use of a set of autonomous while collaborative trackers to overc...
181
Voted
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
170
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
174
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Recovering the three-dimensional (3D) object shape lies as an unresolved and active research topic on the crosssection of computer vision, photogrammetry and bioinformatics. Altho...
168
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...