Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Dictionary Learning for Two-Dimensional Kendall Shapes
 
research article

Dictionary Learning for Two-Dimensional Kendall Shapes

Song, Anna
•
Uhlmann, Virginie
•
Fageot, Julien
Show more
January 1, 2020
Siam Journal On Imaging Sciences

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplicity and faithfulness with respect to the nonlinear geometric structure of Kendall's shape space. Remarkably, it boils down to a classical dictionary learning formulation modified using complex weights. Existing dictionary learning methods extended to nonlinear spaces map the manifold either to a reproducing kernel Hilbert space or to a tangent space. The first approach is unnecessarily heavy in the case of Kendall's shape space and causes the geometrical understanding of shapes to be lost, while the second one induces distortions and theoretical complexity. Our approach does not suffer from these drawbacks. Instead of embedding the shape space into a linear space, we rely on the hyperplane of centered configurations, including preshapes from which shapes are defined as rotation orbits. In this linear space, the dictionary atoms are scaled and rotated using complex weights before summation. Furthermore, our formulation is more general than Kendall's original one: it applies to discretely defined configurations of landmarks as well as continuously defined interpolating curves. We implemented our algorithm by adapting the method of optimal directions combined to a Cholesky-optimized order recursive matching pursuit. An interesting feature of our shape dictionary is that it produces visually realistic atoms, while guaranteeing reconstruction accuracy. Its efficiency can mostly be attributed to a clear formulation of the framework with complex numbers. We illustrate the strong potential of our approach for the characterization of datasets of shapes up to similitudes and the analysis of patterns in deforming two-dimensional shapes.

  • Details
  • Metrics
Type
research article
DOI
10.1137/19M126044X
Web of Science ID

WOS:000545955400006

Author(s)
Song, Anna
Uhlmann, Virginie
Fageot, Julien
Unser, Michael  
Date Issued

2020-01-01

Publisher

SIAM PUBLICATIONS

Published in
Siam Journal On Imaging Sciences
Volume

13

Issue

1

Start page

141

End page

175

Subjects

Computer Science, Artificial Intelligence

•

Computer Science, Software Engineering

•

Mathematics, Applied

•

Imaging Science & Photographic Technology

•

Computer Science

•

Mathematics

•

Imaging Science & Photographic Technology

•

kendall's shape space

•

sparse dictionary learning

•

2d shape analysis

•

interpolating curves

•

splines

•

sparse

•

representation

•

algorithms

•

snakes

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LIB  
Available on Infoscience
July 18, 2020
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/170227
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés