• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.167-170
• /
• 2004

본 논문에서는 다양한 디지털 컨텐츠들 중에 디지털 비디오에 대한 워터마킹 방법을 제안하였다. 현재 비디오 압축 부호화의 기본 알고리즘으로 사용되는 DCT(discrete cosine transform)는 고압축을 수행할 경우 블록킹 현상이 심하게 나타나는 단점이 있다. 제안한 방법은 이러한 단점을 극복하고 점진적 전송 특성을 갖는 비디오를 위해 웨이브릿 변환 영역에서 SPIHT(set partitioning in hierarchical trees)를 이용한 비디오 부호화 과정에 워터마크를 삽입하였다. SPIHT 부호화 과정에서 비디오 신호의 시간 중복성을 이용한 I 프레임에 대한 이전 프레임의 움직임 벡터를 이용하여 I 프레임에 워터마크를 삽입한다. 워터마크 삽입 시 HVS(human visual system)를 이용하여 움직임 벡터 분석에 의해 선택된 영역에서 지각적 중요 계수 (PSC :perceptual significant coefficient)를 선택하여 워터마크를 삽입한다. 실험 결과 시간 중복성과 HVS를 이용하여 I 프레임에 워터마크를 삽입하였기 때문에 비가시성과 강인성이 우수함을 확인하였다.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1232-1239
• /
• 2006

In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.1000-1010
• /
• 2006

This paper proposes a new architecture for DCT-based motion estimation and compensation. Previous methods do riot take sufficient advantage of the sparseness of 2-D DCT coefficients to reduce execution time. We first derive a recursion equation to perform DCT domain motion estimation more efficiently; we then use it to develop a wavefront array processor (WAP) consisting of processing elements. In addition, we show that the recursion equation enables motion predicted images with different frequency bands, for example, from the images with low frequency components to the images with low and high frequency components. The wavefront way Processor can reconfigure to different motion estimation algorithms, such as logarithmic search and three step search, without architectural modifications. These properties can be effectively used to reduce the energy required for video encoding and decoding. The proposed WAP architecture achieves a significant reduction in computational complexity and processing time. It is also shown that the motion estimation algorithm in the transform domain using SAD (Sum of Absolute Differences) matching criterion maximizes PSNR and the compression ratio for the practical video coding applications when compared to tile motion estimation algorithm in the spatial domain using either SAD or SSD.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1918-1924
• /
• 2010

This In this paper, we propose an efficient algorithm for motion estimation of the image sequences with luminance fluctuation. For such sequences, conventional motion estimation methods based on the difference of pixel values usually produce the erroneous motion information. The proposed algorithm defines the luminance fluctuation as a linear model with gain and offset parameter, and extracts motion information using gradient and phase of the corresponding local region within consecutive frames. Therefor the method is robust to the luminance change of the frames. We test our algorithm for the ground truth sequence with artificially added luminance change and motion, and real sequences corrupted by the flicker. The results shows that the proposed algorithm outperforms the conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.167-177
• /
• 2013

In this paper, a motion adaptive deinterlacing algorithm is proposed. It consists of three parts: (1) modified edge-based line average, (2) pixel-based consequent five-field motion detection, and (3) block-based local characteristic for detecting true motion and calculating the motion intensity by using an improved method which is able to detect the inner part of moving objects precisely as well as to reduce the risk of false detection caused by intrinsic noises in the image. Depending on the detected motion activity level, it combines spatial and temporal methods with weighting factor. Simulations conducted on several video sequences indicate that the performance of the proposed method is superior to the conventional methods in terms of both subjective and objective video quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.78-85
• /
• 2007

With the advancement of the digital broadcasting and popularity of the Internet, recently, many studies are making on the digital watermarking for the copyright protection of digital data. This paper proposes the minimum modification method of motion vector to minimize the degradation of video quality, hiding subtitles of many language and information of OST(original sound track), character profiles, etc. as well as the copyright protection. Our proposed algorithm extracts feature vector by comparing motion vector data with watermark data, and minimize the modification of motion vectors by deciding the inversion of bit. Thus the degradation of video quality is minimized comparing to conventional algorithms. This algorithm also can check data integrity, and retrieve embedded hidden data simply and blindly. And our proposed scheme can be useful for conventional MPEG-1, -2 standards without any increment of bit rate in the compressed video domain. The experimental result shows that the proposed scheme obtains better video quality than other previous algorithms by about $0.5{\sim}1.5dB$.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.154-161
• /
• 2015

A novel multiframe super-resolution (SR) algorithm is presented to overcome the limitation of existing single-image SR algorithms using motion information from adjacent frames in a video. The proposed SR algorithm consists of three steps: i) definition of a local region using interframe motion vectors, ii) multiscale patch generation and adaptive selection of multiple optimum patches, and iii) combination of optimum patches for super-resolution. The proposed algorithm increases the accuracy of patch selection using motion information and multiscale patches. Experimental results show that the proposed algorithm performs better than existing patch-based SR algorithms in the sense of both subjective and objective measures including the peak signal-to-noise ratio (PSNR) and structural similarity measure (SSIM).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1663-1670
• /
• 2014

Recently, lots of research works have been actively focused on the DVC (Distributed Video Coding) techniques which provide a theoretical basis for the implementation of light video encoder. However, most of these studies have showed poorer performances than the conventional standard video coding schemes such as MPEG-1/2, MPEG-4, H.264 etc. In order to overcome the performance limits of the conventional approaches, several channel-divided distributed video coding schemes have been designed in such a way that some information are obtained while generating side information at decoder side and then these are provided to the encoder side, resulting in channel-divided video coding scheme. In this paper, the interpolation scheme by weighted sum of multiple motion-compensated interpolation frames is introduced and a new channel-divided DVC scheme is designed to effectively describe noisy channels based on the motion vector and its matching characteristics. Through several simulations, it is shown that the proposed method performs better than the conventional methods at low bit-rate and keeps the reconstructed visual quality constantly.