Sciweavers

15 search results - page 1 / 3
» Subspace matching: Unique solutions to point matching with g...
Sort
View
ICCV
2009
IEEE
14 years 10 months ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
CVPR
2005
IEEE
14 years 7 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
ICCV
2011
IEEE
12 years 5 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
TASE
2010
IEEE
13 years 3 hour ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
DICTA
2003
13 years 6 months ago
Image Matching using TI Multi-wavelet Transform
Abstract. A multi-resolution image matching technique based on multiwavelets followed by a coarse to fine strategy is presented. The technique addresses the estimation of optimal c...
Asim Bhatti, Saeid Nahavandi, Hong Zheng