• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8B
• /
• pp.1129-1140
• /
• 2001

본 논문에서는 블록기반 동영상 부호화에서 나타나는 양자화 잡음을 그 특성에 맞게 모델링을 하고, 이를 기반으로 웨이블렛 변환(wavelet transform)을 이용하여 양자화 잡음을 제거하는 후처리 방법을 제안한다. 제안된 방법에서는 양자화 잡음을 특정 프로화일(profile)로 표현되는 블록화 잡음과 비에지 화소(non-edge pixel)에서 백색 가우시안 특성을 가지는 나머지 잡음의 합으로 모델링 한다. 이러한 양자화 잡음의 모델을 기반으로 정칙화 미분(regularized differentiation)을 표현하는 Mallat의 1차원 웨이브렛 변환을 이용하여 영상복원 관점에서 각각의 잡음을 제거한다. 먼저, 웨이브렛 영역의 블록경계에서 임펄스로 나타나는 블록화 잡음 성분들의 크기를 추정하여 줄임으로 해서 블록화 잡음을 제거한다. 이때 임펄스 크기의 추정은 메디안 필터와 양자화 파라미터(quantization parameter), 그리고 국부 활동도(local activity)를 이용하여 이루어진다. 그리고 나머지 잡음은 비에지 화소에서 연역치화(soft-thresholding)을 수행함으로써 제거한다. 이러한 후처리 방법의 구현은 실시간 응용을 위해 웨이브렛 필터를 이용하여 근사적으로 공간 영역에서 이루어진다. 실험 결과, 제안된 방법이 다양한 영상과 압축률에 대해 MPEG-4 VM(verification model) 후처리 필터(post-filter)보다 PSNR 성능뿐만 아니라 주관적 화질면에서도 우수함을 확인하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2005.11a
• /
• pp.47-50
• /
• 2005

본 논문에서는 인터넷 스트리밍 및 모바일 응용 등에서 요구되는 저 비트율 비디오를 위한 효과적인 후처리 기법을 제안한다. 블록기반 압축영상의 특성상 낮은 비트율에서는 블록킹 현상과 같은 화질열화가 불가피하다. 이러한 블록기반 압축영상의 블록킹 현상에 대하여 본 논문에서 제안한 디블록킹 기법은 블록 경계 주변의 특성에 따라 필터링 모드를 달리 적용하여 효율적으로 블록킹 현상을 제거함으로서 주관적, 객관적 화질을 향상시킨다. 제안한 알고리즘에서는 모드 선택의 정확성을 높이기 위하여 저역통과필터를 이용한 간단한 전처리 과정을 거치도록 하고, 또한 영상의 실제 에지와 블록킹 현상을 구분하기 위하여 3가지 모드를 도입하며, 이를 통해 필터링에 의한 실제 에지 부분의 화질열화를 방지하도록 한다. 마지막으로 corner outlier와 같은 특수한 artifact의 제거를 위해 별도의 모드를 추가한다. 실험에서는 MPEG-4로 복호된 영상에 대하여 제안한 필터를 적용하고, 최근 표준화가 완료된 H.264의 루프필터 및 최근 발표된 저 비트율 비디오에 대한 후처리 기법과의 비교실험을 통하여 제안된 방법의 성능을 평가한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1944-1956
• /
• 2016

The Digital Video Broadcasting-Common Scrambling Algorithm is an ETSI-designated algorithm designed for protecting MPEG-2 signal streams, and it is universally used. Its structure is a typical hybrid symmetric cipher which contains stream part and block part within a symmetric cipher, although the entropy is 64 bits, there haven't any effective cryptanalytic results up to now. This paper studies the security level of CSA against impossible differential cryptanalysis, a 20-round impossible differential for the block cipher part is proposed and a flaw in the cipher structure is revealed. When we attack the block cipher part alone, to recover 16 bits of the initial key, the data complexity of the attack is O(2^44.5), computational complexity is O(2^22.7) and memory complexity is O(2^10.5) when we attack CSA-BC reduced to 21 rounds. According to the structure flaw, an attack on CSA with block cipher part reduced to 21 rounds is proposed, the computational complexity is O(2^21.7), data complexity is O(2^43.5) and memory complexity is O(2^10.5), we can recover 8 bits of the key accordingly. Taking both the block cipher part and stream cipher part of CSA into consideration, it is currently the best result on CSA which is accessible as far as we know.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.1
• /
• pp.85-92
• /
• 2019

In this paper, we propose a efficient feature point extraction method that can solve the problem of performance degradation by introducing a preprocessing process when extracting feature points by utilizing the characteristics of 360-degree realistic media. 360-degree realistic media is composed of images produced by two or more cameras and this image combining process is accomplished by extracting feature points at the edges of each image and combining them into one image if they cover the same area. In this production process, however, the stitching process where images are combined into one piece can lead to the distortion of non-seamlessness. Since the realistic media of 4K-class image has higher resolution than that of a general image, the feature point extraction and matching process takes much more time than general media cases.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.557-575
• /
• 2005

Much research in core technologies has been done to make it possible the ubiquitous video services over various kinds of user information terminals anytime anywhere in the way the users want to consume. In this paper, we design plototypesystem architecture for the ubiquitous TV program content consumption based on user preference via various kinds of intelligent information terminals in digital home environment, and present an implementation and testing results for the prototype system. For the system design, we utilize the TV Anytime specification fur the consumption of TV program contents based on user preference in TV programs, and also use the MPEG-21 DIA (Digital Item Adaptation) tools which are the representation schema formats in order to describe the context information for user environments, user terminal characteristics, user characteristics for universal access and consumption of the preferred TV program contents. The proposed ubiquitous content mobility prototype system is designed to make it possible to seamlessly consume contents by a single user or multiple users via various kinds of user terminals for the TV program contents they watch together. The proposed ubiquitous content mobility prototype system in digital home environment consists of a home server, a display TV terminal, and an intelligent information terminal. We use 42 TV programs contents in eight different genres from four different TV channels in order to test our prototype system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.17-24
• /
• 2004

In this paper, the wavelet video coding using Low-Band-Shift(LBS) method and multiresolution motion estimation(MRME) is proposed. To overcome shift- variant property on wavelet coefficients, the LBS was proposed. LBS method previously has superior performance in terms of rate-distortion characteristic. However, this method needs more memory and computational complexity. Therefore to reduce computational complexity of video coding using LBS, we combine MRME with LBS. When mm is applied only, it has 7 times as much as existing method's motion vector because each subband has different motion vector using property of LBS, number of motion vector decreases. Proposed method decreases motion vector, and it decreases motion compensated Prediction error by detailed motion estimation. And then it shows better coding performance. Also this method reduces computational amount by smaller search area in higher resolution. The computational complexity of the proposed method is 12.1% of that of existing method at 3-level wavelet transform. The experimental results with the proposed method show about 0.2∼9.7% improvement of MAD performance in case of lossless coding, and 0.1∼2.0㏈ improvement of PSNR performance at 4he same bit rate in case of lossy coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1669-1676
• /
• 2004

In H.264, 7 modes {16${\times}$16, 16${\times}$8, 8${\times}$16, 8${\times}$8, 8${\times}$4, 4${\times}$8, 4${\times}$4) are used to enhance the coding efficiency. The motion vector estimation with 7 modes may require huge computing time. In this paper, to speed up the motion vector estimation procedure while the high image quality remains, we propose a motion vector refinement scheme using the temporary motion vector generated with little computation. The proposed estimation process consists of three phases: Mode decision for a 16${\times}$16 macroblock, Composing a temporary motion vector, Refinement of the temporary motion vector. We demonstrate the effectiveness of the proposed method by computer simulation. In the results, the encoding time consumed by the proposed scheme has been reduced significantly while the encoded video quality remains unchanged.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.128-139
• /
• 2005

Moving object boundary is very important for moving object segmentation. But the moving object boundary shows broken boundary We invent a novel space-oriented boundary linking algorithm to link the broken boundary The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundary and searches forward other terminating pixel to link within a radius. The boundary linking algorithm guarantees shortest distance linking. We also register the background from image sequence. We construct two object masks, one from the result of boundary linking and the other from the registered background, and use these two complementary object masks together for moving object segmentation. We also suppress the moving cast shadow using Roberts gradient operator. The major advantages of the proposed algorithms are more accurate moving object segmentation and the segmentation of the object which has holes in its region using these two object masks. We experiment the algorithms using the standard MPEG-4 test sequences and real video sequence. The proposed algorithms are very efficient and can process QCIF image more than 48 fps and CIF image more than 19 fps using a 2.0GHz Pentium-4 computer.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.712-719
• /
• 2007

In this paper, we propose a new, effective, fast motion estimation algorithms using $4{\times}4$ pixels Hadamard transform. The Hadamard transform has the advantage of simplicity because it uses only addition and subtraction. Motion estimation is composed of three stages. First, it should be decided whether to terminate the search early and use a previous motion vector with DC(Direct Current) coefficients. Then the adaptive matching scan order for motion estimation should be determined according to the image complexity using AC(Alternating Current) coefficients. Experimentally, we adapted this algorithms to MVFAST and PMVFAST algorithms, and the proposed algorithms turn out to be very efficient in terms of computational speed while remaining almost the same in terms of PSNR(Peak Signal-to-Noise Ratio) compared to MVFAST and PMVFAST algorithms.