Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99155
Title: A fast quadtree normalization algorithm
Authors: Ang, C.-H. 
Samet, H.
Keywords: image processing
Quadtree normalization
region representation
Issue Date: Jan-1994
Citation: Ang, C.-H.,Samet, H. (1994-01). A fast quadtree normalization algorithm. Pattern Recognition Letters 15 (1) : 57-63. ScholarBank@NUS Repository.
Abstract: A region quadtree representation of an image can be normalized thereby yielding a quadtree that contains the least number of nodes in O (s2 log2 s) time where s is the length of the grid. A new algorithm is proposed whose asymptotic time bound is the same but whose first part only takes O (s2). It is shown empirically to be able to produce the normalized quadtrees for a number of images in real applications. © 1994.
Source Title: Pattern Recognition Letters
URI: http://scholarbank.nus.edu.sg/handle/10635/99155
ISSN: 01678655
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

54
checked on Dec 7, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.