Stereo matching algorithm based on across-scale PatchMatch
DOI:
CSTR:
Author:
Affiliation:

1.School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, CHN; 2. School of Detroit Greed Technology, Hubei University of Technology, Wuhan 430068, CHN

Clc Number:

TP391.4

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To solve the problem of Insufficient matching accuracy of the weak texture and disparity discontinuity regions in the image, A stereo matching algorithm combining superpixel segmentation and cross-scale PatchMatch is proposed. Firstly, multi-scale images are obtained by the gaussian under-sampling, and superpixel segmentation of each scale image. Then, based on the four-color theorem, corroding superpixel boundaries makes the iterative propagation of 3D labels on superpixels sub-modular and independent, and the generated sub-modular energy is optimized by the Graph Cut (GC) algorithm. Finally, aim to make 3D label iterative propagation can be cross-scale GC optimization to obtain the optimal disparity map, a cross-scale energy function model is proposed to constrain the consistent energy of 3D labels of the same pixel at different scales. Experimental results on Middlebury data set show that the average mismatch rate of the proposed algorithm for 21 groups of weak texture and complex texture images is 2.20%. Compared with other improved PatchMatch stereo matching algorithm, the false matching rate is reduced by 10.1%. Visualization of disparity map mismatched regions shows the proposed algorithm is better than other improved PatchMatch stereo matching for weak texture and disparity discontinuity regions algorithm.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: April 17,2024
  • Published:
Article QR Code