Thumbnail
Access Restriction
Subscribed

Author Wakatani, A.
Sponsorship Brandeis Univ
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2005
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Concurrent computing ♦ Clustering algorithms ♦ Costs ♦ Image coding ♦ Parallel algorithms ♦ Nearest neighbor searches ♦ Velocity measurement ♦ Local area networks ♦ Linux ♦ Degradation
Abstract Summary form only given. We evaluate two parallel algorithms for the codebook generation of the VQ compression: parallel LBG and aggressive PNN. Parallel LBG is based on the LBG algorithm with the K-mean method. The cost of both latter algorithms mainly consists of: a) the computation part; b) the communication part; and c) the update part. Aggressive PNN is a parallelized version of the PNN (pairwise nearest neighbor) algorithm, whose cost mainly consists of: a) the computation part; b) the communication part; and c) the merge part. We measured the speedups and elapsed times of both algorithms on a PC cluster system. When the quality of images compressed by both algorithms is the same, the number of training vectors required by the aggressive PNN is much less than that by the parallel LBG, and the aggressive PNN is superior in terms of the elapsed time.
Description Author affiliation: Fac. of Sci. & Eng., Konan Univ., Kobe, Japan (Wakatani, A.)
ISBN 0769523099
ISSN 10680314
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-03-29
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 68.49 kB


Source: IEEE Xplore Digital Library