USING HOUGH TRANSFORM IN LINE EXTRACTION

Similar documents
GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

Stained Glass Design. Teaching Goals:

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

II. THE ALGORITHM. A. Depth Map Processing

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

2 Computing all Intersections of a Set of Segments Line Segment Intersection

Section 10.4 Hyperbolas

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Slides for Data Mining by I. H. Witten and E. Frank

IMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho

1 Drawing 3D Objects in Adobe Illustrator

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

MTH 146 Conics Supplement

Introduction Transformation formulae Polar graphs Standard curves Polar equations Test GRAPHS INU0114/514 (MATHS 1)

A Comparison of the Discretization Approach for CST and Discretization Approach for VDM

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION

Topics in Analytic Geometry

9 Graph Cutting Procedures

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Fig.25: the Role of LEX

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

Computing offsets of freeform curves using quadratic trigonometric splines

Section 9.2 Hyperbolas

Ray surface intersections

How to Design REST API? Written Date : March 23, 2015

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

1 Quad-Edge Construction Operators

Spectral Analysis of MCDF Operations in Image Processing

A Fast Imaging Algorithm for Near Field SAR

2014 Haskell January Test Regular Expressions and Finite Automata

Digital approximation to extended depth of field in no telecentric imaging systems

Engineer-to-Engineer Note

A Study on Eye Gaze Estimation Method Based on Cornea Model of Human Eye

Geometric transformations

10.5 Graphing Quadratic Functions

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

1.1 Lines AP Calculus

Tilt-Sensing with Kionix MEMS Accelerometers

SUPPLEMENTARY INFORMATION

Computer Vision and Image Understanding

EXPONENTIAL & POWER GRAPHS

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012

8.2 Areas in the Plane

Analysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Stack. A list whose end points are pointed by top and bottom

Image Segmentation Using Wavelet and watershed transform

Graphing Conic Sections

Optimization of Air Bearing Slider Design

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization

PNC NC code PROGRAMMER'S MANUAL

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

Small Business Networking

4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E

Step-Voltage Regulator Model Test System

Statistical classification of spatial relationships among mathematical symbols

Small Business Networking

A Transportation Problem Analysed by a New Ranking Method

Small Business Networking

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

Agilent Mass Hunter Software

Subband coding of image sequences using multiple vector quantizers. Emanuel Martins, Vitor Silva and Luís de Sá

HOPC: A NOVEL SIMILARITY METRIC BASED ON GEOMETRIC STRUCTURAL PROPERTIES FOR MULTI-MODAL REMOTE SENSING IMAGE MATCHING

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Hyperbolas. Definition of Hyperbola

Accelerating 3D convolution using streaming architectures on FPGAs

5 Regular 4-Sided Composition

AVolumePreservingMapfromCubetoOctahedron

A dual of the rectangle-segmentation problem for binary matrices

x )Scales are the reciprocal of each other. e

The Reciprocal Function Family. Objectives To graph reciprocal functions To graph translations of reciprocal functions

Small Business Networking

Engineer To Engineer Note

Digital Design. Chapter 6: Optimizations and Tradeoffs

Small Business Networking

Small Business Networking

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits

Math 35 Review Sheet, Spring 2014

Control-Flow Analysis and Loop Detection

6.2 Volumes of Revolution: The Disk Method

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

called the vertex. The line through the focus perpendicular to the directrix is called the axis of the parabola.

Misrepresentation of Preferences

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.

Angle Properties in Polygons. Part 1 Interior Angles

What are suffix trees?

Conic Sections Parabola Objective: Define conic section, parabola, draw a parabola, standard equations and their graphs

Memory-Optimized Software Synthesis from Dataflow Program Graphs withlargesizedatasamples

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

Transcription:

Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473, GR-54006, Thessloniki, Greece sstyl@topo.uth.gr, ptis@topo.uth.gr Working Group V/5 KEY WORDS: Hough trnsform, Line extrction, Algorithm ABSTRACT In close-rnge imges, normlly lrge number of geometricl fetures is vilble. For photogrmmetrists, the detection of shpes such s stright lines is very useful. These fetures re very helpful for further photogrmmetric work, such s sensor clibrtion, imge orienttion, DTM genertion etc. Hough Trnsform (HT), is such powerful tool for detecting predefined shpes (i.e. lines, ellipses). HT hs been used for more thn three decdes in the res of imge processing, pttern recognition nd computer vision. However, in digitl close rnge photogrmmetry HT hs only rrely been used. This pper is contribution on how HT cn be used s powerful technique for line extrction in close rnge photogrmmetric problems.. INTRODUCTION In rchitecturl photogrmmetry where lrge number of structures is vilble in the imges, tools for detecting pressigned shpes such s stright lines re very useful. These fetures re very useful for further photogrmmetric work, such s sensor clibrtion, imge orienttion, DTM genertion etc. Hough Trnsform (HT), is such tool for detecting predefined fetures (i.e. lines, ellipses) in imges nd hs been used for more thn three decdes in the res of imge processing, pttern recognition nd computer vision. However, in digitl close rnge photogrmmetry HT hs only rrely been used. In this pper HT focuses in problems of rchitecturl photogrmmetry. More specificlly, HT is used for line extrction from close rnge imges. An lgorithm hs been creted nd softwre in Microsoft Visul Bsic hs been developed. It must be cler from the beginning tht there re two wys in line extrction using the HT. It depends on the kind of work tht the user wnts to use the extrcted lines. If the mjority of lines is the subject of reserch then the whole imge must be exmined. This is slow process nd rther suffers from the disdvntge tht both useful nd useless dt re simultneously extrcted from the imge. On the other hnd, if only specific lines re the subject of reserch then the lgorithm is executed in specific prt of the imge which is defined by the user. Surely in this cse the process is much quicker. The uthors pproch ims to the second one, which mens tht HT is used s tool to extrct not ll the lines from the imge but only those tht re useful for further process. The im of this extrction process is the further use of lines such s in vnishing point computtion, single photo resection nd sensor clibrtion. Sttisticl tests re shown in rel test imges supporting the pproch.. WHAT IS HOUGH TRANSFORM - HOW DOES IT WORKS HT ws first proposed nd ptented by Pul Hough in 96 (Hough, 96) s technique for detecting curves in imges. The clssicl HT is technique for curve detection tht cn be described s prmetric curve (Bllrd nd Brown, 98). Previously, HT hs been expnded to detect rbitrry shpes (Bllrd, 98). Using n edge detector to locte points tht my consist n edge, the method exmines whether the points re components of specific type of prmetric curve. For instnce, such curve my be stright line or n ellipse. 9 Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Supplement B5. Amsterdm 000.

Stylinidis, Efstrtios Ech edge point is trnsformed from imge spce to prmeter spce by incresing the elements of n rry clled ccumultor, using the line prmeters s rry indices. The cells of the rry which hve the lrgest vlues indicte the possible loctions of lines in the imge (Figure c). Initilly ccumultor is set to zero. At first HT ws used to detect stright lines presented by the slopeintercept form (Eqution ). y = m x + b () For every edge point in the imge plne (xy plne), the ccumultor (bm plne, Figure c) is incresed using vlues for the slope nd y-intercept tht stisfies the Eqution s indices: A (m,b) = A(m, b) + () F Figure. Imge points (), prmeter lines (b), ccumultor cells (c) Ech edge point hs n ssocited prmeter line in the ccumultor (Figure b). The existence nd the position of colliner points re been indicted from the intersection of prmeter lines. The higher the number of colliner points the greter the possibility tht line is been detected in the imge. HT complexity depends on the number of increments required for the slope. For instnce, hving k increments of m, there re km number of computtions. In 97, Dud nd Hrt (Dud nd Hrt, 97) proposed tht the prmeters for line would be better described by the length! nd orienttion (Eqution 3) of norml vector to the line from the origin of the imge (Figure ).! = x cos + ysin (3) In the sme wy, following the steps of originl HT, for every edge point in the imge plne (xy plne), the ccumultor (! plne) (initilly set to zero) is incresed using vlues for the ngle nd rdius! tht stisfy Eqution 3 s indices: A (!,) = A(!,) + (4) Figure. Norml representtion of line Figure 3. Prmeter spce! Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Supplement B5. Amsterdm 000. 0

Stylinidis, Efstrtios The ccumultor cells with the gretest number of votes correspond to lines in imge spce. This wy, the norml prmeteriztion gives sinusoidl curves in the ccumultor. The intersection of curves denote the possible loctions of lines in the imge nd the number found t the intersection shows the number of colliner points in the line. The rnge of! is D to + D, where D is the digonl size of the re serched in the imge spce. Additionlly, the rnge of is between 0 nd 00 grds. 3. GRADIENT IN HOUGH TRANSFORM The im is the detection of stright lines in close rnge imges. In order to mke the recognition of line esier the most common wy is the reduction of informtion which is included in the originl imge. To this end n edge opertor is used, like the grdient opertor, nd thus grdient imge is generted by this process. An imge cn be described s function f(x,y), where x,y re the spce indictors nd f the gry vlue for the specific imge pixel. The grdient of f t position (x,y) is the vector given by f x G x G [f (x, y)] = = (5) G f y y The mgnitude of the grdient t position (x,y) is given by y G [f (x, y)] = G x + G (6) When using 3x3 filter-msk such s 4 7 5 8 3 6 9 (7) the components G x nd G y for the center pixel of the msk (7) re given by (Sobel filter) G G x y = ( = ( 7 3 + + 8 6 + ) ( + 9 + ) ( + 9 4 + + 3 7 ) ) (8) Using formul (9) G [f (x, y)] > T (9) edge points re defined s these pixels tht the mgnitude of their grdient exceeds n initilly defined threshold vlue T. Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Supplement B5. Amsterdm 000.

Stylinidis, Efstrtios 3. «Edge enhnced» imges () The edge detection process is gretly esed if, insted the originl imges, «edge enhnced» ones re used. This inevitbly leds to the use of some edge detector, like the ones presented next. 3.. Cnny edge detector. This is the work by John Cnny for his Msters degree t MIT in 983. He treted edge detection s signl processing problem nd imed to design the «optiml» edge detector. He formlly specified n objective function to be optimized nd used this to design the opertor. The objective function ws designed to chieve the following optimiztion constrins (Cnny, 986): (b) (c) Figure 4. Originl imge (), Cnny edge detector (b) imge, SUSAN imge (c). Mximize the signl to noise rtio in order to provide good detection.. Achieve good locliztion to ccurtely mrk edges. 3. Minimize the number of responses to single edge (nonedges re not mrked). 3.. SUSAN edge detector. SUSAN is n cronym for Smllest Univlue Segment Assimilting Nucleus. The SUSAN lgorithms cover imge noise filtering, edge finding nd corner finding. The edge detection lgorithm developed by Stephen M. Smith follows the usul method of tking n imge nd using predetermined window (circulr msk in this cse usul rdius is 3.4 pixels giving msk of 37 pixels) centered on ech pixel in the imge nd pplying loclly cting set of rules to give n edge response. This response is then processed to give s n output set of edges. (http://www.fmrib.ox.c.uk/~steve/susn/index.html) Figure 5. Finl line is shown overlid upon the «imge» line Figure 6. Finl line lignment fter best fitting process 4. IMPLEMENTATION - EXPERIMENTAL RESULTS The HT experiment implemented through softwre developed in Microsoft Visul Bsic environment. The user hs to select serch re for the lgorithm to serch, find nd locte the possible line. The softwre responses, showing the line loction (Figure 5). The extrcted line is shown overlid upon the «imge» line so s the user cn judge the effectiveness of the procedure. Additionlly, ll interesting pixels, tht hve distnce not greter thn pixel from the extrcted line, re recorded. Following best fitting procedure for ll the recorded interesting pixels, the best fitted line is clculted s well s its sttistics (Figure 6). In this process line form of Eqution ws used. Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Supplement B5. Amsterdm 000.

Stylinidis, Efstrtios The experiment took plce in n indoor imge (Figure 8) cquired with Kodk DCS 40 still video cmer with super wide ngle lens 7 mm (Figure 7). Four horizontl nd four verticl lines hve been extrcted from the imge nd their sttistics re shown in Tble. The results tht presented in Tble, re derived from the ppliction of HT technique in the indoor imge. Formerly, the originl imge ws pre-processed with the SUSAN edge detector (Figure 4c). Figure 7. DCS 40 A globl relibility test took plce, using the sttisticl test of vrince weight unit. An onesided F-test is defined s: o : H = / : H < () In this cse, the zero hypothesis H o is being ccepted if ^. F f, () Figure 8. Extrcted lines from the experimentl test where f re the degrees of freedom nd. is the significnce level. In the experiment where ws set equl to one pixel nd ³ clculted below unit (0.4.0) (Tble ), it is cler tht the lterntive hypothesis H is being ccepted. These leds to the conclusion tht mesurements in the imge were tken with n ccurcy lower thn one pixel. A Line No. Hough Trnsform Results in SUSAN Edge Imge No. of Points ^ o ^ (grd) ^ b (pixels) (H) 07 0.94 0.0 0.05 (H) 077 0.99 0.04 0.09 3 (H) 58 0.89 0.09 0.08 Figure 9. Extrcted lines were plotted in 4 (H) 36 0.74 0.3 0.08 Autocd environment using ActiveX technology 5 (V) 3 0.90 0.7 0.7 6 (V) 53 0.89 0.4 0.76 7 (V) 33 0.75 0.7 0.63 4. Model cretion -ActiveX technology 8 (V) 5 0.37 0.07 0.04 During best fitting process, mong the other prmeters, line s endpoints coordintes re clculted nd recorded s well. A very useful tech- Tble. Line sttistics nique for dt utiliztion hs been developed using ActiveX technology in CAD environment. AutoCd is such CAD pckge tht provides the bility to use this technology. Extrcted lines from HT process were plotted in AutoCd environment (Figure 9). Through the softwre developed it is possible to use ll possible AutoCd bilities. 5. CONCLUSIONS HT is technique for detecting rbitrry shpes nd predefined shpes, such s lines, s well. Even if it is not widely used in close rnge pplictions, HT remins powerful tool nd must be used in line extrction. In this pper HT ws exmined from the point of view of line extrction. 3 Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Supplement B5. Amsterdm 000.

Stylinidis, Efstrtios Experimentl results proved tht using n edge imge, quickly nd ccurtely lines cn be detected nd locted in close rnge imges. More specificlly, the vlue of -posteriori vrince of weight unit reched 0.4 pixel nd lower thn pixel. Finlly, new softwre module ws creted turning to dvntge of ActiveX technology in CAD environment. Using this technology in AutoCd environment, extrcted lines where plotted, hving s result the imge model cretion. All AutoCd utilities nd commnds cn now be ccessed nd used from the developed module. REFERENCES Admos, C., Fig W., 99. Hough Trnsform in Digitl Photogrmmetry. In: Interntionl Archives of Photogrmmetry nd Remote Sensing, Wshington, USA, Vol. 9, Prt B3, pp. 50-54. Bllrd, D. H., 98. Generlizing the Hough Trnsform to detect rbitrry shpes. Pttern Recognition, 3(), pp. -. Bllrd, D. H., Brown C. M., 98. Computer Vision. Prentice-Hll Inc., Englewood Cliffs, New Jersey, pp. 3-3. Cnny, J., 986. A computtionl pproch to edge detection. IEEE Trnsctions on Pttern Anlysis nd Mchine Intelligence, 8(6), pp. 679-698. Dud, R. D., Hrt P. E., 97. Use of the Hough Trnsform to detect lines nd curves in pictures. Communiction of the ACM, 5(), pp. -5. Hough, P.V.C, 96. Method nd Mens for Recognizing Complex Ptterns. U.S. Ptent 3,069,654. Stylinidis, E., Ptis P., 999. Semi-utomtic «interest line» extrction in close rnge imges. In: Interntionl Archives of Photogrmmetry nd Remote Sensing, Thessloniki, Greece, Vol. XXXII, Prt 5W, pp. 37-4. Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Supplement B5. Amsterdm 000. 4