Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,729,639 papers from all fields of science
Search
Sign In
Create Free Account
Low-rank approximation
Known as:
Low rank approximation
In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Biconvex optimization
Biplot
Data compression
Factor analysis
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Non-negative Matrix Completion for the Enhancement of Snapshot Mosaic Multispectral Imagery
G. Tsagkatakis
,
M. Jayapala
,
B. Geelen
,
P. Tsakalides
IMSE
2016
Corpus ID: 33724986
Multiand Hyperspectral Imaging (HSI) are characterized by the discrepancy between the dimensionality of hyperspectral image and…
Expand
2015
2015
Unsupervised Hyperspectral Image Band Selection via Column Subset Selection
Chi Wang
,
Maoguo Gong
,
Mingyang Zhang
,
Yongqiang Chan
IEEE Geoscience and Remote Sensing Letters
2015
Corpus ID: 21417692
In this letter, we proposed a novel band selection algorithm for hyperspectral images (HSIs) based on column subset selection…
Expand
2014
2014
A Hierarchical Fast Solver for EFIE-MoM Analysis of Multiscale Structures at Very Low Frequencies
M. A. Echeverri Bautista
,
M. Francavilla
,
F. Vipiana
,
G. Vecchi
IEEE Transactions on Antennas and Propagation
2014
Corpus ID: 34689495
We present an EFIE fast solver that is stable down to very low frequencies, for very dense meshes and multi-scale problems. The…
Expand
Highly Cited
2009
Highly Cited
2009
Polynomial Semantic Indexing
Bing Bai
,
J. Weston
,
+5 authors
M. Mohri
Neural Information Processing Systems
2009
Corpus ID: 1633422
We present a class of nonlinear (polynomial) models that are discriminatively trained to directly map from the word content in a…
Expand
2009
2009
Efficient multi-label classification with hypergraph regularization
Gang Chen
,
Jianwen Zhang
,
Fei Wang
,
Changshui Zhang
,
Yuli Gao
IEEE Conference on Computer Vision and Pattern…
2009
Corpus ID: 17685609
Many computer vision applications, such as image classification and video indexing, are usually multi-label classification…
Expand
2007
2007
Fast Low-Rank Approximation for Covariance Matrices
M. Belabbas
,
P. Wolfe
IEEE International Workshop on Computational…
2007
Corpus ID: 15435619
Computing an efficient low-rank approximation of a given positive definite matrix is a ubiquitous task in statistical signal…
Expand
2006
2006
Block‐row Hankel weighted low rank approximation
M. Schuermans
,
P. Lemmerling
,
S. Huffel
Numerical Linear Algebra with Applications
2006
Corpus ID: 16391936
This paper extends the weighted low rank approximation (WLRA) approach to linearly structured matrices. In the case of Hankel…
Expand
2006
2006
Equivalence of Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices
K. Inoue
,
K. Urahama
Computer Vision and Pattern Recognition
2006
Corpus ID: 14063868
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by…
Expand
2006
2006
Blind Blur Estimation Using Low Rank Approximation of Cepstrum
A. Bhutta
,
H. Foroosh
International Conference on Image Analysis and…
2006
Corpus ID: 7013298
The quality of image restoration from degraded images is highly dependent upon a reliable estimate of blur. This paper proposes a…
Expand
2005
2005
Lower bounds on the size of selection and rank indexes
Peter Bro Miltersen
ACM-SIAM Symposium on Discrete Algorithms
2005
Corpus ID: 7516089
The <i>rank index problem</i> is the following: Preprocess and store a bit string <i>x</i> ∈ {0,1}<sup><i>n</i></sup> on a random…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE