• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1343-1355
• /
• 1997

Full motion video data is the most effective data type that transmits information in multimedia enviornment. VOD service is system that uses network to transmit full motion video data interactively. Therefore VOD service system must satisfy the following requirements. First, it should transmit high quality full motion video. Second, it should be able to control a large quantity of full motion video. Third, a user should be able to retrieve the full motion vide effectively. However the existing VOD service system is established based n file system that not only does it have disadvantages in managment such as transaction control but also it is not suitable for distributed multimedia environment. The goal of this research is to build a VOD service system that provides high-quality full motion video assuming information retrieval. In order to mainly search video data's bibliographical information and to manage related information, VOD service system and DBMS system are to be closely related. Also, to transmit high quality full motion video data, we use MTP$^{TM}$(Media Transfer Protocol) developed by StarLight. MTP$^{TM}$ guarantees high bandwidth that is necessary to tansmit high quality full motion video data effectively. In other hand TCP/IP which is used for information search does not guarentee high bandwidth as that in MTP$^{TM}$. Therfore VOD service system that seraches information managed by DBMS and transmits requried full motion video data should control different kinds of protocol simultaneously. This paper describes the configuration of VODB system that has solved these problems, implementation and efficiency of data applied system.stem.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.211-214
• /
• 2002

Automatic video partitioning is the first step for content-based indexing and retrieval of video data. In this paper, an efficient algorithm for scene change detection is proposed, where cumulative histogram and edge information are utilized. Experimental results have shown the effectiveness of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.21-23
• /
• 2006

Due to development of Internet network environments and data compression techniques, the size and amount of multimedia data has greatly increased. They are compressed before transmission or storage. Dealing with these compressed data such as video retrieval or indexing requires the decoding procedure most of the time. In video retrieval and indexing a color histogram is one of the most frequently used tools. We propose a novel scheme for extracting color histograms from images transformed into the compressed domain using $8{times}8$ DCT(Discrete Cosine Transform). In this scheme an averaged version of original image is obtained by filtering DCT coefficients with a filter we destined.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.1
• /
• pp.75-80
• /
• 2017

Nowadays, smart phone is being popularly used for communication, entertainment, and information retrieval. While demands on video traffic over mobile networks increases sharply, the wireless link capacity is often limited to fully support the traffic demand. Therefore, the size of video data needs to be reduced to provide high quality video with limited capacity. To handle this issue, we propose a video editing system using the ffmpeg library. The proposed system can provide a high quality video with a relatively small data size, thereby facilitating the mobile streaming services and live-video games.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.121-132
• /
• 2000

Most of video indexing applications depend on fast and efficient archiving, browsing, retrieval techniques. A number of techniques have been approached about only pixel domain analysis until now. Those approaches brought about the costly overhead of decompressing because the most of multimedia data is typically stored in compressed format. But with a compressed video data, if we can analyze the compressed data directly. then we avoid the costly overhead such as in pixel domain. In this paper, we analyze the information of compressed video stream directly, and then extract the available features for video indexing. We have derived the technique for cut detection using these features, and the stream is divided into shots. Also we propose a new brief key frame selection technique and an efficient video indexing method using the spatial informations(DT coefficients) and also the temporal informations(motion vectors).

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.252-264
• /
• 1999

The key characteristic of video data is its spatial/temporal relationships. In this paper, we propose an content based video retrieval system based on hierarchical data structure for specifying the temporal semantics of video data. In this system, video data's hierarchical structure temporal relationship, inter video object temporal relationship, and moving video object temporal relationship can be represented. We also implemented these video data's temporal relationship into an object-relational database management system using inheritance, encapsulation function overloading, etc. So more extended and richer temporal functions can be used to support a broad range of temporal queries.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.77-83
• /
• 2015

The storage and retrieval of multimedia data is becoming increasingly important in many application areas including record management, video(CCTV) management and Internet of Things (IoT). In these applications, the files containing multimedia that need to be stored and managed is tremendous and constantly scaling. In this paper, we propose a technique to retrieve a very large number of files, in multimedia format, using the Hadoop Framework. Our strategy is based on the management of metadata that describes the characteristic of files that are stored in Hadoop Distributed File System (HDFS). The metadata schema is represented in Hbase and looked up using SQL On Hadoop (Hive, Tajo). Both the Hbase, Hive and Tajo are part of the Hadoop Ecosystem. Preliminary experiment on multimedia data files stored in HDFS shows the viability of the proposed strategy.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.217-227
• /
• 2005

In this paper, we present the result of an efficient implementation of DirectX-based multichannel visual monitoring system and the performance analysis of it. Our proposed system mainly consists of three subsystems: display, storage, and retrieval/playback. The display subsystem is designed to utilize efficiently H/W acceleration, overlay and flip of DirectX for faster real-time display, display synchronization among channels, and improvement of tearing artifact. For the performance improvement of storage speed, the storage subsystem is designed and implemented in DirectShow Filter-based multithreading architecture so that it can store multichannel video streams efficiently in each channel with minimizing data bottleneck among channels. In the retrieval and playback subsystem, efficient index file architecture and video data storage architecture, efficient playback architecture which can make playback be processed parallel among channels are designed and implemented for faster retrieval and playback,. Through experiments, our proposed system is shown to be maximally 2 times as fast in storaging speed and maximally 3.5 times as fast in retrieval and playback speed as the previous system.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1134-1141
• /
• 2005

With ever more popularity of video web-publishing, popular content is being compressed, reformatted and modified, resulting in excessive content duplication. Such overlapped data can cause problem of search speed and rate of searching. However, duplicated data on other site can provide alternatives while specific site cause problem. This paper proposes the efficient method, for retrieving. similar video data in large database. In this research we have used the method to compare summarized video image instead of the raw video data, and detected similar videos through clustering in that dimension feature vector through PCA(principle component analysis). We show that our proposed method is efficient and accurate through our experiment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.8-15
• /
• 2007

Recently, it is important to process multimedia data efficiently. Especially, in case of retrieval of multimedia information, technique of user interface and retrieval technique are necessary. This paper proposes a new technique which detects cuts effectively in compressed image information by MPEG. A cut is a turning point of scenes. The cut-detection is the basic work and the first-step for video indexing and retrieval. Existing methods have a weak point that they detect wrong cuts according to change of a screen such as fast motion of an object, movement of a camera and a flash. Because they compare between previous frame and present frame. The proposed technique detects shots at first using DC(Direct Current) coefficient of DCT(Discrete Cosine Transform). The database is composed of these detected shots. Features are extracted by HMMD color model and edge histogram descriptor(EHD) among the MPEG-7 visual descriptors. And detections are performed in sequence by the proposed matching technique. Through this experiments, an improved video segmentation system is implemented that it performs more quickly and precisely than existing techniques have.