• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.849-856
• /
• 2020

The Angle-of-Arrival(AOA) information for an array antenna receiver is one of the important factors for estimating the location of specific signals and detecting signals efficiently, in various situations. The AOA estimator in the satellite environment can rapidly calculate the AOA information in the wide area, utilizing a planar (grid, circular) array antenna mounted on the satellite. Since the satellite receiver has the limitation of the array antenna size, the concentric circular (ring) array (CCA or CRA) antenna structure with comparatively small size but with multiple antenna elements is more efficient than the uniform circular array (UCA) structure, for the satellite environment. In this paper, we introduce a cascade AOA estimation algorithm based on CRA, consisting of CAPON and Beamspace MUSIC. In addition, we provide computer simulation examples for verifying the estimation performance of the cascade AOA estimation algorithm based on CRA and compare it to the case of UCA.

• Journal of Korean Library and Information Science Society
• /
• v.38 no.2
• /
• pp.185-202
• /
• 2007

This study examines the application of the FRBR model to an integrated KORMARC format using music materials. To do this, first, we analysed an integrated KORMARC format as well as a KORMARC format for audiovisual materials and then based on its analysis results, constructed an algorithm that allows the transformation from KORMARC to FRBR. Second, we used the algorithm to see whether it fits to the existing KORMARC database. Three suggestions were proposed to support the application of the FRBR model on existing integrated KORMARC library catalogues. This study results can be used not only to improve digital library interfaces but also as basic data in revising cataloging rules for the adaptation of the FRBR model.