• Journal of the Korea Computer Graphics Society
• /
• v.23 no.2
• /
• pp.41-47
• /
• 2017

In this paper, we present a method for data-driven correction of the noisy motion data captured from a low-end RGB-D camera such as the Kinect device. For this purpose, our key idea is to construct a synchronized motion database captured with Kinect and additional specialized motion capture device simultaneously, so that the database contains a set of erroneous poses from Kinect and their corresponding correct poses from the mocap device together. In runtime, given motion captured data from Kinect, we search the similar K candidate Kinect poses from the database, and synthesize a new motion only by using their corresponding poses from the mocap device. We present how to build such motion database effectively, and provide a method for querying and searching a desired motion from the database. We also adapt the laze learning framework to synthesize the corrected poses from the querying results.

• Microbiology and Biotechnology Letters
• /
• v.24 no.3
• /
• pp.371-375
• /
• 1996

TFD is a transcription factor database which consists of short functional DNA sequences called as signals and their references. SIGNAL SCAN, developed by Dan S. Prestridge, is used to determine what signals of TFD may exist in a DNA sequence. This program searches TFD database by using a simple algorithm for character string comparison. We developed TFSCAN that aims at searching for signals in an input DNA sequence more efficently than SIGNAL SCAN. Our algorithms consist of two parts, one constructs an automata by scanning sequences of rFD, the other searches for signals through this automata. Searching for signal-related references is radically improved in time by using an indexing method. Usage of TFSCAN is very simple and its output is obvious. We developed and installed a TFSCAN input form and a CGI program in GINet Web server, to use TFSCAN. The algorithm applying automata showed drastical results in improvement of computing time. This approach may apply to recognizing several biological patterns. We have been developing our algorithm to optimize the automata and to search more sensitively for signals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.148-155
• /
• 2000

In image coding applications such as web browsing and image database searching, it is very useful to quickly view a small portion of the image with higher quality. Region of interest (ROI) coding technique provides the capability to reconstruct the ROI in advance of decompressing the rest of the image, with a smaller number of transmitted bits compared to the case where the entire image is treated with the same priority. In this paper, a progressive ROI coding method using the enbedded coder is presented, and an efficient transmission method for the ROI information. Experimental results show that the proposed progressive ROI coding technique can be effectively used for image coding applications such as web browsing and image database searching system.

• Journal of the Korean Society for Library and Information Science
• /
• v.17
• /
• pp.339-366
• /
• 1989

Appearance of full-text online is the most encouraging phenomenon ·during the development of databases. The full-text databases of today is derived from by-product of electronic publication of printed materials. Now, there are also some movements toward electronic production of documents in Korea although not powerful. The present study is designed to examine the characteristics and effective retrieval method of full-text databases now commercially available through various vendors. The outline of this paper IS as follows: First, background and present situation of existing full-text database services through national and worldwide are examined. Second, free-text searching system of full-text databases is compared with controlled vocabulary system. The factors influencing on free-text retrieval performance, searching thesaurus, and hybrid or compromising system, which is using limited controlled vocabulary in conjunction with natural language for the enrichment needed for practical operation of the . system, are examined. Third, user demands through the analysis of preceding studies on 'various types of full-text databases are recognised. Fouth, application of CD-ROM full-text database to the libraries and information centers is examined as prospective resources for them. Finally, some problems and prospect of full-text databases are presented.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.3
• /
• pp.213-223
• /
• 1999

This study provides a improved model of digital basemap production that can efficiently identify and correct the various errors generated in digital map production process. In order to fulfill the requirements that the new model calls for, this study provides a typology of errors by analyzing the errors in digital basemap data. Computer programs for automatic error searching and for checking the correctness of the digital codes in the data have also been developed. Exsiting visual error-checking process has also been analyzed and more systematic process is suggested. As a result, it is found that the improved model of digital basemap production suggested in this study contributes to improving the quality of the digital map database by providing a systematic method for efficient error-searching and correction of digital map data.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.851-858
• /
• 2004

This paper presents improved teaching and learning GUI for easily analysis tool of load flow of power system with database function for searching solution. In this paper includes not only contingency analysis function but also searching function of conditional solution sets from database of solution for various load levels. The GUI is friendly for study for power system operation and control because picture provide a better visualizing of relationshipsbetween input parameters and effects than a tabula type result. This GUI enables topologyand the output data of load flow for line outages to be shown on same picture page. Userscan input the system data for power flow on the the picture and can easily see the theresult diagram of bus voltage, bus power, line flow. It is also observe the effects of different types of variation of tap, shunt capacitor, loads level, line outages. Proposed GUI has been studied on the Ward-Hale 6-Bus system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.6
• /
• pp.1259-1266
• /
• 2013

Nowadays, the databases are getting larger and larger. As the company has difficulty in managing the database, they want to outsource the database to the cloud system. In this case the database security is more important because their database is managed by the cloud service provider. Among database security techniques, the encryption method is a well-certified and established technology for protecting sensitive data. However, once encrypted, the data can no longer be easily queried. The performance of the database depends on how to encrypt the sensitive data, and on the approach for searching, and the retrieval efficiency that is implemented. In this paper we propose the new suitable mechanism to encrypt the database and lookup process on the encrypted database under control of the cloud service provider. This database encryption algorithm uses the bloom filter with the variable keyword based index. Finally, we demonstrate that the proposed algorithm should be useful for database encryption related research and application activities.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3E
• /
• pp.69-73
• /
• 2007

This paper presents an efficient algorithm to retrieve similar music files from a large archive of digital music database. Users are able to navigate and discover new music files which sound similar to a given query music file by searching for the archive. Since most of the methods for finding similar music files from a large database requires on computing the distance between a given query music file and every music file in the database, they are very time-consuming procedures. By measuring the acoustic distance between the pre-classified music files with the same type of emotion, the proposed method significantly speeds up the search process and increases the precision in comparison with the brute-force method.

• The Journal of Information Systems
• /
• v.18 no.3
• /
• pp.327-349
• /
• 2009

Traditional keyword-based searching methods suffer from low accuracy and high complexity due to the rapid growth in the amount of information. Accordingly, many researchers attempt to implement a so-called semantic search which is based on the semantics of the user's query. Semantic information can be described using a semantic modeling language, such as Topic Map. In this paper, we propose a new method to map a topic map to a traditional Relational Database (RDB) without any information loss. Although there have been a few attempts to map topic maps to RDB, they have paid scant attention to handling multi-role topics. In this paper, we propose a new storage structure to map multi-role topics to traditional RDB. The proposed structure consists of a mapping table, role tables, and content tables. Additionally, we devise a query translator to convert a user's query to one appropriate to the proposed structure.