• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.400-405
• /
• 2006

In this paper, we present effective methods for music summarization which summarize music automatically. It could be used for sample music of on-line digital music provider or some music retrieval technology. When summarizing music, we use different two methods according to music length. First method is for finding sabi or chorus part of music which can be regarded as the most important part of music and the second method is for extracting several parts which are in different structure or have different mood in the music. Our proposed music summarization system is better than conventional system when structure of target music is explicit. The proposed method could generate just one important segment of music or several segments which have different mood in the music. Thus, this scheme will be effective for summarizing music in several applications such as online music streaming service and sample music for Tcommerce.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.268-273
• /
• 2007

In this paper, we present effective methods for automatic music recommendation system which automatically recommend music by signal processing technology. Conventional music recommendation system use users’ music downloading pattern, but the method does not consider acoustic characteristics of music. Sometimes, similarities between music are used to find similar music for recommendation in some method. However, the feature used for calculating similarities is not highly related to music characteristics at the system. Thus, our proposed method use high-level music characteristics such as rhythm pattern, timbre characteristics, and the lyrics. In addition, our proposed method store features of music, which individuals queried, to recommend music based on individual taste. Experiments show the proposed method find similar music more effectively than a conventional method. The experimental results also show that the proposed method could be used for real-time application since the processing time for calculating similarities between music, and recommending music are fast enough to be applicable for commercial purpose.

• ETRI Journal
• /
• v.46 no.4
• /
• pp.697-707
• /
• 2024

Music identification is widely regarded as a solved problem for music searching in quiet environments, but its performance tends to degrade in TV broadcast audio owing to the presence of dialogue or sound effects. In addition, constructing an accurate dataset for measuring the performance of background music monitoring in TV broadcast audio is challenging. We propose a framework for monitoring background music by automatic identification and introduce a background music cue sheet. The framework comprises three main components: music identification, music-speech separation, and music detection. In addition, we introduce the Cue-K-Drama dataset, which includes reference songs, audio tracks from 60 episodes of five Korean TV drama series, and corresponding cue sheets that provide the start and end timestamps of background music. Experimental results on the constructed and existing datasets demonstrate that the proposed framework, which incorporates music identification with music-speech separation and music detection, effectively enhances TV broadcast audio monitoring.

• Journal of Advanced Navigation Technology
• /
• v.17 no.4
• /
• pp.386-395
• /
• 2013

This paper proposes a root-assisted MUSIC algorithm which uses a combination of the MUSIC and the root-MUSIC algorithm. This algorithm consists of two steps. Firstly, a coarse DOA is computed by the root-MUSIC algorithm. Secondly, a precise DOA estimation is carried out by the MUSIC algorithm in the reduced searching range. This paper analyzes the accuracy and the resolution performance of the proposed DOA estimation method using a software simulation platform.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.2E
• /
• pp.39-43
• /
• 2007

Music summarization refers to a technique which automatically extracts the most important and representative segments in music content. In this paper, we propose and evaluate a technique which provides the repeated part in music content as music summary. For extracting a repeated segment in music content, the proposed algorithm uses the weighted sum of similarity measures based on multi-level vector quantization for fixed-length summary or optimal-length summary. For similarity measures, count-based similarity measure and distance-based similarity measure are proposed. The number of the same codeword and the Mahalanobis distance of features which have same codeword at the same position in segments are used for count-based and distance-based similarity measure, respectively. Fixed-length music summary is evaluated by measuring the overlapping ratio between hand-made repeated parts and automatically generated ones. Optimal-length music summary is evaluated by calculating how much automatically generated music summary includes repeated parts of the music content. From experiments we observed that optimal-length summary could capture the repeated parts in music content more effectively in terms of summary length than fixed-length summary.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.2E
• /
• pp.51-56
• /
• 2008

In this paper, we propose an effective method for music summarization which automatically extracts a representative part of the music by using signal processing technology. Proposed method uses a vector quantization technique to extract several segments which can be regarded as the most important contents in the music. In general, there is a repetitive pattern in music, and human usually recognizes the most important or catchy tune from the repetitive pattern. Thus the repetition which is extracted using segment similarity is considered to express a music summary. The segments extracted are again combined to generate a complete music summary. Experiments show the proposed method captures the main theme of the music more effectively than conventional methods. The experimental results also show that the proposed method could be used for real-time application since the processing time in generating music summary is much faster than other methods.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.826-836
• /
• 2016

Mastering a musical instrument for an unskilled beginning learner is not an easy task. It requires playing every note correctly and maintaining the tempo accurately. Any music comes in two forms, a music score and it rendition into an audio music. The proposed method of assisting beginning music players in both aspects employs two popular pattern recognition methods for audio-visual analysis; they are support vector machine (SVM) for music score recognition and hidden Markov model (HMM) for audio music performance tracking. With proper synchronization of the two results, the proposed music learning assistant system can give useful feedback to self-training beginners.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.11
• /
• pp.880-885
• /
• 2017

In AD-MUSIC algorithm, DOD/DOA can be estimated without computationally expensive two-dimensional search. In this paper, to further reduce the computational complexity, the Newton type method has been applied to one-dimensional search. In this paper, we summarize the formulation of the AD-MUSIC algorithm, and present how to apply Newton-type iteration to AD-MUSIC algorithm for improvement of the accuracy of the DOD/DOA estimates. Numerical results are presented to show that the proposed scheme is efficient in the viewpoints of computational burden and estimation accuracy.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.39-46
• /
• 2016

While the difficulty of the music can be classified by a variety of standard, conventional methods are classified by the subjective judgment based on the experience of many musicians or conductors. Music score is difficult to evaluate as there is no quantitative criterion to determine the degree of difficulty. In this paper, we propose a new classification method for determining the degree of difficulty of the music. In order to determine the degree of difficulty, we convert the score, which is expressed as a traditional music score, into electronic music sheet. Moreover, we calculate information about the elements needed to play sheet music by distance of notes, tempo, and quantifying the ease of interpretation. Calculating a degree of difficulty of the entire music via the numerical data, we suggest the difficulty evaluation of the score, and show the difficulty of music through experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1170-1175
• /
• 2007

This paper presents techniques to recognize music using back propagation network one of the neural network algorithms, and to preprocess technique for music mage. Music symbols and music notes are segmented by preprocessing such as binarization, slope correction, staff line removing, etc. Segmented music symbols and music notes are recognized by music note recognizing network and non-music note recognizing network. We proved correctness of proposed music recognition algorithm though experiments and analysis with various kind of musics.