• Title/Summary/Keyword: multimedia data

Search Result 3,811, Processing Time 0.036 seconds

The Construction of QoS Integration Platform for Real-time Negotiation and Adaptation Stream Service in Distributed Object Computing Environments (분산 객체 컴퓨팅 환경에서 실시간 협약 및 적응 스트림 서비스를 위한 QoS 통합 플랫폼의 구축)

  • Jun, Byung-Taek;Kim, Myung-Hee;Joo, Su-Chong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.11S
    • /
    • pp.3651-3667
    • /
    • 2000
  • Recently, in the distributed multimedia environments based on internet, as radical growing technologies, the most of researchers focus on both streaming technology and distributed object thchnology, Specially, the studies which are tried to integrate the streaming services on the distributed object technology have been progressing. These technologies are applied to various stream service mamgements and protocols. However, the stream service management mexlels which are being proposed by the existing researches are insufficient for suporting the QoS of stream services. Besides, the existing models have the problems that cannot support the extensibility and the reusability, when the QoS-reiatedfunctions are being developed as a sub-module which is suited on the specific-purpose application services. For solving these problems, in this paper. we suggested a QoS Integrated platform which can extend and reuse using the distributed object technologies, and guarantee the QoS of the stream services. A structure of platform we suggested consists of three components such as User Control Module(UCM), QoS Management Module(QoSM) and Stream Object. Stream Object has Send/Receive operations for transmitting the RTP packets over TCP/IP. User Control ModuleI(UCM) controls Stream Objects via the COREA service objects. QoS Management Modulel(QoSM) has the functions which maintain the QoS of stream service between the UCMs in client and server. As QoS control methexlologies, procedures of resource monitoring, negotiation, and resource adaptation are executed via the interactions among these comiXments mentioned above. For constmcting this QoS integrated platform, we first implemented the modules mentioned above independently, and then, used IDL for defining interfaces among these mexlules so that can support platform independence, interoperability and portability base on COREA. This platform is constructed using OrbixWeb 3.1c following CORBA specification on Solaris 2.5/2.7, Java language, Java, Java Media Framework API 2.0, Mini-SQL1.0.16 and multimedia equipments. As results for verifying this platform functionally, we showed executing results of each module we mentioned above, and a numerical data obtained from QoS control procedures on client and server's GUI, while stream service is executing on our platform.

  • PDF

Design and Implementation of Clipcast Service via Terrestrial DMB (지상파 DMB를 이용한 클립캐스트 서비스 설계 및 구현)

  • Cho, Suk-Hyun;Seo, Jong-Soo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.23-32
    • /
    • 2011
  • Design and Implementation of Clipcast Service via Terrestrial DMB This paper outlines the system design and the implementation process of clipcast service that can send clips of video, mp3, text, images, etc. to terrestrial DMB terminals. To provide clipcast service in terrestrial DMB, a separate data channel needs to be allocated and this requires changes in the existing bandwidth allocation. Clipcast contents can be sent after midnight at around 3 to 4 AM, when terrestrial DMB viewship is low. If the video service bit rate is lowered to 352 Kbps and the TPEG service band is fully used, then 320 Kbps bit rate can be allocated to clipcast. To enable clipcast service, the terminals' DMB program must be executed, and this can be done through SMS and EPG. Clipcast service applies MOT protocol to transmit multimedia objects, and transmits twice in carousel format for stable transmission of files. Therefore, 72Mbyte data can be transmitted in one hour, which corresponds to about 20 minutes of full motion video service at 500Kbps data rate. When running the clip transmitted through terrestrial DMB data channel, information regarding the length of each clip is received through communication with the CMS(Content Management Server), then error-free files are displayed. The clips can be provided to the users as preview contents of the complete VOD contents. In order to use the complete content, the user needs to access the URL allocated for that specific content and download the content by completing a billing process. This paper suggests the design and implementation of terrestrial DMB system to provide clipcast service, which enables file download services as provided in MediaFLO, DVB-H, and the other mobile broadcasting systems. Unlike the other mobile broadcasting systems, the proposed system applies more reliable SMS method to activate the DMB terminals for highly stable clipcast service. This allows hybrid, i.e, both SMS and EPG activations of terminals for clipcast services.

Design and Implementation of Content-based Video Database using an Integrated Video Indexing Method (통합된 비디오 인덱싱 방법을 이용한 내용기반 비디오 데이타베이스의 설계 및 구현)

  • Lee, Tae-Dong;Kim, Min-Koo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.661-683
    • /
    • 2001
  • There is a rapid increase in the use of digital video information in recent years, it becomes more important to manage video databases efficiently. The development of high speed data network and digital techniques has emerged new multimedia applications such as internet broadcasting, Video On Demand(VOD) combined with video data processing and computer. Video database should be construct for searching fast, efficient video be extract the accurate feature information of video with more massive and more complex characteristics. Video database are essential differences between video databases and traditional databases. These differences lead to interesting new issues in searching of video, data modeling. So, cause us to consider new generation method of database, efficient retrieval method of video. In this paper, We propose the construction and generation method of the video database based on contents which is able to accumulate the meaningful structure of video and the prior production information. And by the proposed the construction and generation method of the video database implemented the video database which can produce the new contents for the internet broadcasting centralized on the video database. For this production, We proposed the video indexing method which integrates the annotation-based retrieval and the content-based retrieval in order to extract and retrieval the feature information of the video data using the relationship between the meaningful structure and the prior production information on the process of the video parsing and extracting the representative key frame. We can improve the performance of the video contents retrieval, because the integrated video indexing method is using the content-based metadata type represented in the low level of video and the annotation-based metadata type impressed in the high level which is difficult to extract the feature information of the video at he same time.

  • PDF

Design and Performance Evaluation of a New SR-ARQ with an Adaptive Timer and Delayed NAK for Improving Handover Performance in Next-Generation Mobile Communication Networks (차세대 이동 통신망에서 핸드오버 성능 향상을 위한 적응형 타이머와 지연 NAK을 이용한 SR-ARQ 설계 및 성능 평가)

  • Park, Man-Kyu;Choi, Yun-Chul;Lee, Jae-Yong;Kim, Byung-Chul;Kim, Dae-Young;Kim, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.1
    • /
    • pp.48-59
    • /
    • 2009
  • Next generation mobile communication system will have various access networks and provide seamless multimedia data service to mobile nodes. The WiNGS system, one of these access network, has superior RAT(Radio Access Technology) and network connectivity other than previous ones. In this paper, we propose link-layer SR-ARQ between mobile node and WAGW to solve packet re-ordering problem during handover. In the proposed scheme, we apply the adaptive timer at the SR-ARQ sender to reduce unnecessary packet retransmission during handoff and delayed NAK algorithm at the SR-ARQ receiver for delaying NAK response due to temporary out-of-sequenced frames. We evaluate the performance of the proposed scheme by implementing the new SR-ARQ protocol at the link-layer using ns-2 simulator, and show the handover performance is improved greatly by preventing unnecessary retransmission.

A Study on Median Filter's Improvement for Removal of Impulse Noise (임펄스 잡음 제거를 위한 미디언 필터의 개선에 관한 연구)

  • Lee, Kyung-Hyo;Ryu, Ji-Goo;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.165-168
    • /
    • 2008
  • With the development of the information technology in recent years, the innovation of multimedia information technology also has been accelerated. Many fields of the digital image processing technologies as image data compression, recognition. restoration, etc. are now being studied actively. When transmitting and saving digital images, noise would be made, and we are using the image filters to remove the noise. The Image Filter used Digital Image Process basically has a two-dimensional structure. There are two methods of the filter's creation - One is reiterating one dimension, and the other is using an indivisible two-dimension image filter. The space domain method using mask is the latter one. That is inserting the value-multiplied pixels values faced each other when the two-dimension filter overlapped on input image- to the filter value's center position and the same position in the image. The image filter is being used widely along with one-dimension filter, according each noise. Most people are using various median filters to remove the impulse noise. However, in this paper, I suggested a powerful switching median filter and compared with conventional method for verification.

  • PDF

Clustering-based Hierarchical Scene Structure Construction for Movie Videos (영화 비디오를 위한 클러스터링 기반의 계층적 장면 구조 구축)

  • Choi, Ick-Won;Byun, Hye-Ran
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.529-542
    • /
    • 2000
  • Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.

  • PDF

Balance-Swap Optimization of Economic Load Dispatch Problem using Quadratic Fuel Cost Function (이차 발전비용함수를 사용한 경제급전문제의 균형-교환 최적화)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.243-250
    • /
    • 2014
  • In this paper, I devise a balance-swap optimization (BSO) algorithm to solve economic load dispatch with a quadratic fuel cost function. This algorithm firstly sets initial values to $P_i{\leftarrow}P_i^{max}$, (${\Sigma}P_i^{max}$ > $P_d$) and subsequently entails two major processes: a balance process whereby a generator's power i of $_{max}\{F(P_i)-F(P_i-{\alpha})\}$, ${\alpha}=_{min}(P_i-P_i^{min})$ is balanced by $P_i{\leftarrow}P_i-{\alpha}$ until ${\Sigma}P_i=P_d$; and a swap process whereby $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_i+{{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}$ = 1.0, 0.1, 0.1, 0.01, 0.001 is set at $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$. When applied to 15, 20, and 38-generators benchmark data, this simple algorithm has proven to consistently yield the best possible results. Moreover, this algorithm has dramatically reduced the costs for a centralized operation of 73-generators - a sum of the three benchmark cases - which could otherwise have been impossible for independent operations.

Sequential Longest Section Color Winning Algorithm for Car Paint Sequencing Problem (자동차 페인트 순서 문제의 연속된 최장 구간 색 승리 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.177-186
    • /
    • 2020
  • This paper deals with the car paint sequencing problem (CPSP) that the entrance sequence is to same colored group with maximum sequenced cars for the buffer arriving cars from the body shop. This problem classified by NP-complete problem because of the exact solution has not obtained within polynomial time. CPSP is aim to minimum pugging number that each pugging must be performs at color changing time in order to entirely cleaning the remaining previous color. To be obtain the minimum number of moving distance with window concept and minimum number of pugging, this paper sorts same color and arriving sequence. Then we basically decide the maximum length section color time to winner team using stage race method. For the case of the loser team with no more racing or yield to loser team and more longer stage in upcoming racing, the winner team give way to loser team. As a result, all cars(runners) are winner in any stage without fail. For n cars, the proposed algorithm has a advantage of simple and fast with O(nlogn) polynomial time complexity, this algorithm can be get the minimum number of moving distance and purging for all of experimental data.

Hardware-Based High Performance XML Parsing Technique Using an FPGA (FPGA를 이용한 하드웨어 기반 고성능 XML 파싱 기법)

  • Lee, Kyu-hee;Seo, Byeong-seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2469-2475
    • /
    • 2015
  • A structured XML has been widely used to present services on various Web-services. The XML is also used for digital documents and digital signatures and for the representation of multimedia files in email systems. The XML document should be firstly parsed to access elements in the XML. The parsing is the most compute-instensive task in the use of XML documents. Most of the previous work has focused on hardware based XML parsers in order to improve parsing performance, while a little work has studied parsing techniques. We present the high performance parsing technique which can be used all of XML parsers and design hardware based XML parser using an FPGA. The proposed parsing technique uses element analyzers instead of the state machine and performs multibyte-based element matching. As a result, our parsing technique can reduce the number of clock cycles per byte(CPB) and does not need to require any preprocessing, such as loading XML data into memory. Compared to other parsers, our parser acheives 1.33~1.82 times improvement in the system performance. Therefore, the proposed parsing technique can process XML documents in real time and is suitable for applying to all of XML parsers.

Analysis on Protection Ratio of IBAC DAB System for Co-Channel FM Interferer (동일채널 FM 간섭원에 대한 IBAC DAB 시스템의 혼신 보호비 분석)

  • Jeong, Young-Ho;Park, So-Ra;Kim, Geon;Lee, Hyun;Lee, Soo-In
    • Journal of Broadcast Engineering
    • /
    • v.5 no.2
    • /
    • pp.199-210
    • /
    • 2000
  • The IBAC (In-Band Adjacent-Channel) DAB (Digital Audio Broadcasting) system is to provide multichannel CD quality audio services and multimedia data services including text and picture in FM band (88~105 MHz). As the FM band is being used by the existing analog radio broadcasting, there must he an analysis of the interference effect between IBAC DAB and analog FM signal. Therefore, the protection ratio should be evaluated to verify the system compatibility and allocate the new IBAC DAB channel in FM band. In this paper, among the three types of interferences, FM-to-DAB, DAB-to-FM and DAB-to-DAB, that can be occurred, the Protection ratio of IBAC DAB system for co-channel FM interferer is analyzed by modeling the FM interferer and considering the multipath fading channel. The simulation results show that IBAC DAB system has far better sensitivity than Eureka 147 and needs a relatively high protection ratio for co-channel FM interferer, because of its narrow bandwidth, about one third of that of Eureka 147.

  • PDF