Fast Quadtree Decomposition Using Histograms

S. G. Lele; H. Mostafavi

doi:10.1117/12.976222

10 December 1986 Fast Quadtree Decomposition Using Histograms

S. G. Lele, H. Mostafavi

Proceedings Volume 0697, Applications of Digital Image Processing IX; (1986) https://doi.org/10.1117/12.976222
Event: 30th Annual Technical Symposium, 1986, San Diego, United States

Abstract

Quadtree decomposition is one of the methods of representing binary image data at multiple resolutions. Such representations have found application in many areas of image processing. This paper describes a novel implementation of quadtree generation using histograms. The histogram based implementation is fast and easy to implement on any histogram generating hardware. The number of histograms to be computed depends upon the size of the original image, the size of the smallest block into which the image is to be resolved, and on the number of gray levels handled by the histogram generating hardware. The paper also describes a fast algorithm to reconstruct binary images from quadtree decomposition using video rate lookup table processing.

Citation Download Citation

S. G. Lele and H. Mostafavi "Fast Quadtree Decomposition Using Histograms", Proc. SPIE 0697, Applications of Digital Image Processing IX, (10 December 1986); https://doi.org/10.1117/12.976222

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available