IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v256y2015icp860-875.html
   My bibliography  Save this article

Minimum n-rank approximation via iterative hard thresholding

Author

Listed:
  • Zhang, Min
  • Yang, Lei
  • Huang, Zheng-Hai

Abstract

The problem of recovering a low n-rank tensor is an extension of sparse recovery problem from the low dimensional space (matrix space) to the high dimensional space (tensor space) and has many applications in computer vision and graphics such as image inpainting and video inpainting. In this paper, we consider a new tensor recovery model, named as minimum n-rank approximation (MnRA), and propose an appropriate iterative hard thresholding algorithm with giving the upper bound of the n-rank in advance. The convergence analysis of the proposed algorithm is also presented. Particularly, we show that for the noiseless case, the linear convergence with rate 12 can be obtained for the proposed algorithm under proper conditions. Additionally, combining an effective heuristic for determining n-rank, we can also apply the proposed algorithm to solve MnRA when n-rank is unknown in advance. Some preliminary numerical results on randomly generated and real low n-rank tensor completion problems are reported, which show the efficiency of the proposed algorithms.

Suggested Citation

  • Zhang, Min & Yang, Lei & Huang, Zheng-Hai, 2015. "Minimum n-rank approximation via iterative hard thresholding," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 860-875.
    • Handle: RePEc:eee:apmaco:v:256:y:2015:i:c:p:860-875
    DOI: 10.1016/j.amc.2015.01.099
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315001319
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.01.099?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:256:y:2015:i:c:p:860-875. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.