default search action
Anh H. T. Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Zhi-Wei Tan
, Yuan Liu
Gridless DOA Estimation Using Complex-Valued Convolutional Neural Network With Phasor Normalization. IEEE Signal Process. Lett. 30: 813-817 (2023) - [c10]Viet-Anh Nguyen, Anh H. T. Nguyen, Andy W. H. Khong:
Improving Performance of Real-Time Full-Band Blind Packet-Loss Concealment with Predictive Network. ICASSP 2023: 1-5 - 2022
- [j2]Yuan Liu
Iterative Implementation Method for Robust Target Localization in a Mixed Interference Environment. IEEE Trans. Geosci. Remote. Sens. 60: 1-13 (2022) - [c9]Viet-Anh Nguyen, Anh H. T. Nguyen, Andy W. H. Khong:
Tunet: A Block-Online Bandwidth Extension Model Based On Transformers And Self-Supervised Pretraining. ICASSP 2022: 161-165 - [c8]Zhi-Wei Tan, Anh H. T. Nguyen, Yuan Liu
Multichannel Noise Reduction Using Dilated Multichannel U-Net and Pre-Trained Single-Channel Network. ICASSP 2022: 266-270 - [i3]Viet-Anh Nguyen, Anh H. T. Nguyen, Andy W. H. Khong:
Improving performance of real-time full-band blind packet-loss concealment with predictive network. CoRR abs/2211.04071 (2022) - 2021
- [c7]Karn Watcharasupat
Directional Sparse Filtering Using Weighted Lehmer Mean for Blind Separation of Unbalanced Speech Mixtures. ICASSP 2021: 4485-4489 - [c6]Mehdi Bekrani, Anh H. T. Nguyen, Andy W. H. Khong:
An Adaptive Non-Linear Process for Under-Determined Virtual Microphone Beamforming. ICASSP 2021: 4495-4499 - [i2]Karn Watcharasupat
Directional Sparse Filtering using Weighted Lehmer Mean for Blind Separation of Unbalanced Speech Mixtures. CoRR abs/2102.00196 (2021) - [i1]Viet-Anh Nguyen, Anh H. T. Nguyen, Andy W. H. Khong:
TUNet: A Block-online Bandwidth Extension Model based on Transformers and Self-supervised Pretraining. CoRR abs/2110.13492 (2021) - 2020
- [j1]Anh H. T. Nguyen
Directional Sparse Filtering for Blind Estimation of Under-Determined Complex-Valued Mixing Matrices. IEEE Trans. Signal Process. 68: 1990-2003 (2020) - [c5]Zhi-Wei Tan, Anh H. T. Nguyen, Linh T. T. Tran, Andy W. H. Khong:
A Joint-Loss Approach for Speech Enhancement via Single-channel Neural Network and MVDR Beamformer. APSIPA 2020: 841-849
2010 – 2019
- 2019
- [c4]Zhi-Wei Tan, Anh H. T. Nguyen, Andy W. H. Khong:
An Efficient Dilated Convolutional Neural Network for UAV Noise Reduction at Low Input SNR. APSIPA 2019: 1885-1892 - [c3]Anh H. T. Nguyen, V. G. Reju
A Method Based on L-bfgs to Solve Constrained Complex-valued Ica. ICASSP 2019: 4370-4374 - 2018
- [c2]V. G. Reju
An Efficient Multi-Source DOA Estimation Algorithm for Underdetermined System. IWAENC 2018: 86-90 - 2017
- [c1]Anh H. T. Nguyen, V. G. Reju
Learning complex-valued latent filters with absolute cosine similarity. ICASSP 2017: 2412-2416
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-04-24 23:00 CEST 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: