Constant time neighbor finding in quadtrees: An experimental result

被引：0

作者：

Aizawa, Kunio ^{[1
]}

Motomura, Koyo ^{[1
]}

Kimura, Shintaro ^{[1
]}

Kadowaki, Ryosuke ^{[1
]}

Fan, Jia ^{[1
]}

机构：

[1] Shimane Univ, Interdisciplinary Fac Sci & Engn, Dept Math & Comp Sci, Matsue, Shimane 6908502, Japan

来源：

2008 3RD INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS, CONTROL AND SIGNAL PROCESSING, VOLS 1-3 | 2008年

关键词：

image processing; quadtrees; linear quadtrees; neighbor finding;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Neighbor finding is an important and a basic part of image processing in quadtrees. A constant time algorithm is proposed for neighbor finding in quadtrees in [1]. In this paper, empirical tests are given for the constant time algorithm in comparison with usual neighbor finding algorithm using quadtrees [2] and another constant time algorithm using linear quadtree [3]. Experiments using synthetic images simulating worst case situations show that the proposed algorithm is in constant time complexity while others are not Even for experiments using natural images, the proposed algorithm is more than twice as fast as algorithm using quadtrees and is slightly as fast as algorithm using linear quadtrees.

引用

页码：505 / 510

页数：6

共 50 条

[1] A Constant-Time Algorithm for Finding Neighbors in Quadtrees
Aizawa, Kunio
Tanaka, Shojiro
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (07) : 1178 - 1183
[2] NEIGHBOR FINDING TECHNIQUES FOR IMAGES REPRESENTED BY QUADTREES
SAMET, H
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 18 (01): : 37 - 57
[3] FINDING NEIGHBORS OF EQUAL SIZE IN LINEAR QUADTREES AND OCTREES IN CONSTANT TIME
SCHRACK, G
CVGIP-IMAGE UNDERSTANDING, 1992, 55 (03): : 221 - 230
[4] A strategy for repetitive neighbor finding in images represented by quadtrees
Voros, J
PATTERN RECOGNITION LETTERS, 1997, 18 (10) : 955 - 962
[5] A MODEL FOR THE ANALYSIS OF NEIGHBOR FINDING IN POINTER-BASED QUADTREES
SAMET, H
SHAFFER, CA
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (06) : 717 - 720
[6] Constant-time neighbor finding in hierarchical tetrahedral meshes
Lee, M
De Floriani, L
Samet, H
INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDING, 2001, : 286 - +
[7] MODEL FOR THE ANALYSIS OF NEIGHBOR FINDING IN POINTER-BASED QUADTREES.
Samet, Hanan
Shaffer, Clifford A.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1985, PAMI-7 (06) : 717 - 720
[8] Topological Approach for Finding Nearest Neighbor Sequence in Time Series
Avogadro, Paolo
Dominoni, Matteo Alessandro
KDIR: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT - VOL 1: KDIR, 2019, : 233 - 244
[9] Asynchronous neighbor discovery: Finding needles of connectivity in haystacks of time
Dutta, Prabal
Culler, David
Shenker, Scott
2008 INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS, PROCEEDINGS, 2008, : 531 - 532
[10] A constant key length coding scheme for linear quadtrees
Chang, HKC
Liou, CY
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SYSTEMS, 1996, 10 (02): : 205 - 218

← 1 2 3 4 5 →