The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Smooth PARAFAC Decomposition for Tensor Completion
Open accessAbstract
In recent years, low-rank based tensor completion, which is a higher order extension of matrix completion, has received considerable attention. However, the low-rank assumption is not sufficient for the recovery of visual data, such as color and 3D images, when the ratio of missing data is extremely high. In this paper, we consider “smoothness” constraints as well as low-rank approximations and propose an efficient algorithm for performing tensor completion that is particularly powerful regarding visual data. The proposed method admits significant advantages, owing to the integration of smooth PARAFAC decomposition for incomplete tensors and the efficient selection of models in order to minimize the tensor rank. Thus, our proposed method is termed as “smooth PARAFAC tensor completion (SPC).” In order to impose the smoothness constraints, we employ two strategies, total variation (SPC-TV) and quadratic variation (SPC-QV), and invoke the corresponding algorithms for model learning. Extensive experimental evaluations on both synthetic and real-world visual data illustrate the significant improvements of our method, in terms of both prediction performance and efficiency, compared with many state-of-the-art tensor completion methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Image quality assessment: from error visibility to structural similarity
Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.819861 · Cited by 57,892
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
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
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
Region Filling and Object Removal by Exemplar-Based Image Inpainting
Criminisi, A., Perez, P., & Toyama, K. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.833105 · Cited by 3,258 · cited 1×
“F”
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
Tensor Completion for Estimating Missing Values in Visual Data
Liu, J., Musialski, P., Wonka, P., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.39 · Cited by 2,063
Beck, A., & Teboulle, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028250 · Cited by 2,004
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
An Iterative Regularization Method for Total Variation-Based Image Restoration
Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040605412 · Cited by 1,787
The CMU pose, illumination, and expression database
Sim, T., Baker, S., & Bsat, M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1251154 · Cited by 1,783
Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009) · doi:10.1002/9780470747278 · Cited by 1,540
Self-citationWitten, D. M., Tibshirani, R., & Hastie, T. (2009) · Biostatistics · doi:10.1093/biostatistics/kxp008 · Cited by 1,535
The Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
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
Xu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
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
Methods of Mathematical Physics: Partial Differential Equations
Courant, R., & Hilbert, D. (1989) · doi:10.1002/9783527617234 · Cited by 735
Scalable tensor factorizations for incomplete data
Acar, E., Dunlavy, D. M., Kolda, T. G., & Mørup, M. (2011) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2010.08.004 · Cited by 602
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
Self-citationAn Augmented Lagrangian Method for Total Variation Video Restoration
Chan, S. H., Khoshabeh, R., Gibson, K. B., Gill, P. E., & Nguyen, T. Q. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2158229 · Cited by 488
Robust video denoising using low rank matrix completion
Ji, H., Liu, C., Shen, Z., & Xu, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539849 · Cited by 483
Rank-One Approximation to High Order Tensors
Zhang, T., & Golub, G. H. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899352045 · Cited by 430
Convex Optimization Algorithms
Bertsekas, D. P. (2015) · Cited by 378
Adaptive total variation image deblurring: A majorization–minimization approach
Oliveira, J. P., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2009) · Signal Processing · doi:10.1016/j.sigpro.2009.03.018 · Cited by 364
Low-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
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
Cichocki, A., Zdunek, R., & Amari, S.-I. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74494-8_22 · Cited by 281
Self-citationUncovering 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
Sorber, L., Van Barel, M., & De Lathauwer, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120868323 · Cited by 273
Ng, M. K., Weiss, P., & Yuan, X. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090774823 · Cited by 266
Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
Dolgov, S. V., & Savostyanov, D. V. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/140953289 · Cited by 253
On Tensor Completion via Nuclear Norm Minimization
Yuan, M., & Zhang, C.-H. (2016) · Foundations of Computational Mathematics · doi:10.1007/s10208-015-9269-5 · Cited by 236
Sorber, L., Van Barel, M., & De Lathauwer, L. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2400415 · Cited by 209
Second-order Cone Programming Methods for Total Variation-Based Image Restoration
Goldfarb, D., & Yin, W. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040608982 · Cited by 196
Matrix completion via an alternating direction method
Chen, C., He, B., & Yuan, X. (2012) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drq039 · Cited by 188
Simultaneous Tensor Decomposition and Completion Using Factor Priors
Chen, Y., Hsu, C.-T., & Liao, H.-Y. M. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.164 · Cited by 183
Nuclear norm of higher-order tensors
Friedland, S., & Lim, L.-H. (2017) · Mathematics of Computation · doi:10.1090/mcom/3239 · Cited by 182
Image Processing Using Smooth Ordering of its Patches
Ram, I., Elad, M., & Cohen, I. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2257813 · Cited by 161
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
Gillis, N., & Glineur, F. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110820361 · Cited by 153
Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
Sorensen, D. C. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623494274374 · Cited by 139
Adaptive data orthogonalization
Owsley, N. L. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1978.1170425 · Cited by 118
Low-Rank Optimization with Trace Norm Penalty
Mishra, B., Meyer, G., Bach, F., & Sepulchre, R. J. (2013) · SIAM Journal on Optimization · doi:10.1137/110859646 · Cited by 107
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
On gradient adaptation with unit-norm constraints
Douglas, S. C., Амари, Ш.-И., & Kung, S. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.845952 · Cited by 73
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
Total variation denoising (an MM algorithm)
Selesnick, I. (2012) · Cited by 53
Riemannian Pursuit for Big Matrix Recovery
Tan, M., Tsang, I. W.-H., Wang, L., Vandereycken, B., & Pan, S. J. (2014) · UTS ePRESS (University of Technology Sydney) · Cited by 52
Non‐Local Image Inpainting Using Low‐Rank Matrix Completion
Li, W., Zhao, L., Lin, Z., Xu, D., & Lu, D. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12521 · Cited by 52
Wang, L., & Chu, M. T. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/130938207 · Cited by 47
The Physics of Compressive Sensing and the Gradient-Based Recovery AlgorithmsPreprint
Dai, Q. I., & Sha, W. E. I. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.1487 · Cited by 17
Optimal Low-Rank Tensor Recovery from Separable Measurements: Four Contractions SufficePreprint
Shah, P., Rao, N., & Tang, G. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.04085 · Cited by 12
PARAFAC with splines: a case study
dos Reis, M. M., & Ferreira, M. M. C. (2002) · Journal of Chemometrics · doi:10.1002/cem.749 · Cited by 10
Metadata
- Authors
- Yokota, T., Zhao, Q., & Cichocki, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-10-15
- Volume
- 64
- Issue
- 20
- Pages
- 5423-5436
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1568416770
- Cited by
- 279
- References
- 59
- FWCI
- 10.00
- Type
- journal article
- Language
- en
- Open access
- green
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.