• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1988.10a
• /
• pp.274-277
• /
• 1988

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1992.06a
• /
• pp.424-429
• /
• 1992

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1624-1635
• /
• 1996

Palletized color images are the dominant type of the image used on Internet and World-Wide Web. In spite of this, most image compression and progressive transmission algorithm have been designed for continuous-tone images. Pallettize images. Palletized images differ from continuous-tone images in such a aspect that values are lookup table indices a new pyramid structure for compression and progressive transmission of a palletized image. In the proposed pyramid structure, the color of a node at higher level is the one that occupies the most part in 4 sons and each node is represented by a type code and several color codes. Since the proposed method do not exploit spatial correlation in an image, it is ideally applied to lossless compression and progressive transmission of palletized images. We have confirmed this through the experimental results.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.41-44
• /
• 2001

삼각형 메쉬(triangular mesh)로 이루어진 삼차원 영상의 큰 데이터량을 줄이기 위한 메쉬 부호화의 연구가 활발히 진행되고 있다. 그리고, 최근에는 삼차원 부호화 데이터의 네트워크 전송 문제가 대두되어, 점진적 부호화(proressive mesh compression)에 대한 알고리듬들도 제안되고 있다. 본 논문은 꼭지점의 위치 정보 및 간략화 과정의 꼭지점 패턴(vertex pattern) 규칙을 이용하여, 기존의 점진적 부호화 알고리듬의 부호화 성능을 개선한 알고리듬을 제안한다. 꼭지점의 위치 정보를 이용하여 기존의 알고리듬에 비해 낮은 엔트로피(entropy)를 얻었으며, 꼭지점 패턴 정보를 이용하여 복원시 분할 꼭지점(split vertex)의 탐색 범위를 한정하였다. 전산 모의 실험을 통해, 제안하는 알고리듬이 기존의 점진적 메쉬 부호화 연구에 비해, 연결 정보 부호화에서 대략 30%정도 향상된 부호화 성능을 가짐을 확인할 수 있었다.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1287-1294
• /
• 2002

The algorithm method for progressive image coding based on discrete wavelet transform presented in a paper. After discrete wavelet transform and extract edge information through edge detection, and then designed efficient coding method more then established embedded coding algorithm using expanded EZW algorithm. Generally, edges have a relatively higher influence on image reconstruction. Occurred DWT on image, and can classify significant coefficients and non-significant coefficients. Using property that edge part has appeared significant coefficient in the paper. Especially, we confirmed that higher frequency sub region on DWT image present homogenous direction property. And on embedded coding, which are effective and well-directed information have higher priority to image reconstruction on transmission. Therefore, our technique algorithm system perform better than that of the conventional method such as progressive image coding application.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.2
• /
• pp.17-26
• /
• 2011

This paper presents an interactive progressive image transmission method, which enables a remote user to interactively select and transmit preferred regions from an index image. Our enhanced quadtree decomposition using PSNR-based rules and new implicit quadtree coding provide better rate-distortion performance than previous quadtree coders as well as leading bit plane methods. An adaptive traversal of child nodes is introduced for better visual display of restored images. Depth-first traversal combined with breadth-first traversal of the quadtree to accomplish interactive transmission as presented, results in a method that provides competitive performance at a low level of computational complexity. Moreover, our decoding requires only simple arithmetic which is enabling our method to be used for real-time mobile applications.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.175-178
• /
• 2000

인접한 화소들간의 상관성에 대한 오류 정보만을 추출하여 전송하는 기법인 라플라시안 피라미드는 알고리즘 구성이 간단하며, 낮은 엔트로피 전송이 가능한 무손실 예측 압축과 점진적인 전송이 가능한 이점을 가지고 있다. 이러한 라플라시안 피라미드를 효율적으고 구성하기 위하여 기존의 5$\times$5 가중치 행렬을 3$\times$3 가중치 행렬로 구성하는 새로운 기법을 보인다. 3$\times$3 가중치행렬을 이용하는 방법이 5$\times$5 가중치 행렬에 의한 알고리즘의 구성보다 간단하면서도 압축효율이 좋음을 시뮬레이션을 통하여 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.33-36
• /
• 2003

영상회의 시스템과 같은 멀티미디어 데이터 통신에서 스케일러빌리티 및 점진적인 전송을 구현하기 위해서 웨이브릿 기반의 영상을 부호화한다. 웨이브릿 기반의 동영상 부호화 기법인 SAMCoW 알고리즘은 움직임이 보상된 오차 영상의 웨이브릿 변환 계수들의 특성으로 인해 제로 트리의 무효 계수 예측이 효과적이지 못하다. 따라서 본 논문에서는 직교 웨이브릿(Forward Orthogonal wavelet)을 기반으로 스케일러빌리티 및 점진적인 전송을 지원하며, 움직임이 보상된 오차 영상의 효율적인 부호화를 위해 적응적 임계치를 이용한 대역 확산 부호화 알고리즘을 제안한다.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.89-98
• /
• 1998

In this paper, we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The proposed algorithm not only supports multi-resolution, dividing original image into special band and various resolution but also reduces blocking effects that come into JPEG In encoding time, this algorithm considers each band characters and priority of transport order, and applies to fast search of image.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2640-2650
• /
• 1997

In this paper we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The proposed algorithms not only supports multi-resolution, dividing original image into special band and various resolution but also reduces blocking effects that come int JPEG. In encoding time this algorithm considers each band characters and priority of transport order, and applies to fast search of image.