• Title/Summary/Keyword: Video length

Search Result 308, Processing Time 0.029 seconds

VIDEO TRAFFIC MODELING BASED ON $GEO^Y/G/{\infty}$ INPUT PROCESSES

  • Kang, Sang-Hyuk;Kim, Ba-Ra
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.12 no.3
    • /
    • pp.171-190
    • /
    • 2008
  • With growing applications of wireless video streaming, an efficient video traffic model featuring modern high-compression techniques is more desirable than ever, because the wireless channel bandwidths are ever limited and time-varying. We propose a modeling and analysis method for video traffic by a class of stochastic processes, which we call '$GEO^Y/G/{\infty}$ input processes'. We model video traffic by $GEO^Y/G/{\infty}$ input process with gamma-distributed batch sizes Y and Weibull-like autocorrelation function. Using four real-encoded, full-length video traces including action movies, a drama, and an animation, we evaluate our modeling performance against existing model, transformed-M/G/${\infty}$ input process, which is one of most recently proposed video modeling methods in the literature. Our proposed $GEO^Y/G/{\infty}$ model is observed to consistently provide conservative performance predictions, in terms of packet loss ratio, within acceptable error at various traffic loads of interest in practical multimedia streaming systems, while the existing transformed-M/G/${\infty}$ fails. For real-time implementation of our model, we analyze G/D/1/K queueing systems with $GEO^Y/G/{\infty}$ input process to upper estimate the packet loss probabilities.

  • PDF

A Study on the Adequate HD Camera Focal Length in the Broadcasting Studio using LED Video Wall (LED 비디오월을 사용하는 방송환경에서 HD 카메라의 적정 초점거리 연구)

  • Choi, Ki-chang;Kwon, Soon-chul;Lee, Seung-hyun
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.5
    • /
    • pp.713-721
    • /
    • 2022
  • In order to use the LED video wall in the broadcasting studio, there are a few things to be aware of. First, since the pixels are closely arranged, a moire phenomenon may occur due to a short arrangement period, and second, the distance between pixels (pixel pitch) may be recorded on the image sensor of the broadcasting camera. When moire occurs or pixel pitch is observed, viewers feel uncomfortable. Moire effect can be reduced by adjusting the shooting distance or angle of the camera, but in order to prevent the pixel pitch from being recorded on the image sensor, secure a sufficient distance between the LED video wall and camera. even when the distance secured, the zoom lens used in the broadcasting studio must be operated by appropriately changing the magnification. If the focal length is changed by changing the magnification to obtain a desired angle of view, the pixel pitch may be unintentionally recorded. In this study we propose the range that the pixel pitch is not observed while changing the magnification ratio of the zoom lens when the distance from the video wall is sufficiently secured. The content was played back on the LED video wall and the LED video wall was recorded on the server using an HD camera equipped with a B4 mount zoom lens

Video Abstracting Using Scene Change Detection and Shot Clustering for Construction of Efficient Video Database (대용량 비디오 데이터베이스 구축을 위하여 장면전환 검출과 샷 클러스터링을 이용한 비디오 개요 추출)

  • Shin Seong-Yoon;Pyo Seong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.2 s.40
    • /
    • pp.111-119
    • /
    • 2006
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with $\chi2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

Analysis of characteristics of YouTube video contents for the development of pattern drafting video (패턴제작 교육용 영상콘텐츠 개발을 위한 유튜브 영상 현황 분석)

  • Kang, Yeo Sun
    • The Research Journal of the Costume Culture
    • /
    • v.27 no.6
    • /
    • pp.599-614
    • /
    • 2019
  • The aim of this study to provide basic reference data for the development of video contents used in pattern drafting education and to explore the possibility of utilizing YouTube videos in such education. Subject videos were selected using the number of views. A total of 596 videos and 28 channels were analyzed for the period July to September 2019 and the results are as follows. With regard to content, there were 27 pattern drafting items, the majority being dress, pants, skirt, blouse and sleeve drafting, although high-level content such as cowl, bustier, corset patterns were also available. Therefore, there is a high likelihood that YouTube videos could be used as educational material, especially as supplementary references to provide specific examples and easy explanations for difficult concepts or method, for students majoring in this field. However, as most videos currently focus on a few items, expanding video content to features a wider variety of clothing items at different levels is necessary. With regard to video length, it mostly ranged from 10 to 15 minutes. It is not advisable to create lengthy lecture-style videos expounding on different principles or variations in pattern drafting when developing educational video material.

Video Abstracting Construction of Efficient Video Database (대용량 비디오 데이터베이스 구축을 위한 비디오 개요 추출)

  • Shin Seong-Yoon;Pyo Seong-Bae;Rhee Yang-Won
    • KSCI Review
    • /
    • v.14 no.1
    • /
    • pp.255-264
    • /
    • 2006
  • Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with ${\chi}^2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

  • PDF

Impact of playout buffer dynamics on the QoE of wireless adaptive HTTP progressive video

  • Xie, Guannan;Chen, Huifang;Yu, Fange;Xie, Lei
    • ETRI Journal
    • /
    • v.43 no.3
    • /
    • pp.447-458
    • /
    • 2021
  • The quality of experience (QoE) of video streaming is degraded by playback interruptions, which can be mitigated by the playout buffers of end users. To analyze the impact of playout buffer dynamics on the QoE of wireless adaptive hypertext transfer protocol (HTTP) progressive video, we model the playout buffer as a G/D/1 queue with an arbitrary packet arrival rate and deterministic service time. Because all video packets within a block must be available in the playout buffer before that block is decoded, playback interruption can occur even when the playout buffer is non-empty. We analyze the queue length evolution of the playout buffer using diffusion approximation. Closed-form expressions for user-perceived video quality are derived in terms of the buffering delay, playback duration, and interruption probability for an infinite buffer size, the packet loss probability and re-buffering probability for a finite buffer size. Simulation results verify our theoretical analysis and reveal that the impact of playout buffer dynamics on QoE is content dependent, which can contribute to the design of QoE-driven wireless adaptive HTTP progressive video management.

Movement Detection Using Keyframes in Video Surveillance System

  • Kim, Kyutae;Jia, Qiong;Dong, Tianyu;Jang, Euee S.
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2022.06a
    • /
    • pp.1249-1252
    • /
    • 2022
  • In this paper, we propose a conceptual framework that identifies video frames in motion containing the movement of people and vehicles in traffic videos. The automatic selection of video frames in motion is an important topic in security and surveillance video because the number of videos to be monitored simultaneously is simply too large due to limited human resources. The conventional method to identify the areas in motion is to compute the differences over consecutive video frames, which has been costly because of its high computational complexity. In this paper, we reduced the overall complexity by examining only the keyframes (or I-frames). The basic assumption is that the time period between I-frames is rather shorter (e.g., 1/10 ~ 3 secs) than the usual length of objects in motion in video (i.e., pedestrian walking, automobile passing, etc.). The proposed method estimates the possibility of videos containing motion between I-frames by evaluating the difference of consecutive I-frames with the long-time statistics of the previously decoded I-frames of the same video. The experimental results showed that the proposed method showed more than 80% accuracy in short surveillance videos obtained from different locations while keeping the computational complexity as low as 20 % compared to the HM decoder.

  • PDF

Performance Evaluation of VBR MPEG Video Storage and Retrieval Schemes in a VOD System (VOD 시스템에서의 가변 비트율 MPEG 비디오 저장 및 검색 기법의 성능 평가)

  • 전용희;박정숙
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.1
    • /
    • pp.13-28
    • /
    • 2001
  • In a VOD(Vide-On-Demand) system, video data are generally stored in magnetic disk array. In order to provide real-time requirement for data retrieval, video streams must be delivered continuously to the clients such that the delivery of continuous media can be guaranteed in a timely fashion. Compared to the increased performance of processors and networks, the performance of magnetic disk systems have improved only modestly. In order to improve the performance of storage system, disk array system is proposed and used. The array system improves I/O performance by placing disks in parallel and retrieving data concurrently. In this paper, two approaches are considered in order to access the video data in a VOD system, which are CTL(Constant Time Length) and CDL(Constant Data Length) access policies. Disk scheduling policies are also classified into the two categories and compared in terms of the maximum allowable video streams with different degrees of disk array synchronization, under the mixed environments in which both data access policy and disk scheduling policy are considered. Among the compared scheduling policies, LOOK was shown to have the best performance. In terms of degree of disk synchronization, more gain was achieved with large degree of synchronization. In comparisons of performance of CTL and CDL, CTL was proved to have a little superior performance in terms of number of maximum allowable streams.

  • PDF

Digital Video Scrambling Method using Intra Prediction Mode of H.264 (H.264 인트라 예측 모드를 이용한 디지털 비디오 스크램블링 방법)

  • Ahn Jinhaeng;Jeon Byeungwoo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.2 s.302
    • /
    • pp.59-68
    • /
    • 2005
  • The amount of digitalized contents has been rapidly increased, but the main distribution channel of them is Internet which is easily accessible. Therefore 'security' necessarily arises as one of the most important issues and the method of protecting contents becomes a major research topic as much as data coding techniques. In recent years, many developers have studied on techniques that allow only authorized person to access contents. Among them the scrambling method is one of well-known security techniques. In this paper, we propose a simple and effective digital video scrambling method which utilizes the intra block properties of a recent video coding technique, H.264. Since intra prediction modes are adopted in H.264 standard, it is easy to scramble a video sequence with modification of the intra prediction modes. In addition to its simplicity, the proposed method does not increase bit rate after scrambling. The inter blocks are also distorted by scrambling intra blocks only. This paper introduces a new digital video scrambling method and verifies its effectiveness through simulation.

Error Concealment Based on Semantic Prioritization with Hardware-Based Face Tracking

  • Lee, Jae-Beom;Park, Ju-Hyun;Lee, Hyuk-Jae;Lee, Woo-Chan
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.535-544
    • /
    • 2004
  • With video compression standards such as MPEG-4, a transmission error happens in a video-packet basis, rather than in a macroblock basis. In this context, we propose a semantic error prioritization method that determines the size of a video packet based on the importance of its contents. A video packet length is made to be short for an important area such as a facial area in order to reduce the possibility of error accumulation. To facilitate the semantic error prioritization, an efficient hardware algorithm for face tracking is proposed. The increase of hardware complexity is minimal because a motion estimation engine is efficiently re-used for face tracking. Experimental results demonstrate that the facial area is well protected with the proposed scheme.

  • PDF