• Journal of Information Technology and Architecture
• /
• v.11 no.2
• /
• pp.225-233
• /
• 2014

In this paper an architecture for 3D audio core algorithm evaluation database system. Due to increase of 3D audio system through multimedia device, an evaluation system is required for evaluating the 3D core algorithms for developing 3D audio system. Conventional evaluation systems have some problems. Researchers have to learn usage of evaluation system, in addition it is inefficient to use and search audio sources because audio sources are not indexed in general. To solve these problems, we design the architecture of 3D audio core algorithm evaluation database system enabling to automatically evaluate core algorithms using database management system. Also we define XML metadata scheme for information of saved audio source in database. This approach allows improving efficiency of search audio source and use of audio database.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.373-382
• /
• 2016

In this study, an EKF (Extended Kalman Filter) based database reference navigation using both gravity gradient and terrain data was performed to complement the weakness of using only one type of geophysical DB (Database). Furthermore, a new algorithm which combines the EKF and profile matching was developed to improve the stability and accuracy of the positioning. On the basis of simulations, it was found that the overall navigation performance was improved by the combination of geophysical DBs except the two trajectories in which the divergence of TRN (Terrain Referenced Navigation) occurred. To solve the divergence problem, the profile matching algorithm using the terrain data is combined with the EKF. The results show that all trajectories generate the stable performance with positioning error ranges between 14m to 23m although not all trajectories positioning accuracy is improved. The average positioning error from the combined algorithm for all nine trajectories is about 18 m. For further study, a development of a switching geophysical DB or algorithm between the EKF and the profile matching to improve the navigation performance is suggested.

• MALSORI
• /
• no.57
• /
• pp.113-122
• /
• 2006

Recently, many studies have been done for speech recognition in noisy environments. Particularly, the Aurora DB has been built as the common database for comparing the various feature extraction schemes. However, in general, the recognition models as well as the features have to be modified for effective noisy speech recognition. As the structure of the HTK is very complex, it is not easy to modify, the recognition engine. In this paper, we implemented a baseline recognizer based on the segmental K-means algorithm whose performance is comparable to the HTK in spite of the simplicity in its implementation.

• International Journal of Advanced Culture Technology
• /
• v.7 no.4
• /
• pp.229-235
• /
• 2019

Due to the development of video and optical technology today, video equipments are being used in a variety of fields such as identification, security maintenance, and factory automation systems that generate products. In this paper, we investigate an algorithm that effectively recognizes an experimental object in an input image with a partial problem due to the mechanical problem of the input imaging device. The object recognition algorithm proposed in this paper moves and rotates the vertices constituting the outline of the experimental object to the positions of the respective vertices constituting the outline of the DB model. Then, the discordance values between the moved and rotated experimental object and the corresponding DB model are calculated, and the minimum discordance value is selected. This minimum value is the final discordance value between the experimental object and the corresponding DB model, and the DB model with the minimum discordance value is selected as the recognition result for the experimental object. The proposed object recognition method obtains satisfactory recognition results using only partial information of the experimental object.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.211-214
• /
• 2003

The problem of unsolicited e-mail has been increasing for years, so many researchers has studied about spam filtering and prevention. In this article, we proposed a faster spam prevention algorithm based on userID instead of full email address. But there are 2% of false-negatives by userID. In this case, we store those domains in a DB and filter them out. The proposed algorithm requires small DB and 3.7 times faster than the e-mail address comparison algorithm. We implemented this algorithm using SPRSW(Spam Prevention using Replay Secrete Words) to register userID automatically in userID DB.

• MALSORI
• /
• v.55
• /
• pp.143-158
• /
• 2005

The adequate compression algorithm is essential to achieve high quality embedded TTS system. in this paper, we Propose waveform interpolation coder for TTS corpus compression after many speech coder investigation. Unlike speech coders in communication system, compression rate and anality are more important factors in TTS DB compression than other performance criteria. Thus we select waveform interpolation algorithm because it provides good speech quality under high compression rate at the cost of complexity. The implemented coder has bit rate 6kbps with quality degradation 0.47. The performance indicates that the waveform interpolation is adequate for TTS DB compression with some further study.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.199-207
• /
• 2008

The FP-tree(Frequency Pattern Tree) mining association rules algorithm was proposed to improve mining performance by reducing DB scan overhead dramatically, and it is recognized that the performance of it is better than that of any other algorithms based on different approaches. But the FP-tree algorithm needs a few more memory because it has to store all transactions including frequent itemsets of the DB. This paper implements a FP-tree algorithm on a general purpose UNK system and compares it with the DHP(Direct Hashing and Pruning) algorithm which uses hash tree and direct hash table from the point of memory usage and execution time. The results show surprisingly that the FP-tree algorithm is poor than the DHP algorithm in some cases even if the system memory is sufficient for the FP-tree. The characteristics of the test data are as follows. The site of DB is look, the number of total items is $1K{\sim}7K$, avenrage length of transactions is $5{\sim}10$, avergage size of maximal frequent itemsets is $2{\sim}12$(these are typical attributes of data for large-scale convenience stores).

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.530-540
• /
• 2015

Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1305-1317
• /
• 2019

Although encryption for data protection is essential in the big data platform environment of public institutions and corporations, much performance verification studies on encryption algorithms considering actual big data workloads have not been conducted. In this paper, we analyzed the performance change of AES, ARIA, and 3DES for each of six workloads of big data by adding data and nodes in MongoDB environment. This enables us to identify the optimal block-based cryptographic algorithm for each workload in the big data platform environment, and test the performance of MongoDB by testing various workloads in data and node configurations using the NoSQL Database Benchmark (YCSB). We propose an optimized architecture that takes into account.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.455-464
• /
• 2007

The construction of a fingerprint database is important to evaluate the performance of an automatic fingerprint recognition system. Due to the cost of collecting fingerprints, there are only few benchmark databases available. Since it is hard to evaluate how robust the system is in various environments with the databases, this paper proposes a novel method that generates fingerprint images automatically from only a few training samples by using the genetic algorithm. Fingerprints generated by the proposed method include similar characteristics of those collected from the corresponding real environment. The proposed method has been verified by comparing with real fingerprint images, showing the usefulness of the method.