default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinho Lee 0003
Person information
- affiliation: Pohang University of Science and Technology, South Korea
Other persons with the same name
- Minho Lee — disambiguation page
- Minho Lee 0001
![[0000-0002-0441-7087]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0441-7087")
— Kyungpook National University, Department of Artificial Intelligence, Daegu, South Korea (and 1 more) - Minho Lee 0002 — Catholic University of Korea, Catholic Precision Medicine Research Center, College of Medicine, Korea (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Chan Park, Minho Lee, Taesu Park, PooGyeon Park:
A variable diagonal-matrix-step-size APA robust to impulsive noises. Signal Process. 220: 109442 (2024)- 2022
- [j6]Minho Lee, Junwoong Hur, Taesu Park, PooGyeon Park:
Variable step-size saturation affine projection algorithm against impulsive noise. J. Frankl. Inst. 359(13): 7025-7050 (2022) - [j5]Minho Lee, Taesu Park, PooGyeon Park:
Variable Step-Size $\ell _{0}$-Norm Constraint NLMS Algorithms Based on Novel Mean Square Deviation Analyses. IEEE Trans. Signal Process. 70: 5926-5939 (2022) - 2021
- [j4]Taesu Park, Minho Lee, PooGyeon Park:
A Novel Individual Variable Step-Size Subband Adaptive Filter Algorithm Robust to Impulsive Noises. IEEE Access 9: 112922-112929 (2021) - 2020
- [j3]Taesu Park, Minho Lee, PooGyeon Park:
Scheduled Step-Size Subband Adaptive Filter Algorithm With Implemental Consideration. IEEE Access 8: 199025-199033 (2020) - [j2]Minho Lee, Taesu Park, Junwoong Hur, PooGyeon Park:
L₁/L₂-Mode Switching Adaptive Filter Algorithm Based on Novel Mean Square Deviation Analysis. IEEE Access 8: 218793-218802 (2020) - [j1]Junwoong Hur, Minho Lee, Dong Woo Kim, PooGyeon Park:
A Variable Step-Size Robust Saturation Algorithm Against Impulsive Noises. IEEE Trans. Circuits Syst. II Express Briefs 67-II(10): 2279-2283 (2020)
2010 – 2019
- 2019
- [c4]Dong Woo Kim, Minho Lee, PooGyeon Park:
A robust online secondary-path filter active noise control system for noisy inputs and impulsive noises in sparse systems. APCCAS 2019: 281-284 - [c3]Minho Lee, Taesu Park, PooGyeon Park:
Bias-Compensated Normalized Least Mean Fourth Algorithm for Adaptive Filtering of Impulsive Measurement Noises and Noisy Inputs. ASCC 2019: 220-223 - [c2]Taesu Park, Minho Lee, Min Su Kim, PooGyeon Park:
A filtered-x VSS-NLMS active noise control algorithm robust against impulsive noise and noisy inputs. ASCC 2019: 789-792 - 2018
- [c1]Min Su Kim, Yong Joon Choi, In Seok Park, NamWoong Kong, Minho Lee, PooGyeon Park:
Sensitivity analysis on a neural network for analyzing the camber in hot rolling process. ICPS 2018: 212-216
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-11-04 21:43 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:
