• 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 KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1403-1406
• /
• 2003

XML이 가지는 다양한 장점을 이용하기 위해, 음악을 XML로 표현하려는 다양한 연구가 계속되고 있다. 그러나, SMDL, MNML, MusicXML과 같은 기존의 연구는 악보상의 정보를 그대로 표현하거나, 전자 음악의 표준인 MIDI 포맷과의 상호교환성을 중심으로 연구되어 왔기 때문에 음악에 대해 구조-내용 기반 복합 검색을 하기에는 부적합하다. 이를 해결하기 위해 본 논문에서는 음악의 대표 선율을 이용한 구조-내용 기반 복합 검색을 위한 XML 스키마를 제안한다. 먼저, 본 논문에서는 사용자가 질의할 가능성이 높은 첫 동기, 절정, 일정 유사도 내에서 반복되는 주제 선율을 해당 음악을 대표하는 선율로서 XML 스키마에 표현하였다. 제안한 XML 스키마에 대해 XML 질의 언어를 이용하여 구조-내용 기반 복합 검색시 전체 선율을 검색하지 않고 대표 선율만을 검색하여 사용자의 응답 시간을 빠르게 할 수 있다.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.495-508
• /
• 2004

Recently, in content-based music information retrieval systems, to enhance the response time of retrieving music data from large music database, some researches have adopted the indexing mechanism that extracts and indexes the representative melodies. The representative melody of music data must stand for the music itself and have strong possibility to use as users' input queries. However, since the previous researches have not considered the musical composition forms, they are not able to correctly catch the contrast, repetition and variation of motif in musical forms. In this paper, we use an index automatically constructed from representative melodies such like first melody, climax melodies and similarly repeated theme melodies. At first, we expand the clustering algorithm in order to extract similarly repeated theme melodies based on the musical composition forms. If the first melody and climax melodies are not included into the representative melodies of music by the clustering algorithm, we add them into representative melodies. We implemented a prototype system and did experiments on comparison the representative melody index with other melody indexes. Since, we are able to construct the representative melody index with the lower storage by 34％ than whole melody index, the response time can be decreased. Also, since we include first melody and climax melody which have the strong possibility to use as users' input query into representative melodies, we are able to get the more correct results against the various users' input queries than theme melody index with the cost of storage overhead of 20％.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1037-1044
• /
• 2007

Recently, we extract the representative melody of the music and index the music to reduce searching time at the content-based music retrieval system. The existing study has used MIDI data to extract a representative melody but it has a weak point that can use only MIDI data. Therefore, this paper proposes a representative melody retrieval method that can be use at all audio file format and uses digital signal processing. First, we use Fast Fourier Transform (FFT) and find the tempo and node for the representative melody retrieval. And we measure the frequency of high value that appears from PCM Data of each node. The point which the high value is gathering most is the starting point of a representative melody and an eight node from the starting point is a representative melody section of the audio data. To verity the performance of the method, we chose a thousand of the song and did the experiment to extract a representative melody from the song. In result, the accuracy of the extractive representative melody was 79.5% among the 737 songs which was found tempo.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.3-6
• /
• 2001

오늘날, 웹과 네트???p의 발달로 인하여 많은 멀티미디어 정보들이 쏟아지고 있고 이에 따라 멀티미디어 정보에 대한 검색 시스템이 활발히 연구중에 있다. 아직까지 음악정보 검색에 대한 연구는 미비한데 최근 XML이 인터넷상에서 정보교환의 표준으로 자리잡으면서 서양음악을 표현하기 위한 방법으로서 MusicXML, ScoreML과 같은 포맷이 고안되었다. 기존의 음악검색기법들이 음악파일에 대해 선율 정보를 검색한 것에 비해 본 논문은 음악을 텍스트로 표현한 XML문서에 대해 멜로디만을 동기 단위로 추출하여 이동도법으로 변환하여 저장함으로서 효율적인 선율 검색이 되도록 데이터베이스 저장소를 설계한다.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.137-145
• /
• 2006

A user remembers a melody as not the combination of pitch and duration which is written in score but the contour which is composed of the relative pitch and duration. Because of the way of remembering a melody the previous Music Information Retrieval Systems which uses keyboard Playing or score as the main input melody are not easily acceptable in Query By Humming Systems. In this paper, we mention about the considerable checkpoints for Query By Humming System and previous researches. And we propose the feature extraction which is similar with the way of remembering a melody and similarity computation algorithms between melody in humming and melody in music. The proposed similarity computation algorithms solves the problem which can be happened when only uses the relative pitches by using relative durations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3762-3774
• /
• 2000

The advances of computer hardware and information processing technologies raise the needs of multimedia information retrieval systems. Up to date. multimedia information systems have been developed for text information and image information. Nowadays. the multimedia information systems for video and audio information. especially for musical information have been grown up more and more. In recent music information retrieval systems. not only the information retrieval based on meta-information such like composer and title but also the content-based information retrieval is supported. The content-based information retrieval in music information retrieval systems utilize the similarity value between the user query and the music information stored in music database. In tbis paper. hence. we developed a similarity computation algorithm in which the pitches and lengths of each corresponding pair of notes are used as the fundamental factors for similarity computation between musical information. We also make an experiment of the proposed algorithm to validate its appropriateness. From the experimental results. the proposed similarity computation algorithm is shown to be able to correctly check whether two music files are analogous to each other or not based on melodies.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.1-11
• /
• 1998

This paper describes design and implementation of the system that is used to efficiently retrieve music information at a digital music library. Unlike typical music information retrieval systems, this system allows the user to sing a part of the melody through the microphone which he/she wants to find rather than using title, composer or the subject catalog to search. The system then recognizes the musical notes information through the signal processing of the sounds of the entered melody, and the intervals contour is created based on this information and used as a search pattern. By running the proposed notes string search algorithm that uses the musical notes information processed with the user input, and it produces the approximate search results. Therefore, users are able to retrieve and appreciate the music whenever he/she can sing any portion of the desired music.

• Journal of the Korean Society for information Management
• /
• v.30 no.3
• /
• pp.23-48
• /
• 2013

This study compared and analyzed 15 CBMR (Content-based Music Retrieval) systems accessible on the web in terms of DB size and type, query type, access point, input and output type, and search functions, with reviewing features of music information and techniques used for transforming or transcribing of music sources, extracting and segmenting melodies, extracting and indexing features of music, and matching algorithms for CBMR systems. Application of text information retrieval techniques such as inverted indexing, N-gram indexing, Boolean search, truncation, keyword and phrase search, normalization, filtering, browsing, exact matching, similarity measure using edit distance, sorting, etc. to enhancing the CBMR; effort for increasing DB size and usability; and problems in extracting melodies, deleting stop notes in queries, and using solfege as pitch information were found as the results of analysis.