Loading...
Please wait, while we are loading the content...
Similar Documents
Optical clustering on a mesh- connected computer 1 (1992).
| Content Provider | CiteSeerX |
|---|---|
| Author | Dehne, Frank Miller, Russ Rau-Chaplin, Andrew |
| Abstract | In this paper, we present optimal parallel algorithms for optical clustering on a mesh-connected computer. Optical clustering is a clustering technique based on the principal of optical resolution, and is of particular interest in picture analysis. The algorithms we present are based on the application of parallel algorithms in computational geometry and graph theoryl In particular, we show that given a set S of N points in the Euclidean plane, the following problems can be solved in optimal O(x/-N) time on a mesh-connected computer of size N. 1. Determine the optical clusters of S with respect o a given separation parameter. 2. Given an interval [a,b] representing the number of optical clusters desired in the clustering of S, determine the range of the separation parameter that will result in such an optical clustering. KEY WORDS: Mesh-connected computer; optical clustering; image processing; computationai geometry; connected components. |
| File Format | |
| Publisher Date | 1992-01-01 |
| Access Restriction | Open |
| Subject Keyword | Optical Clustering Mesh-connected Computer Mesh Connected Computer Separation Parameter Optical Cluster Computational Geometry Euclidean Plane Optimal Parallel Algorithm Parallel Algorithm Optical Resolution Picture Analysis Graph Theoryl Particular Interest Key Word Following Problem Image Processing Computationai Geometry |
| Content Type | Text |
