Abstract
A new method of describing the shape of a silhouette for data compression is proposed. A silhouette is decomposed into a union of components. Each component is defined as a density distribution function. The algorithm of shape decomposition is based on the skeleton structure. The components are represented in a tree structure according to the sequence of silhouettes. The latter are generated by applying a Gaussian filter to the original contour at varying levels. Simulation reveals that the proposed technique requires fewer bits than other shape decomposition schemes at the same degree of approximation. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
