渐进图像传输:一种自适应四叉树修剪方法

C. Bajaj, Guozhong Zhuang
{"title":"渐进图像传输:一种自适应四叉树修剪方法","authors":"C. Bajaj, Guozhong Zhuang","doi":"10.1109/DCC.1997.582075","DOIUrl":null,"url":null,"abstract":"Summary form only given. Progressive, adaptive and hierarchical modes are desirable image coding features. This paper presents a quadtree-pruning pyramid coding scheme satisfying all these objectives. Pyramid coding is an approach suitable for progressive image transmission, where the original image is divided into different levels that correspond to successive approximants of the original one. Starting from the original image, a sequence of reduced-size images is formed by averaging intensity values over 2/spl times/2-pixel blocks. This sequence, called the mean pyramid, ends with an image with only one pixel. Then another sequence of images, called the difference pyramid which can be further encoded via vector quantization, is formed by taking the difference of two consecutive images in the mean pyramid. Our quadtree-pruning approach uses only the mean pyramid. Experiments show that the quadtree-pruning pyramid method is quite efficient for lossy compression. Our approach can also be used for lossless compression by simply setting the threshold function to be zero.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Progressive image transmission: an adaptive quadtree-pruning approach\",\"authors\":\"C. Bajaj, Guozhong Zhuang\",\"doi\":\"10.1109/DCC.1997.582075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. Progressive, adaptive and hierarchical modes are desirable image coding features. This paper presents a quadtree-pruning pyramid coding scheme satisfying all these objectives. Pyramid coding is an approach suitable for progressive image transmission, where the original image is divided into different levels that correspond to successive approximants of the original one. Starting from the original image, a sequence of reduced-size images is formed by averaging intensity values over 2/spl times/2-pixel blocks. This sequence, called the mean pyramid, ends with an image with only one pixel. Then another sequence of images, called the difference pyramid which can be further encoded via vector quantization, is formed by taking the difference of two consecutive images in the mean pyramid. Our quadtree-pruning approach uses only the mean pyramid. Experiments show that the quadtree-pruning pyramid method is quite efficient for lossy compression. Our approach can also be used for lossless compression by simply setting the threshold function to be zero.\",\"PeriodicalId\":403990,\"journal\":{\"name\":\"Proceedings DCC '97. Data Compression Conference\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '97. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1997.582075\",\"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 '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

只提供摘要形式。渐进、自适应和分层模式是理想的图像编码特征。本文提出了一种满足上述要求的四叉树剪枝金字塔编码方案。金字塔编码是一种适用于渐进图像传输的方法,它将原始图像分成不同的层次,对应于原始图像的连续近似值。从原始图像开始,通过平均2/spl倍/2像素块上的强度值,形成一系列减小尺寸的图像。这个序列被称为平均金字塔,以只有一个像素的图像结束。然后在平均金字塔中取两幅连续图像的差,形成另一序列图像,称为差金字塔,可以通过矢量量化进一步编码。我们的四叉树修剪方法只使用平均金字塔。实验结果表明,四叉树剪枝金字塔方法对有损压缩是非常有效的。我们的方法也可以用于无损压缩,只需将阈值函数设置为零。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Progressive image transmission: an adaptive quadtree-pruning approach
Summary form only given. Progressive, adaptive and hierarchical modes are desirable image coding features. This paper presents a quadtree-pruning pyramid coding scheme satisfying all these objectives. Pyramid coding is an approach suitable for progressive image transmission, where the original image is divided into different levels that correspond to successive approximants of the original one. Starting from the original image, a sequence of reduced-size images is formed by averaging intensity values over 2/spl times/2-pixel blocks. This sequence, called the mean pyramid, ends with an image with only one pixel. Then another sequence of images, called the difference pyramid which can be further encoded via vector quantization, is formed by taking the difference of two consecutive images in the mean pyramid. Our quadtree-pruning approach uses only the mean pyramid. Experiments show that the quadtree-pruning pyramid method is quite efficient for lossy compression. Our approach can also be used for lossless compression by simply setting the threshold function to be zero.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信