الفهرس 
Chapter 1 ” IntroductionOnly 14 pages are availabe for public view
 |  | from | 203 |  |  |
| | | from | 203 | | |
Abstract
The present study addresses the issus of parallelizing algorithms used in image data compression there arae many methods for image date compression but the vector quantization (VQ) methods is the aim of the present study.the standard vector quantization (STDVQ) and tree-structyre vectorquanization. (TSVQ) are selected from the vector quantization techniqes to convert their sequential algorithms to parallel algorithms. This thesis presents parallel algorithms for STOVQ and T5 VQ that us aptill loop teehmque of UeI processg. The UeI algorilhms fO ’caeh STDVQ and TSVQ arc inlplCllIcntcd on a uniprocessor machine, The pcrfonnancc analysis of the paralldi ed vcr ions with differenl Ilumbers of processes w: iS don’ USl1lg pcrlm ntal C mpnt3tions, well as parallel pcrfOtln3nCC modds of analysis Result how that the parallel iQ algoril1nns gave 1I1 1al speedups over the s’ qucntial algoritluns 10, I 8 il the code book generation and 5, ill Ihe t: ncodeJd code process at IS rocesses WIth n loss of infollnatlon, 1 he speedup increases with increaSIng tl number of proc SSC IP to a certain , then de reasing due 10 Ihe verh ll1d yndlronI7 llion, Such perfonnancc i better.