scispace - formally typeset
Search or ask a question
Author

Horng-Ren Tsai

Bio: Horng-Ren Tsai is an academic researcher. The author has an hindex of 1, co-authored 1 publications receiving 11 citations.

Papers
More filters
Proceedings ArticleDOI
17 Dec 2002
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.

11 citations


Cited by
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

Proceedings ArticleDOI
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

Proceedings Article
01 Jan 2004

1 citations