Sciweavers

27 search results - page 4 / 6
» Matrix Completion from Noisy Entries
Sort
View
ICASSP
2009
IEEE
13 years 4 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
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 6 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht
IWPEC
2004
Springer
14 years 1 days ago
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
Jens Gramm, Till Nierhoff, Till Tantau
CVPR
2008
IEEE
14 years 8 months ago
Spectrally optimal factorization of incomplete matrices
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
TROB
2010
120views more  TROB 2010»
13 years 1 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...