By Topic

Segments matching: comparison between a neural approach and a classical optimization way

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

3 Author(s)
Laumy, M. ; LASMEA, Univ. Blaise Pascal, Aubiere, France ; Dhome, M. ; Lapreste, J.-T.

We describe and compare two approaches to achieve segments matching between two images from a sequence, without any knowledge on the viewed object and/or on the motion of the camera between the different images. The first method uses an Hopfield neural network with several local constraints like correlation and distance between segments of consecutive images. The second algorithm is an iterative optimization of a criterion. We model the primitives displacement between the images by an homographic transform. Then we search, with a Levenberg-Marquardt method, the homography matrix giving the best match between the segments of the two images. The two algorithms are validated and compared on sequences of real images

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996