Abstract
Given a set S of m points stored on a reconfigurable mesh computer of size n×n, one point per processing element (PE). In this paper we present a parallel method for solving the k-Nearest Neighbor problem (k-NN). This method permits each point of S to know its k-NN (0<k<m). The corresponding algorithm requires that each PE must have 2k registers where it stores the (x,y) coordinates of its k-NN in a given order. This algorithm has a complexity of O(log h+k 2) times, where h is a maximal number of points within a row of the mesh. This complexity is reduced to O(k 2) times, using an appropriate procedure which demonstrates the power of the reconfiguration operations carried out by the processors, and the polymorphic properties of the mesh.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alnuweiri, H.M. et al.: Switch models and reconfigurable networks: Tutorial and partial survey, CICSR-TR 94-01, Department of Electrical Engineering, University of British Columbia.
Chen, Y. A., Lin, Y. L., and Chang, L. W.: A systolic algorithm for the k-nearest neighbors problem, IEEE Trans. Comput. 41(1) (1992), 103-108.
Davis, P. J.: Interpolation and Approximation, Dover, New York, 1973.
Duda, R. O. and Hart, P. E.: Pattern Classification and Scene Analysis, Wiley-interscience, New York, 1973.
Elmesbahi, J.: Nearest neighbor problem on a mesh connected computer, IEEE Trans. Systems Man Cybernet. 20(5) (1990), 1199-1204.
Elmesbahi, J.: θ(1) time algorithm for image component labeling in a mesh connected computer, IEEE Trans. Systems Man Cybernet. 21(2) (1991), 427-433.
Elmesbahi, J., Bouattane, O., Sabri, M., and Chaibi, M.: A fast algorithm for ranking and perimeter computation on a reconfigurable mesh computer, in: Proc. of IEEE Internat. Conf. on Systems, Man and Cybernetics, San Antonio, Texas, 2-5 October 1994, pp. 1898-1902.
Elmesbahi, J. and Charkaoui, J.: Structure analysis for Gray level pictures on a mesh connected computer, in: Proc. of IEEE Internat. Conf. on Systems, Man and Cybernetics, October 1986, pp. 1415-1419.
Li, H. and Maresca, M.: Polymorphic torus architecture for computer vision, IEEE Trans. Pattern Anal. Mach. Intell. 11(3) (1989), 233-242.
Miller, R., et al.: Meshes with reconfigurable buses, in: Proc. 5th MIT Conf. on Advanced Research in VLSI, Cambridge, MA, 1988, pp. 163-178.
Miller, R., Prasanna-Kummar, V. K., Reisis, D. I., and Stout, Q. F.: Parallel computation on reconfigurable meshes, IEEE Trans. Comput. 42(6) (1993), 678-692.
Miller, R. and Stout, Q. F.: Mesh computer algorithms for computational geometry, IEEE Trans. Comput. 38(3) (1989), 321-340.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bouattane, O., Elmesbahi, J., Khaldoun, M. et al. A Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer. Journal of Intelligent and Robotic Systems 32, 347–360 (2001). https://doi.org/10.1023/A:1013920332390
Issue Date:
DOI: https://doi.org/10.1023/A:1013920332390