Missing data recovery using low rank matrix completion methods

Unnikrishna Pillai; Vinay Murthy; Ivan Selesnick

doi:10.1109/RADAR.2012.6212119

Missing data recovery using low rank matrix completion methods

Unnikrishna Pillai, Vinay Murthy, Ivan Selesnick

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper presents a new method for data recovery exploiting low rank structure and convexity constraints. It is capable of handling arbitrary observation patterns and it can incorporate additional convex constraints such as non-negativity and finite bandwidth.

Original language	English (US)
Title of host publication	2012 IEEE Radar Conference
Subtitle of host publication	Ubiquitous Radar, RADARCON 2012 - Conference Program
Pages	101-106
Number of pages	6
DOIs	https://doi.org/10.1109/RADAR.2012.6212119
State	Published - 2012
Event	2012 IEEE Radar Conference: Ubiquitous Radar, RADARCON 2012 - Atlanta, GA, United States Duration: May 7 2012 → May 11 2012

Publication series

Name	IEEE National Radar Conference - Proceedings
ISSN (Print)	1097-5659

Other

Other	2012 IEEE Radar Conference: Ubiquitous Radar, RADARCON 2012
Country/Territory	United States
City	Atlanta, GA
Period	5/7/12 → 5/11/12

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/RADAR.2012.6212119

Cite this

Pillai, U, Murthy, V & Selesnick, I 2012, Missing data recovery using low rank matrix completion methods. in 2012 IEEE Radar Conference: Ubiquitous Radar, RADARCON 2012 - Conference Program., 6212119, IEEE National Radar Conference - Proceedings, pp. 101-106, 2012 IEEE Radar Conference: Ubiquitous Radar, RADARCON 2012, Atlanta, GA, United States, 5/7/12. https://doi.org/10.1109/RADAR.2012.6212119

@inproceedings{5ce8a62a3539454a97c0b52677f4b858,

title = "Missing data recovery using low rank matrix completion methods",

abstract = "This paper presents a new method for data recovery exploiting low rank structure and convexity constraints. It is capable of handling arbitrary observation patterns and it can incorporate additional convex constraints such as non-negativity and finite bandwidth.",

author = "Unnikrishna Pillai and Vinay Murthy and Ivan Selesnick",

year = "2012",

doi = "10.1109/RADAR.2012.6212119",

language = "English (US)",

isbn = "9781467306584",

series = "IEEE National Radar Conference - Proceedings",

pages = "101--106",

booktitle = "2012 IEEE Radar Conference",

note = "2012 IEEE Radar Conference: Ubiquitous Radar, RADARCON 2012 ; Conference date: 07-05-2012 Through 11-05-2012",

}

TY - GEN

T1 - Missing data recovery using low rank matrix completion methods

AU - Pillai, Unnikrishna

AU - Murthy, Vinay

AU - Selesnick, Ivan

PY - 2012

Y1 - 2012

N2 - This paper presents a new method for data recovery exploiting low rank structure and convexity constraints. It is capable of handling arbitrary observation patterns and it can incorporate additional convex constraints such as non-negativity and finite bandwidth.

AB - This paper presents a new method for data recovery exploiting low rank structure and convexity constraints. It is capable of handling arbitrary observation patterns and it can incorporate additional convex constraints such as non-negativity and finite bandwidth.

UR - http://www.scopus.com/inward/record.url?scp=84864250006&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864250006&partnerID=8YFLogxK

U2 - 10.1109/RADAR.2012.6212119

DO - 10.1109/RADAR.2012.6212119

M3 - Conference contribution

AN - SCOPUS:84864250006

SN - 9781467306584

T3 - IEEE National Radar Conference - Proceedings

SP - 101

EP - 106

BT - 2012 IEEE Radar Conference

T2 - 2012 IEEE Radar Conference: Ubiquitous Radar, RADARCON 2012

Y2 - 7 May 2012 through 11 May 2012

ER -

Missing data recovery using low rank matrix completion methods

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this