• International Journal of Internet, Broadcasting and Communication
• /
• 제7권2호
• /
• pp.168-172
• /
• 2015

In this paper, a balanced bitrate control in transcoding process based on video complexity measure for multi-view system which simultaneously shows multiple channels or video contents in single screen, is proposed. In order to consider the total quality of multiple video streams, the proposed algorithm reduces the complexity of multiple video stream and video quality differences at the same time by controlling bitrates of each stream by weighting when they are stitched for single screen. For the measure of complexity and quality differences between video streams, two different data: histogram of macroblock type and bitrate for each stream are used. The experimental result indicates that proposed algorithm decreases fluctuation of quality difference between videos in the multi-view system.

• ETRI Journal
• /
• 제42권3호
• /
• pp.446-458
• /
• 2020

In this study, an efficient scheme for hiding data directly in partially encrypted versions of high efficiency video coding (HEVC) videos is proposed. The content owner uses stream cipher to selectively encrypt some HEVC-CABAC bin strings in a format-compliant manner. Then, the data hider embeds the secret message into the encrypted HEVC videos using the specific coefficient modification technique. Consequently, it can be used in third-party computing environments (more generally, cloud computing). For security and privacy purposes, service providers cannot access the visual content of the host video. As the coefficient is only slightly modified, the quality of the decrypted video is satisfactory. The encrypted and marked bitstreams meet the requirements of format compatibility, and have the same bit rate. At the receiving end, data extraction can be performed in the encrypted domain or decrypted domain that can be adapted to different application scenarios. Several standard video sequences with different resolutions and contents have been used for experimental evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1301-1314
• /
• 2018

In this paper, we present a low-cost fire detection system using a thermal camera and a smartphone. The developed system collects thermal and RGB videos from the developed camera. To detect fire, candidate fire regions are extracted from videos obtained using a thermal camera. The block mean of variation of adjacent frames is measured to analyze the dynamic characteristics of the candidate fire regions. After analyzing the dynamic characteristics of regions of interest, a fire is determined by the candidate fire regions. In order to evaluate the performance of our system, we compared with a smoke detector, a heat detector, and a flame detector. In the experiments, our fire detection system showed the excellent performance in detecting fire with an overall accuracy rate of 97.8 %.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권4호
• /
• pp.243-249
• /
• 2016

This paper proposes a new watermarking algorithm to embed watermarks in thr process of sample adaptive offsets (SAO) for high efficiency video coding (HEVC) compressed videos. The proposed method embeds two-bit watermark into the SAO offsets for each coding tree unit (CTU). To minimize visual quality degradation caused by embedding watermark, watermark bits are embedded into SAO offset depending on the SAO types of block. Furthermore, the embedded watermark can be extracted by simply adding four offsets and checking their least significant bits (LSB) at the decoder side. The experimental results show that the proposed method achieves 0.3% BD-rate increase without much visual quality degradation. Two-bit watermark for each CTU is embedded for more bit watermarking. In addition, the proposed method requires negligible computational load for watermark insertion and extraction.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권4호
• /
• pp.231-234
• /
• 2016

The next-generation video coding standard known as High-Efficiency Video Coding (HEVC) was developed with the aim of doubling the bitrate reduction offered by H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Several schemes for a fast mode decision have been presented in reference software and in other studies. However, a possible speed-up in conventional schemes is sometimes insignificant for videos that have inhomogeneous spatial and temporal characteristics. This paper proposes a bypass algorithm to skip large-block-size predictions for videos where small block sizes are preferred over large ones. The proposed algorithm does not overlap with those in previous works, and thus, is easily used with other fast algorithms. Consequently, an independent speed-up is possible.

• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.629-637
• /
• 2000

The content-based information retrieval for a multimedia database uses feature information extracted from the compressed videos. This paper presents an effective method to detect scene changes from compressed videos. Scene changes are detected with DC values of DCT coefficients in MPEG-1 encoded video sequences. Instead of decoding full frames. partial macroblocks of each frame, horizontal and vertical macroblocks, are decoded to detect scene changes. This method detects abrupt scene changes by decoding minimal number of blocks and saves a lot of computation time. The performance of the proposed algorithm is analyzed based on the precision and the recall. The experimental results show the effectiveness in computation time and detection rate to detect scene changes of various MPEG-1 video streams.

• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.656-665
• /
• 2000

A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.

• 한국통신학회논문지
• /
• 제32권8C호
• /
• pp.738-744
• /
• 2007

본 논문에서는 농구 비디오의 내용기반 자동 요약 방법을 제안하였다. 의미 있는 요약을 위해, 농구 비디오에 포함되어 있는 스코어 정보를 이용하였다. 스코어 정보는 비디오에 포함된 스코어 자막의 숫자들을 인식한 후, 인식된 스코어의 변화를 분석함에 의해 획득된다. 일반적으로 농구경기의 중요한 이벤트는 3점 슛, 일방적 리드, 역전 등이다. 제안된 방법은 스코어 정보를 활용해 이러한 이벤트들을 검출하였으며, 이를 기반으로 농구 비디오의 요약 및 하이라이트를 생성하였다.

• Journal of Computing Science and Engineering
• /
• 제11권1호
• /
• pp.24-31
• /
• 2017

Face-based video retrieval has become an active and important branch of intelligent video analysis. Face profiling and matching is a fundamental step and is crucial to the effectiveness of video retrieval. Although many algorithms have been developed for processing static face images, their effectiveness in face-based video retrieval is still unknown, simply because videos have different resolutions, faces vary in scale, and different lighting conditions and angles are used. In this paper, we combined content-based and semantic-based image analysis techniques, and systematically evaluated four mainstream local features to represent face images in the video retrieval task: Harris operators, SIFT and SURF descriptors, and eigenfaces. Results of ten independent runs of 10-fold cross-validation on datasets consisting of TED (Technology Entertainment Design) talk videos showed the effectiveness of our approach, where the SIFT descriptors achieved an average F-score of 0.725 in video retrieval and thus were the most effective, while the SURF descriptors were computed in 0.3 seconds per image on average and were the most efficient in most cases.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.253-254
• /
• 2007

We investigate error patterns in compressed multi-view videos and propose a multi-hypothesis algorithm, which is adaptive to the error patterns. Different from multi-hypothesis algorithms for mono-view sequences, the proposed algorithm exploits inter-view correlations in multi-view sequences as well as spatio-temporal correlations. Simulation results demonstrate that the proposed algorithm effectively protects the quality of reconstructed videos against transmission errors.