Sciweavers

910 search results - page 25 / 182
» Computational Efficiency of Structural Image Matching
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
ACCV
2007
Springer
14 years 1 months ago
Texture-Independent Feature-Point Matching (TIFM) from Motion Coherence
Abstract. This paper proposes a novel and efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images. The striking feature of th...
Ping Li, Dirk Farin, Rene Klein Gunnewiek, Peter H...
RECOMB
2004
Springer
14 years 7 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
PRL
2008
122views more  PRL 2008»
13 years 7 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu
CVPR
2000
IEEE
13 years 12 months ago
Corner Guided Curve Matching and its Application to Scene Reconstruction
Corners and curves are important image features in many vision-based applications. Corners are usually more stable and easier to match than curves,while curves contain richer info...
Ying Shan, Zhengyou Zhang