paper-with-me

홈 › Papers

Fast $(1+ε)$-approximation of the Löwner extremal matrices of high-dimensional symmetric matrices

2016-04-06 · Frank Nielsen, Richard Nock

Matrix data sets are common nowadays like in biomedical imaging where the Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) modality produces data sets of 3D symmetric positive definite matrices anchored at voxel positions capturing the anisotropic diffusion properties of water molecules in biological tissues. The space of symmetric matrices can be partially ordered using the L\"owner ordering, and computing extremal matrices dominating a given set of matrices is a basic primitive used in matrix-valued signal processing. In this letter, we design a fast and easy-to-implement iterative algorithm to approximate arbitrarily finely these extremal matrices. Finally, we discuss on extensions to matrix clustering.

📄 PDF Abstract BibTeX arXiv:1604.01592

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Fast 2D Border Ownership Assignment

2015-06-01 · CVPR 2015 6 · Ching Teo, Cornelia Fermuller, Yiannis Aloimonos

A method for efficient border ownership assignment in 2D images is proposed. Leveraging on recent advances using Structured Random Forests (SRF) for boundary detection, we impose a novel border ownership structure that d…

Boundary Detection

Low rank approximation and decomposition of large matrices using error correcting codes

2015-12-30 · Shashanka Ubaru, Arya Mazumdar, Yousef Saad

Low rank approximation is an important tool used in many applications of signal processing and machine learning. Recently, randomized sketching algorithms were proposed to effectively construct low rank approximations an…

regression

Distributed outer approximation of the intersection of ellipsoids

2023-05-24 · Rodrigo Aldana-Lopez, Eduardo Sebastian, Rosario Aragues, Eduardo Montijano 외

The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices mo…

Sensor Fusion

Fast approximation of orthogonal matrices and application to PCA

2019-07-18 · Cristian Rusu, Lorenzo Rosasco

We study the problem of approximating orthogonal matrices so that their application is numerically fast and yet accurate. We find an approximation by solving an optimization problem over a set of structured matrices, tha…

An Approach to Colour Morphological Supremum Formation using the LogSumExp Approximation

2023-12-21 · Marvin Kahra, Michael Breuß, Andreas Kleefeld, Martin Welk

Mathematical morphology is a part of image processing that has proven to be fruitful for numerous applications. Two main operations in mathematical morphology are dilation and erosion. These are based on the construction…