By Topic

Feature point correspondence in the presence of occlusion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Salari, V. ; Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA ; Sethi, I.K.

Occlusion and poor feature point detection are two of the main difficulties in the use of multiple frames for establishing correspondence of feature points. A formulation of the correspondence problem as an optimization problem is used to handle these difficulties. Modifications to an existing iterative optimization procedure for solving the formulation of the correspondence problem are discussed. Experimental results are presented to show the merits of the formulation

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:12 ,  Issue: 1 )