Matthew Thorpe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Matthew Thorpe has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Dejan Slepčev
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, USA
2 shared publications - Gustavo Kunde Rohde
Imaging and Data Science Laboratory, The Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, USA
2 shared publications Serim Park
Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA
2 shared publications- Soheil Kolouri
Department of Computer Science Vanderbilt University
2 shared publications - Adam Michael Johansen
Department of Statistics, University of Warwick, Coventry, CV4 7AL, UK
1 shared publication - Se Rim Park
Carnegie Mellon University 15213 Pittsburgh PA USA
1 shared publication
Latest Publications
- Open Access
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7864-7872
Representing and Learning High Dimensional Data with the Optimal Transport Map from a Probabilistic Viewpoint
In this paper, we propose a generative model in the space of diffeomorphic deformation maps. More precisely, we utilize the Kantarovich-Wasserstein metric and accompanying geometry to represent an image as a deformation from templates. Moreover, we incorporate a probabilistic viewpoint by assuming that each image is locally generated from a reference image. We capture the local structure by modelling the tangent planes at reference images. Once basis vectors for each tangent plane are learned via probabilistic PCA, we can sample a local coordinate, that can be inverted back to image space exactly. With experiments using 4 different datasets, we show that the generative tangent plane model in the optimal transport (OT) manifold can be learned with small numbers of images and can be used to create infinitely many 'unseen' images. In addition, the Bayesian classification accompanied with the probabilist modeling of the tangent planes shows improved accuracy over that done in the image space. Combining the results of our experiments supports our claim that certain datasets can be better represented with the Kantarovich-Wasserstein metric. We envision that the proposed method could be a practical solution to learning and representing data that is generated with templates in situatons where only limited numbers of data points are available.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7864-7872
Open AccessRepresenting and Learning High Dimensional Data with the Optimal Transport Map from a Probabilistic Viewpoint
In this paper, we propose a generative model in the space of diffeomorphic deformation maps. More precisely, we utilize the Kantarovich-Wasserstein metric and accompanying geometry to represent an image as a deformation from templates. Moreover, we incorporate a probabilistic viewpoint by assuming that each image is locally generated from a reference image. We capture the local structure by modelling the tangent planes at reference images. Once basis vectors for each tangent plane are learned via probabilistic PCA, we can sample a local coordinate, that can be inverted back to image space exactly. With experiments using 4 different datasets, we show that the generative tangent plane model in the optimal transport (OT) manifold can be learned with small numbers of images and can be used to create infinitely many 'unseen' images. In addition, the Bayesian classification accompanied with the probabilist modeling of the tangent planes shows improved accuracy over that done in the image space. Combining the results of our experiments supports our claim that certain datasets can be better represented with the Kantarovich-Wasserstein metric. We envision that the proposed method could be a practical solution to learning and representing data that is generated with templates in situatons where only limited numbers of data points are available.
- 4 April 2017
- Published by Springer Nature in Annals of the Institute of Statistical Mathematics
- Vol. 70 (4) , 717-744
Pointwise convergence in probability of general smoothing splines
- 4 April 2017
- Published by Springer Nature in Annals of the Institute of Statistical Mathematics
- Vol. 70 (4) , 717-744
Pointwise convergence in probability of general smoothing splines
- 23 March 2017
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 59 (2) , 187-210
A Transportation $L^p$ Distance for Signal AnalysisTransport-based distances, such as the Wasserstein distance and earth mover’s distance, have been shown to be an effective tool in signal and image analysis. The success of transport-based distances is in part due to their Lagrangian nature which allows it to capture the important variations in many signal classes. However, these distances require the signal to be non-negative and normalised. Furthermore, the signals are considered as measures and compared by redistributing (transporting) them, which does not directly take into account the signal intensity. Here, we study a transport-based distance, called the \(TL^p\) distance, that combines Lagrangian and intensity modelling and is directly applicable to general, non-positive and multichannelled signals. The distance can be computed by existing numerical methods. We give an overview of the basic properties of this distance and applications to classification, with multichannelled non-positive one-dimensional signals and two-dimensional images, and colour transfer.- 23 March 2017
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 59 (2) , 187-210
A Transportation $L^p$ Distance for Signal AnalysisTransport-based distances, such as the Wasserstein distance and earth mover’s distance, have been shown to be an effective tool in signal and image analysis. The success of transport-based distances is in part due to their Lagrangian nature which allows it to capture the important variations in many signal classes. However, these distances require the signal to be non-negative and normalised. Furthermore, the signals are considered as measures and compared by redistributing (transporting) them, which does not directly take into account the signal intensity. Here, we study a transport-based distance, called the \(TL^p\) distance, that combines Lagrangian and intensity modelling and is directly applicable to general, non-positive and multichannelled signals. The distance can be computed by existing numerical methods. We give an overview of the basic properties of this distance and applications to classification, with multichannelled non-positive one-dimensional signals and two-dimensional images, and colour transfer.- Open AccessA Transportation $L^p$ Distance for Signal AnalysisTransport based distances, such as the Wasserstein distance and earth mover's distance, have been shown to be an effective tool in signal and image analysis. The success of transport based distances is in part due to their Lagrangian nature which allows it to capture the important variations in many signal classes. However these distances require the signal to be nonnegative and normalized. Furthermore, the signals are considered as measures and compared by redistributing (transporting) them, which does not directly take into account the signal intensity. Here we study a transport-based distance, called the $TL^p$ distance, that combines Lagrangian and intensity modelling and is directly applicable to general, non-positive and multi-channelled signals. The framework allows the application of existing numerical methods. We give an overview of the basic properties of this distance and applications to classification, with multi-channelled, non-positive one and two-dimensional signals, and color transfer.Open AccessA Transportation $L^p$ Distance for Signal AnalysisTransport based distances, such as the Wasserstein distance and earth mover's distance, have been shown to be an effective tool in signal and image analysis. The success of transport based distances is in part due to their Lagrangian nature which allows it to capture the important variations in many signal classes. However these distances require the signal to be nonnegative and normalized. Furthermore, the signals are considered as measures and compared by redistributing (transporting) them, which does not directly take into account the signal intensity. Here we study a transport-based distance, called the $TL^p$ distance, that combines Lagrangian and intensity modelling and is directly applicable to general, non-positive and multi-channelled signals. The framework allows the application of existing numerical methods. We give an overview of the basic properties of this distance and applications to classification, with multi-channelled, non-positive one and two-dimensional signals, and color transfer.