Fast All Nearest Neighbor Algorithms from Image Processing Perspective

Authors:
Yuh-Rau Wang;Shi-Jinn Horng;Hung-Chang Chan
Affiliations:
St. John's & St. Mary's Institute of Technology, Taiwan;National Taiwan University of Science and Technology, Taipei;National Taiwan University of Science and Technology, Taipei
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Year:
2005

Citing 12
Cited 1

Space multiplexing of waveguides in optically interconnected multiprocessor systems

The Computer Journal - Special issue on object-oriented programming
Parallel Algorithms for Image Processing on OMC

IEEE Transactions on Computers
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes

IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh

IEEE Transactions on Parallel and Distributed Systems
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Fundamental data movement operations and its applications on a hyper-bus broadcast network

Parallel Computing
Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems

The Journal of Supercomputing
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal
Parallel algorithms for arbitrary dimensional Euclidean distance transforms with applications on arrays with reconfigurable optical buses

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model

IEEE Transactions on Parallel and Distributed Systems

An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we solve the k-dimensional all nearest neighbor (kD_ANN) problem, where k = 2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective.Three scalable O(1) time algorithms are proposed, one for solving the Euclidean distance transform (EDT) problem and the other two for solving the all nearest neighbor (ANN) problem.First, for a two-dimensional (2D) binary image of size N x N, we devise an algorithm for solving the 2D_EDT problem using an LARPBS of size N^{2+驴} , where 0