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
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-citationNovel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD
Zhang, Z., Ely, G., Aeron, S., Hao, N., & Kilmer, M. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.485 · Cited by 798
Infrared Small Target Detection Based on Partial Sum of the Tensor Nuclear Norm
Zhang, L., & Peng, Z. (2019) · Remote Sensing · doi:10.3390/rs11040382 · Cited by 759
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
Missing value imputation: a review and analysis of the literature (2006–2017)
Lin, W.-C., & Tsai, C.-F. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09709-4 · Cited by 612
Image Inpainting : Overview and Recent Advances
Guillemot, C., & Le Meur, O. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2273004 · Cited by 608
Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
Zhao, Q., Zhang, L., & Cichocki, A. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2392756 · Cited by 587
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Low-Rank Tensor Constrained Multiview Subspace Clustering
Zhang, C., Fu, H., Liu, S., Liu, G., & Cao, X. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.185 · Cited by 566
On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank Minimization
Xie, Y., Tao, D., Zhang, W., Liu, Y., Zhang, L., & Qu, Y. (2018) · International Journal of Computer Vision · doi:10.1007/s11263-018-1086-2 · Cited by 506
Hyperspectral Image Restoration Via Total Variation Regularized Low-Rank Tensor Decomposition
Wang, Y., Peng, J., Zhao, Q., Leung, Y., Zhao, X.-L., & Meng, D. (2018) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2017.2779539 · Cited by 484
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Bengua, J. A., Phien, H. N., Tuan, H. D., & Do, M. N. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2672439 · Cited by 461
A Generalized Low-Rank Appearance Model for Spatio-temporally Correlated Rain Streaks
Chen, Y.-L., & Hsu, C.-T. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.247 · Cited by 458
Robust Low-Rank Tensor Recovery: Models and Algorithms
Goldfarb, D., & Qin, Z. (. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/130905010 · Cited by 408
A Bayesian tensor decomposition approach for spatiotemporal traffic data imputation
Chen, X., He, Z., & Sun, L. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.11.003 · Cited by 373
Tensors for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2915921 · Cited by 354
A Comprehensive Survey on Multi-View Clustering
Fang, U., Li, M., Li, J., Gao, L., Jia, T., & Zhang, Y. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3270311 · Cited by 351
Sun, Y., Yang, J., & An, W. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3022069 · Cited by 332
Magnetic resonance multitasking for motion-resolved quantitative cardiovascular imaging
Christodoulou, A. G., Shaw, J. L., Nguyen, C., Yang, Q., Xie, Y., Wang, N., & Li, D. (2018) · Nature Biomedical Engineering · doi:10.1038/s41551-018-0217-y · Cited by 323
Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery
Xie, Q., Zhao, Q., Meng, D., & Xu, Z. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2734888 · Cited by 318
Abnormal event detection in crowded scenes using sparse representation
Cong, Y., Yuan, J., & Liu, J. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2012.11.021 · Cited by 311
Self-citationLow-rank tensor completion by Riemannian optimization
Kressner, D., Steinlechner, M., & Vandereycken, B. (2014) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0455-z · Cited by 290
Smooth PARAFAC Decomposition for Tensor Completion
Yokota, T., Zhao, Q., & Cichocki, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586759 · Cited by 279
Less Is More: Towards Compact CNNs
Zhou, H., Alvarez, J. M., & Porikli, F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46493-0_40 · Cited by 279
Federated Tensor Mining for Secure Industrial Internet of Things
Kong, L., Liu, X.-Y., Sheng, H., Zeng, P., & Chen, G. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2937876 · Cited by 68
Subspace Estimation from Unbalanced and Incomplete Data Matrices: 𝓁2, ∞ Statistical Guarantees
Cai, C., Li, G., Chi, Y., Poor, H. V., & Chen, Y. (2021) · The Annals of Statistics · doi:10.1214/20-aos1986 · Cited by 37
Decomposition Methods for Machine Learning with Small, Incomplete or Noisy Datasets
Caiafa, C. F., Solé-Casals, J., Marti-Puig, P., Zhe, S., & Tanaka, T. (2020) · Applied Sciences · doi:10.3390/app10238481 · Cited by 33
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.