基于小波变换和矢量量化的人脸图像压缩

提出一种新的在小波域内进行矢量量化的算法.该算法在对图像进行多级小波变换后,构造三个方向的跨频带矢量,同时采用分类矢量量化,非线性插补矢量量化和基于人眼视觉特性的加权矢量量化,提高了图像的编码效率和重构质量.仿真结果表明,该算法实现简单,在较低的编码率下,可达到较好的压缩效果.     

基于小波变换和人眼视觉系统特性的图像降噪方法

利用小波变换与人眼视觉系统（human visual system,HVS）的多通道特性相匹配的特点,提出一种基于人类视觉系统的图像降噪方法.该方法在P-M模型中引入小波变换与视觉敏感函数,并且结合视觉敏感函数的带通特性,提出一种新的扩散函数.实验结果表明,该方法得到的图像不论在客观评价（峰值信噪比）方面还是主观测评方面,都能达到较好的效果.     

正交小波包及其在数字信号压缩中的应用

正交小波包是正交多分辨分析构造正交小波思想的自然延伸,正交小波包变换可以进一步分割小波空间,解决小波变换“高频低分辨”的问题,为数字信号处理提供获得高频高分辨效果的分析工具。最后,将小波包分析用于数字信号压缩问题的研究,获得了很好的变换压缩效果     

一种分形图像编码的改进方法

在分析小波包变换和分形编码特点的基础上,先将图像进行小波包分解,对进一步细分的高频部分直接进行频域截断,对低频部分进行分形压缩.计算机模拟试验表明,上述方案与基本分形编码方法相比,在重建图像主观质量和运行时间上都显示出优越性.     

基于广义交叉认证的多小波阈值的图像降噪

提出一种新的小波收缩阈值降噪方法,该方法是通过对噪声图像进行多小波变换,然后用广义交叉认证的方法来确定小波阈值参数．由于本文采用的是多小波变换,而多小波一般同时具有正交性和线性相位,另外广义交叉认证方法不需要对噪声的强度进行估计,所以这种方法有比较好的降噪效果．实验结果表明该方法与基于小波变换的广义交叉认证的图像降噪方法相比较,其降噪效果有一定的提高;同时也表明在一定的条件下,其降噪效果要明显好于传统的Wiener滤波方法．     

多小波图像插值算法研究

与单小波变换一样,多小波变换同样具有多分辨分析的特性,1次多小波变换可以将图像分解成4个低频子带和12个高频子带,而且原图像的大小是每个子带的4倍.根据多小波变换的这一特点,利用原图像与经过1次多小波变换后的各高频子带的信息,并考虑各子带的分形维数,提出了一种新颖的灰度图像插值算法.实验结果表明,与传统的插值算法相比,例如双线性插值与双三次多项式插值,该算法的插值效果较好,且克服了单小波插值中出现的斑点干扰.     

基于HIS和小波变换相结合的图像融合方法

分析了HIS变换在图像融合中产生颜色失真的原因,提出了将HIS变换和小波变换相结合的方法,有效地解决了融合中颜色失真的问题,并根据融合评价体系对实验结果进行评价.结果显示,方法与传统的HIS方法相比取得了更好的融合效果.     

自适应小波基与图像降噪

对于给定的图像提出一种基于提升方法的自适应小波基,其选择标准是:在自适应提升小波变换下,给定的图像的小波系数有一个好的稀疏性.实验结果表明,自适应提升小波基比非自适应小波基有更好的稀疏性.为了说明自适应提升小波基的稀疏效果,将自适应小波基运用到图像降噪中,实验结果表明自适应提升小波基对于纹理比较光滑的图像有更好的降噪效果.     

正交小波变换的向量空间算法

本文揭示了一个事实，小波不仅可构成Ｌ２空间中的正交基，小波分解与重构滤波还可产生Ｎ维空间中的正交基．在本文提出修改的小波变换算法之下，Ｎ点信号的小波变换等价于Ｎ维空间中的正交变换．用该算法进行信号或图象压缩，无需对信号或图象进行周期延拓，可严格地在Ｎ维空间中进行．     

基于视觉模型和整数余弦变换的数字水印算法

本文通过引入整数余弦变换与Hash函数方法相结合，在视觉模型框架下提出了一种新的数字水印算法。整数变换的引入，提高了运算速度和图像质量，视觉模型引入，使得水印算法抗JPEG压缩以及其他图像处理方法能力强；本文水印方案加密方法符合公开密码体制，具有高度安全特性。     

Wavelet Image Compressor—MinImage

Nowadays, still images are used everywhere in the digital world. The shortages of storage capacity and transmission bandwidth make efficient compression solutions essential. A revolutionary mathematics tool, wavelet transform, has already shown its power in image processing. MinImage, the major topic of this paper, is an application that compresses still images by wavelets. MinImage is used to compress grayscale images and true color images. It implements the wavelet transform to code standard BMP image files to LET wavelet image files, which is defined in MinImage. The code is written in C++ on the Microsoft Windows NT platform. This paper illustrates the design and implementation details in Min-Image according to the image compression stages. First, the preprocessor generates the wavelet transform blocks. Second, the basic wavelet decomposition is applied to transform the image data to the wavelet coefficients. The discrete wavelet transforms are the kernel component of MinImage and are discussed in detail. The different wavelet transforms can be plugged in to extend the functionality of MinImage. The third step is the quantization. The standard scalar quantization algorithm and the optimized quantization algorithm, as well as the dequantization, are described. The last part of MinImage is the entropy-coding schema. The reordering of the coefficients based on the Peano Curve and the different entropy coding methods are discussed. This paper also gives the specification of the wavelet compression parameters adjusted by the end user. The interface, parameter specification, and analysis of MinImage are shown in the final appendix.     

Scalability and Communication in Parallel Low-Complexity Lossless Compression

Approximation schemes for optimal compression with static and sliding dictionaries which can run on a simple array of processors with distributed memory and no interconnections are presented. These approximation algorithms can be implemented on both small and large scale parallel systems. The sliding dictionary method requires large size files on large scale systems. As far as lossless image compression is concerned, arithmetic encoders enable the best lossless compressors but they are often ruled out because they are too complex. Storer extended dictionary text compression to bi-level images to avoid arithmetic encoders (BLOCK MATCHING). We were able to partition an image into up to a hundred areas and to apply the BLOCK MATCHING heuristic independently to each area with no loss of compression effectiveness. Therefore, the approach is suitable for a small scale parallel system at no communication cost. On the other hand, bi-level image compression seems to require communication on large scale systems. With regard to grey scale and color images, parallelizable lossless image compression (PALIC) is a highly parallelizable and scalable lossless compressor since it is applied independently to blocks of 8 × 8 pixels. We experimented the BLOCK MATCHING and PALIC heuristics with up to 32 processors of a 256 Intel Xeon 3.06 GHz processors machine () on a test set of large topographic bi-level images and color images in RGB format. We obtained the expected speed-up of the compression and decompression times, achieving parallel running times about 25 times faster than the sequential ones. Finally, scalable algorithms computing static and sliding dictionary optimal text compression on an exclusive read, exclusive write shared memory parallel machine are presented. On the same model, compression by block matching of bi-level images is shown which can be implemented on a full binary tree architecture under some realistic assumptions with no scalability issues.     

Automated Segmentation and Registration of Dermatological Images

During the last years, there has been a significant increase in the level of interest in image morphology, full-color image processing, image data compression, image recognition and knowledge based analysis systems for medical images. The present paper describes the implementation and tests the efficiency of algorithms dealing with the issues of segmentation and registration of digital images containing skin lesions. Those steps are considered of great importance in computer based characterization systems as they are responsible for the isolation of pathological findings and the matching of sequential images during follow-up studies in medical imaging. This revised version was published online in July 2006 with corrections to the Cover Date.     

基于自适应小波变换和矢量量化的图像压缩编码

运用小波变换进行图像压缩的算法其核心都是小波变换的多分辨率分析以及对不同尺度的小波系数的量化和编码 .本文提出了一种基于能量的自适应小波变换和矢量量化相结合的压缩算法 .即在一定的能量准则下 ,根据子图像的能量大小决定是否进行小波分解 ,然后给出恰当的小波系数量化 .在量化过程中 ,采用一种改进的LBG算法进行码书的训练 .实验表明 ,本算法广泛适用于不同特征的数字图像 ,在取得较高峰值信噪比的同时可以获得较高的重建图像质量 .     

A segmentation procedure of the pervious area of the aorta artery from CT images without contrast medium

In this paper, we develop an algorithm for the segmentation of the pervious lumen of the aorta artery in computed tomography (CT) images without contrast medium, a challenging task due to the closeness gray levels of the different zones to segment. The novel approach of the proposed procedure mainly resides in enhancing the resolution of the image by the application of the algorithm deduced from the mathematical theory of sampling Kantorovich operators. After the application of suitable digital image processing techniques, the pervious zone of the artery can be distinguished from the occluded one. Numerical tests have been performed using 233 CT images, and suitable numerical errors have been computed and introduced ex novo to evaluate the performance of the proposed method. The above procedure is completely automatic in all its parts after the initial region of interest (ROI) selection. The main advantages of this approach relies in the potential possibility of performing diagnosis concerning vascular pathologies even for patients with severe kidney diseases or allergic problems, for which CT images with contrast medium cannot be achieved.     

基于185例肺小结节CT图像灰度共生矩阵纹理特征的多水平模型研究

为探讨基于肺小结节CT图像灰度共生矩阵纹理特征的多水平模型,对北京友谊医院和宣武医院提供的185例2137张肺小结节CT图像提取4种灰度共生矩阵纹理特征。根据该类资料具有层次结构的特点,拟合多水平统计模型。结果表明,能量,熵和惯性矩,在患者水平上具有聚集性,且在良恶性肺小结节间的差异有统计学意义(P值均小于0.001),提示多水平模型可以灵活有效地处理肺小结节CT图像这类具有层次结构的数据,在一定程度上有利于早期肺癌的鉴别诊断。     

Variational image inpainting

Inpainting is an image interpolation problem with broad applications in image and vision analysis. Described in the current expository paper are our recent efforts in developing universal inpainting models based on the Bayesian and variational principles. Discussed in detail are several variational inpainting models built upon geometric image models, the associated Euler‐Lagrange PDEs and their geometric and dynamic interpretations, as well as effective computational approaches. Novel efforts are then made to further extend this systematic variational framework to the inpainting of oscillatory textures, interpolation of missing wavelet coefficients as in the wireless transmission of JPEG2000 images, as well as light‐adapted inpainting schemes motivated by Weber's law in visual perception. All these efforts lead to the conclusion that unlike many familiar image processors such as denoising, segmentation, and compression, the performance of a variational/Bayesian inpainting scheme much more crucially depends on whether the image prior model well resolves the spatial coupling (or geometric correlation) of image features. As a highlight, we show that the Besov image models appear to be less interesting for image inpainting in the wavelet domain, highly contrary to their significant roles in thresholding‐based denoising and compression. Thus geometry is the single most important keyword throughout this paper. © 2005 Wiley Periodicals, Inc.     

Partial differential equations and finite-difference methods in image processing,part 1: Image representation

Stochastic representation of discrete images by partial differential equation operators is considered. It is shown that these representations can fit random images, with nonseparable, isotropic covariance functions, better than other common covariance models. Application of these models in image restoration, data compression, edge detection, image synthesis, etc., is possible.Different representations based on classification of partial differential equations are considered. Examples on different images show the advantages of using these representations. The previously introduced notion of fast Karhunen-Loeve transform is extended to images with nonseparable or nearly isotropic covariance functions, or both.     

Exploiting statistical properties of wavelet coefficient for face detection and recognition

Wavelet transforms (WT) are widely accepted as an essential tool for image processing and analysis. Image and video compression, image watermarking, content-base image retrieval, face recognition, texture analysis, and image feature extraction are all but few examples. It provides an alternative tool for short time analysis of quasi-stationary signals, such as speech and image signals, in contrast to the traditional short-time Fourier transform. The Discrete Wavelet Transform (DWT) is a special case of the WT, which provides a compact representation of a signal in the time and frequency domain. In particular, wavelet transforms are capable of representing smooth patterns as well anomalies (e.g. edges and sharp corners) in images. We are focusing here on using wavelet transforms statistical properties for facial feature detection, which allows us to extract the image facial feature/edges easily. Wavelet sub-bands segmentation method been developed and used to clean up the non-significant wavelet coefficients in wavelet sub-band (k) based on the (k-1) sub-band. Moreover, erosion which is considered as one of the fundamental operation in morphological image processing, been used to reduce the unwanted edges in certain directions. For face detection, face template profiles been built for both the face and the eyes for different wavelet sub-band levels to achieve better computational performance, these profiles used to match the extracted profiles from the wavelet domain of the input image using the Dynamic Time Warping technique DTW. The DTW smallest distance allows identifying the face and the eyes location. The performance of face features distances and ratio has been also tested for face verification purposes. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)