Sciweavers

266 search results - page 9 / 54
» High-Rank Matrix Completion
Sort
View
TROB
2010
120views more  TROB 2010»
13 years 2 months ago
2-D Ultrasound Probe Complete Guidance by Visual Servoing Using Image Moments
This paper presents a visual-servoing method that is based on 2-D ultrasound (US) images. The main goal is to guide a robot actuating a 2-D US probe in order to reach a desired cro...
Rafik Mebarki, Alexandre Krupa, François Ch...
ICASSP
2009
IEEE
13 years 5 months ago
Weighted nonnegative matrix factorization
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
Yong-Deok Kim, Seungjin Choi
PAKDD
2009
ACM
157views Data Mining» more  PAKDD 2009»
13 years 12 months ago
Analysis of Variational Bayesian Matrix Factorization
Abstract. Recently, the variational Bayesian approximation was applied to probabilistic matrix factorization and shown to perform very well in experiments. However, its good perfor...
Shinichi Nakajima, Masashi Sugiyama
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
14 years 25 days ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong