default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLee-Min Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c12]Lee-Min Lee:
Piecewise Polynomial High-Order Hidden Markov Models with Applications in Speech Recognition. CIT 2016: 323-327- 2015
- [j5]Lee-Min Lee:
Duration High-Order Hidden Markov Models and Training Algorithms for Speech Recognition. J. Inf. Sci. Eng. 31(3): 799-820 (2015) - [c11]Lee-Min Lee:
Piecewise linear high-order hidden Markov models and applications to speech recognition. ICMLC 2015: 383-388 - [c10]Lee-Min Lee, Fu-Rong Jean, Tan-Hsu Tan:
Performance Analysis of Distributed Speech Recognition Using Analysis-by-Synthesis Frame Reduced Front End under Packet Loss Conditions. SMC 2015: 1992-1997 - 2014
- [c9]Lee-Min Lee, Fu-Rong Jean, Tan-Hsu Tan, Jen-Hsiang Chou:
Recognition of packet loss speech using the most reliable reduced-frame-rate data. SMC 2014: 1810-1815 - [c8]Lee-Min Lee, Fu-Rong Jean:
Analysis-by-synthesis frame dropping algorithm together with a novel speech recognizer using time-varying hidden Markov model. SMC 2014: 2293-2298 - 2013
- [j4]Lee-Min Lee, Fu-Rong Jean:
Adaptation of Hidden Markov Models for Recognizing Speech of Reduced Frame Rate. IEEE Trans. Cybern. 43(6): 2114-2121 (2013) - 2011
- [j3]Lee-Min Lee:
High-Order Hidden Markov Model and Application to Continuous Mandarin Digit Recognition. J. Inf. Sci. Eng. 27(6): 1919-1930 (2011)
2000 – 2009
- 2006
- [c7]Lee-Min Lee, Jia-Chien Lee:
A Study on High-Order Hidden Markov Models and Applications to Speech Recognition. IEA/AIE 2006: 682-690
1990 – 1999
- 1998
- [j2]Jen-Tzung Chien
, Hsiao-Chuan Wang, Lee-Min Lee:
A novel projection-based likelihood measure for noisy speech recognition. Speech Commun. 24(4): 287-297 (1998) - 1997
- [c6]Tai-Hwei Hwang, Lee-Min Lee, Hsiao-Chuan Wang:
Feature adaptation using deviation vector for robust speech recognition in noisy environment. ICASSP 1997: 1227-1230 - [c5]Tai-Hwei Hwang, Lee-Min Lee, Hsiao-Chuan Wang:
Adaptation of time differentiated cepstrum for noisy speech recognition. EUROSPEECH 1997: 1075-1078 - 1996
- [j1]Lee-Min Lee, Hsiao-Chuan Wang:
An extended Levinson-Durbin algorithm for the analysis of noisy autoregressive process. IEEE Signal Process. Lett. 3(1): 13-15 (1996) - [c4]Jen-Tzung Chien, Lee-Min Lee, Hsiao-Chuan Wang:
Noisy speech recognition using variance adapted likelihood measure. ICASSP 1996: 45-48 - [c3]Jen-Tzung Chien, Hsiao-Chuan Wang, Lee-Min Lee:
Estimation of channel bias for telephone speech recognition. ICSLP 1996: 1840-1843 - 1995
- [c2]Jen-Tzung Chien, Lee-Min Lee, Hsiao-Chuan Wang:
Channel estimation for reference model adaptation in telephone speech recognition. EUROSPEECH 1995: 1541-1544 - 1994
- [c1]Lee-Min Lee, Hsiao-Chuan Wang:
A study on adaptations of cepstral and delta cepstral coefficients for noisy speech recognition. ICSLP 1994: 1011-1014
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-25 05:59 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:
