Abstract
Quadtree is an efficient method to represent binary images. How to build a quadtree for a binary image is worthy of study. The major contribution of this paper is that we first use the Hilbert mapping technique to represent the binary image. Then, based on the reconfigurability of the reconfigurable mesh, a constant time algorithm for building a quadtree for an n × n binary image using n × n processors is derived. For applications of this algorithm two methods for compressing and decompressing binary images are also proposed.
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.
