Pith. sign in

REVIEW 2 cited by

Stereo Matching by Training a Convolutional Neural Network to Compare Image Patches

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1510.05970 v2 pith:OGXYVVEW submitted 2015-10-20 cs.CV cs.LGcs.NE

classification cs.CVcs.LGcs.NE
keywords matchingnetworkstereoconvolutionalcostdataimageneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a method for extracting depth information from a rectified image pair. Our approach focuses on the first stage of many stereo algorithms: the matching cost computation. We approach the problem by learning a similarity measure on small image patches using a convolutional neural network. Training is carried out in a supervised manner by constructing a binary classification data set with examples of similar and dissimilar pairs of patches. We examine two network architectures for this task: one tuned for speed, the other for accuracy. The output of the convolutional neural network is used to initialize the stereo matching cost. A series of post-processing steps follow: cross-based cost aggregation, semiglobal matching, a left-right consistency check, subpixel enhancement, a median filter, and a bilateral filter. We evaluate our method on the KITTI 2012, KITTI 2015, and Middlebury stereo data sets and show that it outperforms other approaches on all three data sets.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Fast Parallel Median Filtering Algorithm Using Hierarchical Tiling

    cs.DC 2025-07 conditional novelty 6.0 of 10

    Hierarchical tiling lets sorting-based median filters on GPUs reach O(k log k) and O(k) per-pixel complexity for k x k kernels, with large measured speedups.

  2. 3DMPE: 3D Multi-Perspective Embedding

    cs.CV 2026-07 conditional novelty 4.5 of 10

    Visibility-weighted multi-perspective MDS recovers consistent 3D point clouds from partial 2D projections with known correspondences, with or without known projection maps.

Pith tools