A computational approach to image matching is described that uses multiple attributes associated with a pixel to yield a generally overdetermined system of constraints, taking into account possible structural discontinuities and occlusions. In the algorithm implemented, intensity, edgeness, and cornerness attributes are used in conjunction with the constraints arising from intraregional smoothness, field continuity and discontinuity, and occlusions to compute dense displacement fields and occlusion maps at pixel grids. A multiresolution multigrid structure is used to deal with large disparities. Coarser-level attributes are obtained by blurring the finer-level attributes. The algorithms are tested on real-world scenes containing depth discontinuities and occlusions. A special case of two-view matching is stereo matching where the motion between two images is known. The general algorithm given here can be easily specialized to perform stereo matching using epipolar line constraint.
|Original language||English (US)|
|Title of host publication||Second Int Conf on Comput Vision|
|Publisher||Publ by IEEE|
|Number of pages||10|
|State||Published - 1988|
ASJC Scopus subject areas