• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.75-94
• /
• 2009

Since XML emerged as a standard for data exchange on the web, it has been established as a core component in e-Commerce and efficient query processing over XML data in ubiquitous computing environment has been also receiving much attention. Recently, the techniques were proposed whereby an XML document is fragmented into XML fragments to be streamed and the mobile clients receive the stream while processing queries over it. In processing queries over an XML fragment stream, the average access time significantly depends on the order of fragments in the stream. As such, for query performance, an efficient organization of XML fragment stream is required as well as the indexing for energy-efficient query processing due to the reduction of tuning time. In this paper, a technique of XML fragment stream organization based on query frequencies, fragment size, fragment access frequencies, and an active XML-based indexing scheme are proposed. Through implementation and performance experiments, our techniques were shown to be efficient compared with the conventional XML fragment stream organizations.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.1-17
• /
• 1998

Video information is an important component of multimedia systems such as Digital Library, World-Wide Web (WWW), and Video-On-Demand (VOD) service system. Video information has hierarchical document structure inherently, so it is named "structure video document" in this paper. This paper proposes a data model, a query language, and an indexing scheme for structured video documents in order to store, retrieve, and share video documents efficiently. In representing structured video documents, the object-oriented data modeling technique is used since the hierarchical structure information can be modeled as complex objects. We also define object types for the structure information. Our query language supports not only content-based retrieval, which means the queries based on the structure of video documents, and spatial/temporal relation for video documents. In order to perform structure queries efficiently, as well as to reduce the storage overhead of indices, an optimized inverted index structure is proposed.

• 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 KIISE:Databases
• /
• v.31 no.2
• /
• pp.122-131
• /
• 2004

Traditional works on indexing have been suggested for low dimensional data under dynamic environments. But recent database applications require efficient processing of huge sire of high dimensional data under static environments. Thus many indexing strategies suggested especially in partitioning ones do not adapt to these new environments. In our study, we point out these facts and propose a new partitioning strategy, which complies with new applications' requirements and is derived from analysis. As a preliminary step to propose our method, we apply a packing technique on the one hand and exploit observations on the Minkowski-sum cost model on the other, under uniform data distribution. Observations predict that unbalanced partitioning strategy may be more query-efficient than balanced partitioning strategy for high dimensional data. Thus we propose our method, called CSP (Cyclic Spliced Partitioning method). Analysis on this method explicitly suggests metrics on how to partition high dimensional data. By the cost model, simulations, and experiments, we show excellent performance of our method over balanced strategy. By experimental studies on other indices and packing methods, we also show the superiority of our method.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.2
• /
• pp.60-70
• /
• 2000

As a result of remarkable developments in computer technology, the image retrieval system that can efficiently retrieve image data becomes a core technology of information-oriented society. In this paper, we implemented the Hierarchical Image Retrieval System for content-based image data retrieval. At the first level, to get color information, with improving 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.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.27-33
• /
• 2002

There are two significant drawbacks in triple image indexing; one is that is cannot support concept-based image retrieval and the other is that it fails to allow disjunctive labeling of images. To remedy the drawbacks, we propose a new technique supporting a concept-based retrieval against images indexed by indefinite fuzzy triples (I-fuzzy triples). The I-fuzzy triples allow not only a disjunctive image labeling, but also a concept-based matching against images labeled disjunctively. The disjunctive labeling is based on the expended closed world assumption and the concept-based image retrieval is based on fuzzy matching. In this paper, we also propose a concept-based query evaluation against the image database to extract desired answers with the degree of certainty $\alpha$$\in$[1,0].

• Journal of radiological science and technology
• /
• v.28 no.1
• /
• pp.19-24
• /
• 2005

The purpose of this study was to design and implement a useful annotation-based Radiological image retrieval system to accurately determine on education and image information for Radiological technologists. For better retrieval performance based on large image databases, we presented an indexing technique that integrated $B^+-tree$ proposed by Bayer for indexing simple attributes and inverted file structure for text medical keywords acquired from additional description information about Radiological images. In our results, we implemented proposed retrieval system with Delphi under Windows XP environment. End users, Radiological technologists, are able to store simple attributes information such as doctor name, operator name, body parts, disease and so on, additional text-based description information, and Radiological image itself as well as to retrieve wanted results by using simple attributes and text keywords from large image databases by graphic user interface. Consequently proposed system can be used for effective clinical decision on Radiological image, reduction of education time by organizing the knowledge, and well organized education in the clinical fields. In addition, It can be expected to develop as decision support system by constructing web-based integrated imaging system included general image and special contrast image for the future.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.535-540
• /
• 2006

This paper presented an effective strategy to extract the buildings and to reconstruct 3-D buildings using high-resolution multispectral stereo satellite images. Proposed scheme contained three major steps: building enhancement and segmentation using both BDT (Background Discriminant Transformation) and ISODATA algorithm, conjugate building identification using the object matching with Hausdorff distance and color indexing, and 3-D building reconstruction using photogrammetric techniques. IKONOS multispectral stereo images were used to evaluate the scheme. As a result, the BDT technique was verified as an effective tool for enhancing building areas since BDT suppressed the dominance of background to enhance the building as a non-background. In building recognition, color information itself was not enough to identify the conjugate building pairs since most buildings are composed of similar materials such as concrete. When both Hausdorff distance for edge information and color indexing for color information were combined, most segmented buildings in the stereo images were correctly identified. Finally, 3-D building models were successfully generated using the space intersection by the forward RFM (Rational Function Model).

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.328-342
• /
• 2007

We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.