Dense disparity features for fast stereo vision

John Kalomiros

doi:10.1117/1.JEI.21.4.043023

17 December 2012 Dense disparity features for fast stereo vision

John Kalomiros

Author Affiliations +

Journal of Electronic Imaging, Vol. 21, Issue 4, 043023 (December 2012). https://doi.org/10.1117/1.JEI.21.4.043023

Abstract

A stereo vision algorithm suitable for fast dense stereo matching is proposed. This method extracts areas of uniform disparity or dense disparity features by testing candidate disparity estimates and classifying pixels according to a matching error. By commencing with a rigorous error threshold, pixels of reliable disparity values are identified. As the threshold is relaxed, other pixels are aggregated, forming dense areas of uniform disparity. Neighboring support is acquired with texture filling and other morphological operations in each disparity feature. The algorithm is tested on publicly available and self-generated data sets and is shown to produce promising results in terms of quality and speed. Handling of regions without texture is discussed and a comparison with other methods is also presented.

Citation Download Citation

John Kalomiros "Dense disparity features for fast stereo vision," Journal of Electronic Imaging 21(4), 043023 (17 December 2012). https://doi.org/10.1117/1.JEI.21.4.043023

Published: 17 December 2012

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available