A FAST QUADTREE NORMALIZATION ALGORITHM

Authors
ANG CH SAMET H
Citation
Ch. Ang et H. Samet, A FAST QUADTREE NORMALIZATION ALGORITHM, Pattern recognition letters, 15(1), 1994, pp. 57-63
Citations number
11
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence
Journal title
Pattern recognition letters → ACNP
ISSN journal
01678655
Volume
15
Issue
1
Year of publication
1994
Pages
57 - 63
Database
ISI
SICI code
0167-8655(1994)15:1<57:AFQNA>2.0.ZU;2-J
Abstract
A region quadtree representation of an image can be normalized thereby yielding a quadtree that contains the least number of nodes in O(s(2) log(2)s) time where s is the length of the grid. A new algorithm is pr oposed whose asymptotic time bound is the same but whose first part on ly takes O(s(2)). It is shown empirically to be able to produce the no rmalized quadtrees for a number of images in real applications.