Search results for "Hilbert"
showing 10 items of 331 documents
Explicit signal to noise ratio in reproducing kernel Hilbert spaces
2011
This paper introduces a nonlinear feature extraction method based on kernels for remote sensing data analysis. The proposed approach is based on the minimum noise fraction (MNF) transform, which maximizes the signal variance while also minimizing the estimated noise variance. We here propose an alternative kernel MNF (KMNF) in which the noise is explicitly estimated in the reproducing kernel Hilbert space. This enables KMNF dealing with non-linear relations between the noise and the signal features jointly. Results show that the proposed KMNF provides the most noise-free features when confronted with PCA, MNF, KPCA, and the previous version of KMNF. Extracted features with the explicit KMNF…
Fixed point iterative schemes for variational inequality problems
2018
In a wide class of evolutionary processes, the problem of computing the solutions of an initial value problem is encountered. Here, we consider projected dynamical systems in the sense of \cite{Daniele} and references therein. Precisely, a projected dynamical system is an operator which solves the initial value problem: \begin{equation}\label{PDS}\frac{dx(t)}{dt}= \Pi_{\mathbb{K}}\left(x(t),-F(x(t))\right), \quad x(0)=x_0 \in \mathbb{K}, \, t \in [0,+\infty[,\tag{P}\end{equation} where $\mathbb{K}$ is a convex polyhedral set in $\mathbb{R}^n$, $F: \mathbb{K} \to \mathbb{R}^n$ and $\Pi_{\mathbb{K}}: \mathbb{R} \times \mathbb{K} \to \mathbb{R}^n$ is given as follows $\Pi_{\mathbb{K}}(x,-F(x))…
Image Quality Assessment Based on Intrinsic Mode Function Coefficients Modeling
2011
Reduced reference image quality assessment (RRIQA) methods aim to assess the quality of a perceived image with only a reduced cue from its original version, called ”reference image”. The powerful advantage of RR methods is their ”General-purpose”. However, most introduced RR methods are built upon a non-adaptive transform models. This can limit the scope of RR methods to a small number of distortion types. In this work, we propose a bi-dimensional empirical mode decomposition-based RRIQA method. First, we decompose both, reference and distorted images, into Intrinsic Mode Functions (IMF), then we use the Generalized Gaussian Density (GGD) to model IMF coefficients. Finally, the distortion m…
A New Image Distortion Measure Based on Natural Scene Statistics Modeling
2012
In the field of Image Quality Assessment (IQA), this paper examines a Reduced Reference (RRIQA) measure based on the bi-dimensional empirical mode decomposition. The proposed measure belongs to Natural Scene Statistics (NSS) modeling approaches. First, the reference image is decomposed into Intrinsic Mode Functions (IMF); the authors then use the Generalized Gaussian Density (GGD) to model IMF coefficients distribution. At the receiver side, the same number of IMF is computed on the distorted image, and then the quality assessment is done by fitting error between the IMF coefficients histogram of the distorted image and the GGD estimate of IMF coefficients of the reference image, using the …
Steiner systems and configurations of points
2020
AbstractThe aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner SystemS(t, n, v) we associate two ideals, in a suitable polynomial ring, defining a Steiner configuration of points and its Complement. We focus on the latter, studying its homological invariants, such as Hilbert Function and Betti numbers. We also study symbolic and regular powers associated to the ideal defining a Complement of a Steiner configuration of points, finding its Waldschmidt constant, regularity, bounds on its resurgence and asymptotic resurgence. We also compute the parameters of linear codes associated to any Steiner configur…
Unbounded Linear Operators in Hilbert Spaces
2002
In order to make this monograph self-contained, we summarize in this chapter some basic definitions and results for unbounded linear operators in a Hilbert space. In Section 1.1, we recall the definitions of C*-algebras and von Neumann algebras. In Section 1.2, we define and investigate the notion of closedness, the closure and the adjoint of an unbounded linear operator in a Hilbert space. Section 1.3 is devoted to the Cayley transform approach to the self-adjointness of a symmetric operator. Section 1.4 deals with the self-adjoint extendability of a symmetric operator with help of the deficiency spaces. In Section 1.5, we extend to unbounded self-adjoint operators the spectral theorem and…
An algorithm for solving generalized algebraic Lyapunov equations in Hilbert space, applications to boundary value problems
1988
Let L(H) be the algebra of all bounded linear operators on a separable complex Hubert space H. In a recent paper [7], explicit expressions for solutions of a boundary value problem in the Hubert space H, of the typeare given in terms of solutions of an algebraic operator equation
Hilbert-Huang versus morlet wavelet transformation on mismatch negativity of children in uninterrupted sound paradigm
2009
Background. Compared to the waveform or spectrum analysis of event-related potentials (ERPs), time-frequency representation (TFR) has the advantage of revealing the ERPs time and frequency domain information simultaneously. As the human brain could be modeled as a complicated nonlinear system, it is interesting from the view of psychological knowledge to study the performance of the nonlinear and linear time-frequency representation methods for ERP research. In this study Hilbert-Huang transformation (HHT) and Morlet wavelet transformation (MWT) were performed on mismatch negativity (MMN) of children. Participants were 102 children aged 8–16 years. MMN was elicited in a passive oddbal…
Diagonalization of large matrices: a new parallel algorithm.
2015
On the basis of a dressed matrices formalism, a new algorithm has been devised for obtaining the lowest eigenvalue and the corresponding eigenvector of large real symmetric matrices. Given an N × N matrix, the proposed algorithm consists in the diagonalization of (N - 1)2 × 2 dressed matrices. Both sequential and parallel versions of the proposed algorithm have been implemented. Tests have been performed on a Hilbert matrix, and the results show that this algorithm is up 340 times faster than the corresponding LAPACK routine for N = 10(4) and about 10% faster than the Davidson method. The parallel MPI version has been tested using up to 512 nodes. The speed-up for a N = 10(6) matrix is fair…
A general framework for a class of non-linear approximations with applications to image restoration
2018
Este artículo se encuentra disponible en la página web de la revista en la siguiente URL: https://www.sciencedirect.com/science/article/abs/pii/S0377042717301188 Este es el pre-print del siguiente artículo: Candela, V., Falcó, A. & Romero, PD. (2018). A general framework for a class of non-linear approximations with applications to image restoration. Journal of Computational and Applied Mathematics, vol. 330 (mar.), pp. 982-994, que se ha publicado de forma definitiva en https://doi.org/10.1016/j.cam.2017.03.008 This is the pre-peer reviewed version of the following article: Candela, V., Falcó, A. & Romero, PD. (2018). A general framework for a class of non-linear approximations with applic…