Unsupervised Learning of Stereo Matching

Author(s):  
Chao Zhou ◽  
Hong Zhang ◽  
Xiaoyong Shen ◽  
Jiaya Jia
2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Kun Zhou ◽  
Xiangxi Meng ◽  
Bo Cheng

Stereo vision is a flourishing field, attracting the attention of many researchers. Recently, leveraging on the development of deep learning, stereo matching algorithms have achieved remarkable performance far exceeding traditional approaches. This review presents an overview of different stereo matching algorithms based on deep learning. For convenience, we classified the algorithms into three categories: (1) non-end-to-end learning algorithms, (2) end-to-end learning algorithms, and (3) unsupervised learning algorithms. We have provided a comprehensive coverage of the remarkable approaches in each category and summarized the strengths, weaknesses, and major challenges, respectively. The speed, accuracy, and time consumption were adopted to compare the different algorithms.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 73804-73815
Author(s):  
Phuc Nguyen Hong ◽  
Chang Wook Ahn

Author(s):  
Hyeuk Kim

Unsupervised learning in machine learning divides data into several groups. The observations in the same group have similar characteristics and the observations in the different groups have the different characteristics. In the paper, we classify data by partitioning around medoids which have some advantages over the k-means clustering. We apply it to baseball players in Korea Baseball League. We also apply the principal component analysis to data and draw the graph using two components for axis. We interpret the meaning of the clustering graphically through the procedure. The combination of the partitioning around medoids and the principal component analysis can be used to any other data and the approach makes us to figure out the characteristics easily.


Sign in / Sign up

Export Citation Format

Share Document