Abstract
Forest of quadtrees (FQT) is a variant of quadtrees (QT) that is used to represent a binary image of size 2 n × 2 n with better space efficiency compared to the latter. The space requirement of FQT depends on the type of regions contained in the image. In some cases, the FQT structure is as costly as QT structure in terms of storage. In this article we compute the probability of FQT structure reducing to QT structure with the assumption that each pixel in the binary image has equal probability to be black or white. It is observed that, in the case of binary images of practical sizes, the FQT structure reduces to QT structure in most of the cases.
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.
