An efficient algorithm to decompose a compound rectilinear shape into simple rectilinear shapes

Detection of a compound object is a critical problem in target recognition. For example, buildings form an important class of shapes whose recognition is important in many remote sensing based applications. Due to the coarse resolution of imaging sensors, adjacent buildings in the scenes appear as a single compound shape object. These compound objects can be represented as the union of a set of disjoint rectilinear shaped objects. Separating the individual buildings from the resulting compound objects in a segmented image is often difficult but important nevertheless. In this paper we propose a new and efficient technique to decompose a compound shape into a set of simple rectilinear shapes. First, the true interior and exterior corner points of the compound object are extracted. A modified corner detector based on polygonal approximation is proposed to accurately determine the boundaries of compound shapes. The compound shape is then split at the interior corner points to minimize the difference between the perimeter of the compound object and the sum of the perimeters of the decomposed objects. We have systematically compared the results our algorithm with those of existing approaches and the results show that the proposed algorithm is more accurate than the algorithms in the literature in terms of accuracy of perimeter estimation and computational cost.

[1]  Eiji Kawaguchi,et al.  On a Method of Binary-Picture Representation and Its Application to Data Compression , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Guojun Lu,et al.  Review of shape representation and description techniques , 2004, Pattern Recognit..

[3]  Eduard Sojka A new algorithm for detecting corners in digital images , 2002, SCCG '02.

[4]  N. K. Kushwaha,et al.  L EAST SQUARE BASED AUTOMATIC THRESHOLD SELECTION FOR POLYGONAL APPROXIMATION OF DIGITAL CURVES , 2013 .

[5]  Yonghak Song,et al.  BUILDING EXTRACTION FROM HIGH RESOLUTION COLOR IMAGERY BASED ON EDGE FLOW DRIVEN ACTIVE CONTOUR AND JSEG , 2008 .

[6]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[7]  Franz Aurenhammer,et al.  Handbook of Computational Geometry , 2000 .

[8]  Basil G. Mertzios,et al.  Real-time computation of two-dimensional moments on binary images using image block representation , 1998, IEEE Trans. Image Process..

[9]  Wuming Zhang,et al.  Semantic Decomposition and Reconstruction of Compound Buildings with Symmetric Roofs from LiDAR Data and Aerial Imagery , 2015, Remote. Sens..

[10]  Sariel Har-Peled,et al.  Approximating the Maximum Overlap of Polygons under Translation , 2014, Algorithmica.

[11]  Trupti P. Patel,et al.  Corner Detection Techniques: An Introductory Survey , 2014 .

[12]  Hiroshi Nagamochi,et al.  An approximation algorithm for dissecting a rectangle into rectangles with specified areas , 2003, Discret. Appl. Math..

[13]  Zhonghua Xi,et al.  Dual-Space Decomposition of 2D Complex Shapes , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Sabri A. Mahmoud,et al.  Polygonal approximation of digital planar curves through adaptive optimizations , 2010, Pattern Recognit. Lett..

[15]  Markus Gerke,et al.  The ISPRS benchmark on urban object classification and 3D building reconstruction , 2012 .

[16]  Paul J. Zsombor-Murray,et al.  Fast algorithm for the computation of moment invariants , 1987, Pattern Recognit..