Shikha Mishra; Namita Tiwari

Exploring Approaches for Curve Similarity: A Comprehensive Review

PDF (1295KB), PP.124-138

Views: 0 Downloads: 0

Author(s)

1. Department of Mathematics, School of Basic Sciences, CSJM University, Kanpur Nagar,208024, India

2. Department of Mathematics and Computer Application, School of Basic Sciences, UIET, CSJM University, Kanpur Nagar, 208024, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijmsc.2026.03.07

Received: 16 Feb. 2026 / Revised: 19 Mar. 2026 / Accepted: 3 Apr. 2026 / Published: 8 Aug. 2026

Index Terms

Curve Similarity, Functional Data Analysis, Dynamic Time Warping, Topological Data Analysis, Statistical Equivalence Testing

Abstract

Curve similarity plays a crucial role in various domains where comparing functional or dynamic shapes is essential, including bioassay analysis, trajectory studies, spectroscopy, medical signal interpretation, and functional genomics. Despite its broad impact, research on curve similarity methods remains fragmented across statistical, computational geometry, and signal processing communities, leading to a lack of unified terminology and systematic comparison. To address this gap, this study adopts a structured literature review methodology, in which relevant studies are identified through a comprehensive search of major academic databases and selected based on predefined inclusion criteria, including peer-reviewed publications focusing on similarity measures for curves and time series. The review systematically examines mathematical and statistical approaches to curve similarity, focusing on their theoretical foundations, statistical properties, and practical applications. The selected methods are categorized into five groups: distance-based, alignment-based, topology-oriented, statistical and hypothesis testing, and learning-based approaches. For each category, key aspects such as mathematical formulation, invariance properties, robustness to sampling variability, and computational characteristics are analyzed. In addition, application domains, method comparisons, and common limitations are discussed, along with available software tools that support curve similarity analysis. By providing a structured and methodologically grounded synthesis, this review assists researchers in selecting appropriate techniques and highlights potential directions for developing more robust and scalable similarity assessment frameworks.

Cite This Paper

Shikha Mishra, Namita Tiwari, "Exploring Approaches for Curve Similarity: A Comprehensive Review", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.12, No.3, pp. 124-138, 2026. DOI: 10.5815/ijmsc.2026.03.07

Reference

[1]A. Srivastava and E. Klassen, Functional and Shape Data Analysis. New York, NY, USA: Springer, 2016.
[2]J. O. Ramsay and B. W. Silverman, Functional Data Analysis, 2nd ed. New York, NY, USA: Springer, 2005.
[3]F. Yao, H.-G. Müller, and J.-L. Wang, “Functional data analysis for sparse longitudinal data,” J. Amer. Stat. Assoc., vol. 100, no. 470, pp. 577–590, 2005, doi: 10.1198/016214504000001745.
[4]J. L. Wang, J. M. Chiou, and H. G. Müller, “Functional data analysis,” Annu. Rev. Stat. Appl., vol. 3, pp. 257–295, 2016.
[5]P. T. Reiss and R. T. Ogden, “Functional principal component regression and functional partial least squares,” J. Amer. Stat. Assoc., vol. 102, no. 479, pp. 984–996, 2007.
[6]J. T. Zhang, Analysis of Variance for Functional Data. Boca Raton, FL, USA: CRC Press, 2013.
[7]J. O. Ramsay, G. Hooker, and S. Graves, Functional Data Analysis with R and MATLAB. New York, NY, USA: Springer, 2009.
[8]H. Sakoe and S. Chiba, “Dynamic programming algorithm optimization for spoken word recognition,” IEEE Trans. Acoust., Speech, Signal Process., vol. 26, no. 1, pp. 43–49, 1978.
[9]F. Xie, C. Wang, and X. Li, “Dynamic time warping for time series curve similarity,” Online J. Robot. Autom. Technol., vol. 3, no. 1, Art. no. OJRAT.MS.ID.000553, 2024, doi: 10.33552/OJRAT.2024.03.000553.
[10]F. Zhou and F. De la Torre, “Canonical time warping for alignment of human behavior,” in Proc. 23rd Int. Conf. Neural Inf. Process. Syst. (NIPS), 2009, pp. 2286–2294.
[11]H. Vu, C. Carey, and S. Mahadevan, “Manifold Warping: Manifold Alignment over Time”, AAAI, vol. 26, no. 1, pp. 1155-1161, Sep. 2021.
[12]D. Bhattacharya, R. Kaur, N. Aithal, N. Sinha, and T. Gregor Issac, “Persistent homology for MCI classification: A comparative analysis between graph and Vietoris-Rips filtrations,” Frontiers in Neuroscience, vol. 19, p. 1518984, 2025, doi: 10.3389/fnins.2025.1518984.
[13]P. Faya, A. P. Rauk, K. L. Griffiths, and B. Parekh, “A curve similarity approach to parallelism testing in bioassay,” J. Biopharm. Stat., vol. 30, no. 4, pp. 721–733, 2020.
[14]H. Alt and M. Godau, “Computing the Fréchet distance between two polygonal curves,” Int. J. Comput. Geom. Appl., vol. 5, no. 1–2, pp. 75–91, 1995.
[15]D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge, “Comparing images using the Hausdorff distance,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 9, pp. 850–863, 1993, doi: 10.1109/34.232073.
[16]G. Trigeorgis, M. A. Nicolaou, S. Zafeiriou, and B. Schuller, “Deep canonical time warping,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR), 2016, pp. 5110–5118.
[17]P. Yu, G. Shi, C. Wang, and X. Song, “Distance-based clustering of functional data with derivative principal component analysis,” J. Comput. Graph. Stat., vol. 34, pp. 47–58, 2024.
[18]U. Bauer, C. Landi, and F. Mémoli, “The Reeb graph edit distance is universal,” Found. Comput. Math., vol. 21, no. 5, pp. 1441–1464, 2021, doi: 10.1007/s10208-020-09488-3.
[19]M. Li, M. Coskun, and M. Koyuturk, “Topological-similarity based canonical representations for biological link prediction,” IEEE Trans. Comput. Biol. Bioinf., vol. 22, no. 4, pp. 1278–1287, 2025, doi: 10.1109/TCBB.2024.3462730.
[20]T. Eiter and H. Mannila, “Computing discrete Fréchet distance,” Tech. Rep., Univ. Helsinki, 1994.
[21]S. J. Novick and H. Yang, “A fast and reliable test for parallelism in bioassay,” J. Biopharm. Stat., vol. 29, no. 6, pp. 1011–1023, 2019.
[22]A. Tamhane, Y. Hochberg, and C. Dunnett, “Multiple test procedures for dose finding,” Biometrics, vol. 52, no. 1, pp. 21–38, 1996.
[23]L. M. Sangalli, P. Secchi, S. Vantini, and V. Vitelli, “K-mean alignment for curve clustering,” Comput. Stat. Data Anal., vol. 54, no. 5, pp. 1219–1233, 2010, doi: 10.1016/j.csda.2009.12.008.
[24]N. Son, “Pattern matching under dynamic time warping for time series prediction,” Tạp chí Khoa học, vol. 15, p. 148, 2019, doi: 10.54607/hcmue.js.15.3.146(2018).
[25]J. S. Marron, J. O. Ramsay, L. M. Sangalli, and A. Srivastava, “Functional data analysis of amplitude and phase variation,” Stat. Sci., vol. 30, no. 4, pp. 468–484, 2015.
[26]K. Bharath, “Analysis of shape data: From landmarks to elastic curves,” WIREs Comput. Stat., 2020.
[27]A. Roy, T. Nelson, and P. Turaga, “Functional data analysis approach for mapping change in time series,” Transp. Res. Interdiscip. Perspect., 2023.
[28]L. Steyer, “Elastic analysis of irregularly or sparsely sampled curves,” Biometrics, vol. 79, no. 3, pp. 2103–2121, 2023.
[29]M. Bauer, M. Bruveris, N. Charon, and J. Møller-Andersen, “A relaxed approach for curve matching with elastic metrics,” arXiv preprint arXiv:1803.10893, 2018.
[30]G. Dogan, J. Bernal, and C. Hagwood, “FFT-based alignment of 2D closed curves for elastic shape analysis,” arXiv preprint arXiv:2501.17779, 2025.
[31]A. B. Bal, X. Guo, T. Needham, and A. Srivastava, “Statistical shape analysis of shape graphs with applications to retinal blood-vessel networks,” arXiv preprint arXiv:2211.15514, 2022.
[32]X. Guo and A. Srivastava, “Representations, metrics and statistics for shape analysis of elastic graphs,” arXiv preprint arXiv:2003.00287, 2020.
[33]F. Fortuna, A. Naccarato, and L. Salvati, “The functional distance-based approach: An application on long-term metropolitan development,” Socio-Econ. Plan. Sci., vol. 94, Art. no. 101917, 2024, doi: 10.1016/j.seps.2024.101917.
[34]J. K. Hunter, Notes on LP and Sobolev Spaces. UC Davis, 2009.
[35]D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge, “Comparing images using the Hausdorff distance,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 9, pp. 850–863, 1993, doi: 10.1109/34.232073.
[36]H. Alt and L. Scharf, “Computing the Hausdorff distance between curved objects,” Int. J. Comput. Geom. Appl., vol. 18, no. 4, pp. 307–320, 2008, doi: 10.1142/S0218195908002647.
[37]F. Zhou and F. De la Torre, “Generalized time warping for multi-modal alignment of human motion,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR), 2012, pp. 1282–1289, doi: 10.1109/CVPR.2012.6247812.
[38]M. Cuturi and M. Blondel, “Soft-DTW: A differentiable loss function for time-series,” in Proc. 34th Int. Conf. Mach. Learn. (ICML), 2017, pp. 894–903.
[39]G. Trigeorgis, M. A. Nicolaou, S. Zafeiriou, and B. Schuller, “Deep canonical time warping,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR), 2016, pp. 5110–5118.
[40]E. W. Chambers and Y. Wang, “Measuring similarity between curves on 2-manifolds via homotopy area,” in Proc. Annu. Symp. Comput. Geom. (SoCG), 2013, pp. 425–434, doi: 10.1145/2462356.2462375.
[41]Z. Weng and M. Zhao, “Persistent homology via curvature-adaptive wing complexes,” AIMS Math., vol. 11, no. 1, pp. 785–809, 2026, doi: 10.3934/math.2026034.
[42]F. Conti, D. Moroni, and M. A. Pascali, “A topological machine learning pipeline for classification,” Mathematics, vol. 10, no. 17, Art. no. 3086, 2022, doi: 10.3390/math10173086.
[43]F. Chazal, V. de Silva, M. Glisse, and S. Oudot, The Structure and Stability of Persistence Modules. Cham, Switzerland: Springer, 2016.
[44] “DTAIDistance library documentation: Python time series distance library,” 2020.
[45]S. Salvador and P. Chan, “FastDTW: Toward accurate dynamic time warping in linear time and space,” Intell. Data Anal., vol. 11, no. 5, pp. 561–580, 2007.
[46]A. Srivastava, E. Klassen, S. Joshi, and I. Jermyn, “Shape analysis of elastic curves in Euclidean spaces,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 7, pp. 1415–1428, 2011.
[47]R. Tavenard et al., “Tslearn: A machine learning toolkit for time series data,” J. Mach. Learn. Res., vol. 21, no. 118, pp. 1–6, 2020.
[48]T. Giorgino, “Computing and visualizing dynamic time warping alignments in R: The dtw package,” J. Stat. Softw., vol. 31, no. 7, pp. 1–24, 2009.
[49]P. Montero and J. Vilar, “TSclust: An R package for time series clustering,” J. Stat. Softw., vol. 62, no. 1, pp. 1–43, 2014.
[50]X. Gao, J. Jian, X. Dai, and W. Chen, “Spectral curve matching application analysis based on Fréchet distance,” Geomatics Inf. Sci. Wuhan Univ., vol. 41, no. 4, pp. 408–414, 2016, doi: 10.13203/j. whugis20140147.
[51]M. S. Arya, R. Deepa, and J. Gandhi, “Dynamic time warping-based technique for predictive analysis in stock market,” in Proc. 6th Int. Conf. Recent Trends Comput., ser. Lecture Notes Netw. Syst., vol. 177, Singapore: Springer, 2021, doi: 10.1007/978-981-33-4501-0_3.
[52]T. Grzejszczak, E. Probierz, A. Galuszka, K. Simek, and K. Jędrasiak, “Dynamic time warping in financial data: Modification of algorithm in context of stock market similarity analysis,” Eur. Res. Stud. J., vol. 25, pp. 967–979, 2022, doi: 10.35808/ ersj/2897.
[53]V. Froese, B. Jain, R. Niedermeier, and M. Renken, “Comparing temporal graphs using dynamic time warping,” Soc. Netw. Anal. Min., vol. 10, no. 1, Art. no. 50, 2020, doi: 10.1007/s13278-020-00664-5.
[54]K. Buchin, A. Nusser, and S. Wong, “Computing continuous dynamic time warping of time series in polynomial time,” in Proc. Int. Symp. Comput. Geom., 2021.
[55]B. Lahreche and B. Boucheham, “A fast and accurate similarity measure for long time series classification based on local extrema and dynamic time warping,” Expert Syst. Appl., vol. 168, Art. no. 114374, 2021, doi: 10.1016/j.eswa.2020.114374.
[56]L. Qiu, C. Qiu, and C. Song, “ESDTW: Extrema-based shape dynamic time warping,” Expert Syst. Appl., vol. 239, Art. no. 122432, 2024, doi: 10.1016/j.eswa.2023.122432.
[57]Y. Liu, Y.-A. Zhang, M. Zeng, and J. Zhao, “A novel distance measure based on dynamic time warping to improve time series classification,” Inf. Sci., vol. 656, Art. no. 119921, 2024, doi: 10.1016/j.ins.2023.119921.
[58]X. Zeng, B. Liang, L. Wei, S. Han, and D. Fu, “Similarity measure of time series based on angle-distance penalized metric dynamic time warping,” Sci. Rep., vol. 15, 2025, doi: 10.1038/s41598-025-29331-5.
[59]M. Dehmer, I. Redžepović, N. Tratnik, and P. Ž. Pleteršek, “Efficient graph similarity assessment method based on vectors of topological indices,” arXiv preprint arXiv:2509.23131, 2025, doi: 10.48550/arXiv.2509.23131.
[60]Gertheiss, J., Maity, A., & Staicu, A.-M. (2024). Functional data analysis: An introduction and recent developments. Biometrical Journal. https://doi.org/10.1002/bimj.202300363
[61]S. Mallat, “A theory for multiresolution signal decomposition: The wavelet representation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 11, no. 7, pp. 674–693, 1989, doi: 10.1109/34.192463.
[62]R. H. Shumway and D. S. Stoffer, Time Series Analysis and Its Applications: With R Examples, 4th ed. New York, NY, USA: Springer, 2017.
[63]F. Yao, H.-G. Müller, and J.-L. Wang, “Functional data analysis for sparse longitudinal data,” J. Amer. Stat. Assoc., vol. 100, no. 470, pp. 577–590, 2005, doi: 10.1198/016214504000001745.
[64]X. Li, K. Zhao, G. Cong, C. S. Jensen, and W. Wei, “Deep representation learning for trajectory similarity computation,” in Proc. IEEE 34th Int. Conf. Data Engineering (ICDE), Paris, France, 2018, pp. 617–628, doi: 10.1109/ICDE.2018.00062.
[65]F. Petitjean, A. Ketterlin, and P. Gançarski, “NeuralWarp: Time-series similarity with warping networks,” arXiv preprint arXiv:1812.08306, 2018.
[66]B. Liu, Z. Wang, J. Zhang, J. Wu, and G. Qu, “DeepSIM: A novel deep learning method for graph similarity computation,” Soft Computing, vol. 28, no. 1, pp. 61–76, 2024, doi: 10.1007/s00500-023-09288-1.
[67]S. Song, Y. Wang, X. Wang, C. Lin, and K. Hu, “A deep learning-based approach to similarity calculation for UML use case models,” Expert Systems with Applications, vol. 251, p. 123927, 2024, doi: 10.1016/j.eswa.2024.123927.
[68]H. Zhou, S. Zhang, J. Peng, S. Zhang, J. Li, H. Xiong, and W. Zhang, “TimeSiam: A self-supervised Siamese framework for time-series representation learning,” arXiv preprint arXiv:2402.02475, 2024.
[69]Y. Wang, Z. Chen, and L. Xu, “SASNet: Siamese attention network for similarity learning,” in Proc. ACM Int. Conf. Information and Knowledge Management (CIKM), 2024, pp. 1–10.
[70]P. Yang et al., “Deep learning approaches for similarity computation: A survey,” IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 12, pp. 7893–7912, Dec. 2024, doi: 10.1109/TKDE.2024.3422484.
[71]C. F. Jekel, G. Venter, M. P. Venter, N. Stander, and R. T. Haftka, “Similarity measures for identifying material parameters from hysteresis loops using inverse analysis,” Int. J. Mater. Form., vol. 12, no. 3, pp. 355–378, 2019.
[72]S. Jeong, “CurveSimilarities: Python package for curve similarity,” GitHub, 2021. [Online]. Available: https://github.com
[73]D. Chanin, “Curve-matcher: A JavaScript library for curve matching using Fréchet distance and Procrustes analysis,” GitHub, 2019. [Online]. Available: https://github.com
[74]R. Werneck et al., “MoveTK: A C++ library for trajectory analysis,” GitHub, 2021. [Online]. Available: https://github.com
[75]Toyota InfoTech, “Spark-curves: Distributed curve similarity,” GitHub, 2018. [Online]. Available: https://github.com
[76]I. R. Cleasby et al., “SimilarityMeasures: Trajectory similarity measures,” CRAN, 2015. [Online]. Available: https://cran.r-project.org
[77]A. Ahmadzadeh, M. Khazaei, and E. Rohlfing, “Beyond Point Matching: Evaluating Multiscale Dubuc Distance for Time Series Similarity,” arXiv preprint arXiv:2510.21824, 2025, doi: 10.48550/arXiv.2510.21824.
[78]A. Krivošija et al., “k-DTW: A Novel Dissimilarity Measure for Curves,” arXiv preprint, 2025.
[79]J. Zhao and L. Itti, “shapeDTW: Shape Dynamic Time Warping,” Pattern Recognition, vol. 74, pp. 171–184, 2018, doi: 10.1016/j.patcog.2017.09.020.
[80]R. Wang, H. Yan, and X. Lu, “Quantitative relations between topological similarity degree and map scale change of contour clusters in multi-scale map spaces,” ISPRS International Journal of Geo-Information, vol. 11, no. 4, Art. no. 268, 2022, doi: 10.3390/ijgi11040268.
[81]P. Han, J. Wang, D. Yao, S. Shang, and X. Zhang, “A graph-based approach for trajectory similarity computation in spatial networks,” in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2021, pp. 556–564, doi: 10.1145/3447548.3467337.
[82]M. Klabunde, T. Schumacher, M. Strohmaier, and F. Lemmerich, “Similarity of neural network models: A survey of functional and representational measures,” ACM Computing Surveys, vol. 57, no. 9, Art. no. 242, 2025, doi: 10.1145/3728458.

International Journal of Mathematical Sciences and Computing (IJMSC)