2015
DOI: 10.1117/12.2083741
|View full text |Cite
|
Sign up to set email alerts
|

Stereo matching with space-constrained cost aggregation and segmentation-based disparity refinement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…− Disparity refinement: in the last stage of the framework, standard approaches for post-processing and disparity refinement were implemented. Peng et al [35] integrated the mean shift and super-pixel with segmentation (SEG) approach which clusters the disparity map according to colour.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…− Disparity refinement: in the last stage of the framework, standard approaches for post-processing and disparity refinement were implemented. Peng et al [35] integrated the mean shift and super-pixel with segmentation (SEG) approach which clusters the disparity map according to colour.…”
Section: Methodsmentioning
confidence: 99%
“…− Weighted median filter (WMF) is implemented where it essentially combines box aggregation with a weighted median, effectively eliminates noise from outliers while conserving the edges [36]. Median filter (MF) was utilised in [35]. MF is accurate at the edges but inaccurate in low-textured regions.…”
Section: Methodsmentioning
confidence: 99%
“…In the last stage, postprocessing and disparity refinement standard techniques were executed. Peng et al [39] implemented the integration of mean shift and superpixel with segmentation method (SEG). This approach clusters the disparity map based on colour.…”
Section: Disparity Refinementmentioning
confidence: 99%
“…This fact is evident in Table I that shows the computational times of the proposed method and the approaches in TSGO, JSOSP+GCP and KADI (the respective computational times were obtained from [45], [46] and [47]). Table V shows that the proposed approach has better ranking SSCBP [51]. The computational complexity of SSCBP [51] is not available to compare it against our approach.…”
Section: B Middlebury Online Stereo Evaluation Benchmarkmentioning
confidence: 99%
“…Table V shows that the proposed approach has better ranking SSCBP [51]. The computational complexity of SSCBP [51] is not available to compare it against our approach. Table I also includes the CPU computation time of the ADCensus [13] approach that is listed in Table V.The proposed method has Fig.…”
Section: B Middlebury Online Stereo Evaluation Benchmarkmentioning
confidence: 99%