Related papers: A general criterion for jump set slicing and appli…
Modern multiscale type segmentation methods are known to detect multiple change-points with high statistical accuracy, while allowing for fast computation. Underpinning theory has been developed mainly for models that assume the signal as a…
Accurate reconstruction of piecewise-smooth functions from a finite number of Fourier coefficients is an important problem in various applications. The inherent inaccuracy, in particular the Gibbs phenomenon, is being intensively…
The aim of this paper is to present an abstract and general approach to jump inequalities in harmonic analysis. Our principal conclusion is the refinement of $r$-variational estimates, previously known for $r>2$, to end-point results for…
We describe a new framework for fitting jump models to a sequence of data. The key idea is to alternate between minimizing a loss function to fit multiple model parameters, and minimizing a discrete loss function to determine which set of…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
There have been many proposals for algorithms segmenting human whole-body motion in the literature. However, the wide range of use cases, datasets, and quality measures that were used for the evaluation render the comparison of algorithms…
For many years, exact metric search relied upon the property of triangle inequality to give a lower bound on uncalculated distances. Two exclusion mechanisms derive from this property, generally known as pivot exclusion and hyperplane…
We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the…
We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the…
We study the radial part of sub-Riemannian Brownian motion in the context of totally geodesic foliations. It\^o's formula is proved for the radial processes associated to Riemannian distances approximating the Riemannian one. We deduce very…
This paper proposes a generalized framework with joint normalization which learns lower-dimensional subspaces with maximum discriminative power by making use of the Riemannian geometry. In particular, we model the similarity/dissimilarity…
A novel algorithm is proposed for segmenting an image into multiple levels using its mean and variance. Starting from the extreme pixel values at both ends of the histogram plot, the algorithm is applied recursively on sub-ranges computed…
In this paper, we introduce a symmetrization technique for the distributional gradient of a function of bounded variation in the anisotropic setting. This generalizes the result obtained in the Euclidean case in…
The LYM inequality is a fundamental result concerning the sizes of subsets in a Sperner family. Subsequent studies on the LYM inequality have been generalized to families of $r$-decompositions, where all components are required to avoid…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
A Hausdorff measure version of W.M. Schmidt's inhomogeneous, linear forms theorem in metric number theory is established. The key ingredient is a `slicing' technique motivated by a standard result in geometric measure theory. In short,…
Continuing the analysis in a unified scheme for treating generalized superselection sectors based upon the notion of selection criteria for states of relevance in quantum physics, we extend the Doplicher-Roberts superselection theory for…
The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…
Teramoto et al. defined a new measure called the gap ratio that measures the uniformity of a finite point set sampled from $\cal S$, a bounded subset of $\mathbb{R}^2$. We generalize this definition of measure over all metric spaces by…
This paper studies iterative schemes for measure transfer and approximation problems, which are defined through a slicing-and-matching procedure. Similar to the sliced Wasserstein distance, these schemes benefit from the availability of…