scholarly journals A Window-Based Adaptive Correspondence Search Algorithm Using Mean Shift and Disparity Estimation

2011 ◽  
Vol 10 (3) ◽  
pp. 65-72
Author(s):  
Shujun Zhang ◽  
Jianbo Zhang ◽  
Yun Liu
Keyword(s):  
Stereo Matching ◽  
Search Algorithm ◽  
Mean Shift ◽  
Depth Map ◽  
Disparity Estimation ◽  
Matching Process ◽  
Window Method ◽  
Binocular Stereo ◽  
Correspondence Search ◽  
Better Than

Current methods to solve the problem of binocular stereo matching can be divided into two categories: sparse points based methods and dense points based methods. However, both of them have different shortcomings and limitations. There is no perfect method to solve the disparity problem. Dense points based techniques relatively obtain more accurate results but with higher computation. A large number of window-based adaptive corres-pondence techniques have emerged in recent years. In order to solve the problem of high time complexity and large amount of calculation in matching process, we propose a new window-based correspondence search algorithm using mean shift and disparity estimation. Mean shift can aggregate the same or similar colors so it can be applied to pre-process the source images to reduce their dynamic color range. Disparity estimation is conducted on the pre-processed two images to compute disparities of uniform texture regions. Adaptive window matching through similarity computation and window-based support aggregation is finally executed and exact depth map is obtained. Experimental results show that our algorithm is more efficient and keeps smooth dis-parity better than the prior window method

scholarly journals Adaptive Unimodal Cost Volume Filtering for Deep Stereo Matching

2020 ◽  
Vol 34 (07) ◽  
pp. 12926-12934
Author(s):  
Youmin Zhang ◽  
Yimin Chen ◽  
Xiao Bai ◽  
Suihanjin Yu ◽  
Kun Yu ◽  
...  
Keyword(s):  
Deep Learning ◽  
Loss Function ◽  
Stereo Matching ◽  
State Of The Art ◽  
Disparity Estimation ◽  
Model Matching ◽  
Regression Problem ◽  
Unimodal Distribution ◽  
Matching Process ◽  
The Cost

State-of-the-art deep learning based stereo matching approaches treat disparity estimation as a regression problem, where loss function is directly defined on true disparities and their estimated ones. However, disparity is just a byproduct of a matching process modeled by cost volume, while indirectly learning cost volume driven by disparity regression is prone to overfitting since the cost volume is under constrained. In this paper, we propose to directly add constraints to the cost volume by filtering cost volume with unimodal distribution peaked at true disparities. In addition, variances of the unimodal distributions for each pixel are estimated to explicitly model matching uncertainty under different contexts. The proposed architecture achieves state-of-the-art performance on Scene Flow and two KITTI stereo benchmarks. In particular, our method ranked the 1st place of KITTI 2012 evaluation and the 4th place of KITTI 2015 evaluation (recorded on 2019.8.20). The codes of AcfNet are available at: https://github.com/youmi-zym/AcfNet.

scholarly journals A Fast Stereo Matching Network with Multi-Cross Attention

Sensors ◽  
2021 ◽  
Vol 21 (18) ◽  
pp. 6016
Author(s):  
Ming Wei ◽  
Ming Zhu ◽  
Yi Wu ◽  
Jiaqi Sun ◽  
Jiarong Wang ◽  
...  
Keyword(s):  
Deep Learning ◽  
Stereo Matching ◽  
Disparity Estimation ◽  
Stereo Image ◽  
Matching Network ◽  
Low Resolution ◽  
Attention Model ◽  
Binocular Stereo ◽  
End To End ◽  
Left Image

Stereo matching networks based on deep learning are widely developed and can obtain excellent disparity estimation. We present a new end-to-end fast deep learning stereo matching network in this work that aims to determine the corresponding disparity from two stereo image pairs. We extract the characteristics of the low-resolution feature images using the stacked hourglass structure feature extractor and build a multi-level detailed cost volume. We also use the edge of the left image to guide disparity optimization and sub-sample with the low-resolution data, ensuring excellent accuracy and speed at the same time. Furthermore, we design a multi-cross attention model for binocular stereo matching to improve the matching accuracy and achieve end-to-end disparity regression effectively. We evaluate our network on Scene Flow, KITTI2012, and KITTI2015 datasets, and the experimental results show that the speed and accuracy of our method are excellent.

scholarly journals A Disparity Refinement Algorithm for Satellite Remote Sensing Images Based on Mean-Shift Plane Segmentation

2021 ◽  
Vol 13 (10) ◽  
pp. 1903
Author(s):  
Zhihui Li ◽  
Jiaxin Liu ◽  
Yang Yang ◽  
Jing Zhang
Keyword(s):  
Remote Sensing ◽  
Satellite Remote Sensing ◽  
Stereo Matching ◽  
Mean Shift ◽  
Segmentation Method ◽  
Remote Sensing Images ◽  
Edge Matching ◽  
Refinement Method ◽  
Initial Segmentation ◽  
Refinement Algorithm

Objects in satellite remote sensing image sequences often have large deformations, and the stereo matching of this kind of image is so difficult that the matching rate generally drops. A disparity refinement method is needed to correct and fill the disparity. A method for disparity refinement based on the results of plane segmentation is proposed in this paper. The plane segmentation algorithm includes two steps: Initial segmentation based on mean-shift and alpha-expansion-based energy minimization. According to the results of plane segmentation and fitting, the disparity is refined by filling missed matching regions and removing outliers. The experimental results showed that the proposed plane segmentation method could not only accurately fit the plane in the presence of noise but also approximate the surface by plane combination. After the proposed plane segmentation method was applied to the disparity refinement of remote sensing images, many missed matches were filled, and the elevation errors were reduced. This proved that the proposed algorithm was effective. For difficult evaluations resulting from significant variations in remote sensing images of different satellites, the edge matching rate and the edge matching map are proposed as new stereo matching evaluation and analysis tools. Experiment results showed that they were easy to use, intuitive, and effective.

scholarly journals High-Accuracy Recognition and Localization of Moving Targets in an Indoor Environment Using Binocular Stereo Vision

2021 ◽  
Vol 10 (4) ◽  
pp. 234
Author(s):  
Jing Ding ◽  
Zhigang Yan ◽  
Xuchen We
Keyword(s):  
Stereo Vision ◽  
Stereo Matching ◽  
Three Dimensional ◽  
Target Localization ◽  
Parallel Structure ◽  
Moving Target ◽  
Target Area ◽  
Moving Targets ◽  
Binocular Stereo Vision ◽  
Binocular Stereo

To obtain effective indoor moving target localization, a reliable and stable moving target localization method based on binocular stereo vision is proposed in this paper. A moving target recognition extraction algorithm, which integrates displacement pyramid Horn–Schunck (HS) optical flow, Delaunay triangulation and Otsu threshold segmentation, is presented to separate a moving target from a complex background, called the Otsu Delaunay HS (O-DHS) method. Additionally, a stereo matching algorithm based on deep matching and stereo vision is presented to obtain dense stereo matching points pairs, called stereo deep matching (S-DM). The stereo matching point pairs of the moving target were extracted with the moving target area and stereo deep matching point pairs, then the three dimensional coordinates of the points in the moving target area were reconstructed according to the principle of binocular vision’s parallel structure. Finally, the moving target was located by the centroid method. The experimental results showed that this method can better resist image noise and repeated texture, can effectively detect and separate moving targets, and can match stereo image points in repeated textured areas more accurately and stability. This method can effectively improve the effectiveness, accuracy and robustness of three-dimensional moving target coordinates.

How significant are the known collision and element distinctness quantum algorithms?

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph
Keyword(s):  
Search Algorithm ◽  
Quantum Algorithms ◽  
Search Space ◽  
Space Complexity ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Time Space ◽  
Simple Quantum ◽  
Structured Problems ◽  
Better Than

Quantum search is a technique for searching $N$ possibilities for a desired target in $O(\sqrt{N})$ steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we propose the criterion that an algorithm which requires $O(S)$ hardware should be considered significant if it produces a speedup of better than $O\left(\sqrt{S}\right)$ over a simple quantum search algorithm. This is because a speedup of $O\left(\sqrt{S}\right)$ can be trivially obtained by dividing the search space into $S$ separate parts and handing the problem to $S$ independent processors that do a quantum search (in this paper we drop all logarithmic factors when discussing time/space complexity). Known algorithms for collision and element distinctness exactly saturate the criterion.

scholarly journals An Edge-Sense Bidirectional Pyramid Network for Stereo Matching of VHR Remote Sensing Images

2020 ◽  
Vol 12 (24) ◽  
pp. 4025
Author(s):  
Rongshu Tao ◽  
Yuming Xiang ◽  
Hongjian You
Keyword(s):  
Remote Sensing ◽  
Stereo Matching ◽  
Tall Buildings ◽  
Disparity Estimation ◽  
Complex Structures ◽  
Learning Networks ◽  
Remote Sensing Images ◽  
Essential Step ◽  
Disparity Range ◽  
The Cost

As an essential step in 3D reconstruction, stereo matching still faces unignorable problems due to the high resolution and complex structures of remote sensing images. Especially in occluded areas of tall buildings and textureless areas of waters and woods, precise disparity estimation has become a difficult but important task. In this paper, we develop a novel edge-sense bidirectional pyramid stereo matching network to solve the aforementioned problems. The cost volume is constructed from negative to positive disparities since the disparity range in remote sensing images varies greatly and traditional deep learning networks only work well for positive disparities. Then, the occlusion-aware maps based on the forward-backward consistency assumption are applied to reduce the influence of the occluded area. Moreover, we design an edge-sense smoothness loss to improve the performance of textureless areas while maintaining the main structure. The proposed network is compared with two baselines. The experimental results show that our proposed method outperforms two methods, DenseMapNet and PSMNet, in terms of averaged endpoint error (EPE) and the fraction of erroneous pixels (D1), and the improvements in occluded and textureless areas are significant.

Research and Realization of a New Algorithm for Stereo Matching Based on Binocular Vision

2013 ◽  
Vol 670 ◽  
pp. 202-207 ◽  
Author(s):  
Jun Ting Cheng ◽  
C. Zhao ◽  
W.L. Zhao ◽  
W.H. Wu
Keyword(s):  
Binocular Vision ◽  
Stereo Matching ◽  
Three Dimensional ◽  
Cnc Machining ◽  
Matching Algorithm ◽  
Evaluation Test ◽  
Three Dimensional Measurement ◽  
Binocular Stereo ◽  
Measuring Machine ◽  
3D Solid

In the development of a three-dimensional measurement system, binocular stereo matching is the most important and difficult. In the basis of introducing selective principles of matching algorithm, a new stereo matching algorithm for binocular vision is put forward that is named noncoded difference measuring distance. The algorithm effectively grapples with the problem of searching for the coincidence relation of raster and can efficiently and accurately obtain three-dimensional world coordinates of the entities. Experiment results show that this 3D measuring machine can effectively measure the 3D solid profile of free surface. During the evaluation test for accuracy, scan a standard plane. Fit all 3D points in one plane, and then the flatness value of this plane is obtained. The flatness value of the standard plane has been ultimately measured as: ± 0.0462mm, this measuring accuracy can completely satisfy the requirements of rapid prototyping or CNC machining, it as well as achieves the stated accuracy (± 0.05mm).

scholarly journals Disparity estimation using Graph cuts for road applications

2021 ◽  
Vol 297 ◽  
pp. 01055
Author(s):  
Mohamed El Ansari ◽  
Ilyas El Jaafari ◽  
Lahcen Koutti
Keyword(s):  
Stereo Matching ◽  
Optimal Solution ◽  
Similarity Criterion ◽  
Graph Cuts ◽  
Search Space ◽  
Disparity Estimation ◽  
Stereo Images ◽  
Disparity Map ◽  
Current Frame ◽  
Edge Points

This paper proposes a new edge based stereo matching approach for road applications. The new approach consists in matching the edge points extracted from the input stereo images using temporal constraints. At the current frame, we propose to estimate a disparity range for each image line based on the disparity map of its preceding one. The stereo images are divided into multiple parts according to the estimated disparity ranges. The optimal solution of each part is independently approximated via the state-of-the-art energy minimization approach Graph cuts. The disparity search space at each image part is very small compared to the global one, which improves the results and reduces the execution time. Furthermore, as a similarity criterion between corresponding edge points, we propose a new cost function based on the intensity, the gradient magnitude and gradient orientation. The proposed method has been tested on virtual stereo images, and it has been compared to a recently proposed method and the results are satisfactory.

Sign in / Sign up

Export Citation Format

Share Document