• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.61-66
• /
• 1997

For constructing an intelligent multimedia database system for medical diagnosis, we are focusing on two technological points. One is a retrieval algorithm of databases, and the other is a coding algorithm of multimedia contents. For the first, previously we proposed a front-end database preprocessor called“keyword-network”, and in this paper we present its extended model providing an intelligent logical AND searching function especially for medical differential diagnosis. For the second, we present examples of multimedia intellectual coding methods for cardiovascular examination records.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.287-290
• /
• 2004

In the moving object database system, spatiotemporal join is very import operation when we process join moving objects. Processing time of spatio-temporal join operation increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we propose spatio-temporal join algorithm with TB-Tree that preserves trajectories of moving objects, and show result of test. We first present basic algorithm, and propose cpu-time tunning algorithm and IO-time tunning algorithm. We show result of test with data set created by moving object generator tool.

• Speech Sciences
• /
• v.10 no.1
• /
• pp.85-94
• /
• 2003

In this paper an algorithm to reduce the size of Text-to-Speech database is proposed. The algorithm is based on the characteristics of Korean phonemic units. From the initial database, a reduced phoneme unit set is induced by articulatory similarity of concatenating phonemes. Speech data is read by one female announcer for 1000 phonetically balanced sentences. All the recorded speech is then segmented by phoneticians. Total size of the original speech data is about 640 MB including laryngograph signal. To synthesize wave, RE-PSOLA (Residual-Excited Pitch Synchronous Overlap and Add Method) was used. The voice quality of synthesized speech was compared with original speech in terms of spectrographic informations and objective tests. The quality of the synthesized speech is not much degraded when the size of synthesis DB was reduced from 320 MB to 82 MB.

• Journal of the Korean Geophysical Society
• /
• v.7 no.4
• /
• pp.247-253
• /
• 2004

In this paper, 3D recognizing algorithm which is based on the external shape feature is presented. Since many objects have the regular shape, if we posses the database of pattern and we recognize the object using the database of the object's pattern, it is possible to inspect and/or recognize the objects of many fields. This paper handles on the 3D object recognition algorithm using the geometrical pattern matching by 3D database.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.1-12
• /
• 2008

Database encryption is one of the important mechanisms for prohibiting internal malicious users and outside hackers from utilizing data. Frequent occurrences of encryption and decryption cause degradation of database performance so that many factors should be considered in implementing encryption system. In this paper, we propose an architecture of database encryption system and data encryption module. In addition we suggest extended SQL in order to manage data encryption and decryption. In implementing database encryption system, we adopt ARIA encryption algorithm which is proved to be the most fast one among Korea standardized encryption algorithm. We use an single key for each database in encrypting data rather than using several keys in order to improve performance. Research over performance evaluation of database encryption system is rare up to now. Based on our implemented system, we provide performance evaluation results over various H/W platforms and compare performance differences between plain text and encrypted data.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.2
• /
• pp.85-93
• /
• 2012

In this paper, we proposed Wireless LAN (WLAN) localization method that enhances database construction based on weighting factor and analyse the characteristic of the WLAN received signals. The weighting factor plays a key role as it determines the importance of Received Signal Strength Indication (RSSI) value from number of received signals (frequency). The fingerprint method is the most widely used method in WLAN-based positioning methods because it has high location accuracy compare to other indoor positioning methods. The fingerprint method has different location accuracies which depend on training phase and positioning phase. In training phase, intensity of RSSI is measured under the various. Conventional systems adapt average of RSSI samples in a database construction, which is not quite accurate due to variety of RSSI samples. In this paper, we analyse WLAN RSSI characteristic from anechoic chamber test, and analyze the causes of various distributions of RSSI and its influence on location accuracy in indoor environments. In addition, we proposed enhanced weighting factor algorithm for accurate database construction and compare location accuracy of proposed algorithm with conventional algorithm by computer simulations and tests.

• Journal of Information Processing Systems
• /
• v.6 no.2
• /
• pp.163-176
• /
• 2010

Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these databases has to be maintained, and an incremental updating technique needs to be developed for maintaining the discovered association rules from these databases. The concept of Temporal Association Rules has been introduced to solve the problem of handling time series by including time expressions into association rules. In this paper we introduce a novel algorithm for Incremental Mining of General Temporal Association Rules (IMTAR) using an extended TFP-tree. The main benefits introduced by our algorithm are that it offers significant advantages in terms of storage and running time and it can handle the problem of mining general temporal association rules in incremental databases by building TFP-trees incrementally. It can be utilized and applied to real life application domains. We demonstrate our algorithm and its advantages in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1604-1609
• /
• 2004

We have to convert XML DTD into relational database schema for storing XML Document at relational database. Hybrid inlining algorithm are used for converting XML DTD to relational database schema. But this method have some problem. That is the relational database schema have N:N relationship are created according this method are not satisfied with third normal from. Therefore, We proposed Extended Hybrid inlining algorithm for solving this problem in this paper.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1998.06a
• /
• pp.539-542
• /
• 1998

In this paper, we devised pulse rate diagnosis database system for provide basic index of Cold-Hot diagnosis. The system consist of database part and pulse rate detection part that for detection pulse wave, respiration and ECG. The database is constructed windows95 platform using DAO(Data Access Object). Search algorithm used ISAM algorithm. The database consist of patient information and medical report for a subject and detected biological signals.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.128-134
• /
• 2011

Note that k-anonymity algorithm has been widely discussed in the area of privacy protection. In this paper, a new search algorithm to achieve k-anonymity for database application is introduced. A lattice is introduced to form a solution space for a k-anonymity problem and then a hybrid search method composed of tabu search and genetic algorithm is proposed. In this algorithm, the tabu search plays the role of mutation in the genetic algorithm. The hybrid method with independent tabu search and genetic algorithm is compared, and the hybrid approach performs the best in average case.