30
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Accelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR

      IEEE transactions on medical imaging
      Institute of Electrical and Electronics Engineers (IEEE)

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references31

          • Record: found
          • Abstract: not found
          • Article: not found

          Exact Matrix Completion via Convex Optimization

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Enhancing Sparsity by Reweighted ℓ 1 Minimization

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

              The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum rank solution can be recovered by solving a convex optimization problem, namely the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds with overwhelming probability. The techniques used in our analysis have strong parallels in the compressed sensing framework. We discuss how affine rank minimization generalizes this pre-existing concept and outline a dictionary relating concepts from cardinality minimization to those of rank minimization.
                Bookmark

                Author and article information

                Journal
                10.1109/TMI.2010.2100850
                3707502
                21292593

                Comments

                Comment on this article