Dr. Zhan Zhang Profile

Dr. Zhan Zhang

at Univ of Chinese Academy of Sciences

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 | 14 August 2019 Paper

Internal and external similarity aggregation stereo match algorithm

Zhan Zhang, Dongsheng Yang

Proceedings Volume 11179, 1117923 (2019) https://doi.org/10.1117/12.2539674

KEYWORDS: Detection and tracking algorithms, Network on a chip, RGB color model, Venus, Distributed interactive simulations, Binary data, Evolutionary algorithms, Algorithm development

Read Abstract +

When extracting disparity map, for the high non-occlusion region error rate and low efficiency of stereo matching algorithms, we defined internal similarity (IS) of neighbor pixels in reference color image, and in the color and sub-pixel space, we defined external similarity (ES) of candidate matching pixels between the reference and target images, and given the calculation methods of the internal similarity and external similarity. We discussed the relationship between the internal similarity and external similarity, and taken the internal similarity as the aggregation degree of the external similarity, and the internal and external similarity aggregation (IESA) algorithm was proposed to aggregate the external similarity by the internal similarity along eight directions, after that, the disparity map was calculated by the winner take all (WTA) algorithm, which was used to search the disparity corresponding to the maximum aggregation similarity. Finally, the box plot filter (BPF) was proposed to smooth the disparity map. Experiments on the Middlebury stereo datasets and the extend datasets show that the proposed algorithms achieve the state-of-the-art results.

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