Cart (Loading....) | Create Account
Close category search window
 

Nearest neighbor problems on a mesh-connected computer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
El Mesbahi, J. ; Hay Essalaum, Casablanca

Given a binary image registered on a mesh-connected computer, the image is formed on n×n pixels distributed one pixel per processing element (PE). Two algorithms for computing the nearest neighbor are proposed. The first algorithm involves an image formed of two kinds of PEs, those having a point (marked PEs) and those not having a point (unmarked PEs). For each marked PE the Euclidean distance that separates this marked PE from the nearest other marked PE is determined. The second algorithm involves an image containing black components. The nearest-neighbor black component for each given black component is determined. When the algorithm has been completed, every PE of each black component `knows' the coordinates of the nearest PE belonging to the nearest black component. It is shown that using the operations of connection and disconnection of communication channels to link two nonneighbor PEs, each problem can be solved in a number of operations less than n if n is sufficiently large for a mesh-connected computer of n×n dimension

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:20 ,  Issue: 5 )

Date of Publication:

Sep/Oct 1990

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.