Abstract
Given a multi-leveled image of size n × n, stored in a reconfigurable mesh computer of the same size one point per processing element (PE). In this paper, we propose a parallel algorithm for structural characterization of all the components of the image. The algorithm is based on the representation of component contour by straight line segments to reduce the volume of data processing. The resulted contours are simultaneously processed using the contour running approach. The pertinent data obtained after the component characterization are used in the filtering application and to develop an algorithm for the convex hull search for all the image components. Our algorithm is assigned to be implemented on a reconfigurable mesh computer and is of θ(1) time complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Oliensis, J.: Local reproducible smoothing without shrinkage, IEEE Trans. Pattern Anal. Mach. Intell. 15(3) (March 1993), 307–312.
Fisher, M. A. and Wolf, H. C.: Locating perceptually salient points on planar curves, IEEE Trans. Pattern Anal. Mach. Intell. 16(2) (February 1994), 113–129.
Pikaz, A. and Its'hak Dinstein: Using simple decomposition for smoothing and feature point detection of noisy digital curves, IEEE Trans. Pattern Anal. Mach. Intell. 16(8) (August 1994), 808–813.
Bouattane, O., Elmesbahi, J., and Rami, A.: A fast parallel algorithm for convex hull problem of multi-leveled images, J. Intell. Robot. Syst. 33 (2002), 285–299.
Elmesbahi, J., Chaibi, M., Bouattane O., and Benabbou, Z.: θ(1) time algorithm for hierarchical image analysis, image restoration and digital picture characterization on a reconfigurable mesh computer, in: Proc. of ICSPAT. Boston, November 1992, 472–478.
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 the IEEE Int. Conf. on SMC. San Antonio Texas, October 1994, 1898–1902.
Elmesbahi, J.: θ(1) Time algorithm for image component labeling in a mesh connected computer, IEEE Trans. SMC 21(2) (1991), 427–433.
Dorst, L. and Smeulders, A. W. M.: Discrete representation of straight line, IEEE Trans. on PAMI 6 (1984), 450–463.
Kim, C. E.: On cellular straight line segments, Comput. Graph. Image Process. 18 (1982), 369–381.
Rosenfeld, A.: Digital straight line segments, IEEE Trans. Comput. 23 (1974), 1264–1269.
Chang, H. and Yan, H.: Analysis of stroke structures of handwritten chinese characters, IEEE Trans. SMC. Part B 29(1) (1999), 47–61.
Khoo, K. G. and Suganthan, P. N.: Structural pattern recognition using genetic algorithms with specialised operators, IEEE Trans. SMC. Part B 33(1) (2003), 156–165.
Siddiqi, K. and Kimia, B. B.: Parts of visual form: computational aspects, IEEE Trans. on PAMI. 17(3) (1995), 239–251.
Ling Tong C. et al.: Efficient parallel processing of image contours, IEEE Trans. PAMI 15(1) (1993), 69–81.
Li, H. and Maresca, M.: Polymorphic Torus Network, IEEE Trans. Comput. 38(9) (1989), 1345–1351.
Li, H. and Maresca, M.: Polymorphic Torus architecture for computer vision, IEEE Trans. PAMI 11(3) (1989), 232–242.
Hayachi, T. et al.: An (O(log log n)2)time algorithm to compute the convex hull of sorted point on a reconfigurable meshes, IEEE Trans. Parallel Distrib. Syst. 9(12) (1998), 1167–1179.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Errami, A., Khaldoun, M., Elmesbahi, J. et al. θ(1) Time Algorithm for Structural Characterization of Multi-Leveled Images and its Applications on a Reconfigurable Mesh Computer. J Intell Robot Syst 44, 277–290 (2005). https://doi.org/10.1007/s10846-005-9017-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-005-9017-1