Abstract

Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with fronto-parallel surfaces. In this paper we propose an algorithm to compute correspondence between stereo images or between frames of a motion sequence by minimizing an energy functional that accounts for slanted surfaces. The energy is minimized in a greedy strategy that alternates between segmenting the image into a number of non-overlapping regions (using the multiway-cut algorithm of Boykov, Veksler, and Zabih) and finding the affine parameters describing the displacement function of each region. A follow-up step enables the algorithm to escape local minima due to oversegmentation. Experiments on real images show the algorithm's ability to find an accurate segmentation and displacement map, as well as discontinuities and creases, from a wide variety of stereo and motion imagery.

Keywords

Maxima and minimaClassification of discontinuitiesArtificial intelligenceAffine transformationComputer scienceComputer visionDisplacement (psychology)SegmentationEnergy (signal processing)Image (mathematics)Sequence (biology)Structure from motionMotion (physics)Image segmentationFunction (biology)AlgorithmMathematicsGeometry

Affiliated Institutions

Related Publications

Normalized cuts and image segmentation

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach...

2000 IEEE Transactions on Pattern Analysis... 15440 citations

Publication Info

Year
1999
Type
article
Pages
489-495 vol.1
Citations
234
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

234
OpenAlex

Cite This

Stan Birchfield, Carlo Tomasi (1999). Multiway cut for stereo and motion with slanted surfaces. , 489-495 vol.1. https://doi.org/10.1109/iccv.1999.791261

Identifiers

DOI
10.1109/iccv.1999.791261