Efficient computation of the most probable motion from fuzzy correspondences

M. Ben-Ezra, S. Peleg, M. Werman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

An algorithm is presented for finding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture effect) or a convex polygon. Noise and outliers are always present, and points may belong to different motions. The presented algorithm, which uses linear programming, recovers the motion parameters and performs outlier rejection and motion-segmentation at the same time. The linear program computes the global optimum without a need for initial guess.

Original languageAmerican English
Title of host publicationProceedings - 4th IEEE Workshop on Applications of Computer Vision, WACV 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages22-27
Number of pages6
ISBN (Electronic)0818686065, 9780818686061
DOIs
StatePublished - 1998
Event4th IEEE Workshop on Applications of Computer Vision, WACV 1998 - Princeton, United States
Duration: 19 Oct 199821 Oct 1998

Publication series

NameProceedings - 4th IEEE Workshop on Applications of Computer Vision, WACV 1998
Volume1998-October

Conference

Conference4th IEEE Workshop on Applications of Computer Vision, WACV 1998
Country/TerritoryUnited States
CityPrinceton
Period19/10/9821/10/98

Bibliographical note

Publisher Copyright:
© 1998 IEEE.

Fingerprint

Dive into the research topics of 'Efficient computation of the most probable motion from fuzzy correspondences'. Together they form a unique fingerprint.

Cite this