n3 프로세서 재구성가능 메쉬에서 n2 화소 이진영상과 경계코드간의 효율적인 변환 = Efficient Transformations Between an n2 Pixel Binary Image and a Boundary Code on an n3 Processor Reconfigurable Mesh

다국어 초록 (Multilingual 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.