Using Transportation Distances for Measuring Melodic Similarity Pichaya Tappayuthpijarn Qiang Wang.

Slides:



Advertisements
Similar presentations
Ranking Multimedia Databases via Relevance Feedback with History and Foresight Support / 12 I9 CHAIR OF COMPUTER SCIENCE 9 DATA MANAGEMENT AND EXPLORATION.
Advertisements

Information Distance More Applications. 1. Information Distance from a Question to an Answer.
Relevance Feedback and User Interaction for CBIR Hai Le Supervisor: Dr. Sid Ray.
Similarity and Difference
Authors: Jianneng Cao, Panagiotis Karras, Panos Kalnis, Kian-Lee Tan
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order Edgar Chávez Karina Figueroa Gonzalo Navarro UNIVERSIDAD MICHOACANA, MEXICO.
Multimedia Database Systems
Linear Programming and Simplex Algorithm Reference: Numerical Recipe Sec
Example-Based Fractured Appearance L. Glondu, L. Muguercia, M. Marchal, C. Bosch, H. Rushmeier, G. Dumont and G. Drettakis.
Organizing a spectral image database by using Self-Organizing Maps Research Seminar Oili Kohonen.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Implementation of ICP Variants Pavan Ram Piratla Janani Venkateswaran.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Image Similarity and the Earth Mover’s Distance Empirical Evaluation of Dissimilarity Measures for Color and Texture Y. Rubner, J. Puzicha, C. Tomasi and.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A novel document similarity measure based on earth mover’s.
Computer Vision Group, University of BonnVision Laboratory, Stanford University Abstract This paper empirically compares nine image dissimilarity measures.
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
Chapter 5 Orthogonality
Isometry invariant similarity
An efficient and effective region-based image retrieval framework Reporter: Francis 2005/5/12.
Reza Sherkat ICDE061 Reza Sherkat and Davood Rafiei Department of Computing Science University of Alberta Canada Efficiently Evaluating Order Preserving.
T.Sharon 1 Internet Resources Discovery (IRD) Music IR.
1 Diffusion Distance for Histogram Comparison, CVPR06. Haibin Ling, Kazunori Okada Group Meeting Presented by Wyman 3/14/2006.
Techniques and Data Structures for Efficient Multimedia Similarity Search.
A Multiresolution Symbolic Representation of Time Series
Content-Based Image Retrieval using the EMD algorithm Igal Ioffe George Leifman Supervisor: Doron Shaked Winter-Spring 2000 Technion - Israel Institute.
Hashed Samples Selectivity Estimators for Set Similarity Selection Queries.
Graph Indexing: A Frequent Structure­ based Approach Authors:Xifeng Yan†, Philip S‡. Yu, Jiawei Han†
1 Music Classification Using Significant Repeating Patterns Chang-Rong Lin, Ning-Han Liu, Yi-Hung Wu, Arbee L.P. Chen, Proc. of 9th International Conference,
The Collocation of Measurement Points in Large Open Indoor Environment Kaikai Sheng, Zhicheng Gu, Xueyu Mao Xiaohua Tian, Weijie Wu, Xiaoying Gan Department.
A 3D Model Alignment and Retrieval System Ding-Yun Chen and Ming Ouhyoung.
Towards Robust Indexing for Ranked Queries Dong Xin, Chen Chen, Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign VLDB.
Intelligent Database Systems Lab 1 Advisor : Dr. Hsu Graduate : Jian-Lin Kuo Author : Silvia Nittel Kelvin T.Leung Amy Braverman 國立雲林科技大學 National Yunlin.
Approximate XML Joins Huang-Chun Yu Li Xu. Introduction XML is widely used to integrate data from different sources. Perform join operation for XML documents:
Introduction: Databases By Margaret Lion 1. What is a database? A collection of data organized to serve many applications efficiently by centralizing.
Distributed Information Retrieval Server Ranking for Distributed Text Retrieval Systems on the Internet B. Yuwono and D. Lee Siemens TREC-4 Report: Further.
Efficient Metric Index For Similarity Search Lu Chen, Yunjun Gao, Xinhan Li, Christian S. Jensen, Gang Chen.
Stratified K-means Clustering Over A Deep Web Data Source Tantan Liu, Gagan Agrawal Dept. of Computer Science & Engineering Ohio State University Aug.
Efficient EMD-based Similarity Search in Multimedia Databases via Flexible Dimensionality Reduction / 16 I9 CHAIR OF COMPUTER SCIENCE 9 DATA MANAGEMENT.
Learning Spectral Clustering, With Application to Speech Separation F. R. Bach and M. I. Jordan, JMLR 2006.
Melodic Similarity Presenter: Greg Eustace. Overview Defining melody Introduction to melodic similarity and its applications Choosing the level of representation.
Searching Specification Documents R. Agrawal, R. Srikant. WWW-2002.
Content-Based Image Retrieval Using Block Discrete Cosine Transform Presented by Te-Wei Chiang Department of Information Networking Technology Chihlee.
A New Spatial Index Structure for Efficient Query Processing in Location Based Services Speaker: Yihao Jhang Adviser: Yuling Hsueh 2010 IEEE International.
A Optimal On-line Algorithm for k Servers on Trees Author : Marek Chrobak Lawrence L. Larmore 報告人:羅正偉.
A Fast LBG Codebook Training Algorithm for Vector Quantization Presented by 蔡進義.
A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.
Content-Based MP3 Information Retrieval Chueh-Chih Liu Department of Accounting Information Systems Chihlee Institute of Technology 2005/06/16.
Chapter 1.8 Absolute Value and Inequalities. Recall from Chapter R that the absolute value of a number a, written |a|, gives the distance from a to 0.
Multiple Sequence Alignment Vasileios Hatzivassiloglou University of Texas at Dallas.
Detecting Remote Evolutionary Relationships among Proteins by Large-Scale Semantic Embedding Xu Linhe 14S
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua University Tsinghua Univ. Oct Experimental Study on Neighbor Selection Policy.
Clustering Data Streams A presentation by George Toderici.
Ontology Evaluation and Ranking using OntoQA Samir Tartir and I. Budak Arpinar Large-Scale Distributed Information Systems Lab University of Georgia The.
Benchmarking for Improved Water Utility Performance.
Outline Time series prediction Find k-nearest neighbors Lag selection Weighted LS-SVM.
南台科技大學 資訊工程系 Region partition and feature matching based color recognition of tongue image 指導教授:李育強 報告者 :楊智雁 日期 : 2010/04/19 Pattern Recognition Letters,
Outline Introduction State-of-the-art solutions
9.2 Properties of Reflections
Chinese Academy of Sciences, Beijing, China
The Earth Mover's Distance
عناصر المثلثات المتشابهة Parts of Similar Triangles
Systems of Inequalities
Yu Su, Yi Wang, Gagan Agrawal The Ohio State University
بازیابی تصاویر بر اساس محتوا
Liang Zheng, Yuzhong Qu Nanjing University, China
Liang Zheng and Yuzhong Qu
Introduction Congruent triangles have corresponding parts with angle measures that are the same and side lengths that are the same. If two triangles are.
Unit 1-2 Test Guide Matter Review Density
Chord Recognition with Application in Melodic Similarity
Presentation transcript:

Using Transportation Distances for Measuring Melodic Similarity Pichaya Tappayuthpijarn Qiang Wang

Outline Introduction Melodic Similarity Measuring The Earth Mover’s Distance (EMD) The Proportional Transportation Distance (PTD) Results & Conclusion

Introduction Weighted notes are well suited to represent music. Measuring melodic similarity by comparing weighted notes. Using EMD or PTD to measure the similarity.

Melodic Similarity Measuring Weighted Notes represented by (Time, Pitch, Weight). The weights only reflect the note durations.

Properties of a Metric **For pseudo-metric, only properties i, iii and iv holds.

The Earth Mover’s Distance (EMD) measures the minimum amount of work needed to transform one into the other by moving weight.

Minimize the overall cost with constraints

W, U are the total weights of A, B respectively,

Example : a weight flow with EMD

The Proportional Transportation Distance (PTD) EMD v.s. PTD PTD is a modified version of EMD. In the case of unequal total weight, triangle inequality does not hold for the EMD. By PTD, triangle inequality holds, making database search more efficient by using indices.

The Proportional Transportation Distance for both point set, divide every point’s weight by its point set’s total weight then calculate the EMD for the resulting point sets.

Properties of PTD A pseudo-metric. Triangle inequality holds true a+b>=c

Gives clear distinction of groups. The fact that the EMD allows partial matching, while the PTD matches all notes, leads to a clear distinction of these groups by the PTD, but not the EMD.

Can recognize augmented versions of the same melody as similar.

Result & Conclusion PTD leads to the identification of about 3.9% of 100 randomly chosen search ( for r = 1). For r = 5, we need less than 1000 calculations instead of 476,000. PTD Indexing reduces the query running time.

Thank you!