Related papers: Piecewise scalable frames
Linear Parameter-Varying (LPV) systems with piecewise differentiable parameters is a class of LPV systems for which no proper analysis conditions have been obtained so far. To fill this gap, we propose an approach based on the theory of…
Given a normal projective irreducible stack $\mathscr X$ over an algebraically closed field of characteristic zero we consider framed sheaves on $\mathscr X$, i.e., pairs $(\mathcal E,\phi_{\mathcal E})$, where $\mathcal E$ is a coherent…
In this work, we present a multiscale kinetic framework for consensus-based image segmentation. By interpreting an image as a system of interacting particles, each pixel is characterised by its spatial position and an internal feature…
Let $A$ be an operator on {a separable } Hilbert space $\cH$, and let $G \subset \cH$. It is known that - under appropriate conditions on $A$ and $G$ - the set of iterations $F_G(A)= \{A^j \gbf \; | \; \gbf \in G, \; 0 \leq j \leq L(\gbf)…
Selective segmentation involves incorporating user input to partition an image into foreground and background, by discriminating between objects of a similar type. Typically, such methods involve introducing additional constraints to…
The purpose of this paper is to propose a definition of continuous frames of rank n for Krein spaces and to study their basic properties. Similarly to the Hilbert space case, continuous frames are characterized by the analysis, the…
A systematic procedure to numerically compute a horseshoe map is presented. This new method uses piecewise functions and expresses the required operations by means of elementary transformations, such as translations, scalings, projections…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
We present a new and compelling approach to the efficient solution of important computational problems that arise in the context of abstract argumentation. Our approach makes known algorithms defined for restricted fragments generally…
This paper studies the problem of 3D volumetric reconstruction from two views of a scene with an unknown camera. While seemingly easy for humans, this problem poses many challenges for computers since it requires simultaneously…
One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…
A Parseval frame is a spanning set for a Hilbert space which satisfies the Parseval identity: a vector can be expressed as a linear combination of the frame whose coefficients are inner products with the frame vectors. There is considerable…
Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…
The problem of time-series clustering is considered in the case where each data-point is a sample generated by a piecewise stationary ergodic process. Stationary processes are perhaps the most general class of processes considered in…
The common approach to radial distortion is by the means of polynomial approximation, which introduces distortion-specific parameters into the camera model and requires estimation of these distortion parameters. The task of estimating…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
Sparse recovery is widely applied in many fields, since many signals or vectors can be sparsely represented under some frames or dictionaries. Most of fast algorithms at present are based on solving $l^0$ or $l^1$ minimization problems and…
Scalar curvature constraints can be studied by means of splitting procedures. The success of this strategy depends on the control we can get on its splitting factors. We introduce canonical so-called minimal splitting factors. They have…
Gradient matching is a promising tool for learning parameters and state dynamics of ordinary differential equations. It is a grid free inference approach, which, for fully observable systems is at times competitive with numerical…
Motivated by the existence problem of Fourier frames on fractal measures, we introduce Bessel and frame measures for a given finite measure on $\br^d$, as extensions of the notions of Bessel and frame spectra that correspond to bases of…