Results 111 to 120 of about 244,383 (211)
Impact of Number of Noise Eigenvectors Used on the Resolution Probability of MUSIC
IEEE Access, 2019 The MUltiple SIgnal Classification (MUSIC) algorithm is a well-known eigenanalysis technique and has been studied extensively. The algorithm relies on accurate partitioning of the eigenvectors of the spatial correlation matrix between the signal (i.e ...
Ashwin Bhobani Baral, Murat Torlak
doaj +1 more source
Advanced Intelligent Systems, EarlyView.: In this work, Voxel‐SLAM (simultaneous localization and mapping) is introduced: a complete, accurate, and versatile LiDAR (light detection and ranging) ‐inertial SLAM system consisting of five modules: initialization, odometry, local mapping (LM), loop closure (LC), and global mapping (GM), all employing the same map representation, an adaptive voxel
Zheng Liu +9 more
wiley +1 more source
On Differentiating Eigenvalues and Eigenvectors [PDF]
Econometric Theory, 1985 Let X0 be a square matrix (complex or otherwise) and u0 a (normalized) eigenvector associated with an eigenvalue λo of X0, so that the triple (X0, u0, λ0) satisfies the equations Xu = λu, . We investigate the conditions under which unique differentiable functions λ(X) and u(X) exist in a neighborhood of X0 satisfying λ(X0) = λO, u(X0) = u0, Xu = λu ...
openaire +4 more sources
Advanced Intelligent Systems, EarlyView.Feature from recent image foundation models (DINOv2) are useful for vision tasks (segmentation, object localization) with little or no human input. Once upsampled, they can be used for weakly supervised micrograph segmentation, achieving strong results when compared to classical features (blurs, edge detection) across a range of material systems.
Ronan Docherty +2 more
wiley +1 more source
Three Hypergraph Eigenvector Centralities
SIAM Journal on Mathematics of Data Science, 2019 Eigenvector centrality is a standard network analysis tool for determining the importance of (or ranking of) entities in a connected system that is represented by a graph. However, many complex systems and datasets have natural multi-way interactions that are more faithfully modeled by a hypergraph.
openaire +3 more sources
International Forum of Allergy &Rhinology, EarlyView.ABSTRACT Background Appropriate medical therapy (AMT) is first‐line treatment for patients with chronic rhinosinusitis (CRS). We evaluated inflammatory structure, treatment‐induced changes, and biomarker‐outcome associations in AMT‐managed patients. Methods Fifty‐one CRS patients were evaluated before and after AMT which included a combination of oral ...
Asher C. Park +9 more
wiley +1 more source
Asymptotic Inference for Eigenvectors
The Annals of Statistics, 1981 Abstract : Asymptotic procedures are given for testing certain hypotheses concerning eigenvectors and for constructing confidence regions for eigenvectors. These asymptotic procedures are derived under fairly general conditions on the estimates of the matrix whose eigenvectors are of interest. Applications of the general results to principal components
openaire +3 more sources
The Anatomical Record, EarlyView.Abstract Muscle architecture is a major determinant of muscle performance and, in mammalian lineages, has been correlated with both feeding ecology and locomotor behaviors. Over the past decade, contrast‐enhanced micro‐CT (DiceCT) has emerged as an alternative to traditional dissection‐based measurement.
Aleksandra Ratkiewicz +5 more
wiley +1 more source
Patterns of spinal motion, kinematic spaces and the land‐to‐sea transition in carnivorans
The Anatomical Record, EarlyView.Using 3D reconstructions, we quantify intervertebral joint mobility to investigate how cervical, thoracic, and lumbar vertebral regions evolved distinct kinematic roles in pinnipeds. The findings reveal lineage‐specific adaptations for swimming and highlight the functional significance of vertebral joint flexibility in ecological transitions.
Juan Miguel Esteban +3 more
wiley +1 more source
Eigenvectors in bottleneck algebra
Linear Algebra and its Applications, 1992 The paper deals with a characterization of the eigenvectors in terms of the associated graph and with an alternative way of computing them. Upper and lower bounds for all eigenvectors are given. The approach is illustrated by several numerical examples.
openaire +2 more sources