Sciweavers

910 search results - page 24 / 182
» Computational Efficiency of Structural Image Matching
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
ACIVS
2007
Springer
14 years 1 months ago
Descriptor-Free Smooth Feature-Point Matching for Images Separated by Small/Mid Baselines
Abstract. Most existing feature-point matching algorithms rely on photometric region descriptors to distinct and match feature points in two images. In this paper, we propose an eï...
Ping Li, Dirk Farin, Rene Klein Gunnewiek, Peter H...
ICPR
2004
IEEE
14 years 8 months ago
Robust Feature Matching Across Widely Separated Color Images
We present a novel method for feature matching across widely separated color images. The proposed approach is robust and can support various correspondence based algorithms e.g. t...
Alexander Kaplan, Ehud Rivlin, Ilan Shimshoni
ICCV
2009
IEEE
15 years 16 days ago
Wide-Baseline Image Matching Using Line Signatures
We present a wide-baseline image matching approach based on line segments. Line segments are clustered into local groups according to spatial proximity. Each group is treated as...
Lu Wang, Ulrich Neumann and Suya You
ICIP
2009
IEEE
13 years 5 months ago
Lamp: Linear approach for matching points
The 3D object recognition from a single or multiple 2D images is a very important problem in the computer vision field with a wide range of real applications. Considering the affi...
Manuel Marques, João Costeira