Given a sequence of points in two dimensions, obtained by sampling the perimeter of a planar region, it is often of interest to approximate this set by piecewise linear curves or polygons. In this paper we take a Minimum Description Length (MDL) approach to this problem. The algorithm presented yields the polygonal approximation with the (globally) minimum description length to the given sequence of points for fixed initial and final endpoints. The execution time and space requirements of our algorithm are both $O(n^2 )$, where $n$ is the number of points. Experimental results demonstrating the behavior of the optimal algorithm under changes in noise and precision levels are shown.
By: Saibal Banerjee, Wayne Niblack and Myron Flickner
Published in: RJ10007 in 1996
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .