2020
DOI: 10.1049/el.2020.1067
|View full text |Cite
|
Sign up to set email alerts
|

Improvement of disparity map refinement stage using adaptive least square plane fitting technique

Abstract: This Letter presents an improvement of disparity map refinement stage using adaptive least square plane fitting technique. This technique is proposed to increase the accuracy on the final stage of stereo matching algorithm. Fundamentally, the accuracy of matching process depends on the robustness of an algorithm on the plain colour region, depth discontinuity and repetitive pattern area. These regions are difficult to be matched and very challenging. Thus, this Letter proposes multiple point selections of disp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 9 publications
(12 reference statements)
0
2
0
Order By: Relevance
“…Firstly, this paper improves the traditional census transformation algorithm in the local algorithm, calculates the initial generation value, and introduces the SGM algorithm based on the unidirectional dynamic programming theory for cost aggregation optimization. en, the WTA (winner-take-all) algorithm [14] is selected to calculate the parallax value corresponding to the minimum aggregate generation value to obtain the initial parallax map. Finally, the initial disparity map is further optimized to obtain a high-quality disparity map.…”
Section: Algorithm Principlementioning
confidence: 99%
“…Firstly, this paper improves the traditional census transformation algorithm in the local algorithm, calculates the initial generation value, and introduces the SGM algorithm based on the unidirectional dynamic programming theory for cost aggregation optimization. en, the WTA (winner-take-all) algorithm [14] is selected to calculate the parallax value corresponding to the minimum aggregate generation value to obtain the initial parallax map. Finally, the initial disparity map is further optimized to obtain a high-quality disparity map.…”
Section: Algorithm Principlementioning
confidence: 99%
“…The earliest fundamental in the stereo matching algorithm design is the matching cost, which obtains the value of disparity map. [7] proposed essential matching cost absolute difference (AD) cost initialization for real-time high-quality system. The advanced AD formula sum of absolute differences (SAD) used by [8] to calculate for each pixel based on the disparity under consideration while zero-mean SSD (ZSSD) used by [9] which eliminates each patch of average intensity and used for the comparison between mean intensity of independent and each pixels.. Another familiar matching cost computation formula used is Normalized Cross Correlation (NCC) technique for generating matching costs.…”
Section: Related Workmentioning
confidence: 99%