• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.585-590
• /
• 2002

In the typical data partitioning for error-resilient video coding, motion and macroblock header information is separated from the texture information. It can be an effective tool for the transmission of video over the error prone environment. For Intra-coded frames, however, the loss of DCT (discrete cosine transform) coefficients is fatal because there is no ther information to reconstruct the corrupted macroblocks by errors. For Inter-coded frames, when error occurs in DCT coefficients, the picture quality is degraded because all DCT coefficients are discarded in those packets. In this paper, we propose an efficient data partitioning and coding method for DCT-based error-resilient video. The quantized DCT coefficients are partitioned into the even-value approximation and the remainder parts. It is shown that the proposed algorithm provides a better quality of the high priority part than the conventional methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.55-62
• /
• 2005

This paper proposes a method to recognize a face using DCT/LDA where LDA is applied to DCT coefficients of an input face image. In the proposed method, SSS problem of LDA due to less number of training data than the size of feature space can be avoided by expressing an input image in low dimensional space using DCT coefficients. In terms of the recognition rate, both the proposed method and the PCA/LDA method have shown almost equal performance while the training time of the proposed method is much shorter than the other. This is because DCT has the fixed number of basis vectors while the property of energy compaction rate is similar to that of PCA. Although depending on the number of coefficients employed for the recognition, the experimental results show that the performance of the proposed method in terms of recognition rate is very comparable to PCA/LDA method and other DCT/LDA methods, and it can be trained 13,000 times faster than PCA/LDA method.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1163-1170
• /
• 2013

Digital watermarking techniques have been used as one of the means for copyright protection and authentication of multimedia data. Conventional Chinese Remainder Theorem(CRT)-based spatial domain watermarking techniques do not perform well under JPEG compression. However, it is seen that the CRT-based watermarking technique in Discrete Cosine Transform(DCT) domain performs well for JPEG compression. In this paper, an improved CRT-based image watermarking method in the DCT domain is proposed. The proposed method provides better robustness which decreases changes of absolute difference of residues against rounding errors due to DCT conversion and various attacks. Experimental results show that the proposed method has a good robustness against various attacks compared with the conventional CRT-based watermarking in DCT domain.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.157-160
• /
• 2003

In this paper. we propose a simple and effective video scene change detection algorithm using a 3-D DCT. The 3-D DCT that we employ is a 2$\times$2$\times$2 DCT has simple computations composed only of adding and shifting operations. The simple average values of multiresolution represented video using the 2$\times$2$\times$2 DCT are used as a detection feature vector.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.5
• /
• pp.25-32
• /
• 1998

In this paper, SA (shape adaptive)-DCT is implemented using a datapath with 4 MACs (multiplication & accumulator). DCT is a well-known bottleneck of real-time video compression using MPEG-like schemes. High-speed pipelined MACs presented here implement real-time DCT. A datapath in this paper executes DCT/IDCT algorithms for QCIF 15fps(frame per second), maximum rate of VLBV(very low bitrte video) in MPEG-4. A 32bit accumulator in a MAC prevents distortion caused by fixed-point process. It can be applied to various operations such as ME (motion estimation) and MC(motion compensation) with a absolutor and a halfer.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.121-126
• /
• 1998

DV(Digital Video) 영상 압축 방식에서 MPEG-2로 변환할 때 처리단계를 줄이기 위하여 DCT 영역에서 변환하였다. DV 방식의 색차신호 포맷인 4:1:1에서 4:2:2로 변환하고, 2-4-8 DCT 모드를 변환할 때 행렬을 이용하여 변환함으로써 중간과정을 줄였으며, DCT 영역에서 MPEG-2의 율 제어를 구현하였다. DV에서 만든 DCT 계수를 이용하여, 단계적으로 움직임 추정을 함으로써 전역탐색 블록 매칭 방식보다 처리 속도를 개선하였다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.1069-1074
• /
• 2008

This paper presents an efficient architecture for $2^n$-point DCT algorithm. The proposed approach makes use of the fact that, in most DCT applications, the scaling operation in the DCT unit can be eliminated and combined with the scaling operation in the quantizer unit. This important property is efficiently exploited with the CORDIC(COordinate Rotation DIgital Computer) algorithm to produce a regular architecture suitable for VLSI implementation. Although there have been several attempts to exploit CORDIC algorithm in developing DCT architectures, the proposed approach provides the most efficient way for scaled DCT applications by completely eliminating the scale factor compensation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1265-1274
• /
• 1990

A new classified VQ scheme for DCT coefficients(DCT-CVQ) is proposed for still image coding. DCT coefficient matrices are classified into six classes by ac coefficients that well represent edge characteristics and the distribution of ac energy in the DCT domain. To reduce the complexity of, VQ, ac transform coefficients are partitioned into several vectors, and an adaptive method is provided by making different codebook sizes for different classes. Simulation results show that this DCT-CVQ results in good subjective quality at low bit rates, and SNR is increased by about 1.5-4.0 dB in the range 0.2-0.5 bpp, when compared with other DCT-VQ coding schemes.