Results 31 to 40 of about 262,580 (281)
Subspace System Identification of the Kalman Filter [PDF]
Some proofs concerning a subspace identification algorithm are presented. It is proved that the Kalman filter gain and the noise innovations process can be identified directly from known input and output data without explicitly solving the Riccati ...
David Di Ruscio
doaj +1 more source
Multiway Filtering Based on Fourth-Order Cumulants
We propose a new multiway filtering based on fourth-order cumulants for the denoising of noisy data tensor with correlated Gaussian noise. The classical multiway filtering is based on the TUCKALS3 algorithm that computes a lower-rank tensor ...
Muti Damien, Bourennane Salah
doaj +1 more source
Multiple pattern classification by sparse subspace decomposition
A robust classification method is developed on the basis of sparse subspace decomposition. This method tries to decompose a mixture of subspaces of unlabeled data (queries) into class subspaces as few as possible.
Sakai, Tomoya
core +1 more source
Subspace representations in ab initio methods for strongly correlated systems [PDF]
We present a generalized definition of subspace occupancy matrices in ab initio methods for strongly correlated materials, such as DFT+U and DFT+DMFT, which is appropriate to the case of nonorthogonal projector functions.
Mostofi, Arash A. +2 more
core +1 more source
Extended Averaged Learning Subspace Method for Hyperspectral Data Classification
Averaged learning subspace methods (ALSM) have the advantage of being easily implemented and appear to outperform in classification problems of hyperspectral images.
Yoshifumi Yasuoka +4 more
doaj +1 more source
Cone-restricted subspace methods [PDF]
In pattern recognition, feature vectors are occasionally subject to non-negative constraints. This characteristic can be expressed by a cone in feature vector space. In this paper, we propose cone-restricted subspace methods. The proposed methods admit the scaling and additivity of vectors as well as ordinary subspace methods; in addition, vectors can ...
Takumi Kobayashi, Nobuyuki Otsu
openaire +1 more source
Imaging of Biphoton States: Fundamentals and Applications
Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley +1 more source
Algorithmic Design of Disordered Networks With Arbitrary Coordination: Application to Biophotonics
Predictive Design of Disordered Networks: Disordered network‐like morphologies are abundant in nature, from cytoskeletal networks to bone structures and chalcogenide glasses. These structures are naturally hard to characterize. A new algorithmic tool extends the established Wooten–Weaire–Winer (WWW) algorithm to valencies above 4.
Florin Hemmann +3 more
wiley +1 more source
Flexible Inner-Outer Krylov Subspace Methods [PDF]
Flexible Krylov methods refer to a class of methods which accept preconditioning that can change from one step to the next. An important special case is found when a fixed preconditioner is only approximated and the approximation changes from one step to the next.
Simoncini V., Szyld D.B.
openaire +2 more sources
Exciton Radiative Lifetimes in Hexagonal Diamond Ge and SixGe1–x Alloys
Strong room‐temperature photoluminescence reported in hexagonal Ge conflicts with theory predicting a nearly dark band edge. First‐principles calculations of excitonic radiative lifetimes fill a key gap in this debate, showing that pristine hexagonal Ge remains intrinsically weakly emissive, while Si alloying only modestly shortens the lifetime and ...
Michele Re Fiorentin +2 more
wiley +1 more source

