Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system

Author

Pan, Yi ; Li, Keqin ; Zheng, Si-Qing

Author_Institution

Dept. of Comput. Sci., Dayton Univ., OH, USA

fYear

1997

fDate

18-20 Dec 1997

Firstpage

444

Lastpage

450

Abstract

We present efficient algorithms for the nearest neighbor problem defined in an n×n binary image. We show that using a linear array with a reconfigurable pipelined bus system (LARPBS) of n² processors, the nearest neighbor problem can be solved in O(log log n) time, and using an LARPBS of n³ processors, the nearest neighbor problem can be solved in O(1) time. We also show that the nearest neighbor problem can be solved on an LARPBS of n² processors in O(1) time with high probability

Keywords

computational complexity; image processing; parallel algorithms; reconfigurable architectures; O(1) time; O(log log n) time; binary image; linear array; n³ processors; nearest neighbor algorithms; nearest neighbor problem; reconfigurable pipelined bus; Broadcasting; Computer science; Multicast algorithms; Nearest neighbor searches; Optical amplifiers; Optical waveguides; Pixel; Propagation delay; Semiconductor optical amplifiers; Stimulated emission;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Conference_Location

Taipei

ISSN

1087-4089

Print_ISBN

0-8186-8259-6

Type

conf

DOI

10.1109/ISPAN.1997.645135

Filename

645135

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3261554