• The Journal of the Acoustical Society of Korea
• /
• v.30 no.8
• /
• pp.461-467
• /
• 2011

Accurate classification of input signals is the key prerequisite for variable bit-rate coding, which has been introduced in order to effectively utilize limited communication bandwidth. Especially, recent surge of multimedia services elevate the importance of speech/music classification. Among many speech/music classifier, the ones based on support vector machine (SVM) have a strong selling point, high classification accuracy, but their computational complexity and memory requirement hinder their way into actual implementations. Therefore, techniques that reduce the computational complexity and the memory requirement is inevitable, particularly for embedded systems. We first analyze implementation of an SVM-based classifier on embedded systems in terms of execution time and energy consumption, and then propose two techniques that alleviate the implementation requirements: One is a technique that removes support vectors that have insignificant contribution to the final classification, and the other is to skip processing some of input signals by virtue of strong correlations in speech/music frames. These are post-processing techniques that can work with any other optimization techniques applied during the training phase of SVM. With experiments, we validate the proposed algorithms from the perspectives of classification accuracy, execution time, and energy consumption.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1398-1406
• /
• 2007

Providing natural and efficient access to the fast growing multimedia information is a critical aspect for content-based information system. Query by humming system allows the user to find a song by humming part of the tune form music database. Conventional music information retrieval systems use a high precision pitch extraction method. However, it is very difficult to extract true pitch perfectly. So, In this paper, we propose to use YIN parameter with applying the reliability to reduce the pitch extraction errors. And we describes developed music information retrieval method based on a query by humming system which uses reliable feature extraction. Developed system is based on a continuous dynamic programming algorithm with features including pitch, duration and energy along with their confidence measures. The experiment showed that the proposed method could reduce the errors of the top-10 7.2% and the top-1 9.1% compared with the cepsturm based multiple pitch candidate. The overall retrieval system achieved 92.8% correct retrieval in the top-10 rank list on a database of 155 songs.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.11
• /
• pp.133-140
• /
• 2012

In this paper, we propose a music recommendation method considering users' tags by collaborative tagging in a social music site. Since collaborative tagging allows a user to add keywords chosen by himself to web resources, it provides users' preference about the web resources concretely. In particular, emotional tags which represent human's emotion contain users' musical preference more directly than factual tags which represent facts such as musical genre and artists. Therefore, to classify the tags into the emotional tags and the factual tags and to assign weighted values to the emotional tags, a tag ontology called UniTag is developed. After preprocessing the tags, the weighted tags are used to create user profiles, and the music recommendation algorithm is executed based on the profiles. To evaluate the proposed method, a conventional playcount-based recommendation, an unweighted tag-based recommendation, and an weighted tag-based recommendation are executed. Our experimental results show that the weighted tag-based recommendation outperforms other two approaches in terms of precision.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.1
• /
• pp.15-23
• /
• 2003

This paper proposes a fast direction of arrival (DOA) estimation algorithm that can rapidly estimate incidence angles of incoming signals using a pseudo covariance matrix. The conventional subspace DOA estimation methods such as MUSIC (multiple signal classification) algorithms need many sample signals to acquire covariance matrix of input signals. Thus, it is difficult to estimate the DOAs of signals because they cannot perform DOA estimation during receiving sample signals. Also if the D0As of signals are changing rapidly, conventional algorithms cannot estimate incidence angles of signals exactly. The proposed algorithm obtains bearing response and directional spectrum after acquiring pseudo covariance matrix of each snapshot. The incidence angles can be exactly estimated by using the bearing response and directional spectrum. The proposed DOA estimation algorithm uses only concurrent snapshot so as to obtain covariance matrix. Compared to conventional DOA estimation methods. The proposed algorithm has an advantage that can estimate DOA of signal rapidly.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.11
• /
• pp.876-885
• /
• 1991

This paper proposes an on-line method of understanding humans conducting action observed through a vision sensor. The vision system captures images of conducting action and extracts image coordinates of endpoint of the baton. A proposed algorithm based on the expert knowledge about conducting recognizes patterns of the conducting action from the extracted image coordimates and play the corresponding music score. Complementary algorithms are also proposed for identifying the first beat static point and dynamics through extensive experiments, this algorithm is found to detect lower edges and upper edges without error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.515-523
• /
• 1997

A high resolution algorithm is presented for resolving multiple coherent spread spectrum signals that are incident on an equispaced linear array. Unlike the conventional noise-eigenvector based methods, this algorithm makes use of the signal eigenvectors of the array spectral density matrix that are associates with eigenvalues that are larger than the sensor noise level. Simulation results are shown to demonstate the high performance of the proposed approach in comparison with MUSIC in which coherent signal subspace method (CSM) is employed.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.507-520
• /
• 2003

In this paper, an automatic construction method of theme melody index for large music database and an associative content-based music retrieval mechanism in which the constructed theme melody index is mainly used to improve the users' response time are proposed. First, the system automatically extracted the theme melody from a music file by the graphical clustering algorithm based on the similarities between motifs of the music. To place an extracted theme melody into the metric space of M-tree, we chose the average length variation and the average pitch variation of the theme melody as the major features. Moreover, we added the pitch signature and length signature which summarize the pitch variation pattern and the length variation pattern of a theme melody, respectively, to increase the precision of retrieval results. We also proposed the associative content-based music retrieval mechanism in which the k-nearest neighborhood searching and the range searching algorithms of M-tree are used to select the similar melodies to user's query melody from the theme melody index. To improve the users' satisfaction, the proposed retrieval mechanism includes ranking and user's relevance feedback functions. Also, we implemented the proposed mechanisms as the essential components of content-based music retrieval systems to verify the usefulness.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.6
• /
• pp.488-496
• /
• 2004

This paper describes a music information retrieval system which uses humming as the key for retrieval Humming is an easy way for the user to input a melody. However, there are several problems with humming that degrade the retrieval of information. One problem is a human factor. Sometimes people do not sing accurately, especially if they are inexperienced or unaccompanied. Another problem arises from signal processing. Therefore, a music information retrieval method should be sufficiently robust to surmount various humming errors and signal processing problems. A retrieval system has to extract pitch from the user's humming. However pitch extraction is not perfect. It often captures half or double pitches. even if the extraction algorithms take the continuity of the pitch into account. Considering these problems. we propose a system that takes multiple pitch candidates into account. In addition to the frequencies of the pitch candidates. the confidence measures obtained from their powers are taken into consideration as well. We also propose the use of an algorithm with three dimensions that is an extension of the conventional DP algorithm, so that multiple pitch candidates can be treated. Moreover in the proposed algorithm. DP paths are changed dynamically to take deltaPitches and IOIratios of input and reference notes into account in order to treat notes being split or unified. We carried out an evaluation experiment to compare the proposed system with a conventional system. From the experiment. the proposed method gave better retrieval performance than the conventional system.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.748-764
• /
• 2019

In order to deal with the filtering delay problem of least mean square adaptive filter noise reduction algorithm and music noise problem of spectral subtraction algorithm during the speech signal processing, we combine these two algorithms and propose one novel noise reduction method, showing a strong performance on par or even better than state of the art methods. We first use the least mean square algorithm to reduce the average intensity of noise, and then add spectral subtraction algorithm to reduce remaining noise again. Experiments prove that using the spectral subtraction again after the least mean square adaptive filter algorithm overcomes shortcomings which come from the former two algorithms. Also the novel method increases the signal-to-noise ratio of original speech data and improves the final noise reduction performance.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.409-419
• /
• 2007

Database community focuses on the similar music retrieval systems for music database when a humming query is given. One of the approaches is converting the midi data to time series, building their indices and performing the similarity search on them. Queries based on humming can be transformed to time series by using the known pitch detection algorithms. The recently suggested algorithm, scaled and warped matching, is based on dynamic time warping and uniform scaling. This paper proposes Humming BIRD(Humming Based sImilaR mini music retrieval system) using sliding window and center-aligned scaled and warped matching. Center-aligned scaled and warped matching is a mixed distance measure of center-aligned uniform scaling and time warping. The newly proposed measure gives tighter lower bound than previous ones which results in reduced search space. The empirical results show the superiority of this algorithm comparing the pruning power while it returns the same results.