• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种使用小波包和金字塔格矢量量化的新型指纹图像压缩技术。

A novel fingerprint image compression technique using wavelets packets and pyramid lattice vector quantization.

作者信息

Kasaei Shohreh, Deriche Mohamed, Boashash Boualem

机构信息

Sharif Univ. of Technol., Tehran, Iran.

出版信息

IEEE Trans Image Process. 2002;11(12):1365-78. doi: 10.1109/TIP.2002.802534.

DOI:10.1109/TIP.2002.802534
PMID:18249705
Abstract

A novel compression algorithm for fingerprint images is introduced. Using wavelet packets and lattice vector quantization , a new vector quantization scheme based on an accurate model for the distribution of the wavelet coefficients is presented. The model is based on the generalized Gaussian distribution. We also discuss a new method for determining the largest radius of the lattice used and its scaling factor , for both uniform and piecewise-uniform pyramidal lattices. The proposed algorithms aim at achieving the best rate-distortion function by adapting to the characteristics of the subimages. In the proposed optimization algorithm, no assumptions about the lattice parameters are made, and no training and multi-quantizing are required. We also show that the wedge region problem encountered with sharply distributed random sources is resolved in the proposed algorithm. The proposed algorithms adapt to variability in input images and to specified bit rates. Compared to other available image compression algorithms, the proposed algorithms result in higher quality reconstructed images for identical bit rates.

摘要

介绍了一种用于指纹图像的新型压缩算法。利用小波包和格矢量量化,提出了一种基于小波系数分布精确模型的新型矢量量化方案。该模型基于广义高斯分布。我们还讨论了一种确定均匀和分段均匀金字塔格所用格的最大半径及其缩放因子的新方法。所提出的算法旨在通过适应子图像的特征来实现最佳的率失真函数。在所提出的优化算法中,不对格参数做任何假设,也不需要训练和多量化。我们还表明,在所提出的算法中解决了与急剧分布的随机源相关的楔形区域问题。所提出的算法适应输入图像的变化和指定的比特率。与其他可用的图像压缩算法相比,所提出的算法在相同比特率下能得到更高质量的重建图像。

相似文献

1
A novel fingerprint image compression technique using wavelets packets and pyramid lattice vector quantization.一种使用小波包和金字塔格矢量量化的新型指纹图像压缩技术。
IEEE Trans Image Process. 2002;11(12):1365-78. doi: 10.1109/TIP.2002.802534.
2
Entropy-coded lattice vector quantization dedicated to the block mixture densities.专门用于块混合密度的熵编码格矢量量化。
IEEE Trans Image Process. 2008 Sep;17(9):1574-86. doi: 10.1109/TIP.2008.2001044.
3
Image compression based on fuzzy algorithms for learning vector quantization and wavelet image decomposition.基于模糊算法的学习矢量量化与小波图像分解的图像压缩
IEEE Trans Image Process. 1998;7(8):1223-30. doi: 10.1109/83.704313.
4
Error-resilient pyramid vector quantization for image compression.用于图像压缩的抗误金字塔向量量化
IEEE Trans Image Process. 1998;7(10):1373-86. doi: 10.1109/83.718479.
5
Pyramidal lattice vector quantization for multiscale image coding.用于多尺度图像编码的金字塔晶格矢量量化。
IEEE Trans Image Process. 1994;3(4):367-81. doi: 10.1109/83.298393.
6
Image compression using wavelet transform and multiresolution decomposition.基于小波变换和多分辨率分解的图像压缩。
IEEE Trans Image Process. 1996;5(1):4-15. doi: 10.1109/83.481666.
7
A progressive transmission image coder using linear phase uniform filterbanks as block transforms.一种使用线性相位均匀滤波器组作为块变换的渐进传输图像编码器。
IEEE Trans Image Process. 1999;8(11):1493-507. doi: 10.1109/83.799878.
8
Joint optimization of run-length coding, Huffman coding, and quantization table with complete baseline JPEG decoder compatibility.运行长度编码、哈夫曼编码和量化表的联合优化,与完整基线JPEG解码器完全兼容。
IEEE Trans Image Process. 2009 Jan;18(1):63-74. doi: 10.1109/TIP.2008.2007609.
9
Optimal bit allocation and best-basis selection for wavelet packets and TSVQ.小波包与树形矢量量化的最优比特分配及最佳基选择
IEEE Trans Image Process. 1999;8(9):1305-9. doi: 10.1109/83.784444.
10
[An algorithm of a wavelet-based medical image quantization].
Sheng Wu Yi Xue Gong Cheng Xue Za Zhi. 2002 Dec;19(4):657-9, 675.