Abstract. We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to devel...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Abstract. We present a method based on multiresolution signal processing on meshes to create a thickness atlas. We applied this method to construct an atlas of bladder wall thickne...
Sylvain Jaume, Matthieu Ferrant, Andreas Schreyer,...
A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the m...
This paper develops an algorithm for estimating the epipole or direction of translation of a moving monocular observer. To this end, we use constraints arising from two points tha...