• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.85-90
• /
• 2006

In this paper, we propose the content-based music information retrieval system with improved retrieval speed and stable performance while maintaining resonable retrieval accuracy In order to solve the in-stable system problem multi-feature clustering (MFC) is used to setup robust music DB. In addition, the music retrieval speed was improved by using the Superclass concept. Effectiveness of the system with SuperClass and without SuperClass is compared in terms of retrieval speed, accuracy and retrieval precision. It is demonstrated that the use of WC and Superclass substantially improves music retrieval speed up to $20\%\~40\%$ while maintaining almost equal retrieval accuracy.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.217-227
• /
• 2005

In this paper, we present the result of an efficient implementation of DirectX-based multichannel visual monitoring system and the performance analysis of it. Our proposed system mainly consists of three subsystems: display, storage, and retrieval/playback. The display subsystem is designed to utilize efficiently H/W acceleration, overlay and flip of DirectX for faster real-time display, display synchronization among channels, and improvement of tearing artifact. For the performance improvement of storage speed, the storage subsystem is designed and implemented in DirectShow Filter-based multithreading architecture so that it can store multichannel video streams efficiently in each channel with minimizing data bottleneck among channels. In the retrieval and playback subsystem, efficient index file architecture and video data storage architecture, efficient playback architecture which can make playback be processed parallel among channels are designed and implemented for faster retrieval and playback,. Through experiments, our proposed system is shown to be maximally 2 times as fast in storaging speed and maximally 3.5 times as fast in retrieval and playback speed as the previous system.

• Journal of the Semiconductor & Display Technology
• /
• v.14 no.2
• /
• pp.53-59
• /
• 2015

Since the amount of digital image continues to grow in usage, users feel increased difficulty in finding specific images from the image collection. This paper proposes a novel image searching scheme that extracts the image feature using combination of Advanced SURF (Speed-Up Robust Feature) and DCD (Dominant Color Descriptor). The key point of this research is to provide a new feature extraction algorithm to improve the existing SURF method with removal of unnecessary feature in image retrieval, which can be adaptable to mobile system and efficiently run on the mobile environments. To evaluate the proposed scheme, we assessed the performance of simulation in term of average precision and F-score on two databases, commonly used in the field of image retrieval. The experimental results revealed that the proposed algorithm exhibited a significant improvement of over 14.4% in retrieval effectiveness, compared to OpenSURF. The main contribution of this paper is that the proposed approach achieves high accuracy and stability by using ASURF and DCD in searching for natural image on mobile platform.

• Journal of Broadcast Engineering
• /
• v.1 no.2
• /
• pp.96-107
• /
• 1996

In case of remote image retrieval via shared network or low speed link in order to make a decision for target image problems such as transmission delay are encountered. In this paper browsing and optimization techniques are proposed for fast retrieval of Image by the multiresolution representation and progressive transmission. The proposed network model was analyzed and evaluated for system's performance improvement. Interactive user-system using several multiresolution representation has shown better performance in transmission delay minimization over the single resolution image retrieval system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• MALSORI
• /
• no.67
• /
• pp.149-166
• /
• 2008

In spoken document retrievals (SDR), subword (typically phonemes) indexing term is used to avoid the out-of-vocabulary (OOV) problem. It makes the indexing and retrieval process independent from any vocabulary. It also requires a small corpus to train the acoustic model. However, subword indexing term approach has a major drawback. It shows higher word error rates than the large vocabulary continuous speech recognition (LVCSR) system. In this paper, we propose an probabilistic slot detection and n-gram based string matching method for phone based spoken document retrievals to overcome high error rates of phone recognizer. Experimental results have shown 9.25% relative improvement in the mean average precision (mAP) with 1.7 times speed up in comparison with the baseline system.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1851-1854
• /
• 2003

This paper suggests an algorithm which can retrieval images using correlations between the region classification of spatial image and the wavelet transform even though the images are rotated in a ${\pm}$90 degree arc. Owing to this proposed method, it was confirmed from experiments that the search about the whole image is not processed and only a few amount of informations are saved by using the mathematical statistics from the block map and transformed band which is resulted from region classification, and by performing the image search based on these, the improvement of search speed and the efficient search can be done.

• Korean Journal of Optics and Photonics
• /
• v.15 no.3
• /
• pp.278-284
• /
• 2004

A Second Harmonic Generation Frequency Resolved Optical Gating(SHG FROG) system was developed. Its performance test shows that it is capable of accurately measuring the temporal evolution of the electric field, both amplitude and phase, of femtosecond light pulses. For the retrieval of the temporal evolution of light pulses from their spectrograms obtained by using the FROG system, Principal Components Generalized Projection(PCGP) algorithm is used and in addition we used additional constraints of second-harmonic spectrum, marginals in frequency and time-delay of the spectrogram. Such modification of the software brings about significant improvement in speed and stability of the pulse retrieval process.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.9
• /
• pp.2061-2065
• /
• 2009

Two simple algorithm modifications are made to the THRASH data retrieval program with the aim of improving analysis speed for complex Fourier transform ion cyclotron resonance (FTICR) mass spectra. Instead of calculating the least-squares fit for every charge state in the backup charge state determination algorithm, only some charge states are pre-selected based on the plausibility values obtained from the FT/Patterson analysis. Second, a modification is made to skip figure-of-merit (FOM) calculations in the central m/z region between two neighboring peaks in isotopic cluster distributions, in which signal intensities are negligible. These combined modifications result in a significant improvement in the analysis speed, which reduces analysis time as much as 50% for ubiquitin (8.6 kDa, 76 amino acids) FTICR MS and MS/MS spectra at the reliability (RL) value = 0.90 and five pre-selected charge states with minimal decreases in data analysis quality (Table 3).

• Journal of Computing Science and Engineering
• /
• v.9 no.1
• /
• pp.29-38
• /
• 2015

Human action recognition has become an important research topic in computer vision area recently due to many applications in the real world, such as video surveillance, video retrieval, video analysis, and human-computer interaction. The goal of this paper is to evaluate descriptors which have recently been used in action recognition, namely Histogram of Oriented Gradient (HOG) and Histogram of Optical Flow (HOF). This paper also proposes new descriptors to represent the change of points within each part of a human body, caused by actions named as Histogram of Changing Points (HCP) and so-called Average Speed (AS) which measures the average speed of actions. The descriptors are combined to build a strong descriptor to represent human actions by modeling the information about appearance, local motion, and changes on each part of the body, as well as motion speed. The effectiveness of these new descriptors is evaluated in the experiments on KTH and Hollywood datasets.