Constrained-storage multistage vector quantization based on genetic algorithms

DOI10.1016/J.PATCOG.2007.05.011MaRDI QIDQ2459575zbMATH OpenOpenAlexFDO

Authors Shiueng Bien Yang

Publication date 7 November 2007

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2007.05.011

zbMATH Keywords

genetic algorithmMultistage vector quantizer

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Vector quantization based on genetic simulated annealing
• Vector quantizers with direct sum codebooks
• Constrained-storage vector quantization with a universal codebook
• Design, performance, and complexity analysis of residual trellis-coded vector quantizers
• Predictive multistage vector quantizer design using asymptotic closed-loop optimization

Cites work

• A unified approach to tree-structured and multistage vector quantization for noisy channels
• Constrained-storage vector quantization with a universal codebook
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 467196 (Why is no real title available?)
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Vector quantizers with direct sum codebooks

Cited in

(3)

• On the systematic development of fast fuzzy vector quantization for grayscale image compression
• Fuzzy declustering-based vector quantization
• Vector quantization based on genetic simulated annealing

Describes a project that uses

Uses Software

• DARPA TIMIT

This page was built for publication: Constrained-storage multistage vector quantization based on genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2459575)