• 한국멀티미디어학회논문지
• /
• 제3권2호
• /
• pp.121-132
• /
• 2000

본 대부분의 비디오 인덱싱 어플리케이션들은 빠르고 효과적인 저장, 브라우징, 검색 기법들을 요구한다. 현재까지 연구된 많은 기법들은 그 처리 영역이 화소 영역에 대해서만 다루어 왔다. 이런 접근은 멀티미디어 데이터가 일반적으로 압축된 형태로 저장되기 때문에 해독, 재압축에 따른 높은 오버헤드를 초래한다. 반면에 압축된 비디오 데이터가 주어질 때, 압축된 데이터를 직접 분석할 수 있다면 화소단위 처리에서 생기는 오버헤드를 피할 수 있다. 본 논문에서, 압축된 비디오 스트림 정보를 직접 분석하여 비디오 인덱싱에 유용한 특징들을 추출한다. 이러한 특징들을 이용하여 컷 검출을 위한 기법을 유도하여 스트림을 샷으로 분할한다. 또한 본 논문에서, 공간적 정보(DCT 계수)와 시간적 정보(움직임 벡터)를 이용하여 간단한 키 프레인 선택 기법과 효과적인 비디오 인덱싱 기법을 제안한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.190-192
• /
• 2004

In this paper, we propose a low bit-rate embedded video compression scheme with 3-D block partition coding in the wavelet domain. The proposed video compression scheme includes multi-level 3-dimensional dyadic wavelet decomposition, raster scanning within each subband, formation of block, 3-D partitioning of block, and adaptive arithmetic entropy coding. Although the proposed video compression scheme is quit simple, it produces bit-stream with good features, including SNR scalability from the embedded nature. Experimental results demonstrate that the proposed video compression scheme is quit competitive to other good wavelet-based video coders in the literature.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.99-102
• /
• 1998

As multimedia communication services have been widely spreading, the amount of video traffic is rapidly increasing in B-ISDN environment based on the ATM technology. The image quality of MPEG services is very sensitive to the cell losses in ATM network, since each cell contains information needed at decoding process. Since the number of cells in each frame of MPEG is variable, this video smoothing technology need to prepare a buffer for no overflow or underflow at the transmission, requires that some number of cells be taken to the buffer in client before the playback of video. To ensure the high quality image of video, the video smoothing is scheduled by a Group of Picture unit. In this paper, we then apply the theory to reds nightmare encoded in MPEG, and find minimum smoothing buffer size, initial buffer size. It can be used to study the smoothing of stored video.

• International Journal of Contents
• /
• 제4권2호
• /
• pp.24-28
• /
• 2008

In this paper, we propose a new approach for content-based video retrieval using non-parametric based motion classification in the shot-based video indexing structure. Our system proposed in this paper has supported the real-time video retrieval using spatio-temporal feature comparison by measuring the similarity between visual features and between motion features, respectively, after extracting representative frame and non-parametric motion information from shot-based video clips segmented by scene change detection method. The extraction of non-parametric based motion features, after the normalized motion vectors are created from an MPEG-compressed stream, is effectively fulfilled by discretizing each normalized motion vector into various angle bins, and by considering the mean, variance, and direction of motion vectors in these bins. To obtain visual feature in representative frame, we use the edge-based spatial descriptor. Experimental results show that our approach is superior to conventional methods with regard to the performance for video indexing and retrieval.

• 한국통신학회논문지
• /
• 제27권10A호
• /
• pp.951-961
• /
• 2002

유한한 DTV 디지털 스트림(digital stream)을 반복 재생할 경우, 반복되는 시점에서 일반적으로 블랙화면이나 음의 끊어짐과 같은 불연속 현상이 발생한다. 본 논문에서는 스트림 반복 재생시의 불연속 현상의 원인을 소스(source) 및 스트림(stream)의 재생시간 분석을 통하여 규명한다. 또한 이 현상을 제거하기 위한 비디오 프레임율(frame rate)과 오디오 프레임율, 및 트랜스포트 스트림 (transport stream, TS) 전송율 사이의 관계를 구한다. 이 관계식을 이용하여 반복 재생시 불연속이 발생하지 않는 최소의 소스, 기초 스트림 (elementary stream, ES) 및 TS 제작 방법을 제안한다. 제안된 방법으로 구현된 ES와 TS를 방송시스템에 적용하여 실험한 결과 반복 재생시 불연속 현상이 발생하지 않음을 확인한다.

• International Journal of Advanced Culture Technology
• /
• 제2권1호
• /
• pp.14-19
• /
• 2014

In this paper, we propose a stream based patching technique in order to reduce demands of network output bandwidth required to provide the true video-on-demand (VoD) service in a Multimedia server. The proposed scheme calculates required streams to clients accurately by analyzing temporal relationships between already arrived requests in a multimedia server and still progressing streams, and then transmits streams freshly. Since our stream based patching technique induces new linking stream which is playing a link role between long and short patching streams, it reduces demand of network output bandwidth required to provide the true VoD service in a multimedia server. Accordingly, we know that the proposed scheme improves service latency and defection rate than those of existing patching technique by a simulation study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.782-804
• /
• 2011

In video-based recognition systems, stationary cameras are used to monitor an area of interest. These systems focus on a segmentation of the foreground in the video stream and the recognition of the events occurring in that area. The usual approach to discriminating the foreground from the video sequence is background subtraction. This paper presents a novel background subtraction method based on a probabilistic approach. We represent the posterior probability of the foreground based on the current image and all past images and derive an updated method. Furthermore, we present an efficient fusion method for the color and edge information in order to overcome the difficulties of existing background subtraction methods that use only color information. The suggested method is applied to synthetic data and real video streams, and its robust performance is demonstrated through experimentation.

• 한국멀티미디어학회논문지
• /
• 제15권6호
• /
• pp.693-700
• /
• 2012

The effective extraction of key frames from a video stream is an essential task for summarizing and representing the content of a video. Accordingly, this paper proposes a new and fast method for extracting key frames from a compressed video. In the proposed approach, after the entire video sequence has been segmented into elementary content units, called shots, key frame extraction is performed by first assigning the number of key frames to each shot, and then distributing the key frames over the shot using a probabilistic approach to locate the optimal position of the key frames. The main advantage of the proposed method is that no time-consuming computations are needed for distributing the key frames within the shots and the procedure for key frame extraction is completely automatic. Furthermore, the set of key frames is independent of any subjective thresholds or manually set parameters.

• 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)
• /
• 제7권12호
• /
• pp.3200-3219
• /
• 2013

This paper proposes an adaptive combined scalable video coding (CSVC) system for video transmission over MIMO-OFDM (Multiple-Input Multiple-Output-Orthogonal Frequency Division Multiplexing) broadband wireless communication systems. The scalable combination method of CSVC adaptively combines the medium grain scalable (MGS), the coarse grain scalable (CGS) and the scalable spatial modes with the limited feedback partially from channel state information (CSI) of MIMO-OFDM systems. The objective is to improve the average of peak signal-to-noise ratio (PSNR) and bit error rate (BER) of the received video stream by exploiting partial CSI of video sources and channel condition. Experimental results show that the delivered quality using the proposed adaptive CSVC over MIMO-OFDM system performs better than those proposed previously in the literature.