相关论文: L1TV computes the flat norm for boundaries
This paper deals with linear time-varying, delay systems. Extensions of the concept of differential flatness \cite{Fliess_95} to this context have been first proposed in \cite{Mounier_95,Fliess_96} (see also \cite{Rudolph_03,Chyzak_05}), by…
This paper makes the following original contributions. First, we develop a unifying framework for testing shape restrictions based on the Wald principle. The test has asymptotic uniform size control and is uniformly consistent. Second, we…
Even after over two decades, the total variation (TV) remains one of the most popular regularizations for image processing problems and has sparked a tremendous amount of research, particularly to move from scalar to vector-valued…
This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…
We study the decomposition of real numbers into sums of L\"uroth sets, which are defined by numbers whose L\"uroth expansions have prescribed digit constraints. We establish several results on the congruence modulo 1 of sums of L\"uroth…
We propose a PDE-constrained optimization approach for the determination of noise distribution in total variation (TV) image denoising. An optimization problem for the determination of the weights correspondent to different types of noise…
We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…
Data visualisation helps understanding data represented by multiple variables, also called features, stored in a large matrix where individuals are stored in lines and variable values in columns. These data structures are frequently called…
The number of studies for the analysis of remote sensing images has been growing exponentially in the last decades. Many studies, however, only report results---in the form of certain performance metrics---by a few selected algorithms on a…
In the study of computer codes, filling space as uniformly as possible is important to describe the complexity of the investigated phenomenon. However, this property is not conserved by reducing the dimension. Some numeric experiment…
We present a proof of the folklore result that any length metric on $\mathbb R^d$ can be approximated by conformally flat Riemannian distance functions in the uniform distance. This result is used to study Liouville quantum gravity in…
Almost every single image restoration problem has a closely related parameter, such as the scale factor in super-resolution, the noise level in image denoising, and the quality factor in JPEG deblocking. Although recent studies on image…
Sparse decomposition has been widely used for different applications, such as source separation, image classification, image denoising and more. This paper presents a new algorithm for segmentation of an image into background and foreground…
Under certain statistical assumptions of noise, recent self-supervised approaches for denoising have been introduced to learn network parameters without true clean images, and these methods can restore an image by exploiting information…
The paper presents a new model for single channel images low-level interpretation. The image is decomposed into a graph which captures a complete set of structural features. The description allows to accurately identify every edge location…
Frame is the corner stone for designing decomposition and reconstruction operations in signal processing. Famous frames include wavelets, curvelets,and Gabor. A celebrated result indicates that if a synthesis frame is chosen for…
We present angle-uniform parallel coordinates, a data-independent technique that deforms the image plane of parallel coordinates so that the angles of linear relationships between two variables are linearly mapped along the horizontal axis…
We describe new approaches for distances between pairs of 2-dimensional surfaces (embedded in 3-dimensional space) that use local structures and global information contained in inter-structure geometric relationships. We present algorithms…
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…
The diamond and completely bounded norms for linear maps play an increasingly important role in quantum information science, providing fundamental stabilized distance measures for differences of quantum operations. Based on the theory of…