Entropy thresholding and its parallel algorithm on the reconfigurable array of processors with wider bus networks

IEEE Transactions on Image Processing

Volumn 8, Issue 9, 1999, Pages 1229-1242

  Lee, Shung Shing ^a   Horng, Shi Jinn ^b   Tsai, Horng Ren ^c  

^a Department of Electric Engineering   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^c Department of Information Management   (Taiwan)

Author keywords

Hilbert's space filling curve; Image segmentation; Local entropy; Parallel algorithm; Quadtree; Reconfigurable array of processors with wider bus networks; Relative entropy; Thresholding

Indexed keywords

EID: 0001414262     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/83.784435     Document Type: Article

References (31)

1. A. Beghdadi, A. L. Négrate, and P. V. Lesegno, "Entropic thresholding using a block source model," Comput. Models Image Process., vol. 57, pp. 197-205, May 1995.
2. A. R. Butz, "Convergence with Hilbert's space filling curve," J. Comput. Syst. Sci., vol. 3, pp. 128-146, 1969.
3. A. R. Butz, "Alternative algorithm for Hilbert's space-filling curve," IEEE Trans. Comput., vol. C-20, pp. 424-426, Apr. 1971.
4. C. I. Chang, K. Chen, J. Wang, and M. L. G. Althouse, "A Relative entropy-based approach to image thresholding," Pattern Recognit., vol. 120, pp. 215-227, 1993.
5. T. W. Kao and S. J. Horng, "Efficient algorithms for computing two nearest neighbor problems on a RAP," Pattern Recognit., vol. 27, pp. 1707-1716, Dec. 1994.
6. T. W. Kao and S. J. Horng, "Computing list ranking on a RAP with wider bus networks," in Proc. 1994 Int. Conf. Parallel and Distributed Systems, Dec. 1994, pp. 28-33.
7. T. W. Kao, S. J. Horng, and H. R. Tsai, "Computing connected components and some related applications on a RAP," in Proc. Int. Conf. Parallel Processing, 1993, vol. 3, pp. 57-64.
8. T. W. Kao, S. J. Horng, and Y. L. Wang, "An O(1) time algorithms for computing histogram and hough transform on a cross bridge reconfigurable array of processors," IEEE Trans. Syst., Man, Cybern., vol. 25, pp. 681-687, Apr. 1995.
9. T. W. Kao, S. J. Horng, Y. L. Wang, and K. L. Chung, "A constant time algorithm for computing Hough transform," Pattern Recognit., vol. 26, pp. 277-286, Feb. 1993.
10. T. W. Kao, S. J. Horng, Y. L. Wang, and H. R. Tsai, "Designing efficient parallel algorithms on CRAP," IEEE Trans. Parallel Distrib. Syst., vol. 6, pp. 554-560, May 1995.
11. J. N. Kapur, P. K. Sahoo, and A. K. C. Wong, "A new method for gray level picture thresholding using the entropy of the histogram," Comput. Graph., Vis., Image Process., vol. 29, pp. 273-285, 1985.
12. S. Kullback, Information Theory and Statistics. New York: Dover, 1968.
13. S. S. Lee, S. J. Horng, T. W. Kao, and H. R. Tsai, "Optimal computing Hough transform on a reconfigurable array of processors with wider bus network," Pattern Recognit., vol. 29, pp. 603-613, 1996.
14. S. S. Lee, S. J. Horng, and H. R. Tsai, "Building a quadtree and its applications on a reconfigurable mesh," Pattern Recognit., vol. 29, pp. 1571-1579, 1996.
15. H. Li and M. Maresca, "Polymorphic-torus architecture for computer vision," IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 233-243, Mar. 1989.
16. M. Maresca, "Polymorphic processor arrays," IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 490-506, 1993.
17. M. Maresca and H. Li, "Connection autonomy in SIMD computers: A VLSI implementation," J. Parallel Distrib. Comput., vol. 7, pp. 302-320, 1989.
18. R. Miller, V. K. P. Kumar, D. Reisis, and Q. F. Stout, "Meshes with reconfigurable buses," in Proc. MIT Conf. Advanced Research in VLSI, Mar. 1988, pp. 163-178.
19. _ "Data movement operations and applications on reconfigurable VLSI arrays," in Proc. Int. Conf. Parallel Processing, Aug. 1988, vol. 1, pp. 205-208.
20. D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers," IEEE Trans. Comput., vol. C-30, pp. 101-107, Feb. 1981.
21. S. Olariu, J. L. Schwing, and J. Zhang, "Fast computer vision algorithms for reconfigurable mesh," Image Vis. Comput., vol. 10, pp. 610-616, Nov. 1992.
22. N. R. Pal and S. K. Pal, "Entropy thresholding," Signal Process., vol. 16, pp. 97-108, 1989.
23. _, "Entropy: A new definition and its application," IEEE Trans. Syst., Man, Cybern., vol. 21, pp. 1260-1270, 1991.
24. T. Pun, "A new method for gray-level picture thresholding using the entropy of the histogram," Signal Process., vol. 2, pp. 223-237, 1980.
25. _, "Entropic thresholding: A new approach," Comput. Graph. Image Process., vol. 16, pp. 210-239, 1981.
26. J. Rothstein, "Bus automata, brains, and mental models," IEEE Trans. Syst., Man, Cybern., vol. 18, pp. 522-531, Apr. 1988.
27. A Schuster, "Dynamic reconfiguring networks for parallel computers: Algorithms and complexity bounds," Ph.D. dissertation, Dept. Comput. Sci., Hebrew Univ., Israel, 1991.
28. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, July 1948.
29. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, IL: Univ. of Illinois Press, 1949.
30. B. F. Wang, G. H. Chen, and F. C. Lin, "Constant time sorting on a processor array with a reconfigurable bus system," Inform. Process. Lett., vol. 34, pp. 187-192, Apr. 1990.
31. B. F. Wang, G. H. Chen, and H. Li, "Configurational computation: A new computation method on processor arrays with reconfigurable bus system," in Proc. Int. Conf. Parallel Processing, Aug. 1991, pp. III-42-III-49.