• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Feasibility Boundary in Dense and Semi-Dense Stereo Matching

by Jana Kostlivá, Jan Čech
Add To MetaCart

Tools

Sorted by:
Results 1 - 6 of 6

Correspondence Propagation with Weak Priors

by Huan Wang, Shuicheng Yan, Jianzhuang Liu, Xiaoou Tang, Thomas S. Huang
"... For the problem of image registration, the top few reliable correspondences are often relatively easy to obtain, while the overall matching accuracy may fall drastically as the desired correspondence number increases. In this paper, we present an efficient feature matching algorithm to employ sparse ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
For the problem of image registration, the top few reliable correspondences are often relatively easy to obtain, while the overall matching accuracy may fall drastically as the desired correspondence number increases. In this paper, we present an efficient feature matching algorithm to employ sparse reliable correspondence priors for piloting the feature matching process. First, the feature geometric relationship within individual image is encoded as a spatial graph, and the pairwise feature similarity is expressed as a bipartite similarity graph between two feature sets; then the geometric neighborhood of the pairwise assignment is represented by a categorical product graph, along which the reliable correspondences are propagated; and finally a closed-form solution for feature matching is deduced by ensuring the feature geometric coherency as well as pairwise feature agreements. Furthermore, our algorithm is naturally applicable for incorporating manual correspondence priors for semi-supervised feature matching. Extensive experiments on both toy examples and real-world applications demonstrate the superiority of our algorithm over the state-of-the-art feature matching techniques.

Multimodal Stereo Vision System: 3D Data Extraction and Algorithm Evaluation

by O Barrera Campo, Felipe Lumbreras Ruiz
"... Abstract—This paper proposes an imaging system for com-puting sparse depth maps from multispectral images. A special stereo head consisting of an infrared and a color camera defines the proposed multimodal acquisition system. The cameras are rigidly attached so that their image planes are parallel. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—This paper proposes an imaging system for com-puting sparse depth maps from multispectral images. A special stereo head consisting of an infrared and a color camera defines the proposed multimodal acquisition system. The cameras are rigidly attached so that their image planes are parallel. Details about the calibration and image rectification procedure are provided. Sparse disparity maps are obtained by the combined use of mutual information enriched with gradient information. The proposed approach is evaluated using a Receiver Operating Characteristics curve. Furthermore, a multispectral dataset, color and infrared images, together with their corresponding ground truth disparity maps, is generated and used as a test bed. Experimental results in real outdoor scenarios are provided showing its viability and that the proposed approach is not restricted to a specific domain. Index Terms—Color and infrared images, multimodal stereo rig, sparse 3D maps. I.
(Show Context)

Citation Context

...ly presented methodology for comparing and evaluating stereo matching algorithms. This evaluation method has been proposed for classical stereo heads where both cameras work in the same spectral band =-=[17]-=-. It is based on Receiver Operating Characteristics (ROC) curves that capture both error and sparsity. Finally, a dataset with and images, together with their corresponding disparity maps and 3D model...

The Self-Aware Matching Measure for Stereo

by unknown authors
"... We revisit stereo matching functions, a topic that is considered well understood, from a different angle. Our goal is to discover a transformation that operates on the cost or similarity measures between pixels in binocular stereo. This transformation should produce a new matching curve that results ..."
Abstract - Add to MetaCart
We revisit stereo matching functions, a topic that is considered well understood, from a different angle. Our goal is to discover a transformation that operates on the cost or similarity measures between pixels in binocular stereo. This transformation should produce a new matching curve that results in higher matching accuracy. The desired transformation must have no additional parameters over those of the original matching function and must result in a new matching function that can be used by existing local, global and semi-local stereo algorithms without having to modify the algorithms. We propose a transformation that meets these requirements, taking advantage of information derived from matching the input images against themselves. We analyze the behavior of this transformation, which we call Self-Aware Matching Measure (SAMM), on a diverse set of experiments on data with ground truth. Our results show that the SAMM improves the performance of dense and semi-dense stereo. Moreover, as opposed to the current state of the art, it does not require distinctiveness to match pixels reliably. 1.
(Show Context)

Citation Context

...parities here. The x-coordinate is the width N of the N × N window. ranked low. We opted for the simple ROC criterion of Gong and Yang [11], instead of a similar criterion proposed by Kostliva et al. =-=[13]-=-. Our concern about the latter is that errors can be forgiven if they are caused by other errors. Since we are mostly dealing with noisy disparity maps, we felt that certain types of errors may not be...

This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Coordinated Adaptive Robust Contouring Control of an Industrial Biaxial Precision Gantry with C

by Chuxiong Hu, Student Member, Bin Yao Member, Qingfeng Wang
"... Abstract—Cogging force is an important source of disturbances for linear-motor-driven systems. To obtain a higher level of contouring motion control performance for multi-axes mechanical systems subject to significant nonlinear cogging forces, both the coordinated control of multi-axes motions and t ..."
Abstract - Add to MetaCart
Abstract—Cogging force is an important source of disturbances for linear-motor-driven systems. To obtain a higher level of contouring motion control performance for multi-axes mechanical systems subject to significant nonlinear cogging forces, both the coordinated control of multi-axes motions and the effective compensation of cogging forces are necessary. In addition, the effect of unavoidable velocity measurement noises needs to be sufficiently attenuated. This paper presents a discontinuous projection based desired compensation adaptive robust contouring controller to address these control issues all at once. Specifically, the presented approach explicitly takes into account the specific characteristics of cogging forces in the controller designs and employs the task coordinate formulation for coordinated motion controls. Theoretically, the resulting controller achieves a guaranteed transient performance and stead-state contouring accuracy even in the presence of both parametric uncertainties and uncertain nonlinearities. In addition, the controller also achieves asymptotic output tracking when there are parametric uncertainties only. Comparative experimental results obtained on a high-speed Anorad industrial biaxial precision gantry are presented to verify the excellent contouring performance of the proposed control scheme and the effectiveness of the cogging force compensations. Index Terms—Contouring control, linear motor, adaptive control, cogging force. I.
(Show Context)

Citation Context

...e (AUC) measures the ability of a confidence measure to predict correct matches. We opted for the simple ROC criterion of Gong and Yang [5], instead of a similar criterion proposed by Kostliva et al. =-=[44]-=-. Our concern about the latter is that errors can be forgiven if they are caused by other errors, which make correct disparity assignment impossible when one considers the uniqueness constraint. Since...

How To Teach Stereoscopic Matching?

by Radim Sara , 2010
"... This paper describes a simple but non-trivial semidense stereoscopic matching algorithm that could be taught in Computer Vision courses. The description is meant to be instructive and accessible to the student. The level of detail is sufficient for a student to understand all aspects of the algorit ..."
Abstract - Add to MetaCart
This paper describes a simple but non-trivial semidense stereoscopic matching algorithm that could be taught in Computer Vision courses. The description is meant to be instructive and accessible to the student. The level of detail is sufficient for a student to understand all aspects of the algorithm design and to make his/her own modifications. The paper includes the core parts of the algorithm in C code. We make the point of explaining the algorithm so that all steps are derived from first principles in a clear and lucid way. A simple method is described that helps encourage the student to benchmark his/her own improvements of the algorithm.

Prague

by unknown authors , 2009
"... branch No. 3902V035—Artificial Intelligence and Biocybernetics Doctoral thesis statement for obtaining the academic title of “Doctor”, abbreviated to “PhD”. ..."
Abstract - Add to MetaCart
branch No. 3902V035—Artificial Intelligence and Biocybernetics Doctoral thesis statement for obtaining the academic title of “Doctor”, abbreviated to “PhD”.
(Show Context)

Citation Context

... or empty based on the variance of the projection into the images, e.g. [20]. 3 Program of the thesis After reviewing the state-of-the-art methods and getting experience from the algorithm evaluation =-=[18, 19]-=-, we decided to study and develop methods of class B. The methods of class A using strong prior models suffer from several types of artifacts: they smooth out occlusion boundaries and interpolate thro...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University