Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2501.17779 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917905993564160 |
|---|---|
| author | Dogan, Günay Bernal, Javier Hagwood, Charles |
| author_facet | Dogan, Günay Bernal, Javier Hagwood, Charles |
| contents | For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. In this paper, we concentrate on rigidly aligning pairs of closed curves in the plane. If the curves have the same length and are centered at the origin, the critical steps to an optimal rigid alignment are finding the best rotation for one curve to match the other and redefining the starting point of the rotated curve so that the starting points of the two curves match. Unlike open curves, closed curves do not have fixed starting points, and this introduces an additional degree of freedom in the alignment. Hence the common naive method to find the best rotation and starting point for optimal rigid alignment has O(N^2) time complexity, N the number of nodes per curve. This can be slow for curves with large numbers of nodes. In this paper, we propose a new O(N log N) algorithm for this problem based on the Fast Fourier Transform. Together with uniform resampling of the curves with respect to arc length, the new algorithm results in an order of magnitude speed-up in our experiments. Additionally, we describe how we can use our new algorithm as part of elastic shape distance computations between closed curves to obtain accurate shape distance values at a fraction of the cost of previous approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17779 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | FFT-based Alignment of 2d Closed Curves with Application to Elastic Shape Analysis Dogan, Günay Bernal, Javier Hagwood, Charles Differential Geometry For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. In this paper, we concentrate on rigidly aligning pairs of closed curves in the plane. If the curves have the same length and are centered at the origin, the critical steps to an optimal rigid alignment are finding the best rotation for one curve to match the other and redefining the starting point of the rotated curve so that the starting points of the two curves match. Unlike open curves, closed curves do not have fixed starting points, and this introduces an additional degree of freedom in the alignment. Hence the common naive method to find the best rotation and starting point for optimal rigid alignment has O(N^2) time complexity, N the number of nodes per curve. This can be slow for curves with large numbers of nodes. In this paper, we propose a new O(N log N) algorithm for this problem based on the Fast Fourier Transform. Together with uniform resampling of the curves with respect to arc length, the new algorithm results in an order of magnitude speed-up in our experiments. Additionally, we describe how we can use our new algorithm as part of elastic shape distance computations between closed curves to obtain accurate shape distance values at a fraction of the cost of previous approaches. |
| title | FFT-based Alignment of 2d Closed Curves with Application to Elastic Shape Analysis |
| topic | Differential Geometry |
| url | https://arxiv.org/abs/2501.17779 |