Share Email Print

Proceedings Paper

Hierarchical detection of rectangles in images
Author(s): Mohamed Hasan; Mohamed Abdellatif; Noborou Babaguchi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper proposes a new technique for rectangle detection in images based on hierarchical feature complexity. The algorithm follows a bottom-up/top-down approach: in the bottom-up phase, contour curves are extracted and its edges are fit to straight lines. Long contours may grow away from the object boundary and they may not complete a loop due to missing edges. The proposed algorithm introduces a solution to such problems in the top-down phase through two simple rules. First, contours are split into segments at the point where non-convexity occurs since this is the point where long contours depart from the object boundary. Second, the split segments are classified into six classes according to their probability of being a rectangle depending on the numbers of the segment sides and right angles they enclose. These classes are then completed into rectangles by searching for suitable lines that may have been missed during the bottom-up phase. The method is verified through experiments on a set of images covering several applications. The results are compared to state of the art methods and benchmarked to groundtruth.

Paper Details

Date Published: 11 July 2016
PDF: 7 pages
Proc. SPIE 10011, First International Workshop on Pattern Recognition, 1001105 (11 July 2016); doi: 10.1117/12.2242171
Show Author Affiliations
Mohamed Hasan, Osaka Univ. (Japan)
Benha Univ. (Egypt)
Mohamed Abdellatif, Future Univ. (Egypt)
Noborou Babaguchi, Osaka Univ. (Japan)

Published in SPIE Proceedings Vol. 10011:
First International Workshop on Pattern Recognition
Xudong Jiang; Guojian Chen; Genci Capi; Chiharu Ishll, Editor(s)

© SPIE. Terms of Use
Back to Top