Name
Abstract | ||
|---|---|---|
A typical stereo matching algorithm involves calculating of the matching cost and smoothness constraint. Recently some algorithms show the good performances by learning the matching cost, but the learning of smoothness constraint have been little researched. This paper focuses on both aspects by using convolutional neural networks. The proposed method first learns a Euclidean embedding for each image using a convolutional neural network with a triplet-based loss function, where the matching cost is directly computed by the squared L2 distances between two vectors in the embedding space. Then we use similar convolutional neural networks to learn the smoothness constraint, and a generalized Semiglobal Matching algorithm is proposed to estimate the disparity. The proposed method has a comparable performance with the state-of-the-art algorithms by using smaller and shallower networks, and the experiments show that learning both of matching cost and smoothness constraint has positive effects for stereo matching. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.neucom.2018.05.008 | Neurocomputing |
Keywords | Field | DocType |
Stereo matching,Convolutional neural network,Smoothness constraint,Semiglobal matching | Stereo matching,Embedding,Square (algebra),Pattern recognition,Convolutional neural network,Artificial intelligence,Euclidean geometry,Smoothness,Blossom algorithm,Mathematics | Journal |
Volume | ISSN | Citations |
314 | 0925-2312 | 2 |
PageRank | References | Authors |
0.36 | 34 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Menglong Yang | 1 | 109 | 10.49 |
| Xuebin Lv | 2 | 4 | 0.73 |