Abstract:
PURPOSE: An image partitioning method using correlation clustering, a system processing the same, and a recording medium are provided to eliminate the need of predetermining the number of partition region or partitioning degree of each image, thereby implementing image partitioning customized for a task through training. CONSTITUTION: A system divides an input image into super pixels (S210). The system constructs a graph from two neighboring super pixels among the obtained super pixels through a connection in consideration of a specific condition (S220). The system extracts a feature vector of each edge of the graph, forms a joint feature map, and partitions the constructed graph through correlation clustering (S230). [Reference numerals] (AA) Start; (BB) End; (S210) System divides an input image into super pixels; (S220) System constructs a graph from two neighboring super pixels among the obtained super pixels through a connection in consideration of a specific condition; (S230) System extracts a feature vector of each edge of the graph, forms a joint feature map, and partitions the constructed graph through correlation clustering
Abstract:
본 발명은 영상 자료를 데이터베이스에 입력할 때 영상자료를 분석하여 그 특징을 추출하고, 이를 이용하여 데이터베이스에 인덱스로 사용함으로써 영상 자료 자체를 검색어로 사용할 수 있도록 한 내용기반 영상 검색 방법 장치에 관한 것이다. 이러한 본 발명에 따른 영상 검색은 영역별로 핑거프린트를 추출하여 데이터베이스에 인덱스로 사용함으로써 각 영상의 내용을 기반으로 한 이미지 검색이 가능하고, 특히, 영역 탐색을 통해 추출되는 특정 영역이 영상의 크기 변화나 회전, 절삭에도 왜곡되지 않으므로 검색의 정확도가 높다. 내용기반, 영상 검색, 회전, 절삭, 핑거프린트
Abstract:
PURPOSE: A higher-order electronic magazine data searching device and method thereof are provided to improve accuracy and reduce calculation amount. CONSTITUTION: A real number vector extractor(300) extracts a real number vector by analyzing input information. A binary part(310) is applied to the quantum scheme and converts the real number vector into a binary data. A candidate generating unit(320) generates a candidate point based on the reliability. A searching unit selects the closest data based on non-similarity between the candidate point and the binary data. The candidate generating unit generates the candidate point by selecting the binary data based on the reliability per bit about the binary data.
Abstract:
PURPOSE: A melody extracting method and system for the same are provided to extract melody component form music with many sounds by using characteristics with energy of the melody component and enabling a melody component to have a harmonic component. CONSTITUTION: A frequency is analyzed by using an analyzing window having a flexible length if an audio signal with many sound is inputted(S100). A candidate melody pitches extracted from an audio signal with a many sounds through a frequency analyzing step by using a harmonic structure model(S200). A melody line is connected to the extracted melody pitch candidates and the candidates area determined(S300).
Abstract:
PURPOSE: A method for melody pitch candidate extraction of polyphonic audio based on a harmonic structure model is provided to extract melody pitch candidates in an audio signal including various sounds. CONSTITUTION: An audio signal including various sounds are short Fourier transformed(S10). The unit of the Fourier transformed audio signal is changed into a cent from Hz(S20). A peak point is extracted from each frame of the audio signal which was transformed to the cent unit(S30). The weight of a harmonic structure model which is included in candidate melody pitches is measured(S40). An energy level difference by a frequency is compensated based on the weight information(S50).
Abstract:
PURPOSE: A melody line decision method from melody pitch candidates on the basis of the property of a melody line is provided for N melody pitch candidates and each melody pitch candidate to efficiently determine a melody line on the basis of physical properties of the melody line. CONSTITUTION: A system is input information about N melody pitch candidates and weight which the melody pitch candidate has in each frame(S10). In a start frame, the system selects N melody pitch candidates and arrays the candidate in a weight descending order(S40). The system determines whether two neighbor melody pitch candidates satisfy set melody line standards(S50). The system selects N melody line candidates through a melody line connection in each melody section(S60). The system selects an optimal melody line(S70).
Abstract:
PURPOSE: A method for efficiently learning a distance metric through the minimization of a cost function is provided to improve fingerprint recognition performance by learning a distance metric from training data. CONSTITUTION: A training data is composed of the fingerprint of original content and the fingerprint of distorted content. A distance metric is determined through learning in order to improve recognition performance in the use of training data(S200). A parameterized distance metric is generated in a determination procedure of the distance metric. A cost function is generated. The parameter of the distance metric is determined through the minimization of the cost function.