Show simple item record

dc.contributor.authorLiu, Ji
dc.contributor.authorMusialski, Przemyslaw
dc.contributor.authorWonka, Peter
dc.contributor.authorYe, Jieping
dc.date.accessioned2015-08-03T10:43:01Z
dc.date.available2015-08-03T10:43:01Z
dc.date.issued2012-01-25
dc.identifier.citationLiu J, Musialski P, Wonka P, Ye J (2013) Tensor Completion for Estimating Missing Values in Visual Data. IEEE Transactions on Pattern Analysis and Machine Intelligence 35: 208–220. Available: http://dx.doi.org/10.1109/TPAMI.2012.39.
dc.identifier.issn0162-8828
dc.identifier.issn2160-9292
dc.identifier.doi10.1109/TPAMI.2012.39
dc.identifier.urihttp://hdl.handle.net/10754/562566
dc.description.abstractIn this paper, we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process or because the user manually identified unwanted outliers. Our algorithm works even with a small amount of samples and it can propagate structure to fill larger missing regions. Our methodology is built on recent studies about matrix completion using the matrix trace norm. The contribution of our paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and then by building a working algorithm. First, we propose a definition for the tensor trace norm that generalizes the established definition of the matrix trace norm. Second, similarly to matrix completion, the tensor completion is formulated as a convex optimization problem. Unfortunately, the straightforward problem extension is significantly harder to solve than the matrix case because of the dependency among multiple constraints. To tackle this problem, we developed three algorithms: simple low rank tensor completion (SiLRTC), fast low rank tensor completion (FaLRTC), and high accuracy low rank tensor completion (HaLRTC). The SiLRTC algorithm is simple to implement and employs a relaxation technique to separate the dependant relationships and uses the block coordinate descent (BCD) method to achieve a globally optimal solution; the FaLRTC algorithm utilizes a smoothing scheme to transform the original nonsmooth problem into a smooth one and can be used to solve a general tensor trace norm minimization problem; the HaLRTC algorithm applies the alternating direction method of multipliers (ADMMs) to our problem. Our experiments show potential applications of our algorithms and the quantitative evaluation indicates that our methods are more accurate and robust than heuristic approaches. The efficiency comparison indicates that FaLTRC and HaLRTC are more efficient than SiLRTC and between FaLRTC and HaLRTC the former is more efficient to obtain a low accuracy solution and the latter is preferred if a high-accuracy solution is desired. © 1979-2012 IEEE.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectsparse learning
dc.subjectTensor completion
dc.subjecttrace norm
dc.titleTensor Completion for Estimating Missing Values in Visual Data
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.contributor.departmentVisual Computing Center (VCC)
dc.identifier.journalIEEE Transactions on Pattern Analysis and Machine Intelligence
dc.eprint.versionPost-print
dc.contributor.institutionUniversity of Wisconsin-Madison, Madison, WI 53706, United States
dc.contributor.institutionVRVis Research Center, Vienna, Austria
dc.contributor.institutionState University, Tempe, AZ 85287-8809, United States
dc.contributor.institutionArizona State University, 699 South Mill Avenue, Tempe, AZ 85287-8809, United States
kaust.personWonka, Peter
refterms.dateFOA2018-06-14T05:53:49Z
dc.date.published-online2012-01-25
dc.date.published-print2013-01


Files in this item

Thumbnail
Name:
2012.PAMI.JiLiu.Tensor Completion.pdf
Size:
2.041Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record