• Title/Summary/Keyword: 스트림 수

Search Result 1,189, Processing Time 0.031 seconds

Implementation of Software Downloading and Installing for upgrading Digital TV Settop Box (디지털 방송 TV수신기의 기능 업그레이드를 위한 소프트웨어 다운로드와 설치 기능 구현)

  • Ryu Yll-Kwon;Jung Moon-Ryul;Kim Jung-Hwan;Choi Jin-Su;Bang Gun
    • Journal of Broadcast Engineering
    • /
    • v.11 no.1 s.30
    • /
    • pp.66-79
    • /
    • 2006
  • As constant development of digital broadcasting and data broadcasting system, new technology will be introduced to digital broadcasting and new broadcasting service will be appeared. These services need to be changed and processed to suit each services and the software of the receiver need to be upgraded. Though, generally the digital broadcasting receivers are not getting updated once it's delivered to home for long time and it need to be done by hand or collected each one of them with trouble. Therefore this paper suggests a way to overcome these difficulties via broadcasting stream. This research is to describe how three modules-namely (1) Downloader, downloads new software from data carrousel stream, (2) Update Loader, installs the software received by downloader; and (3) Recoverer, recovers the former version of the software if some serious problem has been occurred during downloading and installing the software. This paper tries to realize the accommodation of terrestrial STB based on the new technique and service following ATSC A-97 agreement.

An Improved Algorithm for Building Multi-dimensional Histograms with Overlapped Buckets (중첩된 버킷을 사용하는 다차원 히스토그램에 대한 개선된 알고리즘)

  • 문진영;심규석
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.336-349
    • /
    • 2003
  • Histograms have been getting a lot of attention recently. Histograms are commonly utilized in commercial database systems to capture attribute value distributions for query optimization Recently, in the advent of researches on approximate query answering and stream data, the interests in histograms are widely being spread. The simplest approach assumes that the attributes in relational tables are independent by AVI(Attribute Value Independence) assumption. However, this assumption is not generally valid for real-life datasets. To alleviate the problem of approximation on multi-dimensional data with multiple one-dimensional histograms, several techniques such as wavelet, random sampling and multi-dimensional histograms are proposed. Among them, GENHIST is a multi-dimensional histogram that is designed to approximate the data distribution with real attributes. It uses overlapping buckets that allow more efficient approximation on the data distribution. In this paper, we propose a scheme, OPT that can determine the optimal frequencies of overlapped buckets that minimize the SSE(Sum Squared Error). A histogram with overlapping buckets is first generated by GENHIST and OPT can improve the histogram by calculating the optimal frequency for each bucket. Our experimental result confirms that our technique can improve the accuracy of histograms generated by GENHIST significantly.

Modeling and Analysis of Wireless Lan Traffic (무선 랜 트래픽의 분석과 모델링)

  • Yamkhin, Dashdorj;Lee, Seong-Jin;Won, You-Jip
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.667-680
    • /
    • 2008
  • In this work, we present the results of our empirical study on 802.11 wireless LAN network traffic. We collect the packet trace from existing campus wireless LAN infra-structure. We analyzed four different data sets: aggregate traffic, upstream traffic, downstream traffic, tcp only packet trace from aggregate traffic. We analyze the time series aspect of underlying traffic (byte count process and packet count process), marginal distribution of time series, and packet size distribution. We found that in all four data sets there exist long-range dependent property in byte count and packet count process. Inter-arrival distribution is well fitted with Pareto distribution. Upstream traffic, i.e. from the user to Internet, exhibits significant difference in its packet size distribution from the rests. Average packet size of upstream traffic is 151.7 byte while average packet size of the rest of the data sets are all greater than 260 bytes. Packets with full data payloads constitutes 3% and 10% in upstream traffic and the downstream traffic, respectively. Despite the significant difference in packet size distribution, all four data sets have similar Hurst values. The Hurst alone does not properly explain the stochastic characteristics of the underlying traffic. We model the underlying traffic using fractional-ARIMA (FARIMA) and fractional Gaussian Noise (FGN). While the fractional Gaussian Noise based method is computationally more efficient, FARIMA exhibits superior performance in accurately modeling the underlying traffic.

An Application-Independent Multimedia Adaptation Framework Using Only Minimum Unit Transcoder Set (최소 단위 트랜스코더 집합만을 이용한 응용 독립적 멀티미디어 적응 프레임워크)

  • Chon, Sung-Mi;Ryu, Dong-Yeop;Lim, Young-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.227-235
    • /
    • 2006
  • MPEG-21's digital item adaptation technology becomes a new way for universal multimedia access. It needs transcoder to change media resource's format and so on according to delivery context Then, the use of heavy transcoder with various transcoding functions integrated into one altogether is so complicated and difficult in supporting universal multimedia access. Unit transcoder Is useful is to resolve this question, in which a transcoder has only one transcoding function. This requires considering how to compose a set of unit transcoders. Thus, given a set for end-to-end different service quality pairs according to the character of application as defined by user, this study suggests how to compose complete unit transcoders that can always create one and more transcoding path(s) for each pair in the set. This method has a question of creating too many transcoding paths for each pair or end-to-end different service quality. Thus, this study also suggests the algorithm that generates minimum unit transcoder sets to support multimedia adaptation with minimum unit transcoder. The algorithm suggested was implemented into multimedia stream engine, and this paper describes the results of experiment for this algorithm.

  • PDF

Audio Stream Delivery Using AMR(Adaptive Multi-Rate) Coder with Forward Error Correction in the Internet (인터넷 환경에서 FEC 기능이 추가된 AMR음성 부호화기를 이용한 오디오 스트림 전송)

  • 김은중;이인성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12A
    • /
    • pp.2027-2035
    • /
    • 2001
  • In this paper, we present an audio stream delivery using the AMR (Adaptive Multi-Rate) coder that was adopted by ETSI and 3GPP as a standard vocoder for next generation IMT-2000 service in which includes combined sender (FEC) and receiver reconstruction technique in the Internet. By use of the media-specific FEC scheme, the possibility to recover lost packets can be much increased due to the addition of repair data to a main data stream, by which the contents of lost packets can be recovered. The AMR codec is based on the code-excited linear predictive (CELP) coding model. So we use a frame erasure concealment for CELP-based coders. The proposed scheme is evaluated with ITU-T G.729 (CS-ACELP) coder and AMR - 12.2 kbit/s through the SNR (Signal to Noise Ratio) and the MOS (Mean Opinion Score) test. The proposed scheme provides 1.1 higher in Mean Opinion Score value and 5.61 dB higher than AMR - 12.2 kbit/s in terms of SNR in 10% packet loss, and maintains the communicab1e quality speech at frame erasure rates lop to 20%.

  • PDF

Hidden Markov Model for Gesture Recognition (제스처 인식을 위한 은닉 마르코프 모델)

  • Park, Hye-Sun;Kim, Eun-Yi;Kim, Hang-Joon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.17-26
    • /
    • 2006
  • This paper proposes a novel hidden Markov model (HMM)-based gesture recognition method and applies it to an HCI to control a computer game. The novelty of the proposed method is two-fold: 1) the proposed method uses a continuous streaming of human motion as the input to the HMM instead of isolated data sequences or pre-segmented sequences of data and 2) the gesture segmentation and recognition are performed simultaneously. The proposed method consists of a single HMM composed of thirteen gesture-specific HMMs that independently recognize certain gestures. It takes a continuous stream of pose symbols as an input, where a pose is composed of coordinates that indicate the face, left hand, and right hand. Whenever a new input Pose arrives, the HMM continuously updates its state probabilities, then recognizes a gesture if the probability of a distinctive state exceeds a predefined threshold. To assess the validity of the proposed method, it was applied to a real game, Quake II, and the results demonstrated that the proposed HMM could provide very useful information to enhance the discrimination between different classes and reduce the computational cost.

Video Quality Metric Using One-Dimensional Histograms of Motion Vectors (움직임 벡터의 1차원 히스토그램을 이용한 비디오 화질 평가 척도)

  • Han, Ho-Sung;Kim, Dong-O;Park, Bae-Hong;Sim, Dong-Gyu
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.21-28
    • /
    • 2008
  • This paper proposes a novel reduced-reference assessment method for video quality assessment, in which one-dimensional (1-D) histograms of motion vectors (MVs) are used as features of videos. The proposed method is more efficient than the conventional methods in view of computation time, because the proposed quality metric decodes MVs directly from video stream in the parsing process instead of reconstructing the distorted video at the receiver. Moreover, in view of data size, the propose method is efficient because a sender transmits 1-D histograms of MVs accumulated over whole input video sequences. Here, we use 1-D histograms of MVs accumulated over the whole video sequences, which is different from the conventional methods that assessed each image independently. For testing the similarity between histograms, we use histogram intersection and histogram difference methods. We compare the proposed method with the conventional methods for 52 video clips, which are coded under varying bit rate, image size, and frame rate. Experimental results show that the proposed method is more efficient than the conventional methods and that the proposed method is more similar to the mean opinion score (MOS) than conventional algorithms.

A Query Index for Processing Continuous Queries over RFID Tag Data (RFID 태그 데이타의 연속질의 처리를 위한 질의 색인)

  • Seok, Su-Wook;Park, Jae-Kwan;Hong, Bong-Hee
    • Journal of KIISE:Databases
    • /
    • v.34 no.2
    • /
    • pp.166-178
    • /
    • 2007
  • The ALE specification of EPCglobal is leading the development of RFID standards, includes the Event Cycle Specification (ECSpec) describing how long a cycle is, how to filter RFID tag data and which reader is interested in. The ECSpec is a specification for filtering and collecting RFID tag data. It is registered to a middleware for long time and is evaluated to return results satisfying the requirements included in it. Thus, it is quite similar to the continuous query. It can be transformed into a continuous query as its predicate in WHERE clause is characterized by the long interval. Long intervals cause problems deteriorating insertion and search performance of existing query indices. In this paper, we propose a TLC-index as a new query index structure for long interval data. The TLC-index has hybrid structure that uses the cell construct of CQI-index with the virtual construct of VCR-index for partitioning long intervals. The TLC-index can reduce the storage cost and improve the insertion performance through decomposing long intervals into one or more cell constructs that have long size. It can also improve the search performance through decomposing short intervals into one or more virtual constructs that have short size enough to fit into those intervals.

Cost Effective Remote Subscription scheme for Ubiquitous Convergence IP-based Network (유비쿼터스 컨버젼스 IP 기반 대용량 네트워크에서 비용 절감형 리모트-서브스크립션 기법)

  • Shin, Soo-Young;Yoon, Young-Muk;Park, Soo-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.95-104
    • /
    • 2007
  • Mobile multimedia services such as TV-call or video streaming are gradually becoming popular in the 3rd or more generation mobile network (IMT-2000). Multimedia traffic is expected to continue increasing into the coming years, and IP technology is considered to be the efficient way of transporting such huge volumes of multimedia traffic. IP-based IMT network platform represents an evolution from IMT-2000. The structure of IP-based IMT network as ubiquitous platform is three-layered model : Middleware including Network Control PlatForm (NCPF) and Service Support PlatForm (SSPF), IP-BackBone (IP-BB), access network including sensor network. Mobility Management (MM) architecture in NCPF is proposed for IP-based IMT network in order to manage routing information and location information separately. The generous existing method of multicast control in IP-based IMT network is Remote Subscription. But Remote Subscription has problem that should be reconstructed whole multicast tree when sender in multicast tree moves to another area. To solve this problem, we propose the way to put Multicast-manager in NCPF.

Analysis and solution to the phase concentration and DC-like component of correlation result in Daejeon correlator (대전 상관기의 상관 결과에 나타난 유사 DC 성분과 위상 집중 현상에 대한 원인 분석과 해결 방법)

  • Roh, Duk-Gyoo;Oh, Se-Jin;Yeom, Jae-Hwan;Oh, Chung-Sik;Jung, Jin-Seung;Chung, Dong-Kyu;Yun, Young-Joo;Oyama, Tomoaki;Ozeki, Kensuke;Onuki, Hirofumi
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.3
    • /
    • pp.191-204
    • /
    • 2013
  • In this paper, we investigated the correlation outputs of Daejeon correlator at the viewpoints of the buffer memory setting related to the fine delay tracking and the under/overflow issue in FFT modules, in order to eliminate DC-like component and phase concentration to 0 degree. As the ring buffer memory is being used for the fine delay tracking, the DC-like component in correlation outputs is generated by improper setting of data read/write address, and then that address setting method is modified to exclude a polluted FFT segment in correlation processing when crossing the port/stream boundary. The phase concentration to 0 degree at beginning of bandpass is caused by inadequate scaling factors, which may be the origins of under/overflow occurred at internal computation of FFT stage. With the revised method of the ring buffer memory setting and the scaling factors in FFT, we could obtain higher signal-to-noise ratio and flux density, compared to the previous method, through the correlation processing of true observational data.