1525 search results - page 113 / 305 » Matching with Regular Constraints |
133
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
139
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Most of vision-based algorithms for motion and localization estimation requires matching some interest points in a pair of images. After building feature correspondence, it is pos...
147
click to vote
KIVS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...
124
click to vote
CVIU
2004
15 years 3 months ago
2004
In this paper we address the problem of matching two images with two different resolutions: a high-resolution image and a low-resolution one. The difference in resolution between ...
286
click to vote
CVPR
2011
IEEE
15 years 1 days ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...