Quick stereo matching method based on graph cut

A stereo matching and fast technology, applied in the field of computer vision, can solve the problems of high error matching rate in low-texture areas, difficult to deal with occluded areas, and excessive calculation, and achieve high matching accuracy, accelerated operation efficiency, and fast operation efficiency Effect

Active Publication Date: 2013-01-16
SPACE STAR TECH CO LTD
View PDF3 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, the local matching method is fast to calculate, but it often has a high error matching rate for low-texture areas, resulting in blurred boundaries, and it is also difficult to deal with occluded areas. The most typical method is t

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Quick stereo matching method based on graph cut
  • Quick stereo matching method based on graph cut
  • Quick stereo matching method based on graph cut

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0029] While the method of the present invention can obtain the characteristics of high matching accuracy of the graph cut method, it is accelerated by the multi-resolution pyramid method, and the operation efficiency is greatly accelerated.

[0030] The computational complexity of stereo matching is directly proportional to the disparity search range, and the disparity search range is directly related to the image resolution. Therefore, narrowing the disparity search range can greatly reduce the calculation time. The stereo matching method based on the multi-resolution pyramid is a coarse-to-fine stereo matching method based on multi-resolution. The low-resolution matching results produced by it can be propagated step by step to guide the high-resolution matching process. The quality of the acceleration is to reduce the search range of the parallax, and at the same time, the probability of mismatching is also reduced due to the reduction of the search range of the parallax.

[003...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A quick stereo matching method based on graph cut is used for stereo matching of at least two images. The method mainly comprises the following four steps: obtaining and preprocessing an image pair subjected to epipolar calibration, respectively building multi-resolution pyramids for a first image and a second image, carrying out stereo matching on the (low-resolution) image pair of a higher-layer pyramid, and transmitting the matching result of the image pair of the higher-layer pyramid to the lower-layer image layer by layer. The quick stereo matching method uses the global stereo matching algorithm based on graph cut to evaluate the parallax between at least one point in the first image and at least one corresponding point in the second image, and uses the multi-resolution pyramids to accelerate. The method has the advantages of high precision and high operating efficiency and can be applied to three-dimensional measurement.

Description

technical field [0001] The invention relates to a fast stereo matching method based on graph cut, which belongs to the technical field of computer vision. Background technique [0002] Stereo matching is the most important and complex part of the stereo vision system. It mainly uses a series of algorithms to find the matching points in the stereo image pair and obtain the disparity map, and then uses the triangular geometric relationship to calculate the depth of the midpoint in space to generate the depth of the image. picture. When an object in space is projected into a planar image, all the optical information of the object is represented by the gray value in the image. is very difficult. [0003] According to the range of image pixels involved in the calculation, stereo matching methods can be divided into local matching methods and global matching methods. Among them, the local matching method is fast to calculate, but it often has a high error matching rate for low-...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T7/00
Inventor 吴振国李勐孙协昌
Owner SPACE STAR TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products