A fast quadtree normalization algorithm

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99155

DC Field	Value
dc.title	A fast quadtree normalization algorithm
dc.contributor.author	Ang, C.-H.
dc.contributor.author	Samet, H.
dc.date.accessioned	2014-10-27T06:01:12Z
dc.date.available	2014-10-27T06:01:12Z
dc.date.issued	1994-01
dc.identifier.citation	Ang, C.-H.,Samet, H. (1994-01). A fast quadtree normalization algorithm. Pattern Recognition Letters 15 (1) : 57-63. ScholarBank@NUS Repository.
dc.identifier.issn	01678655
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/99155
dc.description.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.
dc.source	Scopus
dc.subject	image processing
dc.subject	Quadtree normalization
dc.subject	region representation
dc.type	Article
dc.contributor.department	INFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitle	Pattern Recognition Letters
dc.description.volume	15
dc.description.issue	1
dc.description.page	57-63
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check