• Title/Summary/Keyword: Real-Time Streaming

Search Result 385, Processing Time 0.025 seconds

Multi-purpose System for Transmitting Images/voices Based on MPEG-4 Streaming (MPEG-4 스트리밍 기반의 다목적 영상/음성 전송 시스템)

  • 박성욱;황수철;박종욱
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.6 no.2
    • /
    • pp.47-53
    • /
    • 2001
  • Real-time multimedia transmit services like internet broadcasting, web-based education, chatting, conference, circumference observation etc. by using internet are given a great deal of weight on most recently internet services. In these way, various internet services are presented and there applications are also gradually spreaded because of improvement MPEG and streaming processing techniques. But currently internet service is a development of system which has independent function of above services. And a research and development of system which have a multipurpose internet service are insufficiency. In this paper, we design and develop system(RealCam SUN A/V) for transmitting images and voices based on MPEG4 streaming. As a result of our research, it made possible to transmit images with 15 frame/sec in 160×120 frame size at 56Kbps and 30 frame/sec in 640×480 frame size at 512Kbps. And also we can apply this system as multipurpose function to circumference observation and internet broadcasting etc., by transmitting voices, images and control signal simultaneously.

  • PDF

VirtualDub as a Useful Program for Video Recording in Real-time TEM Analysis (실시간 TEM 분석에 유용한 영상 기록 프로그램, VirtualDub)

  • Kim, Jin-Gyu;Oh, Sang-Ho;Song, Kyung;Yoo, Seung-Jo;Kim, Young-Min
    • Applied Microscopy
    • /
    • v.40 no.1
    • /
    • pp.47-51
    • /
    • 2010
  • The capability of real-time observation in TEM is quite useful to study dynamic phenomena of materials in a certain variable ambience. In performing the experiment, the choice of video recording program is an important factor to obtain high quality of movie streaming. Window Movie Maker (WMM) is generally recommended as a default video recording program if one uses "DV Capture" function in DigitalMicrograph$^{TM}$ (DM) software. However, the image quality does not often satisfy the condition for high-resolution microscopic analysis since the severe information loss in the final result occurs during the conversion process. As a good candidate to overcome this problem, Virtual-Dub is highly recommended since the information loss can be minimized through the streaming process. In this report, we demonstrated how useful VirtualDub works in a high-resolution movie recording. Quantitative comparison of the information quality between the images recorded by each software, WMM and VirtualDub, was carried out based on histogram analysis. As a result, the image recorded by VirtualDub was improved ~13% in brightness and ~122% in contrast compared with the image obtained by WMM at the same imaging condition. Remarkably, the gray gradation (meaning an amount of information) becomes wider up to ~115% than that of the WMM result.

A Real-Time Scheduling Technique on Multi-Core Systems for Multimedia Multi-Streaming (다중 멀티미디어 스트리밍을 위한 멀티코어 시스템 기반의 실시간 스케줄링 기법)

  • Park, Sang-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1478-1490
    • /
    • 2011
  • Recently, multi-core processors have been drawing significant interest from the embedded systems research and industry communities due mainly to their potential for achieving high performance and fault-tolerance at low cost in such products as automobiles and cell phones. To process multimedia data, a scheduling algorithm is required to meet timing constraints of periodic tasks in the system. Though Pfair scheduling algorithm can meet all the timing constraints while achieving 100% utilization on multi-core based system theoretically, however, the algorithm incurs high scheduling overheads including frequent core migrations and system-wide synchronizations. To mitigate the problems, we propose a real-time scheduling algorithm for multi-core based system so that system-wide scheduling is performed only when it is absolutely necessary. Otherwise the proposed algorithm performs scheduling within each core independently. The experimental results by extensive simulations show that the proposed algorithm dramatically reduces the scheduling overheads up to as negligible one when the utilization is under 80%.

An Efficient Algorithm for Streaming Time-Series Matching that Supports Normalization Transform (정규화 변환을 지원하는 스트리밍 시계열 매칭 알고리즘)

  • Loh, Woong-Kee;Moon, Yang-Sae;Kim, Young-Kuk
    • Journal of KIISE:Databases
    • /
    • v.33 no.6
    • /
    • pp.600-619
    • /
    • 2006
  • According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

Implementation of Real-Time Image Blurring System for User Privacy Support (사용자 보호를 위한 실시간 이미지 모자이크 처리 시스템 개발)

  • Minyeong Kim;Suah Jeon;Jihoon Lee
    • Journal of the Semiconductor & Display Technology
    • /
    • v.22 no.1
    • /
    • pp.39-42
    • /
    • 2023
  • Recently, with the explosive increase of video streaming services, real-time live broadcasting has also increased, which leads to an infringement problem for user privacy. So, to solve such problems, we proposed the real image blurring system using dlib face-recognition library. 68 face landmarks are extracted and convert into 128 vector values. After that the proposed system tries to compare this value with the image in the database, and if it is over 0.45, it is considered as different person and image blurring processing is performed. With the proposed system, it is possible to solve the problem of user privacy infringement, and also to be utilized to detect the specific person. Through experimental results, the proposed system has an accuracy of more than 90% in terms of face recognition.

  • PDF

Substream-based out-of-sequence packet scheduling for streaming stored media (저장매체 스트리밍에서 substream에 기초한 비순차 패킷 스케줄링)

  • Choi Su Jeong;Ahn Hee June;Kang Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1469-1483
    • /
    • 2004
  • We propose a packet scheduling algorithms for streaming media. We assume that the receiver periodically reports back the channel throughput. From the original video data, the importance level of a video packet is determined by its relative position within its group of pictures, taking into account the motion-texture discrimination and temporal scalability. Thus, we generate a number of nested substreams. Using feedback information from the receiver and statistical characteristics of the video, we model the streaming system as a queueing system, compute the run-time decoding failure probability of a Same in each substream based on effective bandwidth approach, and determine the optimum substream to be sent at that moment in time. Since the optimum substream is updated periodically, the resulting sending order is different from the original playback order. From experiments with real video data, we show that our proposed scheduling scheme outperforms the conventional sequential sending scheme.

Performance analysis of private multimedia caching network based on wireless local area network (WLAN 기반 개인형 멀티미디어 캐싱 네트워크 성능 분석)

  • Ban, Tae-Won;Kim, Seong Hwan;Ryu, Jongyeol;Lee, Woongsup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.8
    • /
    • pp.1486-1491
    • /
    • 2017
  • In this paper, we propose a private multimedia caching scheme based on wireless local area network (WLAN) to improve the quality of service for high capacity and high quality multimedia streaming services which are recently increasing and to reduce the traffic load of core networks. The proposed caching scheme stores multimedia in the storage device mounted on WLAN APs and provides streaming services on its own without Internet connection in accordance with the request from clients. We have implemented a test network based on real commercial networks and measured the performance of the proposed caching scheme in terms of frames per second (FPS) and buffering time. According to the performance measurement results, the proposed caching scheme can reduce the average buffering time by 73.3% compared to the conventional streaming scheme. In addition, the proposed caching scheme can also improve the average FPS by 71.3% compared to the conventional streaming scheme.

Experimental Study on Electrokinetic Streaming Potential in Micropore Channels of Hollw-Fiber Based on General Helmholtz-Smoluchowski's Principle (일반적 Helmholtz-Smoluchowski 원리에 따른 중공사 미세기공 채널에서의 계면동전기 흐름전위에 관한 실험연구)

  • 전명석;조홍일
    • Membrane Journal
    • /
    • v.12 no.1
    • /
    • pp.41-50
    • /
    • 2002
  • The streaming potential generated by the electrokinetic flow within electric double layer of charged microchannel is applied to determine the zeta potential of hollow-fiber membrane pore by using the general Helmholtz-Smoluchowski equation. The streaming potential is know to provide a useful real-time information on the surface property and the interaction between pore and particles in actual situations and physicochemical conditions. The influence of physicochemical parameters upon the filtration with hollow-fibers has been examined with an in-situ and simultaneously monitoring the streaming potential as well as permeate flux. In particular, the present study examined an experimental method to identify the effect of cake layer which can vary according to the axial position of a hollow-fiber and the progress of membrane fouling by measuring the position-dependent streaming potential. As the latex concentration increases, the permeate flux decreased but the streaming potential increased. The growth of cake layer has been mire developed with increasing latex concentration, however, the effect of surface charges of latexes deposited on the membrane surface leads to increase the streaming potential. With increasing ionic concentration of KCI, both the permeate flux and the streaming potential decrease. The increase of ionic concentration provides a compact cake layer due to the shrinkage of Debye length and the decreased streaming potential results from the weakened ionic flows owing to a thin diffusive double layer.

A Study of Real-time SVC Bitstream Extraction for QoS guaranteed Streaming (QoS 기반 스트리밍 서비스를 위한 실시간 SVC 비트스트림 추출기에 대한 연구)

  • Kim, Duck-Yeon;Bae, Tae-Meon;Kim, Young-Suk;Ro, Yong-Man;Choi, Hae-Chul;Kim, Jae-Gon
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.513-516
    • /
    • 2005
  • SVC(Scalable Video coding) is the standardization of MPEG that aims to support multi spatial, temporal, and quality layers. We can support the video service guaranteeing the QoS in varied network circumstance by using SVC bitstream. In this paper, we propose the real-time SVC bitstream extractor that is able to extract the bitstream with varied frame rate and SNR quality in real-time. To do, extraction processing needs to be performed by GOP unit. As well , essential bitstream information for real-time extraction is aquired before doing extraction process. The proposed method is implemented by using JSVM 2.0. Experimental results show that the proposed method is valid.

  • PDF

Design and Implementation of CCTV Remote Real-time Monitoring and Context Reporting System using Xcode (Xcode를 이용한 CCTV 원격 실시간 모니터링 및 상황 알림보고 시스템의 설계 및 구현)

  • Yang, Soo-Mi;Kim, Yu-Rim
    • Convergence Security Journal
    • /
    • v.15 no.1
    • /
    • pp.83-89
    • /
    • 2015
  • In the wide area surveillance system including many CCTVs, application for remote realtime monitoring is designed and implemented. The applications using Xcode provide secure administrator interface from headquarters. Through the efficient and intuitive interface, it delivers real-time context reports and inference results. For the user convenience, it includes push alarm of events, SNS, Media streaming service for real-time monitoring uses Wirecast and Wowza media server. Wowza stream engine provides URL accommodating development specification. Mobile devices can receive real-time stream data. Performance evaluation in the processing is provided.