Noise-driven concurrent stereo matching

Show simple item record

dc.contributor.advisor Grimel'farb, Georgy en
dc.contributor.author Liu, Jiang, 1972- en
dc.date.accessioned 2020-07-08T04:50:11Z en
dc.date.available 2020-07-08T04:50:11Z en
dc.date.issued 2007 en
dc.identifier.uri http://hdl.handle.net/2292/51999 en
dc.description Full text is available to authenticated members of The University of Auckland only. en
dc.description.abstract Reconstruction of 3D scenes from stereo pairs is based on matching of corresponding points in the left and right images. Generally, reconstruction is an ill-posed inverse optical problem because many optical surfaces may produce the same stereo image pair due to homogeneous texture, partial occlusions and optical distortions. To regularise the problem in order to obtain a unique solution close to human visual perception, specific constraints on surfaces need to be imposed. Almost all existing stereo reconstruction algorithms search for a single optical surface yielding the best correspondence between the images under constrained surface continuity, smoothness, and visibility conditions. Typically, most of the constraints are ‘soft’, i.e. allow for deviations, and the matching score is an ad hoc linear combination of individual criteria of signal similarity, surface smoothness, and surface visibility (or occlusions) with empirically chosen weights for each criterion. The resulting complex optimisation problem is solved using different exact or approximate techniques, e.g. dynamic programming, belief propagation or graph min-cut algorithms. However, the heuristic choice of the weights in the matching score strongly influences the reconstruction accuracy. In addition, natural stereo pairs contain many admissible matches, so that the ‘best’ matching that optimises the score may not lead to correct decisions. Moreover, real scenes very rarely consist of a single surface, so this assumption is also too restrictive. The thesis develops an alternative approach to 3D stereo reconstruction called Noise- driven Concurrent Stereo Matching (NCSM). The family of algorithms that implement the NCSM paradigm clearly separate image matching from a subsequent search for optical surfaces. First, a hidden noise model which allows for mutual photometric distortions of images and matching outliers is estimated and then used to search for the candidate volumes by detecting all likely image matches. The selection of the 3D candidate volumes performed by image-to-image matching at a set of fixed depth, or disparity, values abandons the conventional assumption that a single best match has to be found. Then, the reconstruction proceeds from most likely foreground surfaces to the background ones (accounting for occlusions in the process), enlarging corresponding background volumes at the expense of occluded portions and selecting consistent optical surfaces that exhibit high point-wise signal similarity. A family of the NCSM based algorithms demonstrates high quality 3D reconstruction from various stereo pairs. Detailed analyses and comparisons show that the NCSM framework yields results competitive with those from the best-performing conventional algorithms on test stereo pairs with no contrast deviations but notably outperforms these algorithms in the presence of large contrast deviations. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof PhD Thesis - University of Auckland en
dc.relation.isreferencedby UoA99173765514002091 en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. en
dc.rights Restricted Item. Full text is available to authenticated members of The University of Auckland only. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title Noise-driven concurrent stereo matching en
dc.type Thesis en
thesis.degree.discipline Computer Science en
thesis.degree.grantor The University of Auckland en
thesis.degree.level Doctoral en
thesis.degree.name PhD en
dc.rights.holder Copyright: The author en
dc.identifier.wikidata Q112870463


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics