• Journal of Platform Technology
• /
• v.6 no.4
• /
• pp.26-33
• /
• 2018

In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.471-479
• /
• 2010

The main contribution of this paper is to propose the integrated database schema from several research projects included in "The Next Generation New Technology for Rock-falling and Landsliding Project". Furthermore this paper describes the development of integrated standard database system for the slopes databases. We also develop and implement the global real time web service system in order to provide one-stop data service for the slopes. In this paper, the new integrated database paradigm for rock-fall and landsliding data is designed and proposed and also data management system is developed based on the global web service system.

• Molecules and Cells
• /
• v.25 no.2
• /
• pp.258-264
• /
• 2008

Deschampsia antarctica is the only monocot that thrives in the tough conditions of the Antarctic region. It is an invaluable resource for the identification of genes associated with tolerance to various environmental pressures. In order to identify genes that are differentially regulated between greenhouse-grown and Antarctic field-grown plants, we initiated a detailed gene expression analysis. Antarctic plants were collected and greenhouse plants served as controls. Two different cDNA libraries were constructed with these plants. A total of 2,112 cDNA clones was sequenced and grouped into 1,199 unigene clusters consisting of 243 consensus and 956 singleton sequences. Using similarity searches against several public databases, we constructed a functional classification of the ESTs into categories such as genes related to responses to stimuli, as well as photosynthesis and metabolism. Real-time PCR analysis of various stress responsive genes revealed different patterns of regulation in the different environments, suggesting that these genes are involved in responses to specific environmental factors.

• The Journal of the Korea Contents Association
• /
• v.6 no.3
• /
• pp.125-134
• /
• 2006

The purpose of this paper is constructed a HEEAAS(Human Emotional Expression Animaion System), which is an animation system to show both the face and the body motion from the inputted voice about just 4 types of emotions such as fear, dislike, surprise and normal. To implement our paper, we chose the korean young man in his twenties who was to show appropriate emotions the most correctly. Also, we have focused on reducing the processing time about making the real animation in making both face and body codes of emotions from the inputted voice signal. That is, we can reduce the search time to use the binary search technique from the face and body motion databases, Throughout the experiment, we have a 99.9% accuracy of the real emotional expression in the cartoon animation.

• International Journal of Advanced Culture Technology
• /
• v.12 no.2
• /
• pp.72-89
• /
• 2024

Depression is a common disorder among the elderly, significantly affecting their quality of life. Traditional dance interventions, although beneficial, have limitations in convenience, personalization, and retention. With the advent of digital technology, digital dance interventions have emerged as a potential solution to these limitations. This paper involves an extensive review of literature on digital dance interventions. Research databases were searched for studies that focus on the use of digital dance in treating depression among older adults. The review also includes analyses of the advancements in digital dance technology, its application in therapeutic settings, and the evaluation of its efficacy. The paper identifies three main challenges in the current digital dance intervention research: real-time dynamic assessment, multimodal dance generation, and improving compliance. Despite these challenges, digital dance interventions show promise in addressing the limitations of traditional dance therapy. The research suggests that the integration of human-computer interaction and personalized approaches in digital dance interventions could significantly improve outcomes in elderly patients with depression. Digital dance interventions represent a novel and promising approach to treating depression in older adults. Future research should focus on overcoming the identified challenges and enhancing the effectiveness of these interventions.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.635-652
• /
• 2011

In ubiquitous environments, many applications need to process data with time and space dimensions. Because of this, there is growing attention not only on gathering spatiotemporal data in ubiquitous environments, but also on processing such data in databases. In order to obtain the full benefits from spatiotemporal data, we need a data model that naturally expresses the properties of spatiotemporal data. In this paper, we introduce three spatiotemporal data models extended from temporal data models. The main goal of this paper is to determine which data model is less complex in the spatiotemporal context. To this end, we compare their query languages in the complexity aspect because the complexity of a query language is tightly coupled with its underlying data model. Throughout our investigations, we show that it is important to intertwine space and time dimensions and keep one-to-one correspondence between an object in the real world and a tuple in a database in order to naturally express queries in ubiquitous applications.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.610-622
• /
• 2003

Metadata Registry was developed to dynamically manage metadata and to increase interoperability between various and heterogeneous metadata. The built metadata registry can be used as a standard guideline for creation of new databases and it provides a radical data integration mechanism. However, in the situation that an enormous databases must be integrated progressively, there is a limit to the existing metadata-based approach. In case that each database has no statistical information for its use rate and the restricted cost is given to us for a unit time, existing metadata-based approaches do not provide how to select some databases to be preferentially integrated and to build a metadata registry progressively, In this paper, we propose a methodology that can create progressively metadata registries in the case. The proposed methodology is based on data visibility and hierarchical metadata registry. We also describe the system that have been developed for applying the methodology to a real domain, and then described its results.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.535-544
• /
• 2009

Even though Korea's national project - NGIS(National Geographic Information System) has been built since 1995 and the GIS database for underground facilities has also been built, not so many systems are utilizing those databases currently. Also, the waterworks GIS developed and operated by K-Water is not used effectively in supporting field works. In order to manage and operate the waterworks pipelines effectively, systematic supporting strategy must be established by adopting the state-of-the-art technology. In this research, a ubiquitous-based strategy for managing waterworks facilities is proposed to increase the usability of the existing related databases and to ensure the systematic way of distributing information. The current status of the existing waterworks GIS and GIS database were analyzed to achieve the goal. By studying the state-of-the-art technology, we found that importing the LBS technology to the databases is necessary. The results of these efforts are exclusive waterworks-mobile-terminals and LBS system supporting them. Furthermore, the applicability of the ubiquitous technology to waterworks has been examined to realize the real-time waterworks management.