Research of an improved dense matching algorithm based on graph cuts

Author(s):  
Hongwei Gao ◽  
Liang Chen ◽  
Xiaoyang Liu ◽  
Yang Yu
2014 ◽  
Vol 4 ◽  
pp. 220-251 ◽  
Author(s):  
Vladimir Kolmogorov ◽  
Pascal Monasse ◽  
Pauline Tan

2013 ◽  
Vol 33 (3) ◽  
pp. 0315004 ◽  
Author(s):  
祝世平 Zhu Shiping ◽  
杨柳 Yang Liu

2005 ◽  
Vol 44 (10) ◽  
pp. 107201 ◽  
Author(s):  
Li Tang ◽  
Chengke Wu ◽  
Hung Tat Tsui

Author(s):  
Z. C. Zhang ◽  
C. G. Dai ◽  
S. Ji ◽  
M. Y. Zhao

Traditional single-lens vertical photogrammetry can obtain object images from the air with rare lateral information of tall buildings. Multi-view airborne photogrammetry can get rich lateral texture of buildings, while the common area-based matching for oblique images may lose efficacy because of serious geometric distortion. A hierarchical dense matching algorithm is put forward here to match two oblique airborne images of different perspectives. Based on image hierarchical strategy and matching constraints, this algorithm delivers matching results from the upper layer of the pyramid to the below and implements per-pixel dense matching in the local Delaunay triangles between the original images. Experimental results show that the algorithm can effectively overcome the geometric distortion between different perspectives and achieve pixel-level dense matching entirely based on the image space.


Sign in / Sign up

Export Citation Format

Share Document