Recovering a Polygon from Noisy Data

✍ Scribed by Longin Jan Latecki; Azriel Rosenfeld

• Book ID: 102568511
• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 299 KB
• Volume: 86
• Category: Article
• ISSN: 1077-3142
• DOI: 10.1006/cviu.2002.0971

✦ Synopsis

Many classes of scenes contain objects that are (approximately) two-dimensional polygons-for example, buildings in an aerial photograph, or flat mechanical parts on a tabletop. This paper deals with the problem of recovering (an approximation to) an unknown polygon from noisy digital data, obtained by digitizing either an image of the (solid) polygon or a sequence of points on its boundary. Note that our goal is to obtain an approximation to the original polygon, not an approximation to the noisy data. We derive constraints on the polygon and on the noisy digitization process under which (approximate) recovery of the polygon is possible. We show that if these constraints are satisfied, the desired approximation can be recovered by selecting a subset of the data points as vertices. We define a vertex elimination process that accomplishes this recovery and give examples of successful recovery of both synthetic and real noisy polygons.