基于二维最大边缘准则和DCT的人脸识别方法

提出了一种基于离散余弦变换(DCT)和二维最大边缘准则(2DMMC)的2DDM特征提取算法,证明了2DMMC可以直接应用于DCT域,利用欧氏距离测度进行分类的结果与在空域中进行得到的结果完全相同。2DMMC方法可直接应用于基于DCT压缩的JPEG格式的图像。在ORL和Yale人脸数据库上的实验结果表明,在空域2DMMC的识别率高于2DPCA和2DLDA,2DDM的识别率又高于2DMMC,而且2DDM的耗时要低于2DMMC。     

The spatial relationship of DCT coefficients between a block andits sub-blocks

At present, almost all digital images are stored and transferred in their compressed format in which discrete cosine transform (DCT)-based compression remains one of the most important data compression techniques due to the efforts from JPEG. In order to save the computation and memory cost, it is desirable to have image processing operations such as feature extraction, image indexing, and pattern classifications implemented directly in the DCT domain. To this end, we present in this paper a generalized analysis of spatial relationships between the DCTs of any block and its sub-blocks. The results reveal that DCT coefficients of any block can be directly obtained from the DCT coefficients of its sub-blocks and that the interblock relationship remains linear. It is useful in extracting global features in the compressed domain for general image processing tasks such as those widely used in pyramid algorithms and image indexing. In addition, due to the fact that the corresponding coefficient matrix of the linear combination is sparse, the computational complexity of the proposed algorithms is significantly lower than that of the existing methods     

基于DCT变换的内嵌静止图像压缩算法

提出了一种有效的基于离散余弦变换(DCT)的内嵌子带图像编码算法.Xiong等人提出的EZDCT算法采用零树结构实现了一种内嵌DCT编码器,且其性能优于JPEG.本文指出DCT的零树结构在内嵌DCT算法中并非很有效,同时提出了一种不依赖零树结构的简便、高效的内嵌DCT子带编码算法.实验结果表明本文算的压缩性能(PSNR)比EZDCT高约0.5~1.5dB,且接近当前最通用的内嵌小波SPIHT算法,在对某些图像压缩时还优于SPIHT算法.     

A low-power DCT core using adaptive bitwidth and arithmeticactivity exploiting signal correlations and quantization

This work describes the implementation of a discrete cosine transform (DCT) core compression system targetted to low-power video (MPEG2 MP@ML) and still-image (JPEG) applications. It exhibits two innovative techniques for arithmetic operation reduction in the DCT computation context along with standard voltage scaling techniques such as pipelining and parallelism. The first method dynamically minimizes the bitwidth of arithmetic operations in the presence of data spatial correlation. The second method trades off power dissipation and image compression quality (arithmetic precision). The chip dissipates 4.38 mW at 14 MHz and 1.56 V     

Image extraction in DCT domain

More and more digital images are being stored in compressed formats, among which the format using discrete cosine transform (DCT) coefficients is widely adopted (JPEG, MPEG, H.263 etc). To exploit those successful image processing techniques developed in the pixel domain, the authors propose a fast image extraction algorithm to allow images to be extracted directly from compressed DCT coefficients without full decompression. In the proposed technique the extracted images retain quality comparable with that of fully decoded images. However, the computing cost and the storage expense incurred by the proposed algorithm are very much lower than the costs of full decompression. The experiments also demonstrate that the proposed algorithm has tremendous potential in that all existing image processing techniques developed in the pixel domain can be directly applied to compressed images, without involving full decompression.     

Image coding using lapped biorthogonal transform

The wireless sensor network utilizes image compression algorithms like JPEG, JPEG2000, and SPIHT for image transmission with high coding efficiency. During compression, discrete cosine transform (DCT)–based JPEG has blocking artifacts at low bit-rates. But this effect is reduced by discrete wavelet transform (DWT)–based JPEG2000 and SPIHT algorithm but it possess high computational complexity. This paper proposes an efficient lapped biorthogonal transform (LBT)–based low-complexity zerotree codec (LZC), an entropy coder for image coding algorithm to achieve high compression. The LBT-LZC algorithm yields high compression, better visual quality with low computational complexity. The performance of the proposed method is compared with other popular coding schemes based on LBT, DCT and wavelet transforms. The simulation results reveal that the proposed algorithm reduces the blocking artifacts and achieves high compression. Besides, it is analyzed for noise resilience.     

A fast 4×4 DCT algorithm for the recursive 2-D DCT

The authors present an efficient algorithm for the computation of the 4×4 discrete cosine transform (DCT). The algorithm is based on the decomposition of the 4×4 DCT into four 4-point 1-D DCTs. Thus, only 1-D transformations and some additions are required. It is shown that the proposed algorithm requires only 16 multiplications, which is half the number needed for the conventional row-column method. Since the 2^m×2^m DCT can be computed using the 4×4 DCT recursively for any m, the proposed algorithm leads to a fast algorithm for the computation of the 2-D DCT     

Image filtering in the block DCT domain using symmetric convolution

Processing of images in the transform domain saves computation by avoiding inverse and re-transform operations. In this paper, we present a technique for filtering of images in the transform domain using symmetric convolution in the block DCT space. Due to the application of convolution-multiplication property in the DCT domain, the filtering operation requires significantly less computation than its equivalent in the original signal/image space. To take care of discontinuities along boundaries of blocks, filtering is performed on a larger DCT block composed from adjacent blocks. Subsequently, the filtered DCT block is obtained by decomposing it. The proposed filtering technique achieves the same results of linear convolution in the spatial domain with reduced cost. With the proposed filtering, it is possible to significantly speedup the operation by ignoring some elements in the filtering matrices whose magnitudes are smaller than a threshold value. Typical sparseness of DCT domain input blocks is also considered for further reduction of computational cost. The proposed method uses simple linear operations such as matrix multiplication, which is appropriate for efficient hardware implementations. We also demonstrate its applications in image sharpening and removal of blocking artifacts directly in the compressed domain.     

基于距离度量学习的DCT域JPEG图像检索

由于特征有限,传统基于欧式距离的压缩域检索性能并不理想。本文引入距离度量学习技术,研究压缩域图像检索,提出了一种基于距离度量学习的离散余弦变换（DCT）域联合图像专家小组（JPEG）图像检索方法。首先,提出了一种更有效的 DCT 域特征提取方法;其次,运用距离度量学习技术训练出一个更加有效的度量矩阵进行检索。在 Corel5000上的图像检索实验表明,新方法有效提高了检索准确度。     

基于重组DCT系数子带能量直方图的图像检索

现在许多图像采用JPEG格式存储,检索这些图像通常要先解压缩,然后提取基于像素域的特征矢量进行图像检索。己有文献提出直接在DCT域进行图像检索的方法,这样可以降低检索的时间复杂度。本文提出对JPEG图像的DCT系数利用多分辨率小波变换的形式进行重组,对整个数据库中所有图像的DCT系数重组得到的若干子带,分别建立子带能量直方图,而后采用Morton顺序建立每幅图像的索引,并采用变形B树结构组织图像数据库用于图像检索。     

A scaled DCT architecture with the CORDIC algorithm

This paper presents an efficient approach for computing the N-point (N=2ⁿ) scaled discrete cosine transform (DCT) with the coordinate rotation digital computer (CORDIC) algorithm. The proposed algorithm is based on an indirect approach for computing the DCT so that the vector rotations are completely separated from the other operations and placed at the end of the DCT unit. As a result, unlike the other CORDIC-based DCT architectures, the proposed scaled DCT architecture does not require scale factor compensation. The number of CORDIC iterations is minimized through the optimal angle recoding method based on the three-value CORDIC algorithm. Although this three-value CORDIC algorithm results in different scale factors for different angles, this does not incur any extra hardware in the proposed scaled DCT architecture     

Fast multiplierless approximations of the DCT with the liftingscheme

We present the design, implementation, and application of several families of fast multiplierless approximations of the discrete cosine transform (DCT) with the lifting scheme called the binDCT. These binDCT families are derived from Chen's (1977) and Loeffler's (1989) plane rotation-based factorizations of the DCT matrix, respectively, and the design approach can also be applied to a DCT of arbitrary size. Two design approaches are presented. In the first method, an optimization program is defined, and the multiplierless transform is obtained by approximating its solution with dyadic values. In the second method, a general lifting-based scaled DCT structure is obtained, and the analytical values of all lifting parameters are derived, enabling dyadic approximations with different accuracies. Therefore, the binDCT can be tuned to cover the gap between the Walsh-Hadamard transform and the DCT. The corresponding two-dimensional (2-D) binDCT allows a 16-bit implementation, enables lossless compression, and maintains satisfactory compatibility with the floating-point DCT. The performance of the binDCT in JPEG, H.263+, and lossless compression is also demonstrated     

Arbitrary resizing of images in DCT domain using lapped transforms

An arbitrary L/M-fold image resizing method using lapped transforms is presented. The resizing operation is carried out in the lapped transform domain, by converting the images in the discrete cosine transform (DCT) domain into those in the lapped transform domain and vice versa. The proposed method provides visually fine images, while reducing the blocking effect to a very low level for images compressed at low bit rates.     

一种基于DCT系数重组的降参考3D视频质量评价方法

针对3D视频质量评价,提出了一种基于离散余弦变 换(DCT)系数重组的降参考质量评价方法。方法主要 包括4D数据集构造、DCT变换与重组和降参考(RR)质量评价3个阶段。在4D数据集构造阶段 ,通过联合视 频的空间域、视点域和时间域信息构造包含3D视频全部信息的4D数据集;在DCT变换与重 组阶段,首 先对数据集进行DCT变换,然后筛选复杂度较高的DCT系数进行重组,得到能够表征3D视 频质量的重 组系数集;在RR质量评价阶段,首先采用广义高斯分布(GGD)函数对重组后DCT系数集的每 个子带进行建模, 然后利用系数距离函数和频率比距离函数评估3D视频质量。实验结果表明,本文提出的方 法与主观评价结果有较好的相关性,符合人类视觉系统(HVS)。     

DCT域中MPEG7主色描述符的提取

该文在MPEG7的基础上提出了DCT域内直接提取主色描述符的新方法。这种方法节省了对图像的解压缩的过程,因而大大的提高了对于压缩图像进行特征提取的速度和效果。作为整个箅法的一部分,一种自动阈值提取的算法也在该文中给予了描述。这种方法可以减少因人为设定经验阈值而带来的不确定性,使算法更具鲁棒性。对比检索试验结果也说明本算法是一个高速有效的算法。新算法主要用于压缩图像库或互联网上的相似检索。     

Content Authentication Based on JPEG-to-JPEG Watermarking

A content authentication technique based on JPEG-to-JPEG watermarking is proposed in this paper. In this technique, each 8x8 block in a JPEG compressed image is first processed by entropy decoding, and then the quantized discrete cosine transform （DCT） is applied to generate DCT coefficients： one DC coefficient and 63 AC coefficients in frequency coefficients. The DCT AC coefficients are used to form zero planes in which the watermark is embedded by a chaotic map. In this way, the watermark information is embedded into JPEG compressed domain, and the output watermarked image is still a JPEG format. The proposed method is especially applicable to content authentication of JPEG image since the quantized coefficients are modified for embedding the watermark and the chaotic system possesses an important property with the high sensitivity on initial values. Experimental results show that the tamper regions are localized accurately when the watermarked JPEG image is maliciously tampered.     

Content Authentication Based on JPEG-to-JPEG Watermarking

A content authentication technique based on JPEG-to-JPEG watermarking is proposed in this paper. In this technique, each 88 block in a JPEG compressed image is first processed by entropy decoding, and then the quantized discrete cosine transform (DCT) is applied to generate DCT coefficients: one DC coefficient and 63 AC coefficients in frequency coefficients. The DCT AC coefficients are used to form zero planes in which the watermark is embedded by a chaotic map. In this way, the watermark information is embedded into JPEG compressed domain, and the output watermarked image is still a JPEG format. The proposed method is especially applicable to content authentication of JPEG image since the quantized coefficients are modified for embedding the watermark and the chaotic system possesses an important property with the high sensitivity on initial values. Experimental results show that the tamper regions are localized accurately when the watermarked JPEG image is maliciously tampered.     

Arbitrary-ratio image resizing using fast DCT of composite length for DCT-based transcoder.

We propose a fast arbitrary-ratio image resizing method for transcoding of the compressed images. The downsizing process in the discrete cosine transform (DCT) domain can be implemented by truncating high-frequency coefficients, whereas the upsizing process is implemented in the DCT domain by padding zero coefficients to the high-frequency part. The proposed method combines a fast inverse and forward DCT of composite length for arbitrary-ratio upsizing or downsizing. According to the resizing ratio, truncating the high-frequency coefficients and padding zeros are appropriately considered by combining the inverse DCT and forward DCT. The proposed method shows a good peak signal-to-noise ratio and less computational complexity compared with the spatial-domain and previous DCT-domain image resizing methods.     

Layered image coding using the DCT pyramid

A block-based subband image coder that exploits the ability to perform decimation in the discrete cosine transform (DCT) domain to effect a pyramidal data structure is described. The proposed "DCT pyramid" has a distinct feature of improved image rendition properties without the associated blocking artifacts at low bit-rates.     

Image representation using block compressive sensing for compression applications

The emerging compressive sensing (CS) theory has pointed us a promising way of developing novel efficient data compression techniques, although it is proposed with original intention to achieve dimension-reduced sampling for saving data sampling cost. However, the non-adaptive projection representation for the natural images by conventional CS (CCS) framework may lead to an inefficient compression performance when comparing to the classical image compression standards such as JPEG and JPEG 2000. In this paper, two simple methods are investigated for the block CS (BCS) with discrete cosine transform (DCT) based image representation for compression applications. One is called coefficient random permutation (CRP), and the other is termed adaptive sampling (AS). The CRP method can be effective in balancing the sparsity of sampled vectors in DCT domain of image, and then in improving the CS sampling efficiency. The AS is achieved by designing an adaptive measurement matrix used in CS based on the energy distribution characteristics of image in DCT domain, which has a good effect in enhancing the CS performance. Experimental results demonstrate that our proposed methods are efficacious in reducing the dimension of the BCS-based image representation and/or improving the recovered image quality. The proposed BCS based image representation scheme could be an efficient alternative for applications of encrypted image compression and/or robust image compression.