Author: 何孝威
Publisher:
ISBN:
Category :
Languages : en
Pages : 90
Book Description
A Fast Local Stereo Matching Algorithm with Simple Edge Detection and Its VLSI Implementation
Stereo Matching Algorithm with Fast Disparity Propagation Under Homogeneous Texture Detection and Its VLSI Implementation
A Fast Coarse-to-Fine Stereo Matching Algorithm and Its VLSI Implementation
A Real-time Stereo Matching Algorithm with Iterative Aggregation and Its VLSI Implementation
A Robust and Efficient Stereo Matching Algorithm
Author: Institut National de Recherche en Informatique et en Automatique
Publisher:
ISBN:
Category : Computer vision
Languages : en
Pages : 31
Book Description
Abstract: "Matching is recognized as the most difficult step in stereo vision. Many algorithms have been proposed but they are not robust enough. The reason for this, in short, is that the available matching constraints are not effectively used. In fact, the design and the implementation of a stereo algorithm are closely coupled issues. To obtain a robust algorithm, constraints should be appropriately used. In addition, noise in the data must also be taken into account explicitly and effectively. Therefore, in this paper, we discuss thoroughly the stereo matching problem, beginning by a brief discussion on the choice of matching primitives. Then matching constraints are discussed in detail and their use justified, especially on the disparity continuity and the choice of a concrete measure of this constraint. Our main contributions are the following. (1) By making realistic assumptions, we show that a disparity gradient (DG) limit as small as 0.2 can be used. Support from neighboring points is not weighted in order to make full use of structural (shape) information, which is made possible by the small DG limit. (2) Noise (due to discretization and dislocation) is fully taken into account and effectively dealt with in the implementation. This in turn makes the use of a small DG limit possible. (3) Disparity discontinuity along an edge chain can be dealt with by requiring only piecewise continuity. In fact, it is frequently observed that a [sic] edge chain results from different surfaces due to the edge detection and linking. Abundant tests have been performed, mostly on complex real scenes. Three of them are shown and analyzed in this paper. The new algorithm proves to be robust and efficient."
Publisher:
ISBN:
Category : Computer vision
Languages : en
Pages : 31
Book Description
Abstract: "Matching is recognized as the most difficult step in stereo vision. Many algorithms have been proposed but they are not robust enough. The reason for this, in short, is that the available matching constraints are not effectively used. In fact, the design and the implementation of a stereo algorithm are closely coupled issues. To obtain a robust algorithm, constraints should be appropriately used. In addition, noise in the data must also be taken into account explicitly and effectively. Therefore, in this paper, we discuss thoroughly the stereo matching problem, beginning by a brief discussion on the choice of matching primitives. Then matching constraints are discussed in detail and their use justified, especially on the disparity continuity and the choice of a concrete measure of this constraint. Our main contributions are the following. (1) By making realistic assumptions, we show that a disparity gradient (DG) limit as small as 0.2 can be used. Support from neighboring points is not weighted in order to make full use of structural (shape) information, which is made possible by the small DG limit. (2) Noise (due to discretization and dislocation) is fully taken into account and effectively dealt with in the implementation. This in turn makes the use of a small DG limit possible. (3) Disparity discontinuity along an edge chain can be dealt with by requiring only piecewise continuity. In fact, it is frequently observed that a [sic] edge chain results from different surfaces due to the edge detection and linking. Abundant tests have been performed, mostly on complex real scenes. Three of them are shown and analyzed in this paper. The new algorithm proves to be robust and efficient."
Proceedings, CVPR '91
Author:
Publisher:
ISBN:
Category : Computers
Languages : en
Pages : 790
Book Description
The proceedings of the conference held in Lahaina, Maui, Hawaii, June 1991, contain 98 regular and 45 poster papers in the areas of object recognition, stereo and surface reconstruction, motion, calibration, low-level vision, optical flow, non-rigid motion, texture, active vision and perceptual grouping, architecture and algorithms, pose estimation and face recognition, and depth. The invited lecture, by Al Bars (computer graphics and animation, CalTech) is titled "Teleological Computer Graphics Modeling". No index. Acidic paper. Annotation copyrighted by Book News, Inc., Portland, OR
Publisher:
ISBN:
Category : Computers
Languages : en
Pages : 790
Book Description
The proceedings of the conference held in Lahaina, Maui, Hawaii, June 1991, contain 98 regular and 45 poster papers in the areas of object recognition, stereo and surface reconstruction, motion, calibration, low-level vision, optical flow, non-rigid motion, texture, active vision and perceptual grouping, architecture and algorithms, pose estimation and face recognition, and depth. The invited lecture, by Al Bars (computer graphics and animation, CalTech) is titled "Teleological Computer Graphics Modeling". No index. Acidic paper. Annotation copyrighted by Book News, Inc., Portland, OR
Proceedings
Artificial Intelligence Abstracts
Author:
Publisher:
ISBN:
Category : Artificial intelligence
Languages : en
Pages : 448
Book Description
Publisher:
ISBN:
Category : Artificial intelligence
Languages : en
Pages : 448
Book Description
1989 International Symposium on VLSI Technology, Systems, and Applications
Electrical & Electronics Abstracts
Author:
Publisher:
ISBN:
Category : Electrical engineering
Languages : en
Pages : 1948
Book Description
Publisher:
ISBN:
Category : Electrical engineering
Languages : en
Pages : 1948
Book Description