Distrbuted Processing and Efficient Transformations Between an n2 Pixel Binary Image and a Boundary Code on an n3 Processor Reconfigurable Mesh


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 8, pp. 2027-2040, Aug. 1998
10.3745/KIPSTE.1998.5.8.2027,   PDF Download:

Abstract

In this paper, we present efficient reconfigurable mesh algorithms for transforming between a binary image and its corresponding boundary code. These algorithms use n?n?n processors when the size of the binary images is n?n. Recent published results show that these transformations can be done in O(1) time using O(n^4) processors. The number of processors used by these algorithms is very large compared to the number of pixels in the image. Here, we present fast transformation algorithms which use n^3 processors only. The transformation from a boundary code to a binary image takes O(1) time, and the converse transformation takes O(log n) time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. Myung, "Distrbuted Processing and Efficient Transformations Between an n2 Pixel Binary Image and a Boundary Code on an n3 Processor Reconfigurable Mesh," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 8, pp. 2027-2040, 1998. DOI: 10.3745/KIPSTE.1998.5.8.2027.

[ACM Style]
Kim Myung. 1998. Distrbuted Processing and Efficient Transformations Between an n2 Pixel Binary Image and a Boundary Code on an n3 Processor Reconfigurable Mesh. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 8, (1998), 2027-2040. DOI: 10.3745/KIPSTE.1998.5.8.2027.