By Topic

Texture segmentation on two high-performance computers

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
$33 $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

3 Author(s)
N. S. Raja ; Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA ; M. Tuceryan ; A. K. Jain

An implementation of a texture segmentation algorithm on two high-performance computers, the Connection Machine CM-2 and the Convex mini-supercomputer, is presented. Texture segmentation is the process of identifying regions with similar texture and separating regions with different textures and is one of the early steps towards identifying surfaces and objects in an image. A segmentation algorithm is described which first extracts texture tokens from the input image, then computes the Voronoi tessellation of the extracted tokens and measures shape features (moments of area) of the resulting Voronoi polygons. Feature similarity is used to obtain an initial labeling of texture tokens as interior or border with four quantized directions. This labeling is then refrained using probabilistic relaxation labeling. The computation of the Voronoi tessellation and the probabilistic relaxation labeling process, which are highly data-parallel procedures, are discussed. Substantial speedups were obtained over a sequential (Sun-4/280) implementation

Published in:

Pattern Recognition, 1990. Proceedings., 10th International Conference on  (Volume:ii )

Date of Conference:

16-21 Jun 1990