彩色图像压缩的组合VQ算法

Q4 Arts and Humanities Czas Kultury Pub Date : 2003-12-14 DOI:10.1109/ICECS.2003.1301986
H. Al-Otum
{"title":"彩色图像压缩的组合VQ算法","authors":"H. Al-Otum","doi":"10.1109/ICECS.2003.1301986","DOIUrl":null,"url":null,"abstract":"In this paper, two VQ algorithms are introduced: (1) VQ with a fast clustering algorithm (VQ-FCA) that can be implemented for codebook production, and (2) VQ with a partially reordered codebook (VQ-PRCB), that extracts the correlation between adjacent VQ indices. Based on these algorithms, two schemes are proposed: (1) 2D VQ, and (2) combined 3D VQ schemes. Experimental results are compared with other algorithms to show its advantages.","PeriodicalId":36912,"journal":{"name":"Czas Kultury","volume":"10 1","pages":"100-103 Vol.1"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Color image compression using combined VQ algorithms\",\"authors\":\"H. Al-Otum\",\"doi\":\"10.1109/ICECS.2003.1301986\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, two VQ algorithms are introduced: (1) VQ with a fast clustering algorithm (VQ-FCA) that can be implemented for codebook production, and (2) VQ with a partially reordered codebook (VQ-PRCB), that extracts the correlation between adjacent VQ indices. Based on these algorithms, two schemes are proposed: (1) 2D VQ, and (2) combined 3D VQ schemes. Experimental results are compared with other algorithms to show its advantages.\",\"PeriodicalId\":36912,\"journal\":{\"name\":\"Czas Kultury\",\"volume\":\"10 1\",\"pages\":\"100-103 Vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Czas Kultury\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECS.2003.1301986\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Czas Kultury","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECS.2003.1301986","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Arts and Humanities","Score":null,"Total":0}
引用次数: 2

摘要

本文介绍了两种VQ算法:(1)基于快速聚类算法(VQ- fca)的VQ算法,该算法可实现码本的生成;(2)基于部分重排序码本的VQ算法(VQ- prcb),该算法可提取相邻VQ指标之间的相关性。基于这些算法,提出了两种方案:(1)二维VQ方案和(2)三维VQ组合方案。实验结果与其他算法进行了比较,证明了该算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Color image compression using combined VQ algorithms
In this paper, two VQ algorithms are introduced: (1) VQ with a fast clustering algorithm (VQ-FCA) that can be implemented for codebook production, and (2) VQ with a partially reordered codebook (VQ-PRCB), that extracts the correlation between adjacent VQ indices. Based on these algorithms, two schemes are proposed: (1) 2D VQ, and (2) combined 3D VQ schemes. Experimental results are compared with other algorithms to show its advantages.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Czas Kultury
Czas Kultury Social Sciences-Social Sciences (miscellaneous)
CiteScore
0.10
自引率
0.00%
发文量
10
期刊最新文献
Aktywizm dający przyjemność: działanie na zasadzie wspólnej zgody, lokalne zakorzenienie i oddolne polityki integracyjne Ekopareneza. Rozpoznania wstępne Paradoks Kasztanki. Fantazmatyczne eksponaty w domach-muzeach Luzowanie ontologii. O wytwarzaniu więcej-niż-ludzkich lokalności na Górnym Śląsku Przez negantropologię do obywatelskiej rewolucji w lokalnościach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1