✦ LIBER ✦

Efficient Algorithms for Overlapping a Sequence of Images

✍ Scribed by Lung-Chun Chang; Kuo-Liang Chung

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 581 KB
Volume: 7
Category: Article
ISSN: 1077-2014
DOI: 10.1006/rtim.2000.0201

No coin nor oath required. For personal study only.

✦ Synopsis

I

n this paper, we present two novel and efficient algorithms for overlapping a sequence of quadtrees, one for binary images and the other for gray images. They relax the constraint that the common subtrees to be merged have to be at the same position and of the same size. This relaxation causes the proposed algorithm to have higher compression capability. Experiments are carried out to demonstrate the memory-saving and computational advantages of the proposed algorithm. Experimental results reveal that the proposed overlapping representation has 24.89%-54.55% (6.83%-11.71%) compression improvement and 34.92%-49.18% (24.75%-34.50%) execution-time improvement when compared to the previous result. Finally, the application of our result to overlap a sequence of gray images is presented.

📜 SIMILAR VOLUMES

Efficient algorithms for generating inte

Efficient algorithms for generating interpolated (zoomed) MR images

✍ M. R. Smith; S. T. Nichols 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 905 KB

This paper discusses the two-dimensional implementation of a number of modified fast Fourier transform (FFT) algorithms that efficiently interpolate (zoom) magnetic resonance (MR) images. If the original image was sampled at a rate satisfying the Nyquist criterion, these algorithms would effectively

Efficient algorithms for finding maximum

Efficient algorithms for finding maximum cliques of an overlap graph

✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

An efficient algorithm for determining n

An efficient algorithm for determining non-overlapping running averages

✍ T.E. Pierce 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 401 KB

A computationally efficient algorithm fo

A computationally efficient algorithm for enhancing linear features in images

✍ A.G. Bolton; S.F. Brown; W. Moran 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 490 KB

A technique for overlapping computation

A technique for overlapping computation and communication for block recursive algorithms

✍ GUPTA, S. K. S.; HUANG, C.-H.; SADAYAPPAN, P.; JOHNSON, R. W. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

This paper presents a design methodology for developing efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed-memory a

A Fully Conservative Interface Algorithm

A Fully Conservative Interface Algorithm for Overlapped Grids

✍ Z.J. Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 550 KB

A fully conservative zonal interface algorithm has been developed for ovethppert (Chimera) (nitss. In this new approach, overlapped zones are transformed into patched zones. Flux conservation is then enforced on the patch boundary in a local sense, thus guaranteeing global conservation. This algorit