Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2411.12743 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909396197441536 |
|---|---|
| author | Bernal, Javier Lawrence, Jim |
| author_facet | Bernal, Javier Lawrence, Jim |
| contents | Algorithms based on gradient descent for computing the elastic shape registration of two simple surfaces in 3-dimensional space and therefore the elastic shape distance between them have been proposed by Kurtek, Jermyn, et al., and more recently by Riseth. Their algorithms are designed to minimize a distance function between the surfaces by rotating and reparametrizing one of the surfaces, the minimization for reparametrizing based on a gradient descent approach that may terminate at a local solution. On the other hand, Bernal and Lawrence have proposed a similar algorithm, the minimization for reparametrizing based on dynamic programming thus producing a partial not necessarily optimal elastic shape registration of the surfaces. Accordingly, Bernal and Lawrence have proposed to use the rotation and reparametrization computed with their algorithm as the initial solution to any algorithm based on a gradient descent approach for reparametrizing. Here we present results from doing exactly that. We also describe and justify the gradient descent approach that is used for reparametrizing one of the surfaces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_12743 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Elastic Shape Registration of Surfaces in 3D Space with Gradient Descent and Dynamic Programming Bernal, Javier Lawrence, Jim Graphics Algorithms based on gradient descent for computing the elastic shape registration of two simple surfaces in 3-dimensional space and therefore the elastic shape distance between them have been proposed by Kurtek, Jermyn, et al., and more recently by Riseth. Their algorithms are designed to minimize a distance function between the surfaces by rotating and reparametrizing one of the surfaces, the minimization for reparametrizing based on a gradient descent approach that may terminate at a local solution. On the other hand, Bernal and Lawrence have proposed a similar algorithm, the minimization for reparametrizing based on dynamic programming thus producing a partial not necessarily optimal elastic shape registration of the surfaces. Accordingly, Bernal and Lawrence have proposed to use the rotation and reparametrization computed with their algorithm as the initial solution to any algorithm based on a gradient descent approach for reparametrizing. Here we present results from doing exactly that. We also describe and justify the gradient descent approach that is used for reparametrizing one of the surfaces. |
| title | Elastic Shape Registration of Surfaces in 3D Space with Gradient Descent and Dynamic Programming |
| topic | Graphics |
| url | https://arxiv.org/abs/2411.12743 |