The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Constant Time Weighted Median Filtering for Stereo Matching and Beyond
Abstract
Despite the continuous advances in local stereo matching for years, most efforts are on developing robust cost computation and aggregation methods. Little attention has been seriously paid to the disparity refinement. In this work, we study weighted median filtering for disparity refinement. We discover that with this refinement, even the simple box filter aggregation achieves comparable accuracy with various sophisticated aggregation methods (with the same refinement). This is due to the nice weighted median filtering properties of removing outlier error while respecting edges/structures. This reveals that the previously overlooked refinement can be at least as crucial as aggregation. We also develop the first constant time algorithm for the previously time-consuming weighted median filter. This makes the simple combination ``box aggregation + weighted median'' an attractive solution in practice for both speed and accuracy. As a byproduct, the fast weighted median filtering unleashes its potential in other applications that were hampered by high complexities. We show its superiority in various applications such as depth up sampling, clip-art JPEG artifact removal, and image stylization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177 · cited 2×
“Thanks to the constant time algorithm for weighted median filtering, it is feasible for us to study its performance for refining local stereo results.”
BackgroundA Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740
He, K., Sun, J., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.213 · Cited by 5,546
Self-citationHe, K., Sun, J., & Tang, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_1 · Cited by 1,565
Self-citationFast bilateral filtering for the display of high-dynamic-range images
Durand, F., & Dorsey, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566574 · Cited by 1,547
A fast two-dimensional median filtering algorithm
Huang, T., Yang, G., & Tang, G. (1979) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1979.1163188 · Cited by 1,390
Secrets of optical flow estimation and their principles
Sun, D., Roth, S., & Black, M. J. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539939 · Cited by 1,389
Adaptive support-weight approach for correspondence search
Yoon, K.-J., & Kweon, I. S. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.70 · Cited by 1,194
Summed-area tables for texture mapping
Crow, F. C. (1984) · Proceedings of the 11th annual conference on Computer graphics and interactive techniques · doi:10.1145/800031.808600 · Cited by 1,125
Evaluation of Cost Functions for Stereo Matching
Hirschmuller, H., & Scharstein, D. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383248 · Cited by 1,122
Image smoothing via L0gradient minimization
Xu, L., Lu, C., Xu, Y., & Jia, J. (2011) · Proceedings of the 2011 SIGGRAPH Asia Conference · doi:10.1145/2024156.2024208 · Cited by 873
Kopf, J., Cohen, M. F., Lischinski, D., & Uyttendaele, M. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276497 · Cited by 872
Structure extraction from texture via relative total variation
Xu, L., Yan, Q., Xia, Y., & Jia, J. (2012) · ACM Transactions on Graphics · doi:10.1145/2366145.2366158 · Cited by 867
Learning Conditional Random Fields for Stereo
Scharstein, D., & Pal, C. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383191 · Cited by 851
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
Paris, S., & Durand, F. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-007-0110-8 · Cited by 797
Spatial-Depth Super Resolution for Range Images
Yang, Q., Yang, R., Davis, J., & Nister, D. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383211 · Cited by 745
Evaluation of Stereo Matching Costs on Images with Radiometric Differences
Hirschmuller, H., & Scharstein, D. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.221 · Cited by 721
Summed-area tables for texture mapping
Crow, F. C. (1984) · ACM SIGGRAPH Computer Graphics · doi:10.1145/964965.808600 · Cited by 661
Domain transform for edge-aware image and video processing
Gastal, E. S. L., & Oliveira, M. M. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964964 · Cited by 591
A pixel dissimilarity measure that is insensitive to image sampling
Birchfield, S., & Tomasi, C. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.677269 · Cited by 585
Cross-Based Local Stereo Matching Using Orthogonal Integral Images
Zhang, K., Lu, J., & Lafruit, G. (2009) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2009.2020478 · Cited by 503
Fast cost-volume filtering for visual correspondence and beyond
Rhemann, C., Hosni, A., Bleyer, M., Rother, C., & Gelautz, M. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995372 · Cited by 485
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
Paris, S., & Durand, F. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744085_44 · Cited by 481
Real-time O(1) bilateral filtering
Yang, Q., Tan, K.-H., & Ahuja, N. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206542 · Cited by 378
A non-local cost aggregation method for stereo matching
Yang, Q. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247827 · Cited by 364
Constant time O(1) bilateral filtering
Porikli, F. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587843 · Cited by 332
Median Filtering in Constant Time
Perreault, S., & Hebert, P. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.902329 · Cited by 317
Image Smoothing Via L0 Gradient Minimization
Dayal, S. (2018) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.21693352 · Cited by 298
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
Mühlmann, K., Maier, D., Hesser, J., & Männer, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014581421794 · Cited by 282
3-D surface description from binocular stereo
Cochran, S. D., & Medioni, G. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.159902 · Cited by 219
Smoothed local histogram filters
Kass, M., & Solomon, J. (2010) · ACM Transactions on Graphics · doi:10.1145/1778765.1778837 · Cited by 170
Min, D., Lu, J., & Do, M. N. (2011) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2011.6126416 · Cited by 96
A Two-Stage Correlation Method for Stereoscopic Depth Estimation
Einecke, N., & Eggert, J. P. (2010) · International Conference on Digital Image Computing: Techniques and Applications (DICTA) · doi:10.1109/dicta.2010.49 · Cited by 59
Cited by
Furukawa, Y., & Hernández, C. (2015) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000052 · Cited by 598
Zhang, Q., Shen, X., Xu, L., & Jia, J. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10578-9_53 · Cited by 580
Optical flow modeling and computation: A survey
Fortun, D., Bouthemy, P., & Kervrann, C. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.02.008 · Cited by 431
Soft 3D reconstruction for view synthesis
Penner, E., & Zhang, L. (2017) · ACM Transactions on Graphics · doi:10.1145/3130800.3130855 · Cited by 358
Gradient Domain Guided Image Filtering
Kou, F., Chen, W., Wen, C., & Li, Z. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2468183 · Cited by 343
Metadata
- Authors
- Ma, Z., He, K., Wei, Y., Sun, J., & Wu, E.
- Venue
- 2013 IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2013-12
- Pages
- 49-56
- OpenAlex
- W2106403211
- Cited by
- 292
- References
- 34
- FWCI
- 20.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.