Mr. Ke Han Profile

Ke Han

at Beijing Univ of Posts and Telecommunications

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 18 November 2019 Paper

An efficient stereo matching based on superpixel segmentation

Haichao Li, Ke Han

Proceedings Volume 11187, 111870B (2019) https://doi.org/10.1117/12.2537259

KEYWORDS: Image segmentation, Lawrencium, Feature extraction, 3D image processing, Image processing algorithms and systems, 3D image reconstruction, Reliability, Image processing, Databases, Lithium

Read Abstract +

The traditional semi-global matching methods provide a good trade-off between accuracy and complexity compared with the local matching methods and global matching methods, however, they still need to traverse the full disparity search range to find the best matching point. Therefore, it still needs high computational cost especially for stereo images with large disparity search range. We proposes an efficient semi-global matching method that disparity search range is reduced based on 3D plane fitting. Firstly, the simple linear iterative clustering (SLIC) algorithm is adopted to segment the stereo images. Secondly, the dense SIFT keypoints are extracted and matched from the left and right images. Thirdly, similar adjacent superpixels are merged based on the gray mean and variance, and for each merged region, 3-D plane is fitted based on matched keypoints. Finally, the pixel-wise disparity search range is limited into several pixels for more-global matching method which can reduce the computational complexity and obtain an accurate disparity map. Experimental results demonstrate that the computational speed of the new semi-global matching method is several times faster than that of the original method, as well as offering a more accurate disparity map.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

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

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years