• The KIPS Transactions:PartD
• /
• v.17D no.6
• /
• pp.463-470
• /
• 2010

We presented a very fast and robust method of text line segmentation based on the DCT blocks of color image without decompression and binary transformation processes. Using DC and another three primary AC coefficients from block DCT we created a gray-scale image having reduced size by 8x8. In order to detect and locate white strips between text lines we analyzed horizontal and vertical projection profiles of the image and we applied a direct markov model to recover the missing white strips by estimating hidden periodicity. We presented performance results. The results showed that our method was 40 - 100 times faster than traditional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.465-474
• /
• 2005

In this paper, a directional reconstruction of lost block in image over noisy channel is presented. DCT coefficients or pixel values in the lost blocks are recovered by using the linear interpolation with available neighboring blocks that are adaptively selected by the directional measure that are composed of the DDC (Difference of DC opposite blocks)and SAC(Similarity of AC opposite blocks) between opposite blocks around lost blocks. The proposed directional recovery method is effective for the strong edge and texture regions because we do not make use of the fixed 4-neighboring blocks but exploit the varying neighboring blocks adaptively by the directional information in the local image. In this paper, we describe the novel directional measure(CDS: Combination of DDC and SAC) composed of the DDC and the SAC and select the usable block to recover the lost block with the directional measure. The proposed method shows about 0.6dB PSNR improvement in average compared to the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.663-674
• /
• 1993

In this paper, a DCT image coding algorithm using the human visual property is proposed. Human visual is relatively sensitive to noise in the darker region, insensitive to noise in the brighter region. This property was proved by Weber's law through psycovisual experiment. Weber's law states that the just noticeable difference (j.n.d.) is proportional to intensity. Therefore, the implication of this observation for image processing is that reducing noise in the darker region is more important than reducing noise in the brighter region. In this proposed coding scheme AC coefficients in the darker region are more finely quantized than those in the brighter region. Results showed that, at low bit rate, the subjective quality of reconstructed images by proposed coding scheme is improved than that of coding scheme without considering human visual property.

• Journal of Broadcast Engineering
• /
• v.3 no.2
• /
• pp.127-137
• /
• 1998

In this paper, we propose the method of extracting edge information from MPEG video sequences for the detection of scene changes. In a the proposed method, five significant AC coefficients of each MPEG block are utilized to obtain edge images from the MPEG video. AC edge images obtained by the proposed scheme not only produce better object boundary information than conventional methods using only DC coefficients, but also can reduce the boundary effects produced by DC-based. Since the AC edge image contains the content information of each frame, it can be effectively utilized for the detection of scene change as well as the content-based video query. Experimental results show that the proposed method can be effectively utilized for the detection of scene changes.

• Korean Journal of Cognitive Science
• /
• v.11 no.2
• /
• pp.79-87
• /
• 2000

In this paper we present a face recognition and face detection algorithm in MPEG compressed video. The proposed method consists three stage of processing steps. The first step is to produce a spatially reduced DC image form MPEG compressed video for processing. And the second step is face detection on reduced DC image. Finally, the last step is face recognition on partially extracted compressed frames which contain the detected faces. The spatially reduced DC image is produced from two dimensional inverse DCT of the DC coefficient and the first two AC coefficients. The face detection is performed on DC image and face recognition is performed on one extracted frame per GOP by using the K-L transform. In order to evaluate the proposed method, we carried out experiments on video database. The experiment results show the proposed method is very efficient and helpful for target tasks.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.155-163
• /
• 1999

In this paper, we propose novel scene change detection and key frame selection techniques, which use two feature images, i.e., DC and edge images, extracted directly from MPEG compressed video. For fast edge image extraction. we suggest to utilize 5 lower AC coefficients of each DCT. Based on this scheme, we present another edge image extraction technique using AC prediction. Although the former is superior to the latter in terms of visual quality, both methods all can extract important edge features well. Simulation results indicate that scene changes such as cut. fades, and dissolves can be correctly detected by using the edge energy diagram obtained from edge images and histograms from DC images. In addition. we find that our edge images are comparable to those obtained in the spatial domain while keeping much lower computational cost. And based on HVS, a key frame of each scene can also be selected. In comparison with an existing method using optical flow. our scheme can select semantic key frames because we only use the above edge and DC images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.442-454
• /
• 2002

It's noticed that the SA-DCT (Shape-Adaptive Discrete Cosine Transform) produces different 2-dimensional transform coefficients according as the first 1-dimensional transform is applied in horizontal or vertical direction for an arbitrarily shaped boundary block. Performing the first 1-dimensional transform in the direction, which has higher spatial correlation or smaller shifting distance, can compact the energy on the smaller number of AC coefficients around DC. This paper shows, experimentally, the compaction capability improvement by choosing the first 1-dimensional transform direction with higher spatial correlation or smaller shifting distance. Two adaptive selection methods are proposed to decide efficiently the spatial direction with higher correlation in a boundary block. One is based on the gradients between DC coefficients of neighboring and current blocks, and the other is based on the final coding efficiency that means the number of bits required for coding the block. Using the MPEG-4 video coder, the proposed method shows coding efficiency gain up to 10.87% compared to the conventional SA-DCT method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.151-153
• /
• 2001

문선 채널에서 신뢰성 있는 실시간 동영상 서비스를 하기 위해서는 비디오 스트림 내에서 오류가 발생한 블록의 위치를 알아야 정확한 오류 복구가 가능하다. 이전의 오류 검출 연구들은 대부분 픽셀 단위로 비교하므로 계산량이 많은 문제점이 있다. 본 논문에서는 실시간 서비스를 고려하여 계산량이 적은 블록 단위의 오류 검출 기법을 제안한다. 블록 내의 DCT 계수를 이용하여 오류를 검출한다. DC 계수를 이용해 1차 임계치를 비교한 후 AC 계수를 이용해 에지를 검출한다. 애지가 존재하는 블록에 대해 2차 임계치를 비교하여 오류 여부를 판단한다. DCT 계수 정보를 직접 이용할 수 없는 P, B 프레임에서 DCT 계수를 추정할 수 있는 방법도 함께 제안한다. 제안한 오류 검출 기법을 실제 구현하여 성능을 측정한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1222-1236
• /
• 2010

In this paper, we propose an improved distributed multi-view video coding method that is robust to illumination changes among different views. The use of view dependency is not effective for multi-view video because each view has different intrinsic and extrinsic camera parameters. In this paper, a modified distributed multi-view coding method is presented that applies illumination compensation when generating side information. The proposed encoder codes DC values of discrete cosine transform (DCT) coefficients separately by entropy coding. The proposed decoder can generate more accurate side information by using the transmitted DC coefficients to compensate for illumination changes. Furthermore, AC coefficients are coded with conventional entropy or channel coders depending on the frequency band. We found that the proposed algorithm is about 0.1~0.5 dB better than conventional algorithms.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.413-421
• /
• 2005

As the population of HDTV is growing, among many useful features of modern set top boxes (STBs) or digital video recorders (DVRs), video browsing, visual bookmark, and picture-in-picture capabilities are very frequently required. These features typically employ reduced-size versions of video frames, or thumbnail images. Most thumbnail generation approaches generate DC images directly from a compressed video stream. A discrete cosine transform (DCT) coefficient for which the frequency is zero in both dimensions in a compressed block is called a DC coefficient and is simply used to construct a DC image. If a block has been encoded with field DCT, a few AC coefficients are needed to generate the DC image in addition to a DC coefficient. However, the bit length of a codeword coded with variable length coding (VLC) cannot be determined until the previous VLC codeword has been decoded, thus it is required that all codewords should be fully decoded regardless of their necessary for DC image generation. In this paper, we propose a method especially for fast DC image generation from an I-frame using multiple-symbol lookup table (mLUT). The experimental results show that the method using the mLUT improves the performance greatly by reducing LUT count by 50$\%$.