An Improved Quantum Solution for the Stereo Matching Problem

Author(s):  
Shahrokh Heidari ◽  
Mitchell Rogers ◽  
Patrice Delmas
2015 ◽  
Vol 138 (4) ◽  
pp. 457-482 ◽  
Author(s):  
Lukasz Laskowski ◽  
Jerzy Jelonkiewicz

2012 ◽  
Vol 433-440 ◽  
pp. 6190-6194
Author(s):  
Shuo Bo Xu ◽  
Di Shi Xu ◽  
Hua Fang

A new method for solving the stereo matching problem in the presence of large occlusion is presented. This method for stereo matching and occlusion detection is based on searching disparity point. In this paper, we suppose that a pair of epipolar-line images is a projection of a group of piece-wise straight lines on the left and right images respective. Therefore the disparity curve corresponding to a pair of epipolar-line images may be approximated by a group of piece-wise straight lines. Then the key of solving disparity curve is how to get the “characteristic points” on the group of piece-wise straight lines. Based on this view, we fetched out the conception “disparity point”, and three kinds of special disparity points are correctly corresponding to the “characteristic point”. By analyzing intensity property of a disparity point and its neighbor points, an approach which combines stepwise hypothesis-verification strategy with three constraint conditions is devised to extract the candidate disparity points from the epipolar images.


Entropy ◽  
2018 ◽  
Vol 20 (10) ◽  
pp. 786 ◽  
Author(s):  
William Cruz-Santos ◽  
Salvador Venegas-Andraca ◽  
Marco Lanzagorta

In this paper, we propose a methodology to solve the stereo matching problem through quantum annealing optimization. Our proposal takes advantage of the existing Min-Cut/Max-Flow network formulation of computer vision problems. Based on this network formulation, we construct a quadratic pseudo-Boolean function and then optimize it through the use of the D-Wave quantum annealing technology. Experimental validation using two kinds of stereo pair of images, random dot stereograms and gray-scale, shows that our methodology is effective.


Author(s):  
Mikel Galar ◽  
Miguel Pagola ◽  
Edurne Barrenechea ◽  
Carlos López-Molina ◽  
Humberto Bustince

Sensors ◽  
2018 ◽  
Vol 19 (1) ◽  
pp. 53 ◽  
Author(s):  
Abiel Aguilar-González ◽  
Miguel Arias-Estrada ◽  
François Berry

Applications such as autonomous navigation, robot vision, and autonomous flying require depth map information of a scene. Depth can be estimated by using a single moving camera (depth from motion). However, the traditional depth from motion algorithms have low processing speeds and high hardware requirements that limit the embedded capabilities. In this work, we propose a hardware architecture for depth from motion that consists of a flow/depth transformation and a new optical flow algorithm. Our optical flow formulation consists in an extension of the stereo matching problem. A pixel-parallel/window-parallel approach where a correlation function based on the sum of absolute difference (SAD) computes the optical flow is proposed. Further, in order to improve the SAD, the curl of the intensity gradient as a preprocessing step is proposed. Experimental results demonstrated that it is possible to reach higher accuracy (90% of accuracy) compared with previous Field Programmable Gate Array (FPGA)-based optical flow algorithms. For the depth estimation, our algorithm delivers dense maps with motion and depth information on all image pixels, with a processing speed up to 128 times faster than that of previous work, making it possible to achieve high performance in the context of embedded applications.


Robotica ◽  
1996 ◽  
Vol 14 (2) ◽  
pp. 173-188 ◽  
Author(s):  
Jong-Eun Byun ◽  
Tadashi Nagatat

SUMMARYThis paper presents an active visual method for determining the 3-D pose of a flexible object with a hand-eye system. Some simple and effective on-line algorithms to overcome various exceptional situations in chaincoding or determine the object pose more precisely are developed. The pose of a flexible object can be easily changed because of the flexible nature and the prediction of the pose is almost impossible. A new sensing pose is computed by using the image coordinates of the points on the border line of an image window and the current pose of a hand-eye system for the cases that the flexible object is extended outside the window. In a case of exceptional overlapping, a new sensing pose is computed by using the image coordinates of four extreme image points and the current pose of the hand-eye system. Through a chaincoding process on the skeletonized images, the stereo matching problem of two images is transformed into the matching of the curvature representations of the two skeletonized images. The 3-D pose of a flexible object is computed by using the results of this matching and the camera and hand-eye parameters calibrated beforehand. The initial sensing results are used in computing a new sensing pose to determine the object more precisely.


2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
S. Y. Chen ◽  
Hanyang Tong ◽  
Zhongjie Wang ◽  
Sheng Liu ◽  
Ming Li ◽  
...  

Generalized belief propagation (GBP) is a region-based belief propagation algorithm which can get good convergence in Markov random fields. However, the computation time is too heavy to use in practical engineering applications. This paper proposes a method to accelerate the efficiency of GBP. A caching technique and chessboard passing strategy are used to speed up algorithm. Then, the direction set method which is used to reduce the complexity of computing clique messages from quadric to cubic. With such a strategy the processing speed can be greatly increased. Besides, it is the first attempt to apply GBP for solving the stereomatching problem. Experiments show that the proposed algorithm can speed up by 15+ times for typical stereo matching problem and infer a more plausible result.


Sign in / Sign up

Export Citation Format

Share Document