QuadTree Partitioning

• Divide the image into non-overlapping blocks (Ranges)

• Try to find a portion of the image (Domain) that maps to a Range

• Search is linear and is computationally very intensive

• Complexity can be reduced by classifying the domains

Previous slide

Next slide

Back to first slide

View graphic version