This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Image Seaming for Segmentation on Parallel Architecture
June 1990 (vol. 12 no. 6)
pp. 588-594

Some basic problems encountered when assembling the results of image analysis on architectures with coarse parallelism are discussed. The emphasis is on strategies that minimize the distortion in the final result caused by processing image tiles independently. Methods are presented that can be used to reduce the disparity between the results of processing each title independently and processing each as part of a whole image. A seaming algorithm has been constructed to seam the tiles with the results of region segmentation using the gray-level mean difference or maximum-minimum criteria. Experimental results, obtained on a Sequent machine and a Sun 3/160 workstation, are given to illustrate the performance of the algorithm.

[1] J. D. Browning and S. L. Tanimoto, "Segmentation of pictures into regions with a tile-by-tile method,"Pattern Recogn., vol. 14, no. 1, pp. 1-10, 1982.
[2] A. Rosenfeld and A. Y. Wu, "Parallel computer for region-level image processing,"Pattern Recogn., vol. 15, no. 1, pp. 41-50, 1982.
[3] J. Serra,Image Analysis and Mathematical Morphology, London: Academic, 1982.
[4] T. Pavlidis, "An asynchronous thinning algorithm,"Comput. Graphics, Image Processing, vol. 20, pp. 133-157, 1982.
[5] S. L. Horowitz and T. Pavlidis, "Picture segmentation by a Tree Traversal Algorithm,"J. Assoc. Comput. Machinery, vol. 23, pp. 368-388, 1976.
[6] T. Pavlidis,Structural Pattern Recognition. New York: Springer-Verlag, 1977.
[7] R. M. Haralick, "Survey: Image segmentation techniques,"Comput. Vision, Graphics, Image Processing, vol. 29, no. 1, 1985.
[8] P. C. Chen and T. Pavlidis, "Segmentation by texture using a co-occurrence matrix and a split-and-merge algorithm,"Comput. Graphics, Image Processing, vol. 10, pp. 172-182, 1979.
[9] M. F. Doherty, M. T. Noga, and C. M. Bjorklund, "Use of compound predicates in split-and-merge segmentation," inProc. CVPR 85, San Francisco, CA, pp. 659-661.
[10] R. H. Laprade and M. F. Doherty, "Split-and-merge segmentation using an F test criterion,"Proc. SPIE--Int. Soc. Opt. Eng., vol. 758, pp. 74-79, 1987.
[11] P. Bouthemy and J. S. Rivero, "A hierarchical likelihood approach for region segmentation according to motion-based criteria," inProc. 1st Int. Conf. Computer Vision, 1987, pp. 463-467.
[12] R. Gershon, A. D. Jepson, and J. K. Tsotsos, "Highlight identification using chromatic information," inProc. 1st Int. Conf. Computer Vision, 1987, pp. 161-170.

Index Terms:
computerised picture processing; segmentation; parallel architecture; image analysis; image tiles; seaming algorithm; gray-level mean difference; maximum-minimum criteria; Sequent machine; Sun 3/160 workstation; computerised picture processing; minimax techniques; parallel architectures
Citation:
M.H. Chen, T. Pavlidis, "Image Seaming for Segmentation on Parallel Architecture," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 6, pp. 588-594, June 1990, doi:10.1109/34.56195
Usage of this product signifies your acceptance of the Terms of Use.