✦ LIBER ✦

Constant-time thresholding on reconfigurable mesh

✍ Scribed by Kuo-Liang Chung

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 388 KB
Volume: 5
Category: Article
ISSN: 1077-2014
DOI: 10.1016/s1077-2014(99)80006-0

No coin nor oath required. For personal study only.

✦ Synopsis

hresholding is a very important labeling operation on a gray-scale image. It refers to setting all the gray levels below a certain level to binary value 0; above that certain level to binary value 1. Given the histogram of one N X N image, this paper presents a constant-time thresholding on a reconfigurable mesh (RM). Suppose h < N, where h is the number of observed gray levels in the image; then the thresholding can be performed in O(1) time on an N x N RM, and it meets the real-time demand.

📜 SIMILAR VOLUMES

Applications of reconfigurable meshes to

Applications of reconfigurable meshes to constant-time computations

✍ Stephan Olariu; James L Schwing; Jingyuan Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Constant-Time Algorithm for the Euclidea

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

✍ Amitava Datta; Subbiah Soundaralakshmi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. In this paper, we p

A constant time algorithm for theorem pr

A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes

✍ B. Pradeep; C. Siva Ram Murthy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Time-Efficient Maze Routing Algorithms o

Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures

✍ F Ercal; H.C Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 396 KB

The routing problem is one of the most widely studied problems in VLSI design. Maze-routing algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on C. Y. Lee's algorithm (1961, IRE Trans. Electron. Comput. (Sept.), 34

Visibility Computation on Reconfigurable

Visibility Computation on Reconfigurable Meshes

✍ Kikuo Fujimura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 435 KB

In this paper, we first report an O(1) time algorithm to Visibility problems are investigated using reconfigurable solve the visibility problem in the plane containing a total meshes. A number of algorithms are proposed on the architecof n disjoint edges using an n ϫ n R-mesh. Thus, the ture for vis

Constant Time Graph Algorithms on the Re

Constant Time Graph Algorithms on the Reconfigurable Multiple Bus Machine

✍ Jerry L. Trahan; Ramachandran Vaidyanathan; Chittur P. Subbaraman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 413 KB

The reconfigurable multiple bus machine (RMBM) is a model of parallel computation based on reconfigurable buses. Unlike other reconfigurable bus-based models such as the reconfigurable mesh (R-Mesh), the RMBM separates the functions of processors and switches. In this paper, we present constant time