This Article 
 Bibliographic References 
 Add to: 
Performance of a Finite-State Machine Implementation of Iterative Cluster Labeling on Desktop and Mobile Computing Platforms
November 2009 (vol. 21 no. 11)
pp. 1604-1616
Matthew L. Aldridge, BeliefNetworks, Inc., Charleston
Michael W. Berry, University of Tennessee, Knoxville
In this paper, we present an efficient finite-state machine implementation of the Hoshen-Kopelman cluster identification algorithm using the nearest-eight neighborhood rule suitable to applications such as computer modeling for landscape ecology. The implementation presented in this study was tested using both actual land cover maps, as well as randomly generated data similar to those in the original presentation of the Hoshen-Kopelman algorithm for percolation analysis. The finite-state machine implementation clearly outperformed a straightforward adaptation of the original Hoshen-Kopelman algorithm on either data type. Research was also conducted to explore the finite-state machine's performance on a Palm mobile computing device, and while it was competitive, it did not exceed the performance of the straightforward Hoshen-Kopelman implementation. However, a discussion of why this was the case is provided along with a possible remedy for future hardware designs.

[1] R. Tarjan, “Depth-First Search and Linear Graph Algorithms,” SIAM J. Computing, vol. 1, no. 2, pp. 146-160, 1972.
[2] P. Leath, “Cluster Size and Boundary Distribution Near Percolation Threshold,” Physical Rev. B, vol. 14, pp. 5046-5055, 1976.
[3] J. Martín-Herrero, “Hybrid Cluster Identification,” J. Physics A: Math. and General, vol. 37, pp. 9377-9386, 2004.
[4] J. Martin-Herrero, “Hybrid Object Labelling in Digital Images,” Machine Vision and Applications, vol. 18, pp. 1-15, Feb. 2007.
[5] A. Rosenfeld and J. Pfalz, “Sequential Operations in Digtial Picture Processing,” J. ACM, vol. 13, pp. 471-494, 1966.
[6] J. Hoshen and R. Kopelman, “Percolation and Cluster Distribution: I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm,” Physical Rev. B.1, vol. 14, pp. 3438-3445, Oct. 1976.
[7] R. Tarjan, “Efficiency of a Good But Not Linear Set Union Algorithm,” J. ACM, vol. 22, no. 1, pp. 215-225, 1975.
[8] N. Moloney and G. Pruessner, “Asynchronously Parallelized Percolation on Distributed Machines,” Physical Rev. E, vol. 67, p.037701, 2003.
[9] M. Berry, E. Comiskey, and K. Minser, “Parallel Analysis of Clusters in Landscape Ecology,” IEEE Computational Science and Eng., vol. 1, no. 2, pp. 24-38, June 1994.
[10] J. Constantin, M. Berry, and B.V. Zanden, “Parallelization of the Hoshen-Kopelman Algorithm Using a Finite State Machine,” The Int'l J. Supercomputing Applications and High Performance Computing, vol. 11, no. 1, pp. 34-48, 1997.
[11] A. Leitão, J. Miller, J. Ahern, and K. McGarigal, Measuring Landscapes: A Planner's Handbook. Washington Island Press, 2006.
[12] D. Stauffer and A. Aharony, Introduction to Percolation Theory, second ed., London Taylor and Francis, 1992.
[13] W. Hargrove, F. Hoffman, and R. Efroymson, “A Practical Map Analysis Tool for Detecting Potential Dispersal Corridors,” Landscape Ecology, vol. 20, no. 4, pp. 361-373, 2005.
[14] V. Dale, M. Aldridge, T. Arthur, L. Baskaran, M. Berry, M. Chang, R. Efroymson, C. Garten, C. Stewart, and R. Washington-Allen, “Bioregional Planning in Central Georgia,” Futures, vol. 38, pp.471-489, 2006.
[15] M.L. Aldridge, “Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm,” PhD dissertation, Univ. of Tennessee, May 2008.
[16] M. Withers and V. Meentemeyer, “Concepts of Scale in Landscape Ecology,” Landscape Ecological Analysis: Issues and Applications, J.Klopatek and R. Gardner, eds., pp. 205-252, Springer-Verlag, 1999.
[17] T. Cormen and C. Leiserson, Introduction to Algorithms, second ed., MIT Press, 2001.
[18] M. Dillencourt, H. Samet, and M. Tamminen, “A General Approach to Connected-Component Labeling for Arbitrary Image Representations,” J. Assoc. for Computing Machinery, vol. 39, no. 2, pp. 253-280, 1992.
[19] M.L. Aldridge, “A Parallel Finite State Machine Implementation of a Nearest-Eight Hoshen-Kopelman Adaptation for Landscape Analysis,” Proc. 45th Ann. Southeast Regional Conf., pp. 391-394, 2007.
[20] H. Carroll, J. Flanagan, and S. Baniya, “A Trace-Driven Simulator for Palm OS Devices,” Proc. IEEE Int'l Symp. Performance Analysis of Systems and Software, pp. 157-166, 2005.

Index Terms:
Cluster identification, finite-state machine, Hoshen-Kopelman, landscape ecology, Palm device.
Matthew L. Aldridge, Michael W. Berry, "Performance of a Finite-State Machine Implementation of Iterative Cluster Labeling on Desktop and Mobile Computing Platforms," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 11, pp. 1604-1616, Nov. 2009, doi:10.1109/TKDE.2009.19
Usage of this product signifies your acceptance of the Terms of Use.