• Journal of KIISE
• /
• v.44 no.7
• /
• pp.710-718
• /
• 2017

As graphs are becoming increasingly large, the costs for storing and managing data are increasing continuously. Shortest path discovery over a large graph requires long running time due to frequent disk I/Os and high complexity of the graph data. Recently, graph summarization techniques have been studied, which reduce the size of graph data and disk I/Os by representing highly dense subgraphs as a single super-node. Decompressing should be minimized for efficient shortest path discovery over the summarized graph. In this paper, we analyze the decompression performance of a summarized graph and propose an approximate technique that discovers the shortest path quickly with a minimum error ratio. We also propose an exact technique that efficiently discovered the shortest path by exploiting an index built on paths containing super-nodes. In our experiments, we showed that the proposed technique based on the summarized graph can reduce the running time by up to 70% compared with the existing techniques performed on the original graph.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.258-261
• /
• 2014

The era of realistic broadcast with high fidelity has come after the wide-spread distribution of UHD display and the transmission of UHD experimental broadcast in CATV. However, UHD broadcast now has constraint because it requires much amount of bandwidth and data in broadcasting transmission and production system. Not only HEVC(High Efficiency Video Codec) which has more than two times higher compression rate but also cloud-based editing system would be the key to solve the problems above. Also, fast scene change detection of videos is needed to index and search UHD videos smoothly. In this paper, therefore, a method is proposed to index and search the scene change information of large volume UHD videos compressed with high-efficiency codec. Application usages of fast detection of scene change information in various UHD video environments are considered by using this algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.91-100
• /
• 2011

Fire stations should be located in optimal location to act quickly in case of emergency and minimize damages as a public facility that protects life and property of local residents. Siting fire stations without regard for the accessibility and occurrence factors of an accident may provide fire service unequally. Therefore service analysis is necessary to reduce the blind spot of disaster and safety and to offer equal fire-service at this time. Especially fire stations can service more efficiently than before by reducing a more likely vulnerable area. This study suggests methods of mapping index of value that represents vulnerability of the occurrence of an accident and extracting service zone map of fire stations, as an initial research for offering efficient fire service. Geographical distribution mismatch between service zone map and vulnerability map is figured out and vulnerable area for fire service is defined by using map overlay method.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.173-182
• /
• 1998

As a result of remarkable developments in multimedia technology, the image database system that can efficiently retrieve image data becomes a core technology of information-oriented society. In this paper, we proposed the 2-phase Image Retrieval System considering both color and shape information as the method of image features extraction for content-based image data retrieval. At the first level, to get color information, with improving and extending the indexing method using color distribution characteristic suggested by Striker et al., i.e. the indexing method considering local color distribution characteristics, the system roughly classifies images through the improved method. At the second level, the system finally retrieves the most similar image from the image queried by the user using the shape information about the image groups classified at the first level. To extract the shape information, we use the Improved Moment Invariants (IMI) that manipulates only the pixels on the edges of objects in order to overcome two main problems of the existing Moment Invariant methods large amount of processing and rotation sensitiveness which can frequently be seen in the Directive Histogram Intersection technique suggested by Jain et al. Experiments have been conducted on 300 automobile images. And we could obtain the more improved results through the comparative test with other methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1033-1043
• /
• 2000

Recently as the user request on NoD (News-on-Demand) is largely increasing, there are a lot of researches to fulfill it. However, because of short life-cycle of new video data and periodical change of video data depending on anchor, it is difficult to apply the conventional video storage techniques to NOD applications directly. For this, we design and implement low-level storage manager for efficient storage and retrieval of multimedia data in NOD Services. Our low-level storage manager not only efficiently sotres video stream dat of new video itself, but also handles its index information. It provides an inverted file method for efficient text-based retrieval and an X-tree index structure for high-dimensional feature vectors. In addition, our low-level storage manager provides some application program interfaces (APIs) for storing video objects itself and index information extracted from hierarchial new video and some APIs for retrieving video objects easily by using cursors. Finally, we implement our low-level storage manager based on SHORE (Scalable Heterogeneous Object REpository) storage system by sunig a standard C++ language under UNIX operating system.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.13-21
• /
• 2000

Online analytical processing (OLAP) systems are introduced to support decision support systems. Many researches focussed on efficient processing of aggregate functions that usually occur in OLAP queries. However, most previous researches in the literature are deal with the situation in which aggregate functions arc applied to all the values in a given range. Since those approaches utilize characteristic of aggregate functions applied to a range, they are difficult to be applied to a muitipoint query that is a query considering only some points in a given range. In this paper, we propose the Ranking Index and the flanking Decision Tree (RDT) for efficient evaluation of multipoints MAX/MIN queries. The ranking of possible MAX/MIN values are computed with RDT Then MAX/MIN values can be acquired from the Ranking Index. We show through experiments that our method provides high performance in most situations. In other words, the proposed method is robust as well as efficient. A single common set of precomputed results for both MAX and MIN values is another advantage of the proposed method.

• The KIPS Transactions:PartB
• /
• v.14B no.2
• /
• pp.89-98
• /
• 2007

For browsing, searching, and manipulating video documents, an indexing technique to describe video contents is required. Until now, the indexing process is mostly carried out by specialists who manually assign a few keywords to the video contents and thereby this work becomes an expensive and time consuming task. Therefore, automatic classification of video content is necessary. We propose a fully automatic and computationally efficient method for analysis and summarization of spots news video for 5 spots news video such as soccer, golf, baseball, basketball and volleyball. First of all, spots news videos are classified as anchor-person Shots, and the other shots are classified as news reports shots. Shot classification is based on image preprocessing and color features of the anchor-person shots. We then use the dominant color of the field and motion features for analysis of sports shots, Finally, sports shots are classified into five genre type. We achieved an overall average classification accuracy of 75% on sports news videos with 241 scenes. Therefore, the proposed method can be further used to search news video for individual sports news and sports highlights.

• Journal of Broadcast Engineering
• /
• v.12 no.4
• /
• pp.311-320
• /
• 2007

In this paper, an efficient detection algorithm of an anchor shot in news video is presented. We observed the audio visual characteristics of news video and proposed several low level features which are appropriate for detecting an anchor shot in news video. The overall structure of the proposed algorithm is composed of 3 stages: the pause detection, the audio cluster classification, and the matching with motion activity stage. We used the audio features as well as the motion feature in order to improve the indexing accuracy and the simulation results show that the performance of the proposed algorithm is quite satisfactory.

• Journal of the Korean Society for information Management
• /
• v.28 no.2
• /
• pp.65-78
• /
• 2011

The purpose of this study is to identify topic areas of academic library research using two informetric methods; word clustering and Pathfinder network. For the data analysis, 139 articles published in major library and information science journals from 2005 to 2009 were collected from the Korean Science Citation Index database. The keywords that represent research topics were gathered from two sections: an and titles in references. Results showed that reference titles usefully represent topics in detail, and combinings and reference titles can produce an expanded topic map.

• Smart Media Journal
• /
• v.1 no.3
• /
• pp.43-47
• /
• 2012

The recent proliferation of multimedia data necessitates the effectively and efficiently retrieving of multimedia data. These research not only focus on the retrieving methods of text matching but also on using the multimedia data features. Therefore, this paper is a similarity measurement method of trajectory using indexing information of moving object in video, for similarity measurement. This method consists of 2 steps. Firstly, Video data is processed indexing for trajectory extraction of moving objects using CCTV. Finally, we describe to compare DTW(Dynamic Time Warping) to TSR(Tansent Space Representation) algorithm.