Results 81 to 90 of about 46,224 (313)
A New Analysis for Support Performance with Block Generalized Orthogonal Matching Pursuit
For recovering block-sparse signals with unknown block structures using compressive sensing, a block orthogonal matching pursuit- (BOMP-) like block generalized orthogonal matching pursuit (BgOMP) algorithm has been proposed recently.
Chaoyu Xia +4 more
semanticscholar +1 more source
EDX elemental map of the pre‐oxidized MgO–steel cermet anode cross section after electrolysis. The development of inert anodes for aluminum electrolysis remains challenging due to the high corrosivity of cryolite‐based melts at 950°C–1000°C. This study investigates the corrosion and process behavior of a carbon‐free MgO–steel cermet anode derived from ...
Alexander Adamczyk +7 more
wiley +1 more source
Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal Reconstruction
Compressed sensing (CS) is a theory which exploits the sparsity characteristic of the original signal in signal sampling and coding. By solving an optimization problem, the original sparse signal can be reconstructed accurately. In this paper, a new Tree-
Yigang Cen +6 more
doaj +1 more source
Achieving high-resolution remote sensing images is an important goal in the field of space exploration. However, the quality of remote sensing images is low after the use of traditional compressed sensing with the orthogonal matching pursuit (OMP ...
Jiawei Yong +7 more
doaj +1 more source
Phase‐field simulations coupled with dislocation‐density‐based crystal plasticity modeling reproduce γ′ rafting behavior in single‐crystal Ni‐based superalloys under varied loading conditions. The model captures both macroscopic creep and microscopic morphology evolution, with results matching high‐temperature creep experiments.
Micheal Younan +5 more
wiley +1 more source
Chebushev Greedy Algorithm in convex optimization [PDF]
Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces.
Temlyakov, Vladimir
core
Sparse approximation based on a random overcomplete basis
We discuss a strategy of sparse approximation that is based on the use of an overcomplete basis, and evaluate its performance when a random matrix is used as this basis.
Kabashima, Yoshiyuki +3 more
core +1 more source
Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich +3 more
wiley +1 more source
This paper addresses the problem of estimating frequency hopping (FH) signals parameters with the single array. The existing optimization algorithms are with unrealistic computational burden.
Yu Wang, Chaozhu Zhang, Fulong Jing
doaj +1 more source
Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit [PDF]
We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an L0 optimization, which can be effectively solved by orthogonal ...
Nagahara, Masaaki +2 more
core +1 more source

