• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.723-736
• /
• 2014

This paper proposes a matching engine for a query-by-singing/humming (QbSH) system with polyphonic music files like MP3 files. The pitch sequences extracted from polyphonic recordings may be distorted. So we use chroma-scale representation, pre-processing, compensation, and asymmetric dynamic time warping to reduce the influence of the distortions. From the experiment with 28 hour music DB, the performance of our QbSH system based on polyphonic database is very promising in comparison with the published QbSH system based on monophonic database. It shows 0.725 in MRR(Mean Reciprocal Rank). Our matching engine can be used for the QbSH system based on MIDI DB also and that performance was verified by MIREX 2011.

• 방송공학회논문지
• /
• 제24권7호
• /
• pp.1228-1236
• /
• 2019

Recently, media platforms such as YouTube and Twitch provide services that can generate personal revenue by utilizing media content produced by individuals. In this regard, interest in the copyright of media content is increasing. In particular, in the case of an audio source, competition for securing audio source copyright is fierce because it is an essential element for almost all media content production. In this paper, we propose a method to store the audio source and its signature using a blockchain and distributed storage system to verify the copyright of music content. To identify the possibility of extracting the audio signature of the audio source and to include it as blockchain transaction data, we implement the audio source and its signature file upload system based on the proposed scheme. In addition, we show the effectiveness of the proposed method through experiments on uploading and retrieving audio files and identify future improvements.

• The Journal of the Acoustical Society of Korea
• /
• 제25권2E호
• /
• pp.69-73
• /
• 2006

In this paper, we propose a robust music audio fingerprinting system for automatic music retrieval. The fingerprint feature is extracted from the long-term dynamic modulation spectrum (LDMS) estimation in the perceptual compressed domain. The major advantage of this feature is its significant robustness against severe background noise from the street and cars. Further the fast searching is performed by looking up hash table with 32-bit hash values. The hash value bits are quantized from the logarithmic scale modulation frequency coefficients. Experiments illustrate that the LDMS fingerprint has advantages of high scalability, robustness and small fingerprint size. Moreover, the performance is improved remarkably under the severe recording-noise conditions compared with other power spectrum-based robust fingerprints.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.400-416
• /
• 2017

Music emotion is an important component in the field of music information retrieval and computational musicology. This paper proposes an approach for automatic emotion classification, based on rough set (RS) theory. In the proposed approach, four different sets of music features are extracted, representing dynamics, rhythm, spectral, and harmony. From the features, five different statistical parameters are considered as attributes, including up to the $4^{th}$ order central moments of each feature, and covariance components of mutual ones. The large number of attributes is controlled by RS-based approach, in which superfluous features are removed, to obtain indispensable ones. In addition, RS-based approach makes it possible to visualize which attributes play a significant role in the generated rules, and also determine the strength of each rule for classification. The experiments have been performed to find out which audio features and which of the different statistical parameters derived from them are important for emotion classification. Also, the resulting indispensable attributes and the usefulness of covariance components have been discussed. The overall classification accuracy with all statistical parameters has recorded comparatively better than currently existing methods on a pair of datasets.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.532-535
• /
• 2008

디지털 콘텐츠의 대부분을 차지하는 동영상에 대한 검색 서비스가 필수 기능으로 대두되고 있으며, 검색 서비스를 수행하는 시스템은 최신 기술을 접목시켜 보다 지능적이고, 의미적인 검색을 할 수 있는 검색 엔진이나 지능형 검색 기법 등의 필요성이 점차 증대되고 있다. 이에 본 논문에서는 디지털 콘텐츠 데이터에 대한 특성요소 분석 및 검색 기술과 구현, 감성어휘기반 분석 및 검색 방안을 위해 멀티미디어 콘텐츠 데이터의 구조 설계와 분석 관리 도구 및 의미론적 특성요소 추출기술과 콘텐츠 내 컬러 정보 기반 감성처리 알고리즘을 제안하였다.

• 대한전자공학회논문지SP
• /
• 제41권4호
• /
• pp.113-120
• /
• 2004

본 논문은 내용 기반 검색 기법에 의한 보다 효율적인 특징 추출 및 영상 검색 알고리즘을 제안하였다. 먼저, MPEG 비디오의 key frame을 입력 영상으로 하여 Gaussian edge detector를 이용하여 객체를 추출하고, 그에 따른 객체 특징들, location feature distributed dimension feature와 invariant moments feature를 추출하였다. 다음, 제안하는 HAQ (Histogram Analysis and Quantization) 알고리즘으로 characteristic color feature를 추출하였다. 마지막으로 key frame이 아닌 shot frame을 질의영상으로 하여 제안된 matching 기법에 따라 4가지 특징들의 단계별 검색을 수행하였다. 본 논문의 목적은 사용자가 요구하는 장면이 속한 비디오의 shot 경계 내의 key frame을 검색하는 새로운 내용 기반 검색 알고리즘을 제안함에 있다. 제안된 알고리즘을 바탕으로 10개의 뮤직비디오, 836개의 시험 영상으로 실험한 결과, 효과적인 검색 효율을 보였다.

• 한국콘텐츠학회논문지
• /
• 제14권2호
• /
• pp.28-38
• /
• 2014

서양 음악의 경우 자동채보와 내용기반 음악검색을 위한 음악 정보 분석연구가 활발하게 진행되고 있다. 그러나 한국 전통음악에서는 유사한 연구사례를 찾아보기 어렵다. 본 논문에서는 한국의 전통음악인 판소리 구조를 자동으로 분석하기 위한 알고리즘들을 제안한다. 제안된 알고리즘은 음성과 비음성의 시간 간격비율을 이용하여 '소리' 부분과 '아니리' 부분을 자동으로 구분한다. 뿐만 아니라 알고리즘은 '장단'이라 칭하는 리듬을 템플릿 이용한 다수결 결정 방법으로 강건하게 구분한다. 또한 알고리즘은 칼만 필터를 이용하여 '소리' 부분의 마디 지점을 검지해낸다. 본 논문에서 제안된 알고리즘들은 판소리 샘플들에서 양호하게 동작하였으며 자동채보의 전단계의 구조분석에 유용할 수 있다.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• ETRI Journal
• /
• 제34권6호
• /
• pp.958-961
• /
• 2012

In this letter, we present a new algorithm for the harmonic and percussive separation of jazz music. Using a short-time Fourier transform and nonnegative matrix factorization, the signal is decomposed into rank components. Each component is then split into harmonic and percussive parts using masks calculated based on their tonalities. Finally, the harmonic and percussive parts are separated after applying the masks and a summation. We evaluate the algorithm based on real audio examples using both objective and subjective assessments. The proposed algorithm performs well for the separation of harmonic and percussive parts of jazz excerpts.

• 한국음향학회지
• /
• 제38권3호
• /
• pp.314-319
• /
• 2019

음악 커버곡 검색 시스템 구현에 있어서 크로마그램 간 유사도 계산은 필수적인 구성 요소이다. 본 논문은 크로마그램 비교에 소요되는 저장공간 및 계산량을 줄이기 위한 크로마그램 코딩 방법을 제안한다. 음악별로 코드북을 학습하여 크로마그램 수열을 코드 수열로 변환하여 저장 공간을 줄이게 된다. 얻어진 코드 간 거리를 룩업 테이블에 저장하여 크로마그램 비교의 속도를 개선하였다. 두 가지 커버곡 실험 데이터셋에서 성능 비교를 수행하여, 제안된 코드 기반 방법과 기존 방법 간의 커버곡 검색 정확도, 저장 공간, 계산량을 비교하였다.