Results 61 to 70 of about 3,813,510 (369)
Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva +4 more
wiley +1 more source
Infrared small target detection is a crucial and challenging topic for various applications. In recent years, the spectrum scale space (SSS) algorithm has shown considerable potential in the field of target detection.
Zujing Yan +4 more
doaj +1 more source
Improvement of CRF-Based Saliency Detection Algorithm Using Matrix Decomposition Based Features [PDF]
One of the most important processing steps in the human vision system is the detection of a scene saliency map. Since saliency map can be applied to algorithms such as segmentation, compression and image retrieval, Researchers have focused on providing ...
Mohammad Shouryabi +1 more
doaj +1 more source
A Generalized CUR Decomposition for Matrix Pairs
We propose a generalized CUR (GCUR) decomposition for matrix pairs $(A, B)$. Given matrices $A$ and $B$ with the same number of columns, such a decomposition provides low-rank approximations of both matrices simultaneously, in terms of some of their rows and columns.
Gidisu, Perfect Y. +1 more
openaire +3 more sources
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source
Computation with No Memory, and Rearrangeable Multicast Networks [PDF]
We investigate the computation of mappings from a set S^n to itself with "in situ programs", that is using no extra variables than the input, and performing modifications of one component at a time, hence using no extra memory.
Emeric Gioan +2 more
doaj +1 more source
Singular random matrix decompositions: Jacobians [PDF]
For a singular random matrix Y, we find the Jacobians associated with the following decompositions; QR, Polar, Singular Value (SVD), L'U, L'DM and modified QR (QDR). Similarly, we find the Jacobinas of the following decompositions: Spectral, Cholesky's, L'DL and symmetric non-negative definite square root, of the cross-product matrix S = Y'Y.
González Farías, Graciela +1 more
openaire +4 more sources
The unrolling of the peltate leaves in Syngonium podophyllum is analyzed and quantified (left‐hand side to center). These measurements serve to verify a mathematical model for leaf unrolling based on the model used in Schmidt (2007). An additional formula for obtaining a layer mismatch from a prescribed radius is derived.
Michelle Modert +4 more
wiley +1 more source
Matrix Decomposition and Applications
In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper triangular matrices.
openaire +2 more sources
This study presents a 3D representative volume element‐based simulation approach to predict mesoscopic residual stress and strain fields in silicon solid solution‐strengthened ductile cast iron. By modeling phase transformation kinetics with an enhanced Johnson–Mehl–Avrami–Kolmogorov model, the effects of varying cooling rates on residual stresses are ...
Lutz Horbach +6 more
wiley +1 more source

