The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Tensor Completion for Estimating Missing Values in Visual Data
Abstract
In 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 dependent 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 an- HaLRTC the former is more efficient to obtain a low accuracy solution and the latter is preferred if a high-accuracy solution is desired.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Missing Value Estimation Methods for DNA Microarrays
Troyanskaya, O., Cantor, M., Sherlock, G., Brown, P., Hastie, T., Tibshirani, R., Botstein, D., & Altman, R. B. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.6.520 · Cited by 4,230
Bertalmio, M., Sapiro, G., Caselles, V., & Ballester, C. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.344972 · Cited by 3,580
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Shape and motion from image streams under orthography: a factorization method
Tomasi, C., & Kanade, T. (1992) · International Journal of Computer Vision · doi:10.1007/bf00129684 · Cited by 2,878
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Harshman, R. A. (1970) · Cited by 2,255
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
Tseng, P. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017501703105 · Cited by 1,989
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Argyriou, A., Evgeniou, T., & Pontil, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0010 · Cited by 1,333
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
Lin, Z., Chen, M., & Ma, Y. (2010) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · doi:10.48550/arxiv.1009.5055 · Cited by 1,176
Regularization methods for learning incomplete matrices
Mazumder, R., Hastie, T. J., & Tibshirani, R. J. (2009) · Journal of Machine Learning Research · doi:10.48550/arxiv.0906.2034 · Cited by 1,174
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Tensor completion and low-n-rank tensor recovery via convex optimization
Gandy, S., Recht, B., & Yamada, I. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/2/025010 · Cited by 738
A Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
SDPT3 -- A Matlab Software Package for Semidefinite Programming
Toh, K.-C., Todd, M. J., & Tütüncü, R. H. (1996) · eCommons (Cornell University) · Cited by 663
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
An accelerated gradient method for trace norm minimization
Ji, S., & Ye, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553434 · Cited by 517
Self-citationROBUST PRINCIPAL COMPONENT ANALYSIS
Alanzi, A. R. A. (2014) · OpenSIUC (Southern Illinois University Carbondale) · Cited by 419
Matrix Methods in Data Mining and Pattern Recognition
Eldén, L. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718867 · Cited by 327
Uncovering shared structures in multiclass classification
Amit, Y., Fink, M., Srebro, N., & Ullman, S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273499 · Cited by 278
Image Completion Using Global Optimization
Komodakis, N. (2006) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2006.141 · Cited by 273
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
Pong, T. K., Tseng, P., Ji, S., & Ye, J. (2010) · SIAM Journal on Optimization · doi:10.1137/090763184 · Cited by 208
Self-citationConsistency of trace norm minimization
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.2848 · Cited by 182
Methods for large scale SVD with missing values
Kurucz, M., Benczúr, A. A., & Csalogány, K. (2007) · SZTAKI Publication Repository (Hungarian Academy of Sciences) · Cited by 150
Estimation of low-rank tensors via convex optimizationPreprint
Tomioka, R., Hayashi, K., & Kashima, H. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.0789 · Cited by 134
Tensor completion for on-board compression of hyperspectral images
Li, N., & Li, B. (2010) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2010.5651225 · Cited by 90
Fast singular value thresholding without singular value decomposition
Cai, J., & Osher, S. (2013) · Methods and Applications of Analysis · doi:10.4310/maa.2013.v20.n4.a2 · Cited by 64
Optimum Subspace Learning and Error Correction for Tensors
Li, Y., Yan, J., Zhou, Y., & Yang, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15558-1_57 · Cited by 59
Spatiotemporal Inpainting for Recovering Texture Maps of Occluded Building Facades
Korah, T., & Rasmussen, C. E. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.903263 · Cited by 55
Multi-label Multiple Kernel Learning
Ji, S., Sun, L., Jin, R., & Ye, J. (2008) · Cited by 51
Self-citation
Cited by
Xu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm
Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., & Yan, S. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2891760 · Cited by 1,144
Pruning and quantization for deep neural network acceleration: A survey
Liang, T., Glossner, J., Wang, L., Shi, S., & Zhang, X. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.07.045 · Cited by 943
Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization
Hu, Y., Zhang, D., Ye, J., Li, X., & He, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.271 · Cited by 829
Self-citationSparse reconstruction cost for abnormal event detection
Cong, Y., Yuan, J., & Liu, J. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995434 · Cited by 801
Self-citation
Metadata
- Authors
- Liu, J., Musialski, P., Wonka, P., & Ye, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2013-01
- Volume
- 35
- Issue
- 1
- Pages
- 208-220
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2091449379
- Cited by
- 2,063
- References
- 43
- FWCI
- 27.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.