Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 49 for “"Eigen decomposition"”.

  1. LOCATION AND TRACKING OF SOURCES THROUGH PREPROCESSING AND EIGEN-DECOMPOSITION

    … known interferences and the determination of the eigenvector associated with the largest eigenvalue of the resulting transformed covariance matrix. The performance of the algorithm is investigated through analytical formulation and computer simulation and compared with that of the conventional …

    nus Repository record for LOCATION AND TRACKING OF SOURCES THROUGH PREPROCESSING AND EIGEN-DECOMPOSITION (opens in a new tab) Download file for LOCATION AND TRACKING OF SOURCES THROUGH PREPROCESSING AND EIGEN-DECOMPOSITION (opens in a new tab)

  2. AI-Driven Security Constrained Unit Commitment Using Predictive Modeling And Eigen Decomposition

    Security Constrained Unit Commitment (SC-UC) is a complex large scale mix integer constrained optimization problem solved by Independent System Operators (ISOs) in the daily planning of the electricity markets. After receiving offers and bids, ISOs have only few hours to clear the day-ahead …

    wvu Repository record for AI-Driven Security Constrained Unit Commitment Using Predictive Modeling And Eigen Decomposition (opens in a new tab)

  3. USING GEOMETRY AND VISUALIZATION TO DEMYSTIFY EIGEN DECOMPOSITION IN THE CLASSROOM: AN ANALYTICAL AND PEDAGOGICAL APPROACH

    … school with a functional understanding of eigen decomposition, many students of the social sciences lack a conceptual or intuitive understanding of what eigen objects are or how to adapt the utility of these objects to new situations and properly interpret them. Conceptual understanding is …

    montana Repository record for USING GEOMETRY AND VISUALIZATION TO DEMYSTIFY EIGEN DECOMPOSITION IN THE CLASSROOM: AN ANALYTICAL AND PEDAGOGICAL APPROACH (opens in a new tab)

  4. USING GEOMETRY AND VISUALIZATION TO DEMYSTIFY EIGEN DECOMPOSITION IN THE CLASSROOM: AN ANALYTICAL AND PEDAGOGICAL APPROACH

    … school with a functional understanding of eigen decomposition, many students of the social sciences lack a conceptual or intuitive understanding of what eigen objects are or how to adapt the utility of these objects to new situations and properly interpret them. Conceptual understanding is …

    montana-tech Repository record for USING GEOMETRY AND VISUALIZATION TO DEMYSTIFY EIGEN DECOMPOSITION IN THE CLASSROOM: AN ANALYTICAL AND PEDAGOGICAL APPROACH (opens in a new tab)

  5. Longitudinal principal components analysis for binary and continuous data

    … component analysis (LPCA) using a random-effects eigen-decomposition, where the eigen-decomposition utilizes longitudinal information over time to model time-varying eigenvalues and eigenvectors of the corresponding covariance matrices. Our method can effectively analyze large marketing data …

    uiuc Repository record for Longitudinal principal components analysis for binary and continuous data (opens in a new tab)

  6. Spectral Regression: A Regression Framework for Efficient Regularized Subspace Learning

    … These methods use information contained in the eigenvectors of a data affinity (\ie, item-item similarity) matrix to reveal the low dimensional structure in the high dimensional data. The most popular manifold learning algorithms include Locally Linear Embedding, ISOMAP, and Laplacian Eigenmap. …

    uiuc Repository record for Spectral Regression: A Regression Framework for Efficient Regularized Subspace Learning (opens in a new tab)

  7. Regularized Multivariate Functional Principal Component Analysis

    … MFPCA approaches. These approaches utilize eigen decomposition and singular value decomposition (SVD) techniques to enhance the performance of MFPCA by incorporating multiple penalty terms, such as roughness and sparsity penalties. In the first method, a roughness penalty is directly imposed …

    marquette Repository record for Regularized Multivariate Functional Principal Component Analysis (opens in a new tab)

  8. Topological approaches for 3D object processing and applications

    … information. The key idea is to apply eigen-decomposition to the mesh umbrella matrix, and then discard the smallest eigenvalues/eigenvectors in order to reduce the dimensionality of the new spectral basis so that most of the energy is concentrated in the low frequency coefficients. We …

    concordia Download PDF for Topological approaches for 3D object processing and applications (opens in a new tab)

  9. Jacobi-SVD Channel Estimation for Amplify and Forward MIMO Relay

    … Theoretical method of obtaining singular value decomposition by computing the Eigen decomposition of gram matrix have proven to be very difficult and impractical to implement due to associated numerical difficulties. Therefore Jacobi Singular Value Decomposition parallel algorithm for channel …

    calgary Repository record for Jacobi-SVD Channel Estimation for Amplify and Forward MIMO Relay (opens in a new tab)

  10. Structure preserving spectral methods and exponential integrators for the numerical solution of stiff semi-linear partial differential equations

    … equations. We describe three methods namely, eigen-decomposition, contour integral and Carath\'{e}odory-Fej\'{e}r approximation, for computing the matrix ($\varphi$) functions of the exponential integrators. We perform numerical experiments with some PDEs with different boundary conditions, …

    manitoba Repository record for Structure preserving spectral methods and exponential integrators for the numerical solution of stiff semi-linear partial differential equations (opens in a new tab)

  11. HIGH PERFORMANCE SPECTRAL METHODS FOR GRAPH-BASED MACHINE LEARNING

    … show that the computational challenge due to the eigen-decomposition procedure in spectral clustering can be fundamentally addressed. We then propose a highly-scalable spectral graph learning approach GRASPEL. GRASPEL can learn high-quality graphs from high dimensional input data. Compared with …

    mtu Repository record for HIGH PERFORMANCE SPECTRAL METHODS FOR GRAPH-BASED MACHINE LEARNING (opens in a new tab)

  12. Comparison of Smoothing Approaches to Polychoric Correlation Matrices in CFA

    … simulation studies were conducted to compare the eigenvalue substitution smoothing method with Higham’s nearest correlation approach. Both aim to transform NPD matrices into positive definite ones but differ in technique. Eigenvalue substitution adjusts eigenvalues below a set threshold and …

    washington Repository record for Comparison of Smoothing Approaches to Polychoric Correlation Matrices in CFA (opens in a new tab)

  13. REFINING OPTIMIZATION METHODS FOR TRAINING MACHINE LEARNING MODELS: A CASE STUDY IN ROBOTIC SURGICAL PROCEDURES

    … the cost-prohibitive nature of standard eigen decomposition for online Gaussian Process Regression covariance update, we implement incremental eigen decomposition within the ℓ1-SRLSMF and SRLSMF Gaussian Process Regression methodologies. Finally, an illustration of the potential …

    concordia Download PDF for REFINING OPTIMIZATION METHODS FOR TRAINING MACHINE LEARNING MODELS: A CASE STUDY IN ROBOTIC SURGICAL PROCEDURES (opens in a new tab)

  14. Volumetric Attribute Compression for 3D Point Clouds using Feedforward Network with Geometric Attention

    … B-spline bases spanning function spaces without eigen-decomposition. Feedforward network architecture means that the system is amenable to end-to-end neural learning. The key to our network is space-varying convolution, similar to a graph operator, whose weights are computed from the known 3D …

    york Repository record for Volumetric Attribute Compression for 3D Point Clouds using Feedforward Network with Geometric Attention (opens in a new tab)

  15. Performance analysis of the dominant mode rejection beamformer

    … rejection (DMR) method, which uses a reshaped eigen-decomposition of sample covariance matrix (SCM) to define a subspace containing the dominant interferers to be rejected, thereby allowing it to detect weak signal in the presence of strong interferences. The DMR weight vector takes a form …

    njit Repository record for Performance analysis of the dominant mode rejection beamformer (opens in a new tab)

  16. Fast Implementation of Linear Discriminant Analysis

    … optimal linear transformations by computing some eigen-decompositions and involving some matrix inversions. However, the eigen-decomposition is computationally expensive, and the involvement of matrix inverses may lead to that the methods are not numerically stable if the associated matrices are …

    nus Repository record for Fast Implementation of Linear Discriminant Analysis (opens in a new tab) Download file for Fast Implementation of Linear Discriminant Analysis (opens in a new tab)

  17. Improving finite sample estimates of principal components

    … of the original structure. PCA is a matrix decomposition technique based on eigen decomposition. It quantifies relationships between variables using covariance matrices, captures the shape of the data distribution, and evaluates the importance of directions using eigenvalues. Therefore, the …

    waikato-masters Repository record for Improving finite sample estimates of principal components (opens in a new tab) Download file for Improving finite sample estimates of principal components (opens in a new tab)

  18. Functional data analysis: classification and regression

    … Component Analysis (Functional PCA) in which eigen decomposition of the covariance function is employed to find the highest variability along which the data have in the function space. The reduced space of functions spanned by a few eigenfunctions are thought of as a space where most of the …

    tamu Repository record for Functional data analysis: classification and regression (opens in a new tab)

  19. Topological approaches to 3D mesh watermarking

    … a 3D model into sub-meshes, then apply the eigen-decomposition to the Laplace-Beltrami matrix of each sub-mesh, followed by computing the hash value of each sub-mesh. The hash value is defined in terms of the entropy of each submesh. The last watermarking technique applies content-based …

    concordia Download PDF for Topological approaches to 3D mesh watermarking (opens in a new tab)

  20. Robust watermarking schemes for multimedia protection

    … to the blocks of each sub-band, followed by an eigen-decomposition distortion step. The second watermarking scheme uses multiple parameter discrete fractional Fourier (MPDFRF) transform and DWT. The original cover image is decomposed into four wavelet sub-bands, followed by a segmentation of …

    concordia

Page 1 of 3