Results 81 to 90 of about 19,816 (300)
A Posteriori Quantized Matching Pursuit [PDF]
, 2001 This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit properties. The coefficients energy in Matching Pursuit indeed decreases with
Pierre Vandergheynst, Pascal Frossard
core
IET Networks, 2019 This study proposes a construction method of deterministic measurement matrix based on a correlation criterion. On this basis, the authors investigated the massive multiple‐input and multiple‐output (MIMO) channel estimation algorithm using the ...
Ruijin Ma, Huisheng Zhang
doaj +1 more source
Orthogonal Matching Pursuit with Replacement
CoRR, 2011 In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms.
Prateek Jain 0002 +2 more
openaire +3 more sources
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
Progressive Source Coding by Matching Pursuit: Application in Image and Gaussian Data Compression [PDF]
, 2009 Conventional image compression algorithms use transform coding to achieve a compact representation of the image. Most transforms used in image compression algorithms map image data to a complete set of transform basis functions which can decorrelate ...
Shoa, Alireza
core
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 Time-frequency signal transform is considered. Advantages of joint time-frequency analysis over traditional separate analysis in time or frequency domains are shown.
Al. A. Petrovsky, V. Y. Herasimovich
doaj
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
MATCHING PURSUIT ALGORITHM IN ASSESSING THE STATE OF ROLLING BEARINGS [PDF]
Applied Computer Science, 2017 In this paper the results of Matching Pursuit (MP) Octave algorithm applied to noise, vibration and harness (NVH) diagnosis of rolling bearings are presented. For this purpose two bearings in different condition state were examined.
Kamil JONAK, Paweł KRUKOW
doaj +1 more source
On Matching Pursuit and Coordinate Descent
, 2018 Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers a generalized notion of directions.
Locatello, F. +6 more
openaire +4 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source