A high speed systolic architecture for labeling connected components in an image
暂无分享,去创建一个
[1] N. Metropolis,et al. Massively parallel processing , 1986 .
[2] Ajit Agrawal,et al. A Parallel O(log N) Algorithm for Finding Connected Components In Planar Images , 1987, ICPP.
[3] M. MANOHAR,et al. Connected component labeling of binary images on a mesh connected massively parallel processor , 1989, Comput. Vis. Graph. Image Process..
[4] Azriel Rosenfeld,et al. Sequential Operations in Digital Picture Processing , 1966, JACM.
[5] Viktor K. Prasanna,et al. Parallel Geometric Algorithms for Digitized Pictures on Mesh of Trees , 1986, ICPP.
[6] N. Ranganathan,et al. A high speed systolic architecture for labeling connected components in an image , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.
[7] Linda G. Shapiro,et al. A new connected components algorithm for virtual memory computers , 1983, Comput. Vis. Graph. Image Process..
[8] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[9] Jorge L. C. Sanz,et al. An EREW PRAM Algorithm for Image Component Labeling , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[10] Sartaj Sahni,et al. Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..
[11] Xue Dong Yang,et al. Design of fast connected components hardware , 2011, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.