A parallel algorithm for approximate regularity

✍ Scribed by Laurence Boxer; Russ Miller

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 77 KB
• Volume: 80
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/s0020-0190(01)00252-6

✦ Synopsis

Spatial regularity amidst a seemingly chaotic image is often meaningful. Many papers in computational geometry are concerned with detecting some type of regularity via exact solutions to problems in geometric pattern recognition. However, real-world applications often have data that is approximate, and may rely on calculations that are approximate. Thus, it is useful to develop solutions that have an error tolerance.

A solution has recently been presented by Robins et al. [Inform. Process. Lett. 69 (1999) 189-195] to the problem of finding all maximal subsets of an input set in the Euclidean plane R 2 that are approximately equally-spaced and approximately collinear. This is a problem that arises in computer vision, military applications, and other areas. The algorithm of Robins et al. is different in several important respects from the optimal algorithm given by Kahng and Robins [Patter Recognition Lett. 12 (1991) [757][758][759][760][761][762][763][764] for the exact version of the problem. The algorithm of Robins et al. seems inherently sequential and runs in O(n 5/2 ) time, where n is the size of the input set. In this paper, we give parallel solutions to this problem.