We proposed a method for reducing LCD motion blur in MPEG domain and analyzing the cause of LCD motion blur. The problem of LCD motion blur is caused by slow response time of liquid crystal and hold-type displaying method of LCDs. The proposed method uses MPEG motion vectors and frequency coefficients of DCT blocks to improve the motion blurs. First, we interpreted the aperture and response time effect of LCD in frequency domain then, modeled sharpening mask filters for the compensation. We confirmed the reduction of motion blurs in LCDs by a motion image simulator.

This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as k/2n (k, n∈ in N). Although some conventional IntDCTs have been proposed, they are not suitable for lossless-to-lossy image coding in low-bit-word-length (coefficients) due to the degradation of the frequency decomposition performance in the system. First, the proposed M-channel lossless Walsh-Hadamard transform (LWHT) can be constructed by only (log2M)-bit-word-length and has structural regularity. Then, our 8-channel IntDCT via LWHT keeps good coding performance even if low-bit-word-length is used because LWHT, which is main part of IntDCT, can be implemented by only 3-bit-word-length. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.

The rate-distortion optimization (RDO) method in the H.264/AVC encoder is an informative technology that improves the coding efficiency, but increases the computational complexity. In this letter, a fast Intra mode decision algorithm using DCT (Discrete Cosine Transform) coefficients distribution is proposed to reduce the H.264 encoder complexity. The proposed method reduces the encoder complexity on average 63.44%, while the coding efficiency is slightly decreased compared with the H.264/AVC encoder.

A scalable speech codec consisting of a harmonic codec as the core layer and MDCT-based transform codec as the enhancement layer is often required to provide both very low-rate core communication and fine granular scalability. This structure, however, has a serious drawback for practical use because a time delay caused by transform in each layer is accumulated, resulting in a long overall codec delay. In this letter, a new MDCT structure is proposed to reduce the overall codec delay by eliminating the accumulation of time delay by each transform. In the proposed structure, the time delay is first reduced by forcing two transforms to share a common look-ahead. The error components of MDCT caused by the look-ahead sharing are then analyzed and compensated in the decoder, resulting in perfect reconstruction. The proposed structure reduces the codec delay by the frame size, with an equivalent coding efficiency.

With DCT coding, block artifact and mosquito noise degradations appear in decoded pictures. The control of post filtering is important to reduce degradations without causing side effects. Decoding information is useful, if the filter is inside or close to the encoder; however, it is difficult to control with independent post filtering, such as in a display. In this case, control requires the estimation of the artifact from only the decoded picture. In this work, we describe an estimation method that determines the mosquito noise block and level. In this method, the ratio of spatial activity is taken between the mosquito block and the neighboring flat block. We test the proposed method using the reconstructed pictures which are coded with different quantization scales. We recognize that the results are mostly reasonable with the different quantizations.

This letter proposes a nonlinear DCT discriminant feature extraction approach for face recognition. The proposed approach first selects appropriate DCT frequency bands according to their levels of nonlinear discrimination. Then, this approach extracts nonlinear discriminant features from the selected DCT bands by presenting a new kernel discriminant method, i.e. the improved kernel discriminative common vector (KDCV) method. Experiments on the public FERET database show that this new approach is more effective than several related methods.

This paper proposes an efficient FFT algorithm for the Psycho-Acoustic Model (PAM) of MPEG-4 AAC. The proposed algorithm synthesizes FFT coefficients using MDCT and MDST coefficients through circular convolution. The complexity of the MDCT and MDST coefficients is approximately half of the original FFT. We also design a new PAM based on the proposed FFT algorithm, which has 15% lower computational complexity than the original PAM without degradation of sound quality. Subjective as well as objective test results are presented to confirm the efficiency of the proposed FFT computation algorithm and the PAM.

This paper presents an FPGA implementation of highly modular universal discrete transforms. The implementation relies upon the unified discrete Fourier Hartley transform (UDFHT), based on which essential sinusoidal transforms including discrete Fourier transform (DFT), discrete Hartley transform (DHT), discrete cosine transform (DCT) and discrete sine transform (DST) can be realized. It employs a reconfigurable, scalable and modular architecture that consists of a memory-based FFT processor equipped with pre- and post-processing units. Besides, a pipelining technique is exploited to seamlessly harmonize the operation between each sub-module. Experimental results based on Xilinx Virtex-II Pro are given to examine the performance of the proposed UDFHT implementation. Two practical applications are also shown to demonstrate the flexibility and modularity of the proposed work.

This letter proposes a new transceiver for OFDM systems based on Smooth Local Trigonometric Transform (LTT). In our transceiver, the transmitter is realized by first modulating the original serial data using a constellation mapper, then feeding the results into the inverse LTT modulator. Unlike the conventional DFT-OFDM system, which always uses the roll cosine function as its window function, the proposed system needs no additional window function for the reason that LTT transform includes a bell-shaped window function by itself. Moreover, each LTT-OFDM symbol has a much more rapid attenuation rate outside of the spectral bandwidth and better spectrum convergence. In the receiver, the original data is recovered by demodulating the received data using forward LTT. Comparative simulation results from the conventional DFT-OFDM system, the system we proposed, and the recently proposed DCT based OFDM system are discussed in terms of bit error rate (BER).

Fast schemes for compressed-domain image size change, are proposed. Fast Winograd DCTs are applied to resizing images by a factor of two to one. First, we speed up the DCT domain downsampling scheme which uses the bilinear interpolation. Then, we speed up other image resizing schemes which use DCT lowpass truncated approximations. The schemes proposed here reduce the computational complexities significantly, while there is no difference in the overall quality of the images compared to previous works.

This paper proposes a DCT-based steganographic method named StegErmelc in the JPEG domain. Three strategies are proposed, namely (i) edge-like block selection, (ii) recursive matrix encoding, and (iii) largest coefficient serving, to form a novel steganographic method for achieving scalable carrier capacity, low detectability by universal blind steganalyzer, and high image quality, simultaneously. For a given message length, StegErmelc flexibly scales its carrier capacity to accommodate the message while trading off with stego detectability. At full capacity, StegErmelc has comparable carrier capacity relative to the existing methods. When embedding the same amount of information, StegErmelc remarkably reduces the stego detection rate to about 0.3-0.5 lower than that of the existing methods considered, and consequently StegErmelc can withstand blind steganalyzer when embedding up to 0.10 bpc. Under the same condition, StegErmelc produces stego image with quality higher than that of the existing methods considered. Graphical comparison with three additional evaluation metrics is also presented to show the relative performance of StegErmelc with respect to the existing methods considered.

This paper presents an integration architecture of content addressable memory (CAM) and a massive-parallel memory-embedded SIMD matrix for constructing a versatile multimedia processor. The massive-parallel memory-embedded SIMD matrix has 2,048 2-bit processing elements, which are connected by a flexible switching network, and supports 2-bit 2,048-way bit-serial and word-parallel operations with a single command. The SIMD matrix architecture is verified to be a better way for processing the repeated arithmetic operation types in multimedia applications. The proposed architecture, reported in this paper, exploits in addition CAM technology and enables therefore fast pipelined table-lookup coding operations. Since both arithmetic and table-lookup operations execute extremely fast, the proposed novel architecture can realize consequently efficient and versatile multimedia data processing. Evaluation results of the proposed CAM-enhanced massive-parallel SIMD matrix processor for the example of the frequently used JPEG image-compression application show that the necessary clock cycle number can be reduced by 86% in comparison to a conventional mobile DSP architecture. The determined performances in Mpixel/mm2 are factors 3.3 and 4.4 better than with a CAM-less massive-parallel memory-embedded SIMD matrix processor and a conventional mobile DSP, respectively.

Blocking artifact is a major limitation of DCT-based codec at low bit rates. This degradation is likely to influence the judgment of a final user. This work presents a powerful post-processing filter in the DCT frequency domain. The proposed algorithm adopts a shift block within four adjacent DCT blocks to reduce computational complexity. The artifacts resulting from quantized and de-quantized process are eliminated by slightly modifying several DCT coefficients in the shift block. Simulation results indicate that the proposed method produces the best image quality in terms of both objective and subjective metrics.

Face recognition is one of the most active research areas in pattern recognition, not only because the face is a human biometric characteristics of human being but also because there are many potential applications of the face recognition which range from human-computer interactions to authentication, security, and surveillance. This paper presents an approach to pose invariant human face image recognition. The proposed scheme is based on the analysis of discrete cosine transforms (DCT) and discrete wavelet transforms (DWT) of face images. From both the DCT and DWT domain coefficients, which describe the facial information, we build compact and meaningful features vector, using simple statistical measures and quantization. This feature vector is called as the hybrid dominant frequency features. Then, we apply a combination of the L2 and Lq metric to classify the hybrid dominant frequency features to a person's class. The aim of the proposed system is to overcome the high memory space requirement, the high computational load, and the retraining problems of previous methods. The proposed system is tested using several face databases and the experimental results are compared to a well-known Eigenface method. The proposed method shows good performance, robustness, stability, and accuracy without requiring geometrical normalization. Furthermore, the purposed method has low computational cost, requires little memory space, and can overcome retraining problem.

For wideband MIMO-OFDM systems, scheduling and link adaptation are key techniques to improve the throughput performance. However, in systems without reciprocity between the uplink and the downlink channels, these techniques require a high feedback overhead of the channel quality indication (CQI) information. In this paper, we propose a novel CQI feedback reduction method, which is based on the conventional compression techniques exploiting the discrete cosine transformation (DCT). The basic idea is to adaptively permute the CQI sequences of different MIMO streams according to one of the possible patterns before the DCT compression so that the amount of feedback bits is minimized. The possible patterns used are carefully designed according to our analysis of the two types of correlations (the inter-stream correlation and the inter-subband correlation) that exist in MIMO-OFDM transmission, as well as their impact on the compression efficiency. Simulation results verify that the proposed method can effectively reduce the CQI feedback overhead under varying channel conditions.

In this paper, we propose a method of resizing images in the integer DCT domain employed by H.264/AVC. To accomplish this, we first derive the matrix scaling the image resolution, and then factorize the scaled DCT blocks and the post scaling factors (PF) from the matrix obtained from the multiplication of the scaling matrix and the original integer DCT blocks. Then, we separate the scaled DCT blocks into the integer scaling matrix and the scaled integer DCT blocks. The experiments show that the proposed method produces nearly the same performance as those operating in the real DCT domain.

This paper presents a lossless steganography method based on the multiple-base notation approach for JPEG images. Embedding a large amount of secret data in a JPEG-compressed image is a challenge since modifying the quantized DCT coefficients may cause serious image distortion. We propose two main strategies to deal with this problem: (1) we embed the secret values in the middle-frequency of the quantized DCT coefficients, and (2) we limit the number of nonzero values of the quantized DCT coefficients that participate in the embedding process. We also investigated the effect of modifying the standard quantization table. The experimental results show that the proposed method can embed twice as much secret data as the irreversible embedding method of Iwata et al. under the same number of embedded sets. The results also demonstrate how three important factors: (1) the quantization table, (2) the number of selected nonzero quantized DCT coefficients, and (3) the number of selected sets, influence the image quality and embedding capacity.

We propose a method to retrieve similar and duplicate images from a JPEG (Joint Photographic Image Group) image database. Similarity level is decided based on the DCT (Discrete Cosine Transform) coefficients signs. The method is simple and fast because it uses the DCT coefficients signs as features, which can be obtained directly after partial decoding of JPEG bitstream. The method is robust to JPEG compression, in which similarity level of duplicate images, i.e., images that are compressed from the same original images with different compression ratios, is not disguised due to JPEG compression. Simulation results showed the superiority of the method compared to previous methods in terms of computational complexity and robustness to JPEG compression.

Existing methods for inverse motion compensation (IMC) in the DCT domain have not considered the unrestricted motion vector (UMV). In the existing methods, IMC is performed to deal with the UMV in the spatial domain after the inverse DCT (IDCT). We propose an IMC method which can deal with the UMV directly in the DCT domain without the use of the IDCT/DCT required by the existing methods. The computational complexity of the proposed method can be reduced by about half of that of the brute-force method operating in the spatial domain. Experimental results show that the proposed method can efficiently reduce the processing time with similar visual quality.

A novel image resizing algorithm is proposed. In our method, three steps are included in the downsampling: the first-round downsampling, the interim upsampling and the second-round downsampling. The downsampling operation unit size is selected between one single 1616 block size and four 88 block sizes during the first-round downsampling processing. To distinguish the selected downsampling operation unit size, the interim upsampling and the second-round downsampling is required. The DCT coefficients of the interim upsampling image indicate the selected downsampling unit size. The DCT coefficients are converted by some way like lifting step and simultaneously downsampled in the second round. The information about selected operator unit size is contained in the final downsampling image. Experimental results demonstrate the proposed method achieves better result than the relevant existing method.