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 19 of 19 for “"tensor approximation"”.

  1. Feature-Based Texture Synthesis and Hierarchical Tensor Approximation

    … We reorganize the subdivided blocks into small tensors, classify the unpruned ones and approximate each cluster as a tensor ensemble. Experiments on images and medical volume data indicate that this approach achieves better approximation quality than wavelet (packet) transforms and hybrid linear …

    uiuc Repository record for Feature-Based Texture Synthesis and Hierarchical Tensor Approximation (opens in a new tab)

  2. Low-Rank Tensor Approximation in post Hartree-Fock Methods

    In this thesis the application of novel tensor decomposition and tensor representation techniques in highly accurate post Hartree-Fock methods is evaluated. These representation techniques can help to overcome the steep scaling behaviour of high level ab-initio calculations with increasing system …

    qucosa-diss

  3. Landscapes and discriminants of optimization problems

    … optimization task is equivalent to a low-rank tensor approximation. We adopt an algebraic point of view and introduce a discriminant for the optimization problem. We propose a version of the Eckart-Young theorem for a Gaussian data--induced weighted inner product. We extend the framework to …

    texas Repository record for Landscapes and discriminants of optimization problems (opens in a new tab)

  4. Fast Evaluation of Near-Field Boundary Integrals using Tensor Approximations

    … of f by polynomials leads to a d-dimensional tensor which is given by the values of f at the interpolation points. This tensor may be approximated in a low rank tensor format like the canonical format or the hierarchical format. The tensor approximation has to be done only once and allows us …

    qucosa-diss

  5. Recognition, Mining, Synthesis and Estimation (Rmse) for Large-Scale Visual Data Using Multilinear Models

    … synthesis, and estimation (RMSE) for large-scale tensor visual data in computer vision and graphics. We develop novel algorithms based on multilinear models to efficiently explore the relationship of multiple factors within the data and investigate some challenging applications in object …

    uiuc Repository record for Recognition, Mining, Synthesis and Estimation (Rmse) for Large-Scale Visual Data Using Multilinear Models (opens in a new tab)

  6. Low-Rank Matrix And Tensor Models For Data Science Applications

    Low-rank approximations play an important role in data science analysis and applications. When the model is linear and the data is represented as a matrix, the optimal rank-r approximation is given by the r dominant factors of the singular value decomposition (SVD). When the model is multilinear …

    wm-mary Repository record for Low-Rank Matrix And Tensor Models For Data Science Applications (opens in a new tab)

  7. Deep Neural Network for Robust Multiple Object Tracking

    … prior of curvilinear structures in the rank-1 tensor approximation tracking framework to reduce the ambiguity rising from indistinguishable curvilinear structures parts. This work uses convolutional neural network to generate more reliable candidates for tracking and consequently improves the …

    temple Repository record for Deep Neural Network for Robust Multiple Object Tracking (opens in a new tab)

  8. 3D Microwave Imaging through Full Wave Methods for Heterogenous Media

    … group, a full wave inverse method, the Diagonal Tensor approximation combined with Born Iterative Method (DTA-BIM), was proposed to reconstruct the electrical profile of the inversion domain in a homogenous background medium and a layered background medium. In order to evaluate the performance of …

    duke Repository record for 3D Microwave Imaging through Full Wave Methods for Heterogenous Media (opens in a new tab)

  9. Scalable Data Mining via Constrained Low Rank Approximation

    Matrix and tensor approximation methods are recognised as foundational tools for modern data analytics. Their strength lies in their long history of rigorous and principled theoretical foundations, judicious formulations via various constraints, along with the availability of fast computer …

    gatech Repository record for Scalable Data Mining via Constrained Low Rank Approximation (opens in a new tab)

  10. Object Trackers Performance Evaluation and Improvement with Applications using High-order Tensor

    … and build the motion information in a high-order tensor framework. We propose to solve it using rank-1 tensor approximation and use a tensor power iteration algorithm to efficiently obtain the solution. It can apply in pedestrian tracking, aerial video tracking, as well as curvalinear structure …

    temple Repository record for Object Trackers Performance Evaluation and Improvement with Applications using High-order Tensor (opens in a new tab)

  11. Multilinear optimization in low-rank models

    qucosa-diss

  12. On Methods in Tensor Recovery and Completion

    Tensor representations of data have great promise, since as the size of data grows both in terms of dimensionality and modes, it becomes increasingly advantageous to employ methods that exploit structure to explain, store, and compute in an efficient manner. Tensors and their decompositions …

    msu Repository record for On Methods in Tensor Recovery and Completion (opens in a new tab)

  13. Learning based Curvilinear Structure Analysis in Medical Images

    … solution. The second approach uses the tensor-based algorithm with model propagation. Specifically, the deformable tracking is formulated as a multi-dimensional assignment problem which is solved by rank-1 l1 tensor approximation. The model prior is propagated in the course of deformable …

    temple Repository record for Learning based Curvilinear Structure Analysis in Medical Images (opens in a new tab)

  14. Exploring sparsity, self-similarity, and low rank approximation in action recognition, motion retrieval, and action spotting

    … and show that by using a new optimized rank-1 tensor approximation of Joint SSV one can obtain compact low-dimensional descriptors that very accurately preserve the dynamics of the original system, e.g. an action video sequence; (ii) The descriptor vectors derived from the optimized rank-1 …

    ucf Repository record for Exploring sparsity, self-similarity, and low rank approximation in action recognition, motion retrieval, and action spotting (opens in a new tab)

  15. Hierarchische Tensordarstellung

    In der vorliegenden Arbeit wird ein neues Tensorformat vorgestellt und eingehend analysiert. Das hierarchische Format verwendet einen binären Baum, um den Tensorraum der Ordnung d mit einer geschachtelten Unterraumstruktur zu versehen. Der Speicheraufwand für diese Darstellung ist von der …

    qucosa-diss