Classification and Compression of Multi-Resolution Vectors: A Tree Structured Vector Quantizer Approach

dc.contributor.advisorBaras, Professor John S.en_US
dc.contributor.authorVarma, Sudhiren_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:12:24Z
dc.date.available2007-05-23T10:12:24Z
dc.date.issued2002en_US
dc.description.abstractTree structured classifiers and quantizers have been used withgood success for problems ranging from successive refinement coding of speechand images to classification of texture, faces and radar returns. Althoughthese methods have worked well in practice there are few results on thetheoretical side.<p> We present several existing algorithms for tree structured clustering using multi-resolution data and develop some results on their convergenceand asymptotic performance.<p> We show that greedy growing algorithms will result in asymptoticdistortion going to zero for the case of quantizers and prove terminationin finite time for constraints on the rate. We derive an online algorithmfor the minimization of distortion. We also show that a multiscale LVQalgorithm for the design of a tree structured classifier converges to anequilibrium point of a related ordinary differential equation.<p>Simulation results and description of several applications are used toillustrate the advantages of this approach.en_US
dc.format.extent664630 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6289
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; PhD 2002-6en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleClassification and Compression of Multi-Resolution Vectors: A Tree Structured Vector Quantizer Approachen_US
dc.typeDissertationen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
PhD_2002-6.pdf
Size:
649.05 KB
Format:
Adobe Portable Document Format