Abstract
In this paper, by a novel morphological decomposition method, we propose an efficient compression approach. Our presented decomposition arises from solving a minimum set cover problem (MSCP) obtained from the image skeleton data. We first use the skeleton pixels to create a collection of blocks which cover the foreground. The given blocks are both overlapped and too many. Hence, in order to find the minimum number of the blocks that cover the foreground, we form an MCSP. To solve this problem, we present a new algorithm of which accuracy is better than those of the known methods in the literatures. Also, its error analysis is studied to obtain an error bound. In the sequel, we present a fast algorithm which include an extra parameter by which the relation between the accuracy and CPU time can be controlled. Finally, several examples are given to confirm the efficiency of our approach.
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.
