default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhi-Yong Wang
2020 – today
- 2025
[j14]Zhi-Yong Wang
, Hing Cheung So, Abdelhak M. Zoubir:
Robust low-rank matrix completion via sparsity-inducing regularizer. Signal Process. 226: 109666 (2025)- 2024
- [j13]Lin-Lin Gu, Run-Qing Yang, Zhi-Yong Wang, Dan Jiang, Ming Fang:
Ensemble learning for integrative prediction of genetic values with genomic variants. BMC Bioinform. 25(1): 120 (2024) - [j12]Zihao He, Zhi-Yong Wang, Jinming Wen, Hing Cheung So:
Non-negative Sparse Recovery via Momentum-Boosted Adaptive Thresholding Algorithm. J. Sci. Comput. 101(2): 47 (2024) - [j11]Pengxing Feng, Zhi-Yong Wang, Hing Cheung So:
Projection FxLMS framework of active noise control against impulsive noise environments. Signal Process. 225: 109624 (2024) - [j10]Xiao Peng Li, Zhi-Yong Wang, Zhanglei Shi, Hing Cheung So, Nicholas D. Sidiropoulos:
Robust Tensor Completion via Capped Frobenius Norm. IEEE Trans. Neural Networks Learn. Syst. 35(7): 9700-9712 (2024) - [j9]Zhi-Yong Wang, Hing Cheung So, Abdelhak M. Zoubir:
Low-Rank Tensor Completion via Novel Sparsity-Inducing Regularizers. IEEE Trans. Signal Process. 72: 3519-3534 (2024) - [j8]Keyuan Hu, Wenxin Xiong, Zhi-Yong Wang, Hing Cheung So, Chi-Sing Leung:
Robust 3-D AOA Localization Based on Maximum Correntropy Criterion With Variable Center. IEEE Trans. Signal Process. 72: 5021-5035 (2024) - [j7]Zhaofeng Liu, Hing Cheung So, Lin Zhang, Xiao Peng Li, Zhi-Yong Wang:
A Reliable Singular-Vector Pre-Coded OFDM-DCSK System Over Doubly Selective Fading Channels. IEEE Wirel. Commun. Lett. 13(5): 1453-1457 (2024) - 2023
- [j6]Zhi-Yong Wang, Xiao Peng Li, Hing Cheung So, Zhaofeng Liu:
Robust PCA via non-convex half-quadratic regularization. Signal Process. 204: 108816 (2023) - [j5]Zhaofeng Liu, Hing Cheung So, Xiao Peng Li, Lin Zhang, Zhi-Yong Wang:
Robust and Energy Efficient Sparse-Coded OFDM-DCSK System via Matrix Recovery. IEEE Trans. Commun. 71(8): 4839-4850 (2023) - [j4]Zhi-Yong Wang, Xiao Peng Li, Hing Cheung So:
Robust Matrix Completion Based on Factorization and Truncated-Quadratic Loss Function. IEEE Trans. Circuits Syst. Video Technol. 33(4): 1521-1534 (2023) - [j3]Zhi-Yong Wang, Xiao Peng Li, Hing Cheung So, Abdelhak M. Zoubir:
Adaptive Rank-One Matrix Completion Using Sum of Outer Products. IEEE Trans. Circuits Syst. Video Technol. 33(9): 4868-4880 (2023) - [j2]Zhi-Yong Wang, Hing Cheung So, Abdelhak M. Zoubir:
Robust Low-Rank Matrix Recovery via Hybrid Ordinary-Welsch Function. IEEE Trans. Signal Process. 71: 2548-2563 (2023) - [i3]Zhi-Yong Wang, Hing Cheung So, Abdelhak M. Zoubir:
Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer. CoRR abs/2310.04762 (2023) - [i2]Zhi-Yong Wang, Hing Cheung So:
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion. CoRR abs/2310.04954 (2023) - [i1]Zhi-Yong Wang, Hing Cheung So, Abdelhak M. Zoubir:
Low-Rank Tensor Completion via Novel Sparsity-Inducing Regularizers. CoRR abs/2310.06233 (2023) - 2022
- [j1]Zhi-Yong Wang, Hing Cheung So, Zhaofeng Liu:
Fast and robust rank-one matrix completion via maximum correntropy criterion and half-quadratic optimization. Signal Process. 198: 108580 (2022)
Coauthor Index
aka: Hing Cheung So
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
