• Title/Summary/Keyword: MusicSearch

Search Result 152, Processing Time 0.024 seconds

Analysis of Mobile Search Functions of Korean Search Portals (검색 포털들의 모바일 검색 기능 분석)

  • Park, So-Yeon
    • Journal of the Korean Society for information Management
    • /
    • v.29 no.1
    • /
    • pp.175-190
    • /
    • 2012
  • This study aims to investigate the current status of mobile search functions of Korean search portals, namely Google Korea, Naver, Nate, Daum, and Yahoo Korea. This study focuses on unique mobile search functionalities, such as voice search, music search, code search, and visual/ object search. In particular, this study analyzed characteristics of these search functions and evaluated their performances based on the accuracy and the speed of recognition. The results of this study show that both Naver and Daum support various mobile searching functions, whereas Google only supports voice search. Nate and Yahoo do not offer any unique function. The results of this study can be applied to the portal's effective development of mobile search functionalities.

A relevance-based pairwise chromagram similarity for improving cover song retrieval accuracy (커버곡 검색 정확도 향상을 위한 적합도 기반 크로마그램 쌍별 유사도)

  • Jin Soo Seo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.43 no.2
    • /
    • pp.200-206
    • /
    • 2024
  • Computing music similarity is an indispensable component in developing music search service. This paper proposes a relevance weight of each chromagram vector for cover song identification in computing a music similarity function in order to boost identification accuracy. We derive a music similarity function using the relevance weight based on the probabilistic relevance model, where higher relevance weights are assigned to less frequently-occurring discriminant chromagram vectors while lower weights to more frequently-occurring ones. Experimental results performed on two cover music datasets show that the proposed music similarity improves the cover song identification performance.

A Comparative Analysis of Content-based Music Retrieval Systems (내용기반 음악검색 시스템의 비교 분석)

  • Ro, Jung-Soon
    • 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.

A Hybrid Multimedia Contents Recommendation Procedure for a New Item Problem in M-commerce (하이브리드 기법을 이용한 신상품 추천문제 해결방안에 관한 연구 : 모바일 멀티미디어 컨텐츠를 중심으로)

  • Kim Jae-Kyeong;Cho Yoon-Ho;Kang Mi-Yeon;Kim Hyea-Kyeong
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.2
    • /
    • pp.1-15
    • /
    • 2006
  • Currently the mobile web service is growing with a tremendous speed and mobile contents are spreading extensively. However, it is hard to search what the user wants because of some limitations of cellular phones. And the music is the most popular content, but many users experience frustrations to search their desired music. To solve these problems, this research proposes a hybrid recommendation system, MOBICORS-music (MOBIle COntents Recommender System for Music). Basically it follows the procedure of Collaborative Filtering (CF) system, but it uses Contents-Based (CB) data representation for neighborhood formation and recommendation of new music. Based on this data representation, MOBICORS-music solves the new item ramp-up problem and results better performance than existing CF systems. The procedure of MOBICORS-music is explained step by step with an illustrative example.

  • PDF

A Study on Desired Signal Estimation in Correlation Signal of Array Antennas (배열 안테나의 상관성 신호에서 원하는 신호 추정 방법에 대한 연구)

  • Lee, Min-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.4
    • /
    • pp.275-280
    • /
    • 2015
  • In this paper, we studied for modified MUSIC algorithm of direction of arrival (DOA)estimation. Modified MUSIC algorithm search optimal covariance matrix using singular value decomposition and Bayes method, and desired signals are estimated by updating weight. In order to estimation of desired signals, we used sub spatial method of MUSIC algorithm. General MUSIC algorithm can estimate a desired signal in case of non-correlation signal. But, general MUSIC algorithm in case of correlation signal can not estimate a desired signals and resolution is decreased. Though simulation in case of correlation signal, we analyze to compare proposed MUSIC algorithm with general MUSIC algorithm.

Extracting Melodies from Polyphonic Piano Solo Music Based on Patterns of Music Structure (음악 구조의 패턴에 기반을 둔 다음(Polyphonic) 피아노 솔로 음악으로부터의 멜로디 추출)

  • Choi, Yoon-Jae;Lee, Ho-Dong;Lee, Ho-Joon;Park, Jong C.
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.725-732
    • /
    • 2009
  • Thanks to the development of the Internet, people can easily access a vast amount of music. This brings attention to application systems such as a melody-based music search service or music recommendation service. Extracting melodies from music is a crucial process to provide such services. This paper introduces a novel algorithm that can extract melodies from piano music. Since piano can produce polyphonic music, we expect that by studying melody extraction from piano music, we can help extract melodies from general polyphonic music.

  • PDF

Improving Cover Song Search Accuracy by Extracting Salient Chromagram Components (강인한 크로마그램 성분 추출을 통한 커버곡 검색 성능 개선)

  • Seo, Jin Soo
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.6
    • /
    • pp.639-645
    • /
    • 2019
  • This paper proposes a salient chromagram components extraction method based on the temporal discrete cosine transform of a chromagram block to improve cover song retrieval accuracy. The proposed salient chromagram emphasizes tonal contents of music, which are well-preserved between an original song and its cover version, while reducing the effects of timbre difference. We apply the proposed salient chromagram extraction method as a preprocessing step for the Fourier-transform based cover song matching. Experiments on two cover song datasets confirm that the proposed salient chromagram improves the cover song search accuracy.

Design of 2D MUSIC Algorithm to Reduce Computational Burden (연산량 감소를 위한 2D MUSIC 알고리즘 설계)

  • Choi, Yun Sub;Jin, Mi Hyun;Choi, Heon Ho;Lee, Sang Jeong;Park, Chansik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1077-1083
    • /
    • 2012
  • The jamming countermeasures in GNSS includes anti-jamming technique and jammer localization technique. In both techniques, direction of jamming signal is important and generally the MUSIC algorithm is used to find the direction of jamming signal. The MUSIC is super-resolution algorithm for detecting incident direction of signal. But, the search time of MUSIC algorithm is too long because all candidates of incidence angle are searched. This paper proposes the new method that has less computational burdens and therefore faster than the conventional MUSIC algorithm. The proposed method improves performance speed by reducing unnecessary calculations. In the proposed method, the cost function of conventional MUSIC algorithm is decomposed into the sum of squares and if the partial sum of cost function is larger than the minimum cost function so far, then the candidate is rejected and next candidates are searched. If the computed cost function is less than the minimum cost function so far, the minimum cost function so far is replaced with newly computed value. The performance of the proposed method was compared with the conventional MUSIC algorithm using the simulation. The accuracy of the estimaed direction of jamming signal was same as the conventional MUSIC while the search speed of the proposed method was 1.15 times faster than the conventional MUSIC.

An Analysis of Multimedia Search Services Provided by Major Korean Search Portals (주요 포털들의 멀티미디어 검색 서비스 비교 분석)

  • Park, So-Yeon
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.44 no.4
    • /
    • pp.395-412
    • /
    • 2010
  • This study aims to perform an evaluation of multimedia search services provided by major Korean search portals: Naver, Nate, Daum, Yahoo-Korea, Paran, and Google-Korea. These multimedia search services are evaluated in terms of the metadata of search results, search functionalities, searching methods, other functionalities, and display options. Every search portal offers image and video searching, whereas only Naver, Nate, and Daum offer music searching. Advanced searching methods and functions are mostly developed and supported in image and video searching rath than music searching. Naver, Nate, and Daum support various searching functions which search portals abroad have not developed. Google-Korea supports advanced searching functions. Search portals provide a limited number of metadata in search results. This study could contribute to the development and improvement of portal's multimedia search services.

Music Source Signature Indexing Method for Quick Search (빠른 검색을 위한 음원 시그니처 인덱싱 방법)

  • Kim, Sang-Kyun;Lee, Kyoung-Sik
    • Journal of Broadcast Engineering
    • /
    • v.26 no.3
    • /
    • pp.321-326
    • /
    • 2021
  • Blockchain is increasing in value as a platform for safe transmission of capital transactions or secure data. In addition, blockchain has the potential as a new platform that can safely store large amounts of data such as videos, music, and photos, and safely manage transaction details and service usage specifications. Since it is not possible to store large-capacity media data in a block, research on the performance of storing sound source information in a block and retrieving the stored sound source data by using the distributed storage system (IPFS) and the hash information of the sound source signature data was conducted. In this paper, we propose a sound source signature indexing method using a bloom filter that can improve the search speed suggested by previous studies. As a result of the experiment, it was confirmed that improved search performance (O(1)) than the existing search performance (O(n)) can be achieved.