{"title":"具有优化状态码本的无脱轨有限状态矢量量化器","authors":"X. Ginesta, Seung P. Kim","doi":"10.1109/DCC.1995.515505","DOIUrl":null,"url":null,"abstract":"A new approach to the design of a finite-state vector quantizer (FSVQ) is proposed. FSVQ essentially exploits correlations between adjacent blocks for efficient coding. Previous FSVQ design schemes had ad-hoc features in defining states and resource allocation using equal number of bits for state codebooks regardless of their probabilities of occurrence in a given source. We propose a FSVQ design approach which improves the compression performance by merging states and using variable state-codebook sizes. Another undesirable feature of the FSVQ is a derailment problem which degrades the performance in many practical applications. We propose a structurally constrained state-codebook design approach that eliminates the derailment problem. The performance of the proposed algorithm outperforms previously known FSVQ methods. Further development of the algorithm utilizing mean-removed VQ is described which gives less block artifact even though PSNR is a little bit inferior.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A derailment-free finite-state vector quantizer with optimized state codebooks\",\"authors\":\"X. Ginesta, Seung P. Kim\",\"doi\":\"10.1109/DCC.1995.515505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new approach to the design of a finite-state vector quantizer (FSVQ) is proposed. FSVQ essentially exploits correlations between adjacent blocks for efficient coding. Previous FSVQ design schemes had ad-hoc features in defining states and resource allocation using equal number of bits for state codebooks regardless of their probabilities of occurrence in a given source. We propose a FSVQ design approach which improves the compression performance by merging states and using variable state-codebook sizes. Another undesirable feature of the FSVQ is a derailment problem which degrades the performance in many practical applications. We propose a structurally constrained state-codebook design approach that eliminates the derailment problem. The performance of the proposed algorithm outperforms previously known FSVQ methods. Further development of the algorithm utilizing mean-removed VQ is described which gives less block artifact even though PSNR is a little bit inferior.\",\"PeriodicalId\":107017,\"journal\":{\"name\":\"Proceedings DCC '95 Data Compression Conference\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '95 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1995.515505\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '95 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1995.515505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A derailment-free finite-state vector quantizer with optimized state codebooks
A new approach to the design of a finite-state vector quantizer (FSVQ) is proposed. FSVQ essentially exploits correlations between adjacent blocks for efficient coding. Previous FSVQ design schemes had ad-hoc features in defining states and resource allocation using equal number of bits for state codebooks regardless of their probabilities of occurrence in a given source. We propose a FSVQ design approach which improves the compression performance by merging states and using variable state-codebook sizes. Another undesirable feature of the FSVQ is a derailment problem which degrades the performance in many practical applications. We propose a structurally constrained state-codebook design approach that eliminates the derailment problem. The performance of the proposed algorithm outperforms previously known FSVQ methods. Further development of the algorithm utilizing mean-removed VQ is described which gives less block artifact even though PSNR is a little bit inferior.