Sciweavers

64 search results - page 1 / 13
» Distributed bearing estimation via matrix completion
Sort
View
ICASSP
2010
IEEE
13 years 5 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
IROS
2007
IEEE
136views Robotics» more  IROS 2007»
13 years 11 months ago
A bounded uncertainty approach to cooperative localization using relative bearing constraints
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
Camillo J. Taylor, John R. Spletzer
ACCV
2010
Springer
12 years 12 months ago
Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
Lun Wu, Arvind Ganesh, Boxin Shi, Yasuyuki Matsush...
KDD
2009
ACM
159views Data Mining» more  KDD 2009»
14 years 5 months ago
Mining brain region connectivity for alzheimer's disease study via sparse inverse covariance estimation
Effective diagnosis of Alzheimer's disease (AD), the most common type of dementia in elderly patients, is of primary importance in biomedical research. Recent studies have de...
Liang Sun, Rinkal Patel, Jun Liu, Kewei Chen, Tere...
PODC
2006
ACM
13 years 10 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah