Sciweavers

Share
28 search results - page 2 / 6
» The sum-of-increments constraint in the consecutive-ones mat...
Sort
View
GRC
2010
IEEE
9 years 3 months ago
Optimal Factorization of Three-Way Binary Data
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
Radim Belohlávek, Vilém Vychodil
CORR
2004
Springer
152views Education» more  CORR 2004»
9 years 2 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
IJCV
2000
133views more  IJCV 2000»
9 years 2 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
CORR
2010
Springer
168views Education» more  CORR 2010»
9 years 2 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
9 years 9 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
books