Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Fast Algorithm for Low-rank Tensor Completion in Delay-embedded Space
Ryuki Yamamoto, Hidekata Hontani, Akira Imakura, et al.
2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2022), pp. 2048-2056
Closed Access | Times Cited: 12

Showing 12 citing articles:

Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach
Tong Nie, Guoyang Qin, Yunpeng Wang, et al.
Transportation Research Part C Emerging Technologies (2023) Vol. 152, pp. 104190-104190
Open Access | Times Cited: 10
Laplacian Convolutional Representation for Traffic Time Series Imputation
Xinyu Chen, Zhanhong Cheng, HanQin Cai, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 36, Iss. 11, pp. 6490-6502
Open Access | Times Cited: 3
Binary multi-view sparse subspace clustering
Jianxi Zhao, Yang Li
Neural Computing and Applications (2023) Vol. 35, Iss. 29, pp. 21751-21770
Closed Access | Times Cited: 8
Fusion of low-rankness and smoothness under learnable nonlinear transformation for tensor completion
Yigong Zhang, Zhihui Tu, Jian Lu, et al.
Knowledge-Based Systems (2024) Vol. 296, pp. 111917-111917
Closed Access | Times Cited: 2
Anti-circulant dynamic mode decomposition with sparsity-promoting for highway traffic dynamics analysis
Xudong Wang, Lijun Sun
Transportation Research Part C Emerging Technologies (2023) Vol. 153, pp. 104178-104178
Open Access | Times Cited: 6
Imbalanced low-rank tensor completion via latent matrix factorization
Yuning Qiu, Guoxu Zhou, Junhua Zeng, et al.
Neural Networks (2022) Vol. 155, pp. 369-382
Closed Access | Times Cited: 6
Image inpainting via Smooth Tucker decomposition and Low-rank Hankel constraint
Jing Cai, Jiawei Jiang, Yibing Wang, et al.
International Journal of Computers and Applications (2023) Vol. 45, Iss. 6, pp. 421-432
Closed Access | Times Cited: 2
Enhanced Low-Rank and Sparse Tucker Decomposition For Image Completion
Wenwu Gong, Zhejun Huang, Lili Yan
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024), pp. 2425-2429
Closed Access
Fast Signal Completion Algorithm with Cyclic Convolutional Smoothing
Hiromu Takayama, Tatsuya Yokota
2022 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC) (2022), pp. 364-371
Closed Access | Times Cited: 1
Robust and Parallelizable Tensor Completion Based on Tensor Factorization and Maximum Correntropy Criterion
Yicong He, George K. Atia
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2023), pp. 1-5
Closed Access
A New Model for Tensor Completion: Smooth Convolutional Tensor Factorization
Hiromu Takayama, Tatsuya Yokota
IEEE Access (2023) Vol. 11, pp. 67526-67539
Open Access
Consistent MDT-Tucker: A Hankel Structure Constrained Tucker Decomposition in Delay Embedded Space
Ryuki Yamamoto, Hidekata Hontani, Akira Imakura, et al.
2022 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC) (2022), pp. 137-142
Closed Access
Page 1

Scroll to top