• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.689-697
• /
• 2012

In this paper, we propose base layer repetition and HARQ schemes for improving the reliability and the performances of H.264 SVC video transmission in a wireless channel, and investigate its performances. The proposed method may solve the problems of transmission delay as well as the scarcity of wireless resources, since the proposed scheme was applied for only base layer, not for enhancement layer. The numerical results show that the proposed scheme can enhance the BER performance of $1.5{\times}10^{-5}$ and the FER of $1.2{\times}10^{-3}$, when SNR=3.4dB. Also, it was confirmed through the resultant images that the proposed method can improve the SVC performance in the wireless link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1296-1302
• /
• 2009

We propose an efficient coding method of digital holograms using MCTF and standard compression tools for video. The hologram is generated by a computer-generated hologram (CGH) algorithm with both an object image and its depth information. The proposed coding consists of localization by segmenting a hologram, frequency transform using $64\times64$ segment size, 2-D discrete cosine transform DCT for extracting redundancy, motion compensated temporal filtering (MCTF), segment scanning the segmented hologram to form a video sequence, and video coding, which uses H.264/AVC. The proposed algorithm illustrates that it has better properties for reconstruction, 10% higher compression rate than previous research in case of object.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2053-2061
• /
• 1997

The motion comensated video coding technology is very improtant to compress video signal since it reduces the temporal redundancies in successive frames. But the computational complexity of the motion estimation(ME) is too enormous to use in the area of real-time and/or resolution video processing applications. To reduce the complexity of ME, fast search algoritjms and hardware design methods are developed. Especially, the three step search(TSS) is well known method which shows stable performance in various video sequences. And other variations of TSS are developed to get better performance andto reduce the complexity. In this paepr, we present the modified TSS using neighboring block's motion vectors to determine first step motion vector in TSS. The presented method uses the correlation of the adjacent blocks with same motion field. The simualtion resutls show that it has a good MAE performance and low complexity comparing with original TSS.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.221-229
• /
• 2004

We present new digital watermarking scheme that embeds a watermark according to the characteristics of the image or video. The scheme is compatible with established image compression standard. We define a weighting function using a parent-child structure of the DCT coefficients in a block to embed a maximum watermark. The spatio-frequency localization of the DCT coefficients can be achieved with this structure. In the detection stage, we present an optimum a posteriori threshold with a given false detection error probability based on the statistical analysis. Simulation results show that the proposed algorithm is efficient and robust against various signal processing techniques. Especially, they are robust against widely used coding standards, such as JPEG and MPEG.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1572-1580
• /
• 2009

Combing through entire video files for the purpose of recognizing and retrieving matching movies requires much time and memory space. Instead, most current similar movie-matching methods choose to analyze only a part of each movie's video-image information. Yet, these methods still share a critical problem of erroneously recognizing as being different matching videos that have been altered only in resolution or converted merely with a different codecs. This paper proposes an audio-information-based search algorithm by which similar movies can be identified. The proposed method prepares and searches through a database of movie's spectral peak information that remains relatively steady even with changes in the bit-rate, codecs, or sample-rate. The method showed a 92.1% search success rate, given a set of 1,000 video files whose audio-bit-rate had been altered or were purposefully written in a different codec.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.7-30
• /
• 1999

현재 방송과 비디오, 신문 등의 매체를 통해 배포되고 있는 컨텐츠를 향후 인터넷을 통해 디지털 유료 서비스하기 위해서는 저작물에 대한 복제와 불법 유통을 막을 수 있는 기술의 개발이 필요하다. 현재 주문형 음악 서비스에서 사용하고 있는 방법은 서비스 제공자에서 사용자까지 전달되는 과정에서 키(Key)를 사용하여 암호화하는 방법이 있으나 일단 적법한 사용자에 의해서 부호화되고 나면 불법 복제 및 유통을 막을 수 없다는 문제점이 있다. 워터마킹 기술은 네트워크를 통해서 전달되는 멀티미디어 컨텐츠 속에 저작권 소유지의 표시를 숨겨두는 기술로서 지적 재산권 분쟁 있을 경우 재산권을 주장할 수 있는 근거가 된다. 즉, 워터마킹 기술은 인터넷을 기반으로 발달하고 있는 영상, 영화, 오디오, 만화 등의 디지털 컨텐츠의 저작권을 보호하기 위해 로고, 상표, 인감, 직인 등의 저작자 정보를 숨겨두는 기술이라고 할 수 있다. 본 논문에서는 최근 빠르게 발달하고 있는 디지털 워터마킹 기술을 소개하고 동향을 분석하여 국내의 워터마킹 기술의 발전 방향을 제시하고자 한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.293-294
• /
• 2010

ITU-T와 ISO/IEC의 공동 작업으로 제정 된 H.264/AVC는 기존 비디오 표준들에 비해 동일한 화질에서 약 30%~70%의 비트 량을 절감할 수 있으며, 동일한 비트 량으로 PSNR이 2~3dB 가량 우수한 영상을 제공할 수 있다. H.264/AVC는 인트라 부호화 효율을 높이기 위해 공간 영역에서 주변 화소를 이용하여 $4{\times}4$ luma 예측의 9가지 모드와 $16{\times}16$ luma 예측의 4가지 모드에 대한 비트율-왜곡 최적화 기법을 사용하여 최적의 인트라 예측 모드를 선택한다. 본 논문에서는 프레임 내에서 공간 중복 성을 더 많이 줄이기 위해 9가지 모드의 $4{\times}4$ luma 예측에 7가지 모드를 추가하여 총16가지의 $4{\times}4$ luma 예측 모델을 제안한다. 그리고 실험을 통하여 제안하는 인트라 예측 모델이 기존 기술에 비해 높은 압축효율을 보인다.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.211-214
• /
• 2001

This paper presents an efficient fast motion estimation algorithm and image segmentation method for low bit-rate coding. First, with region split information, the algorithm splits the image having homogeneous and semantic regions like face and semantic regions in image. Then, in these regions, We find the motion vector using adaptive search window adjustment. Additionally, with this new segment based fast motion estimation, we reduce blocking artifacts by intensively coding our interesting region(face or arm) in input image. The simulation results show the improvement in coding performance and image quality.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.281-285
• /
• 2000

This paper proposes context-based coding methods for variable length coding of inter-frame DCT coefficients. The proposed methods classify run-level symbols depending on the preceding coefficients. No extra overhead needs to be transmitted, since the information of the previously transmitted coefficients is used for classification. Two entropy coding methods, arithmetic coding and Huffman coding, are used for the proposed context-based coding. For Huffman coding, there is no complexity increase from the current standards by using the existing inter/intra VLC tables. Experimental results show that the proposed methods give ～ 19% bits gain and ～ 0.8 dB PSNR improvement for adaptive inter/intra VLC table selection, and ～ 37% bits gain and ～ 2.7dB PSNR improvement for arithmetic coding over the current standards, MPEG-4 and H.263. Also, the proposed methods obtain larger gain for small quantizaton parameters and the sequences with fast and complex motion. Therefore, for high quality video coding, the proposed methods have more advantage.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.438-450
• /
• 1999

In this paper, a new watermaking method embedding digital watermarks in the compressed video for the copy protection of multimedia data. The proposed method segments objects and embeds independent watermarks in each objects by spread spectrum method in the bitstream domain which is compressed by DCT and motion compensated coding method like MPEG-2. And, the proposed method not only embeds watermarks but show the robustness to the attacks like average operation or statistical analysis.