• 전자공학회논문지B
• /
• 제31B권8호
• /
• pp.109-118
• /
• 1994

We proposed new field/frame mode selection quantization and buffer control strategy for interlaced digital HDTV image coding system. The field/frame mode selection is performed based on the mean square error and number of generated bits for each superblock. The quantization factor for each superblock is determined by the characteristics of human visual system and buffer status. The statistical characteristics of the number of generated bits for basis block and the prediction of buffer status are used for buffer control. Simulation results show that the proposed field/frame mode selection and rate buffer control. Simulation results show that the proposed field/frame mode selection and rate buffer control strategy have good subjective image quality and have stable buffer status.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.417-418
• /
• 2006

In this paper, we propose a new fast algorithm which reduces search range by checking reliability of predicted vector in multi-view video coding (MVC). Block position matching algorithm is implemented to improve the proposed algorithm. The processing time is decreased by from 40 to 60% in each frame in the proposed algorithm.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 춘계학술대회 학술발표 논문집
• /
• pp.153-156
• /
• 1998

JPEG은 정지 영상의 압축 표준으로 8$\times$8 블록을 기반으로 DCT 변환을 한 후 양자화 및 엔트로피 부호화 과정을 통해 압축이 이루어진다. DCT는 이미지를 공간 영역에서 주파수 영역으로 변환하는 기법으로 대체로 저주파 성분은 저주파 성분끼리, 고주파 성분은 고주파 성분끼리 모아준다. 이러한 형태는 필요 없는 성분들을 쉽게 제거할 수 있어 압축이 효율적으로 이루어지도록 한다. 블록 기반의 압축 기법을 적용할 때 흔히 나타나는 문제점은 블록 기반으로 인해 발생하는 블？킹 현상으로서 이는 양자화로 인한 정보의 손실에서 비롯되며 그 기본이 되는 8$\times$8 블록 단위로 나타난다. 본 연구세어서는 작은 블록 단위를 16$\times$16의 매크로블록으로 확대한 개념을 이용하여 매크로 블록 내의 수직 및 수평 방향으로 1:2단위로 샘플링한 4개의 8$\times$8블록 간의 블록킹 경계로 없애 주도록 하고자 한다. 또한 16$\times$16의 DCT 블록 대신 16$\times$16 블록내의 8$\times$8 블록들을 이용함으로써 표준 기법에서 이용되는 8$\times$8 단위의 양자화 테이블이나 RLE기법 등을 그대로 적용할 수 있다.

• 한국통신학회논문지
• /
• 제21권7호
• /
• pp.1613-1623
• /
• 1996

In this paper, an image coding scheme using removal of isolated coefficients and quadtree structure in wavelet transformed domain, is suggested. The number of significant coefficients can be reduced by quantizing in different stages according to the weights of the each band. The quadtree structure preseves the location information while significantly reducing the number of bits required to represent the locality of an image. To increase the efficienty of the wavelet transformed images using quadtree, the energy of the isolated coefficients is analyzed and those with low energy are eliminated. Furthermore, to control the bit rate the entropy of each block is sorted according to its energy concentration and the number of bits required for encoding, and the blocks with low energy are removed to achieve the desired compression rate.

• 대한전자공학회논문지
• /
• 제25권12호
• /
• pp.1677-1685
• /
• 1988

In this paper, a new contour coding algorithm is investigated for use in region based image coding. Generally the contour data may be encoded by its chain codes or chain difference codes. But the data compression efficiency is low because of heavy burden for initial absolute coordinates of each chain. To alleviate this problem, the depth first search in graph traversal algorithm, is applied to the chain difference coding method. The proposed coding scheme is shown to be very efficient for contour images obtained by split-merge segmentation. Finally, we can reuce data about 60% in comparison with modified chain difference coding.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.257-258
• /
• 2007

In real-time video communications, the large fluctuation of bits generated from contiguous frames may lead to the buffer oveflow and the delay of transmitting video data. This paper proposes a method that the bits generated from each frame may be in the range of specified fluctuation. The method uses a scene change detector and ignores the time information of detected frames. The experimental results indicate that our scheme achieves average PSNR gain of 2.0dB over TMN8.

• 한국통신학회논문지
• /
• 제25권3B호
• /
• pp.519-528
• /
• 2000

This pater presents a new fractal coding scheme to find more optimal transformation using the reference images which I determined by some criteria. After finding the transformations to minimize the distance between the original image and the reference images. we choose one of them which has the best performance. Conventional fractal coding schemes based on the collage theorem obtain the transformation to minimize the distance between an original image and its collage image because of heavy computation. In other words, it is because the optimal transformation and be obtained after the attractors of all the possible transformations are generated and then compared with an original image. As such a procedure is practically difficult to implement. the collage coding schemes using the theorem have widely used, We introduce the new scheme to overcome the complexity problem for the optimal transformation and be obtained, our scheme is evaluated. as compared with the optimal one, In general cases that the optimal one is unavailable. our scheme is also evaluated, as compared with the conventional schemes.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.771-781
• /
• 1997

In order to solve the problem of uncovered background region due to the region-due to the region-based motion estimation, this paper presents a new method which generates the uncovered region memory using motion estimation and shows the application of the algorithm for very low bit rate video coding. The proposed algorithm can be briefly described as follows it detects the changed region by using the information of FD(frame difference) and segmentation, and then as for only that region the backward motion estimation without transmission of shape information is done. Therefore, from only motion information the uncovered background region memory is generated and updated. The contents stored in the uncovered background region memory are referred whenever the uncovered region comes into existence. The regions with large prediction error are transformed and coded by using DCT. As results of simulation, the proposed algorithm shows the superior improvement in the subjective and objective image quality due to the remarkable reduction of transmission bits for prediction error.

• 한국통신학회논문지
• /
• 제22권3호
• /
• pp.469-480
• /
• 1997

For moving image coding, the variable size of region coding based on local motion is more efficient than fixed size of region coding. It can be applied well to complex motions and is more stable for wide motions because images are segmented according to local motions. In this paper, new image coding method using the segmentation of motion vectors is proposed. First, motion vector field is smoothed by filtering and segmented by smoothed motion vectors. The region growing method is used for decomposition of regions, and merging of regions is decided by motion vector and prediction errors of the region. Edge of regions is excluded because of the correlation of image, and neighbor motion vectors are used evaluation of current block and construction of region. The results of computer simulation show the proposed method is superior than the existing methods in aspect of coding efficiency.

• 한국정보처리학회논문지
• /
• 제7권3호
• /
• pp.1013-1020
• /
• 2000

In this paper, we propose an algorithm which segments hierarchically blocks of image using discrete cosine transform(DCT) and execute finite-state vector quantization (FSVQ) for each block. Using DCT coefficient feature, image is segmented hierarchically to large smooth block and small edge block, then the block hierarchy informations are transmitted. The codebooks are respectively constructed for each hierarchical blocks, the encoder transmits codeword index using FSVQ for reducing encoded bit with hierarchical segmentation. Compared with side match VQ(SMVQ) and hierarchical FSVQ(HFSVQ) algorithm, about Zelda and Boat image, the new algorithm shows better picture quality with 1.97dB and 2.85 dB difference as to SMVQ, 1.78dB and 1.85dB diffences as to HFSVQ respectively.