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

Authors:
Yuh-Rau Wang
Affiliations:
Department of Computer Science and Information Engineering, St. John's University, Taipei, Taiwan
Venue:
Journal of Parallel and Distributed Computing
Year:
2007

Citing 20
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Space multiplexing of waveguides in optically interconnected multiprocessor systems

The Computer Journal - Special issue on object-oriented programming
Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
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
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

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
Linear array with a reconfigurable pipelined bus system—concepts and applications

Information Sciences: an International Journal - special issue on parallel and distributed processing
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
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
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
Scalable and Efficient Parallel Algorithms for Euclidean Distance Transform on the LARPBS Model

IEEE Transactions on Parallel and Distributed Systems
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
Fast All Nearest Neighbor Algorithms from Image Processing Perspective

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Efficient Parallel Hierarchical Clustering Algorithms

IEEE Transactions on Parallel and Distributed Systems
3D Distance Fields: A Survey of Techniques and Applications

IEEE Transactions on Visualization and Computer Graphics
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

A novel O(1) time algorithm for 3D block-based medial axis transform by peeling corner shells

Parallel Computing
An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Computers and Electrical Engineering
Scheduling light-trails on WDM rings

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. First, for a two-dimensional (2D) binary image of size NxN, we devise an algorithm for solving the 2D_ANN problem using a LARPBS of size N2+, where 0N3+, where 0