Paper Info
Title
Finding neighbors on bincode-based images in O (n log log n) time
Abstract
The interpolation-based bintree is a storage-saving encoding scheme for representing binary images. It represents the image by using a sequence of increasing positive integers, called bincodes. In this paper, an efficient algorithm for solving the problem of neighbor finding on bincodes is presented. The time complexity of the algorithm is O (n log log n), where n is the number of the bincodes. In addition, experimental results are included to confirm the theoretical analysis. These experimental values show that our algorithm is faster than the previous best known results (Huang and Chung, 1995a, b). Furthermore, by using the conversion algorithms, we can apply our algorithm for the neighbor-finding problem on images represented by other representations such as the locational codes, the DF-expression, the S-tree, and the Morton codes to achieve better performance.
Year
DOI
Venue
1996
10.1016/0167-8655(96)00067-0
Pattern Recognition Letters
Keywords
DocType
Volume
neighbor finding,bincodes,interpolation-based bintree,efficient algorithm,experimental value,morton code,bincode-based image,binary image,conversion algorithm,n log log n,neighbor-finding problem,better performance,interpolation search,time complexity
Journal
17
Issue
ISSN
Citations 
10
Pattern Recognition Letters
6
PageRank 
References 
Authors
0.49
11
2
Name
Order
Citations
PageRank
Kuo-Liang Chung11166121.24
Chi-Yen Huang221612.02