Location
University of Utah
Start Date
5-8-2000 10:00 AM
Description
In this paper we deal with a new technique for large data compression. Contour mapping of two dimensional objects is of fundamental importance in remote sensing and computer vision applications. We present extensive algorithms applied to polygonized, simply-connected contours and reproduce desired shapes using an innovative data compression technique based on conformal mapping. In a previous work3,4, through a conformal mapping process, we demonstrated the ability to 1) recognize shapes, and 2) concisely represent shape boundaries using a set of polynomial coefficients derived in the mapping process. In this work we illustrate how these previous results can be applied to data compression. In particular, in the approach outlined herein, a syntactic representation is formed for polygon shapes whose representation we desire to extract and reproduce compactly. Additionally, we present a problem of concavity in shape boundaries and a proposed solution in which polygons are divided into convex subsets and reconstructed accordingly.
A New Fast and Efficient Conformal Mapping Based Technique for Remote Sensing Data Compression and Transmittal
University of Utah
In this paper we deal with a new technique for large data compression. Contour mapping of two dimensional objects is of fundamental importance in remote sensing and computer vision applications. We present extensive algorithms applied to polygonized, simply-connected contours and reproduce desired shapes using an innovative data compression technique based on conformal mapping. In a previous work3,4, through a conformal mapping process, we demonstrated the ability to 1) recognize shapes, and 2) concisely represent shape boundaries using a set of polynomial coefficients derived in the mapping process. In this work we illustrate how these previous results can be applied to data compression. In particular, in the approach outlined herein, a syntactic representation is formed for polygon shapes whose representation we desire to extract and reproduce compactly. Additionally, we present a problem of concavity in shape boundaries and a proposed solution in which polygons are divided into convex subsets and reconstructed accordingly.