• ETRI Journal
• /
• v.27 no.6
• /
• pp.713-724
• /
• 2005

This paper focuses on the problem of key-frames coding and proposes a new promising approach based on the use of fractals. The summary, made of a set of key-frames selected from a full-length video sequence, is coded by using a 3D fractal scheme. This allows the video presentation tool to expand the video sequence in a "natural" way by using the property of the fractals to reproduce the signal at several resolutions. This feature represents an important novelty of this work with respect to the alternative approaches, which mainly focus on the compression ratio without taking into account the presentation aspect of the video summary. In devising the coding scheme, we have taken care of the computational complexity inherent in fractal coding. Accordingly, the key-frames are first wavelet transformed, and the fractal coding is then applied to each subband to reduce the search range. Experimental results show the effectiveness of the proposed approach.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.147-153
• /
• 1998

This paper provides a method for video augmentation using image interpolation. In computer graphics or augmented reality, 3D information of a model object is necessary to generate 2D views of the model, which are then inserted into or overlayed on environmental views or real video frames. However, we do not require any three dimensional model but images of the model object at some locations to render views according to the motion of video camera which is calculated by an SFM algorithm using point matches under weak-perspective (scaled-orthographic) projection model. Thus, a linear view interpolation algorithm is applied rather than a 3D ray-tracing method to get a view of the model at different viewpoints from model views. In order to get novel views in a way that agrees with the camera motion the camera coordinate system is embedded into model coordinate system at initialization time on the basis of 3D information recovered from video images and model views, respectively. During the sequence, motion parameters from video frames are used to compute interpolation parameters, and rendered model views are overlayed on corresponding video frames. Experimental results for real video frames and model views are given. Finally, discussion on the limitations of the method and subjects for future research are provided.

• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1492-1500
• /
• 2015

In recent crime scene, there is the captured crime scene video at least one. So video files recorded on storage media often provide important evidence. Criminals often attempt to destroy storage saved crime scene video. For this reason recovery of a damaged or deleted video file is important to resolve criminal cases in aspects of digital forensic. In the recent, there is a study to recover video file based on video frames, but it is very poor time efficiency when the connecting video frames. This paper proposed advanced frame-based recovery technique of a damaged video files using time information. We suggest a new connecting algorithm to connect video frames using recorded time information in front of video frame. We also evaluate performance in aspects of time and experiment result shows that proposed method improves performance.

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

In video coding, the goal of rate control (RC) is not only to avoid the undesirable fluctuation in bit allocation, but also to provide a good visual perception. In this paper, a novel frame-level rate control algorithm for High Efficiency Video Coding (HEVC) is proposed. Firstly a model that reveals the relationship between bit per pixel (bpp), the bitrate of the intra frame and the bitrate of the subsequent inter frames in a group of pictures (GOP) is established, based on which the target bitrate of the first intra frame is well estimated. Then a novel frame-level bit allocation algorithm is developed, which provides a robust bit balancing scheme between the intra frame and the inter frames in a GOP to achieve the visual quality smoothness throughout the whole sequence. Our experimental results show that when compared to the RC scheme for HEVC encoder HM-16.0, the proposed algorithm can produce reconstructed frames with more consistent objective video quality. In addition, the objective visual quality of the reconstructed frames can be improved with less bitrate.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.731-739
• /
• 2017

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low complexity video sampling. In DCVS schemes, motion estimation & motion compensation is employed at the decoder side, similarly to distributed video coding (DVC), for a low-complex encoder. However, since a simple BCS-SPL algorithm is applied to a residual arising from motion estimation and compensation in conventional MC-BCS-SPL (motion compensated block compressed sensing with smoothed projected Landweber) scheme, the reconstructed visual qualities are severly degraded in Wyner-Ziv (WZ) frames. Furthermore, the scheme takes lots of iteration to reconstruct WZ frames. In this paper, the conventional MC-BCS-SPL algorithm is improved to be operated in more effective way in WZ frames. That is, first, the proposed algorithm calculates a correlation coefficient between two reference key frames and, then, by selecting adaptively the reference frame, the residual reconstruction in pixel domain is performed to the conventional BCS-SPL scheme. Experimental results show that the proposed algorithm achieves significantly better visual qualities than conventional MC-BCS-SPL algorithm, while resulting in the significant reduction of the decoding time.

• International Journal of Contents
• /
• v.5 no.2
• /
• pp.32-37
• /
• 2009

A new video watermarking scheme with robustness against collusion and synchronization attacks is presented. We propose to embed only a few copies of the watermark along the temporal axis into frames, which are located at the borders of each two different plotlines of the video. As a result, each change of the video plotline is transformed into pulse, which is used for watermark embedding and extraction. In addition, since we embed a watermark only into a small number of frames, the distortions of the video are reduced to minimum. Experimental results show the robustness of the proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1109-1116
• /
• 2011

In this paper, we propose a new and fast method for assigning the number of key frames to each shot. At first we segment the entire video sequence into elementary content unit called shots and then the key frame allocation is performed by calculating the accumulated value of AF(activity function). The proposed algorithm is based on the amount of content variation using DC images extracted from compressed video. By assigning the number of key frames to the shot that has the largest value of content function, one key frame is assigned at a time until you run out of given all key frames. The main advantage of our proposed method is that we do not need to use time-exhaustive computations in allocating the key frames over the shot and can perform it fully automatically.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.37-43
• /
• 2016

This paper introduces a method for video shot group detection needed for efficient management and summary of video. The proposed method detects shots based on low-level visual properties and performs temporal and spatial clustering based on visual similarity of neighboring shots. Shot groups created from temporal clustering are further clustered into small groups with respect to visual similarity. A set of representative shot frames are selected from each cluster of the smaller groups representing a scene. Shots excluded from temporal clustering are also clustered into groups from which representative shot frames are selected. A number of video clips are collected and applied to the method for accuracy of shot group detection. We achieved 91% of accuracy of the method for shot group detection. The number of representative shot frames is reduced to 1/3 of the total shot frames. The experiment also shows the inverse relationship between accuracy and compression rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2866-2880
• /
• 2014

We propose a video denoising method based on Kalman filter to reduce the noise in video sequences. Firstly, with the strong spatiotemporal correlations of neighboring frames, motion estimation is performed on video frames consisting of previous denoised frames and current noisy frame based on intensity and structure tensor. The current noisy frame is processed in temporal domain by using motion estimation result as the parameter in the Kalman filter, while it is also processed in spatial domain using the Wiener filter. Finally, by weighting the denoised frames from the Kalman and the Wiener filtering, a satisfactory result can be obtained. Experimental results show that the performance of our proposed method is competitive when compared with state-of-the-art video denoising algorithms based on both peak signal-to-noise-ratio and structural similarity evaluations.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.339-345
• /
• 2007

Video transcoding is a technique used to convert a compressed input video stream with an arbitrary format, size, and bitrate into a different attribute video stream different attributes to provide a efficient video streaming service for the customers is dispersed in the heterogeneous networks. Specifically, frames deletion occur in a transcoding scheme that exploits the adjustment of frame rate, and at this time, the loss in temporal relation among frames due to frame deletion is compensated for the prediction of motion estimation by reusing motion vectors in the would-be deleted frames. But the processing time for transcoding don't have an improvement as much as our expectation because transcoding is done only within the transcoder. So in this paper, we propose a new transcoding algorithm based on prediction period to improve transcoding-related processing time. For this, we also modify the existing encoder so as to adjust dynamically frame rate based on the prediction period and deletion period of frames. To check how the proposed algorithm works nicely, we implement a video streaming system with the new transcoder and encoder to which it is applied. The result of the performance test shows that the streaming system with proposed algorithm improve 60% above in processing time and also PSNR have a good performance while the quality of pictures is preserved.