MATHEMATICAL ANALYSIS OF MELODIES: SLOPE AND DISCRETE FRÉCHET DISTANCE
نویسندگان
چکیده
منابع مشابه
Approximability of the Discrete Fréchet Distance
The Fréchet distance is a popular and widespread distance measure for point sequences and for curves. About two years ago, Agarwal et al [SIAM J. Comput. 2014] presented a new (mildly) subquadratic algorithm for the discrete version of the problem. This spawned a flurry of activity that has led to several new algorithms and lower bounds. In this paper, we study the approximability of the discre...
متن کاملVoronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous (continuous/discrete) Fréchet distance. In this paper, for the first time, we consider the Voronoi diagram of polygonal chains in d-dimension under the discrete Fréchet distance. Given a ...
متن کاملA Middle Curve Based on Discrete Fréchet Distance
Given a set of polygonal curves we seek to find a “middle curve” that represents the set of curves. We ask that the middle curve consists of points of the input curves and that it minimizes the discrete Fréchet distance to the input curves. We develop algorithms for three different variants of this problem.
متن کاملEfficient Motif Discovery in Spatial Trajectories Using Discrete Fréchet Distance
The discrete Fréchet distance (DFD) captures perceptual and geographical similarity between discrete trajectories. It has been successfully adopted in a multitude of applications, such as signature and handwriting recognition, computer graphics, as well as geographic applications. Spatial applications, e.g., sports analysis, traffic analysis, etc. require discovering the pair of most similar su...
متن کاملProtein Local Structure Alignment Under the Discrete Fréchet Distance
Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very few results are known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Far East Journal of Mathematical Sciences (FJMS)
سال: 2015
ISSN: 0972-0871
DOI: 10.17654/fjmsjul2015_583_615