• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.403-406
• /
• 1999

Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.538-540
• /
• 2000

본 논문에서는 적응적인 웨이블릿 변환에 기초한 저속 비트율 비디오 코딩 방법의 새로운 알고리즘을 제안한다. 접근 방법은 양자화된 웨이블릿 계수들이 웨이블릿 서브밴드 구조내에서 중복성을 활용하는 메커니즘에 의해서 전처리 된다면 코딩 절차가 더욱 효과적으로 나타난다. 그러므로 본 논문에서는 코딩부분의 최적화 활동에 초점을 맞추어 완전한 중복 블록 움직임 보상된 에어프레임에서 일치를 확보하기 위해 이용하고, 향상된 코사인 윈도우를 적용하였다. 또한 웨이블릿 변환은 각 일치한 움직임 보상된 에러 프레임을 전체적인 에너지 컴팩션에 도달하도록 적용된다. 움직임 벡터의 수평적, 수직적 컴포넌트는 적응적 산술적 코딩을 사용하여 독립적으로 인코드되는 반면에 의미있는 웨이블릿 계수는 적응적 산술 코딩을 사용함에 의해서 비트-플레인 순서로 인코드된다. 제안된 부호기는 28Kbits에서 PSNR이 평균적으로 각각 대략 2.07과 1.38dB에 존재하는 H.263과 ZTE를 초과한다. 전체순서 코딩에 대하여도 3DWCVC 방법은 평균적으로 각각 0.35와 0.71dB을 나타내는 H.263과 ZTE보다 우수한 성능을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.769-771
• /
• 2004

요즘 Web-Browsing, 영상 데이터 베이스 그리고 원격 진료와 같은 여러 응용 분야에서는 압축할 이미지내의 사용자의 관심 영역을 다른 영역보다 더 우선적으로 처리할 필요가 있다. 즉, 영상을 전송하는데 있어서 관심영역(ROI ： Region Of Interest)을 먼저 전송하고, 영상 복원 시에도 영상의 전체 영역 중 ROI 영역이 우선적으로 복원하여야 하는 경우가 있다. Maxshift 방법은 JPEG2000 ROI Coding 에서 표준으로 사용하고 있다. 그러나 Maxshift 방법은 단지 하나의 ROI 영역만을 처리 가능하다. 본 논문에서는 기존의 방법을 이용하여 우선 순위를 가지는 Multiple ROI Coding 기법을 제안한다. 제안한 방법에서는 계수값들의 비트 플레인에 대한 스케일링 변수를 이용하여 우선 순위를 가지는 Multiple ROI 부호화가 가능함을 보이고, 저 비트율에서 Maxshift 방법보다 좀 더 우수한 성능을 확인하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.107-115
• /
• 2014

The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.64-71
• /
• 2003

In this paper, we proposed an algorithm that shorten coding time maintaining image quality in JPEG2000, which is the standard, of still image compression. This method encodes only the bit plane selected as appropriate truncation point for output bitstream, obtained from estimation of frequency distribution for whole image. Wavelet characterized by multi-resolution has vertical, horizontal, and diagonal frequency components for each resolution. The frequency interrelation addressed above is maintained thorough whole level of resolution and represents the unique frequency characteristics for input image. Thus, using the frequency relation at highest level, we can pick the truncation point for the compression time decrease by estimating code bits at encoding each code block. Also, we reduced the encoding time using simply down sampling instead of low-pass filtering at low-levels which are not encoded in color component of lower energy than luminance component. From the proposed algorithm, we can reduce about 15~36% of encoding time maintaining PSNR 30$\pm$0.5㏈.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1057-1065
• /
• 1998

This paper describes a new fractal image coding algorithm to shorten time to take on fractal image encoding by using limited search area method and scaling method. First, the original image is contracted respectively by half and by quarter with the scaling method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. This searched block is used in encoding. Also, we propose an algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.476-481
• /
• 2012

Recently, QoS/QoE technology as a part of the HTTP-based adaptive streaming technology has attracted attention. In this paper, we find out HTTP-based adaptive and dynamic streaming technology. It is based on a dynamic adaptive streaming system over HTTP, which is designed and implemented. The system consist of conversion by the bit rate of MPEG2-TS files, division of segment, creation of MPD(Media Presentation Description) and bitrate's player through analysis of MPD File between servers and clients in network environments of dynamic and adaptive. This diverse network environments, continuous and smooth playback of video will be used in various multimedia fields.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10C
• /
• pp.975-982
• /
• 2009

In this paper, we propose a novel mixing algorithm for multiple video streams, which can guarantee low complexity and low end-to-end delay. In the propose algorithm, we change the syntax bitstream in the compressed domain. And we mix the H.264/AVC video streams by coded slice unit. The syntax bitstream for a mixing changes according to the arrangement of videos streams in which it organizes the mixing screen layout. Experimental results show more than 4 video streams could be mixed at high speed. Moreover, it could display in the player which it supports the standard H.264/AVC without the picture quality loss.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1462-1471
• /
• 2005

Recently, the medical image has been digitized by the development of computer science and digitization of the medical devices. There are needs for database service of the medical image and long term storage because of the construction of PACS(picture archiving and communication system) following DICOM(digital imaging communications in medicine) standards, telemedicine, and et al. However, it also caused some kinds of problems, such as illegal reproduction of medical image, proprietary rights and data authentication. In this paper, we propose the new digital watermarking technique for medical image based on public key encryption algorithm for integrity verification. It prevents illegal forgery that can be caused after transmitting medical image data remotely. The watermark is the value of bit-plane in wavelet transform of the original image for certification method of integrity verification. We proposed the embedding regions are randomly chosen considering ROI, and a digital signature is made using hash function of MD5 which input is a secret key. The experimental results show that the watermark embedded by the proposed algorithm can survive successfully in image processing operations and that the watermark's invisibility is good.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.309-318
• /
• 2004

This paper proposes the H.264-based selective fine granular scalable (FGS) coding scheme that selectively uses the temporal prediction data in the enhancement layer. The base layer of the proposed scheme is basically coded by the H.264 (MPEG-4 Part 10 AVC) visual coding scheme that is the state-of-art in codig efficiency. The enhancement layer is basically coded by the same bitplane-based algorithm of the MPEG-4 (Part 2) fine granular scalable coding scheme. In this paper, we introduce a new algorithm that uses the temproal prediction mechanism inside the enhancement layer and the effective selection mechanism to decide whether the temporally-predicted data would be sent to the decoder or not. Whenever applying the temporal prediction inside the enhancement layer, the temporal redundancies may be effectively reduced, however the drift problem would be severly occurred especially at the low bitrate transmission, due to the mismatch bewteen the encoder's and decoder's reference frame images. Proposed algorithm selectively uses the temporal-prediction data inside the enhancement layer only in case those data could siginificantly reduce the temporal redundancies, to minimize the drift error and thus to improve the overall coding efficiency. Simulation results, based on several test image sequences, show that the proposed scheme has 1∼3 dB higher coding efficiency than the H.264-based FGS coding scheme, even 3∼5 dB higher coding efficiency than the MPEG-4 FGS international standard.