2017 IEEE 19th International Workshop on Multimedia Signal Processing (MMSP) 2017
DOI: 10.1109/mmsp.2017.8122284
|View full text |Cite
|
Sign up to set email alerts
|

Accurate and fast segment-based cost aggregation algorithm for stereo matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…Finally, unlike in other methods [32, 33], the matching costs C was formed by combining the two costs from pixel‐space and SLIC‐space, Cfalse(0.16emp,dfalse)=false(1αfalse)Cpfalse(0.16emp,dfalse)+αCpfalse(0.16emp,dfalse)…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Finally, unlike in other methods [32, 33], the matching costs C was formed by combining the two costs from pixel‐space and SLIC‐space, Cfalse(0.16emp,dfalse)=false(1αfalse)Cpfalse(0.16emp,dfalse)+αCpfalse(0.16emp,dfalse)…”
Section: Methodsmentioning
confidence: 99%
“…Bad 1.0 is set as the error threshold in non-occluded regions. SAS [32], SCA [33], and the proposed method are implemented with the SLIC algorithm. GF_EMA [39] employed the EWMA filter and guided filter for smoothing in the cost volume in pixel space.…”
Section: 21mentioning
confidence: 99%
See 1 more Smart Citation
“…Once the cost of the paired pixels in the stereo images is calculated, the cost aggregation is further applied to achieve more robust results by including more pixels, which have the same tendency. For local stereo matching, the window-based aggregation considers the similarities of the surrounding pixels in a designated window [19][20][21][22][23][24][25]. The ideal windows are designed to include the nearby pixels, which are in the same object as possible.…”
Section: Cost Aggregationmentioning
confidence: 99%
“…In (24), not only with disparity similarity, we further include the color tolerance to label the pixels. For L(x, y) = 0, the mismatched pixels are further categorized into two types: small holes or big holes.…”
Section: Iterative Dual-path Depth Refinementmentioning
confidence: 99%