pith. sign in

arxiv: 1809.04176 · v1 · pith:XJUF4W3Gnew · submitted 2018-09-11 · 💻 cs.LG · cs.IT· math.IT· stat.ML

Phaseless Subspace Tracking

classification 💻 cs.LG cs.ITmath.ITstat.ML
keywords subspacephaselesssignalproblemsequencetimetrackingwork
0
0 comments X
read the original abstract

This work takes the first steps towards solving the "phaseless subspace tracking" (PST) problem. PST involves recovering a time sequence of signals (or images) from phaseless linear projections of each signal under the following structural assumption: the signal sequence is generated from a much lower dimensional subspace (than the signal dimension) and this subspace can change over time, albeit gradually. It can be simply understood as a dynamic (time-varying subspace) extension of the low-rank phase retrieval problem studied in recent work.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.