VEGETATION HEIGHT ESTIMATION NEAR POWER TRANSMISSION POLES VIA SATELLITE STEREO IMAGES USING 3D DEPTH ESTIMATION ALGORITHMS

被引:3
作者
Qayyum, A. [1 ]
Malik, A. S. [1 ]
Saad, M. N. M. [1 ]
Iqbal, M. [1 ]
Abdullah, F. [1 ]
Rahseed, W. [1 ]
Abdullah, T. A. R. B. T. [2 ]
Ramli, A. Q. [2 ]
机构
[1] Univ Teknol PETRONAS, Dept Elect & Elect Engn, CISIR, Tronoh 31750, Malaysia
[2] Univ Tenaga Nas, Kajang 43000, Selangor, Malaysia
来源
36TH INTERNATIONAL SYMPOSIUM ON REMOTE SENSING OF ENVIRONMENT | 2015年 / 47卷 / W3期
关键词
QuickBird Satellite sensor; Pleiades satellite Sensor; Stereo matching techniques; Dynamic Programming; Graph-Cut; 3D depth approach; ENERGY MINIMIZATION;
D O I
10.5194/isprsarchives-XL-7-W3-489-2015
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Monitoring vegetation encroachment under overhead high voltage power line is a challenging problem for electricity distribution companies. Absence of proper monitoring could result in damage to the power lines and consequently cause blackout. This will affect electric power supply to industries, businesses, and daily life. Therefore, to avoid the blackouts, it is mandatory to monitor the vegetation/trees near power transmission lines. Unfortunately, the existing approaches are more time consuming and expensive. In this paper, we have proposed a novel approach to monitor the vegetation/trees near or under the power transmission poles using satellite stereo images, which were acquired using Pleiades satellites. The 3D depth of vegetation has been measured near power transmission lines using stereo algorithms. The area of interest scanned by Pleiades satellite sensors is 100 square kilometer. Our dataset covers power transmission poles in a state called Sabah in East Malaysia, encompassing a total of 52 poles in the area of 100 km. We have compared the results of Pleiades satellite stereo images using dynamic programming and Graph-Cut algorithms, consequently comparing satellites' imaging sensors and Depth-estimation Algorithms. Our results show that Graph-Cut Algorithm performs better than dynamic programming (DP) in terms of accuracy and speed.
引用
收藏
页码:489 / 494
页数:6
相关论文
共 19 条
[1]  
[Anonymous], IMAGE VISION COMPUTI
[2]  
[Anonymous], 2001, INT C COMP VIS
[3]  
Banks J, 1997, TENCON IEEE REGION, P365, DOI 10.1109/TENCON.1997.647332
[4]   A pixel dissimilarity measure that is insensitive to image sampling [J].
Birchfield, S ;
Tomasi, C .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (04) :401-406
[5]   STRUCTURAL STEREOPSIS FOR 3-D VISION [J].
BOYER, KL ;
KAK, AC .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1988, 10 (02) :144-166
[6]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[7]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[8]   Height estimation from monocular image sequences using dynamic programming with explicit occlusions [J].
Cai, J. ;
Walker, R. .
IET COMPUTER VISION, 2010, 4 (03) :149-161
[9]  
Ghaffar R, 2004, LECT NOTES COMPUT SC, V3212, P512
[10]   Camera sightline pointing requirements for aerial inspection of overhead power lines [J].
Jones, DI ;
Earp, GK .
ELECTRIC POWER SYSTEMS RESEARCH, 2001, 57 (02) :73-82