default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYih-Kai Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Yih-Kai Lin
, Ting-Yu Yen:
A Meta-Learning Approach for Few-Shot Face Forgery Segmentation and Classification. Sensors 23(7): 3647 (2023)- 2022
- [j13]Chu-Fu Wang, Yih-Kai Lin, Jun-Cheng Chen:
A cooperative image object recognition framework and task offloading optimization in edge computing. J. Netw. Comput. Appl. 204: 103404 (2022) - 2021
- [j12]Yih-Kai Lin, Chu-Fu Wang, Ching-Yu Chang, Hao-Lun Sun:
An efficient framework for counting pedestrians crossing a line using low-cost devices: the benefits of distilling the knowledge in a neural network. Multim. Tools Appl. 80(3): 4037-4051 (2021)
2010 – 2019
- 2018
- [j11]Yih-Kai Lin, Cheng-Hsing Yang, Jinn-Tsong Tsai:
More secure lossless visible watermarking by DCT. Multim. Tools Appl. 77(7): 8579-8601 (2018) - 2017
- [j10]Cheng-Hsing Yang, Chi-Yao Weng, Yih-Kai Lin, Kuan-Liang Liu:
High-fidelity lossless data hiding based on predictors selection. Multim. Tools Appl. 76(22): 23699-23720 (2017) - 2014
- [j9]Yih-Kai Lin:
A data hiding scheme based upon DCT coefficient modification. Comput. Stand. Interfaces 36(5): 855-862 (2014) - 2012
- [j8]Yih-Kai Lin, Shu-Chien Huang, Cheng-Hsing Yang:
A fast algorithm for Huffman decoding based on a recursion Huffman tree. J. Syst. Softw. 85(4): 974-980 (2012) - [j7]Yih-Kai Lin:
High capacity reversible data hiding scheme based upon discrete cosine transformation. J. Syst. Softw. 85(10): 2395-2404 (2012) - 2011
- [j6]Cheng-Hsing Yang, Sheng-Chang Wu, Shu-Chien Huang, Yih-Kai Lin:
Huffman-code strategies to improve MFCVQ-based reversible data hiding for VQ indexes. J. Syst. Softw. 84(3): 388-396 (2011)
2000 – 2009
- 2004
- [c2]Yih-Kai Lin:
Fair control of Petri nets. SMC (2) 2004: 1672-1677 - 2003
- [j5]Yih-Kai Lin, Cheng-Hong Li, Hsu-Chun Yen:
Synthesis of Control Policies for Lossy Controlled Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(7): 1790-1798 (2003) - [j4]Yih-Kai Lin, Hsu-Chun Yen:
An ω-automata approach to the representation of bilevel images. IEEE Trans. Syst. Man Cybern. Part B 33(3): 524-531 (2003) - 2000
- [j3]Yih-Kai Lin, Kuo-Liang Chung:
A space-efficient Huffman decoding algorithm and its parallelism. Theor. Comput. Sci. 246(1-2): 227-238 (2000) - [c1]Yih-Kai Lin, Hsu-Chun Yen:
An omega-automata approach to the compression of bi-level images. CATS 2000: 170-184
1990 – 1999
- 1997
- [j2]Kuo-Liang Chung, Yih-Kai Lin:
A novel memory-efficient Huffman decoding algorithm and its implementation. Signal Process. 62(2): 207-213 (1997) - [j1]Kuo-Liang Chung, Yih-Kai Lin:
A generalized pipelined median filter network. Signal Process. 63(1): 101-106 (1997)
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 2025-01-09 13:14 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:
