Search results for "signal processing"
showing 10 items of 2451 documents
Subsignal-based denoising from piecewise linear or constant signal
2011
15 pages; International audience; n the present work, a novel signal denoising technique for piecewise constant or linear signals is presented termed as "signal split." The proposed method separates the sharp edges or transitions from the noise elements by splitting the signal into different parts. Unlike many noise removal techniques, the method works only in the nonorthogonal domain. The new method utilizes Stein unbiased risk estimate (SURE) to split the signal, Lipschitz exponents to identify noise elements, and a polynomial fitting approach for the sub signal reconstruction. At the final stage, merging of all parts yield in the fully denoised signal at a very low computational cost. St…
Signal Restoration via a Splitting Approach
2012
International audience; In the present study, a novel signal restoration method from noisy data samples is presented and is termed as "signal split (SSplit)" approach. The new method utilizes Stein unbiased risk estimate estimator to split the signal, the Lipschitz exponents to identify noise elements and a heuristic approach for the signal reconstruction. However, unlike many noise removal techniques, the present method works only in the non-orthogonal domain. Signal restoration was performed on each individual part by finding the best compromise between the data samples and the smoothing criteria. Statistical results are quite promising and suggest better performance than the conventional…
The squared symmetric FastICA estimator
2017
In this paper we study the theoretical properties of the deflation-based FastICA method, the original symmetric FastICA method, and a modified symmetric FastICA method, here called the squared symmetric FastICA. This modification is obtained by replacing the absolute values in the FastICA objective function by their squares. In the deflation-based case this replacement has no effect on the estimate since the maximization problem stays the same. However, in the symmetric case we obtain a different estimate which has been mentioned in the literature, but its theoretical properties have not been studied at all. In the paper we review the classic deflation-based and symmetric FastICA approaches…
Energy-efficient resource allocation for OFDMA two-way relay networks with imperfect CSI
2015
Most of the existed works on the radio resource allocation (RRA) problem commonly assume the channel-state information (CSI) can be perfectly obtained by the transmission source. However, such assumption is not practical in the realistic wireless systems. In this work, we consider the practical implementation issues of resource allocation in orthogonal frequency division multiple access (OFDMA) two-way relay networks: the inaccuracy of channel-state information (CSI) available to the source. Instead, only the estimated channel status is known by the source. In this context, a joint optimization of subcarrier pairing and allocation, relay selection, and transmit power allocation is formulate…
Explicit recursivity into reproducing kernel Hilbert spaces
2011
This paper presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define model recursivity in the Hilbert space. The method exploits some properties of functional analysis and recursive computation of dot products without the need of pre-imaging. We illustrate the feasibility of the methodology in the particular case of the gamma-filter, an infinite impulse response (IIR) filter with controlled stability and memory depth. Different algorithmic formulations emerge from the signal model. Experiments in chaotic and electroencephalographic time se…
Deflation-Based FastICA With Adaptive Choices of Nonlinearities
2014
Deflation-based FastICA is a popular method for independent component analysis. In the standard deflation-base d approach the row vectors of the unmixing matrix are extracted one after another always using the same nonlinearities. In prac- tice the user has to choose the nonlinearities and the efficiency and robustness of the estimation procedure then strongly depends on this choice as well as on the order in which the components are extracted. In this paper we propose a novel adaptive two- stage deflation-based FastICA algorithm that (i) allows one to use different nonlinearities for different components and (ii) optimizes the order in which the components are extracted. Based on a consist…
Tensor tomography on Cartan–Hadamard manifolds
2017
We study the geodesic X-ray transform on Cartan-Hadamard manifolds, and prove solenoidal injectivity of this transform acting on functions and tensor fields of any order. The functions are assumed to be exponentially decaying if the sectional curvature is bounded, and polynomially decaying if the sectional curvature decays at infinity. This work extends the results of Lehtonen (2016) to dimensions $n \geq 3$ and to the case of tensor fields of any order.
Infrared-finite algorithms in QED II. The expansion of the groundstate of an atom interacting with the quantized radiation field
2009
Abstract In this paper, we present an explicit and constructive algorithm enabling us to calculate the groundstate and the groundstate energy of a non-relativistic atom minimally coupled to the quantized radiation field up to an error of arbitrary finite order in the fine structure constant. Because of infrared divergences, which invalidate a straightforward Taylor expansion, an iterative construction is employed to remove the infrared cut-off in photon momentum space and to produce a convergent algorithm.
Catalan and Schröder permutations sortable by two restricted stacks
2020
Abstract Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the stacks avoid some specified patterns. Some of the obtained results have been further generalized to Cayley permutations by Cerbai, specialized to particular patterns by Defant and Zheng, or considered in the context of functions over the symmetric group by Berlow. In this work we study pattern avoiding machines where the first stack avoids a pair of patterns of length 3 and investigate those pairs for which sortable permutations are counted by the…
Controlled diffeomorphic extension of homeomorphisms
2018
Let $\Omega$ be an internal chord-arc Jordan domain and $\varphi:\mathbb S\rightarrow\partial\Omega$ be a homeomorphism. We show that $\varphi$ has finite dyadic energy if and only if $\varphi$ has a diffeomorphic extension $h: \mathbb D\rightarrow \Omega$ which has finite energy.