Parallel algorithms for the medial axis transform on linear arrays with a reconfigurable pipelined bus system
17 Dec 2002-pp 123-128
TL;DR: An O(log log N) bus cycles parallel algorithm for the medial axis transform of an N/spl times/N binary image on a linear array with a reconfigurable pipelined bus system using N/sup 2/ processors is provided.
Abstract: In this paper based on the advantages of both optical transmission and electronic computation, we first provide an O(log log N) bus cycles parallel algorithm for the medial axis transform of an N/spl times/N binary image on a linear array with a reconfigurable pipelined bus system using N/sup 2/ processors. By increasing the number of processors, the proposed algorithm can be modified to run in O(log log/sub q/ N) and O(1) bus cycles using qN/sup 2/ and N/sup 2+1//spl isin// processors respectively, where 1/spl les/q/spl les//spl radic/N, /spl isin/ is a constant and /spl isin//spl ges/1. These results improve on previously known algorithms developed on various parallel computation models. Key Words: Medial axis transform, image processing, image compression, computer vision, parallel algorithms, linear array with a reconfigurable pipelined bus system.
Citations
More filters
Proceedings Article•
01 Jan 1996
TL;DR: In this paper, a new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), has been proposed as a feasible and efficient parallel computational model based on current optical technologies.
Abstract: A new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), has been proposed as a feasible and efficient parallel computational model based on current optical technologies. In this paper, we further study this model by proposing several basic data movement operations on the model. These operations include broadcast, multicast, compression, split, binary prefix sum, maximum finding. Using these basic operations, several image processing algorithms are also presented for the model. We show that all algorithms can be executed efficiently on the LARPBS model. It is our hope that the LARPBS model can be used as a new and practical parallel computational model for designing parallel algorithms.
119 citations
Journal Article•
TL;DR: This work designs energy-efficient protocols for one-to-one communication on a single channel and k-channel wireless network and can be extended for multiple multicasting as well.
Abstract: A wireless network (WN) is a distributed system where each node is a small hand-held commodity device called a station. Wireless sensor networks have received increasing interest in recent years due to their usage in monitoring and data collection in a wide variety of environments like remote geographic locations, industrial plants, toxic locations or even office buildings. One of the most important issues related to a WN is its energy constraints. A station is usually powered by a battery which cannot be recharged while on a mission. Hence, any protocol run by a WN should be energy-efficient. We design energy-efficient protocols for one-to-one communication on a single channel and k-channel wireless network. Our protocols can be extended for multiple multicasting as well.
8 citations
10 Oct 2005
TL;DR: To the best of the authors' knowledge, this is the first parallel algorithm proposed for solving the 3D/spl I.bar/BB/ Spl I. bar/MAT problem known.
Abstract: Many parallel algorithms have been proposed for computing the two-dimensional block-based medial axis transform (2D/spl I.bar/BB/spl I.bar/MAT). Unfortunately, almost all of them are dedicated for solving 2D/spl I.bar/BB/spl I.bar/MAT problem and are very difficult to be extended for solving the 3D/spl I.bar/BB/spl I.bar/MAT problem. In this paper, an O(1) time algorithm for solving the 2D/spl I.bar/BB/spl I.bar/MAT of a binary image P of size N /spl times/ N on an LARPBS is first developed. The running time of this algorithm has a smaller constant factor compared with those of all the other previous proposed O(1) time algorithms. Then this algorithm is extended for computing the 3D/spl I.bar/BB/spl I.bar/MAT of a binary image V of size N /spl times/ N /spl times/ N in O(1) time on an LARPBS. The running time of this algorithm has a small constant factor also. To the best of our knowledge, this is the first parallel algorithm proposed for solving the 3D/spl I.bar/BB/spl I.bar/MAT problem known.
7 citations
Cites methods from "Parallel algorithms for the medial ..."
...Keywords: Medial axis transform, image processing, parallel algorithm, LARPBS....
[...]
01 Jan 2000
1 citations
References
More filters
Book•
01 Jan 1976
TL;DR: The rapid rate at which the field of digital picture processing has grown in the past five years had necessitated extensive revisions and the introduction of topics not found in the original edition.
Abstract: The rapid rate at which the field of digital picture processing has grown in the past five years had necessitated extensive revisions and the introduction of topics not found in the original edition.
4,231 citations
572 citations
TL;DR: An optical communication structure is proposed for multiprocessor arrays which exploits the high communication bandwidth of optical waveguides and time-division multiplexing of messages has the same effect as message pipelining on opticalWaveguides.
Abstract: An optical communication structure is proposed for multiprocessor arrays which exploits the high communication bandwidth of optical waveguides. The structure takes advantage of two properties of optical signal transmissions on waveguides, namely, unidirectional propagation and predictable propagation delays per unit length. Because of these two properties, time-division multiplexing (TDM) of messages has the same effect as message pipelining on optical waveguides. Two TDM approaches are proposed, and the combination of the two is used in the design of the optical communication structure. Analysis and simulation results are given to demonstrate the communication effectiveness of the system. A clock distribution method is proposed to address potential synchronization problems. Feasibility issues with current and future technologies are discussed. >
151 citations
"Parallel algorithms for the medial ..." refers methods in this paper
...To route messages on an optical bus system, the coincident pulse addressing technique [13, 18] (i....
[...]
141 citations
"Parallel algorithms for the medial ..." refers methods in this paper
...D reconfigurable mesh using N2 and qN processors based on the idea proposed by Kucera [11], where 2 q N ....
[...]
...[15] gave two O(1) and O(logq N) time parallel algorithms on a 2-D reconfigurable mesh using N(2) and qN processors based on the idea proposed by Kucera [11], where 2 q N ....
[...]
Proceedings Article•
01 Jan 1996
TL;DR: In this paper, a new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), has been proposed as a feasible and efficient parallel computational model based on current optical technologies.
Abstract: A new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), has been proposed as a feasible and efficient parallel computational model based on current optical technologies. In this paper, we further study this model by proposing several basic data movement operations on the model. These operations include broadcast, multicast, compression, split, binary prefix sum, maximum finding. Using these basic operations, several image processing algorithms are also presented for the model. We show that all algorithms can be executed efficiently on the LARPBS model. It is our hope that the LARPBS model can be used as a new and practical parallel computational model for designing parallel algorithms.
119 citations