Circular Hough Transform and Local Circularity Measure for Weight Estimation of a Graph-Cut based Wood Stack Measurement

被引:14
作者
Galsgaard, Bo [1 ]
Lundtoft, Dennis H. [1 ]
Nikolov, Ivan [1 ]
Nasrollahi, Kamal [1 ]
Moeslund, Thomas B. [1 ]
机构
[1] Aalborg Univ, Rendsburggade 14, DK-9000 Aalborg, Denmark
来源
2015 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV) | 2015年
关键词
ENERGY MINIMIZATION;
D O I
10.1109/WACV.2015.97
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the time consuming tasks in the timber industry is the manually measurement of features of wood stacks. Such features include, but are not limited to, the number of the logs in a stack, their diameters distribution, and their volumes. Computer vision techniques have recently been used for solving this real-world industrial application. Such techniques are facing many challenges as the task is usually performed in outdoor, uncontrolled, environments. Furthermore, the logs can vary in texture and they can be occluded by different obstacles. These all make the segmentation of the wood logs a difficult task. Graph-cut has shown to be good enough for such a segmentation. However, it is hard to find proper graph weights. This is exactly the contribution of this paper to propose a method for setting the weights of the graph. To do so, we use Circular Hough Transform (CHT) for obtaining information about the fore- and background regions of a stack image, and then use this together with a Local Circularity Measure (LCM) to modify the weights of the graph to segment the wood logs from the rest of the image. We further improve the segmentation by separating overlapping logs. These segmented wood logs are finally scaled and used to acquire the necessary wood stack measurements in real-world scale (in cm). The proposed system, which works automatically, has been tested on two different datasets, containing real outdoor images of logs which vary in shapes and sizes. The experimental results show that the proposed approach not only achieves the same results as the state-of-the-art systems, it produces more stable results.
引用
收藏
页码:686 / 693
页数:8
相关论文
共 14 条
[1]  
[Anonymous], 2001, INT J COMPUT VIS
[2]  
Binghan L., 2002, P 4 WORLD C INT CONT, V1, P2901
[3]   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
[4]   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
[5]  
Dahl M. G. A. B., 2006, VISION DAY INFORM MA
[6]   USE OF HOUGH TRANSFORMATION TO DETECT LINES AND CURVES IN PICTURES [J].
DUDA, RO ;
HART, PE .
COMMUNICATIONS OF THE ACM, 1972, 15 (01) :11-&
[7]  
Fink Florian, 2004, THESIS
[8]  
Gutzeit E, 2011, COMM COM INF SC, V229, P96
[9]  
Gutzeit E, 2012, LECT NOTES COMPUT SC, V7431, P252, DOI 10.1007/978-3-642-33179-4_25
[10]  
Howe N.R., 2004, TECHNICAL REPORT