default search action
Kailun Zhou
Person information
- affiliation: Tongji University, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Xueyan Cao, Tao Lin, Liping Zhao
, Yufen Yang, Kailun Zhou, Hu Wei, Xianyi Chen:
Fast intra coding in AVS3 based on direct non-first pre-coding skip. J. Vis. Commun. Image Represent. 98: 104027 (2024) - 2023
- [j14]Liping Zhao
Line-based self-referencing string prediction technique for screen content coding in AVS3. Multim. Tools Appl. 82(15): 23693-23708 (2023) - [j13]Kailun Zhou
Equal Value String and Copy Above String Based String Prediction for SCC in AVS3. IEEE Trans. Multim. 25: 584-592 (2023) - 2022
- [j12]Liping Zhao
Enhanced Intra String Copy for Screen Content Coding in AVS3. IEEE Access 10: 80403-80414 (2022) - [j11]Yufen Yang, Tao Lin, Liping Zhao, Kailun Zhou, Shuhui Wang:
A string matching based ultra-low complexity lossless screen content coding technique. Multim. Tools Appl. 81(2): 2043-2063 (2022) - 2021
- [j10]Yufen Yang
An Ultralow Complexity String Matching Approach to Screen Content Coding in AVS3. IEEE Trans. Circuits Syst. Video Technol. 31(9): 3714-3718 (2021) - [j9]Qingyang Zhou, Liping Zhao
String Prediction for 4: 2: 0 Format Screen Content Coding and Its Implementation in AVS3. IEEE Trans. Multim. 23: 3867-3876 (2021) - [c2]Liping Zhao, Kailun Zhou, Qingyang Zhou, Huihui Wang, Tao Lin:
An Intra String Copy Approach for SCC in AVS3. VCIP 2021: 1-5 - 2020
- [j8]Liping Zhao
An Ultra-Low Complexity and High Efficiency Approach for Lossless Alpha Channel Coding. IEEE Trans. Multim. 22(3): 786-794 (2020)
2010 – 2019
- 2018
- [j7]Kailun Zhou, Liping Zhao, Tao Lin:
A flexible and uniform string matching technique for general screen content coding. Multim. Tools Appl. 77(18): 23751-23775 (2018) - [j6]Liping Zhao
A Universal String Matching Approach to Screen Content Coding. IEEE Trans. Multim. 20(4): 796-809 (2018) - 2016
- [j5]Kailun Zhou, Liping Zhao
A Hardware Decoder Architecture for General String Matching Technique. IEEE J. Emerg. Sel. Topics Circuits Syst. 6(4): 560-572 (2016) - [j4]Liping Zhao
Pseudo 2D String Matching Technique for High Efficiency Screen Content Coding. IEEE Trans. Multim. 18(3): 339-350 (2016) - 2015
- [j3]Shuhui Wang, Tao Lin, Kailun Zhou, Peijun Zhang, Xianyi Chen:
Pseudo-2D-matching based enhancement to high efficiency video coding for screen contents. Multim. Tools Appl. 74(18): 7753-7771 (2015) - 2013
- [j2]Tao Lin, Kailun Zhou, Shuhui Wang:
Cloudlet-screen computing: a client-server architecture with top graphics performance. Int. J. Ad Hoc Ubiquitous Comput. 13(2): 96-108 (2013) - [j1]Tao Lin, Peijun Zhang, Shuhui Wang, Kailun Zhou, Xianyi Chen:
Mixed Chroma Sampling-Rate High Efficiency Video Coding for Full-Chroma Screen Content. IEEE Trans. Circuits Syst. Video Technol. 23(1): 173-185 (2013) - [c1]Tao Lin, Kailun Zhou, Xianyi Chen, Shuhui Wang:
Arbitrary shape matching for screen content coding. PCS 2013: 369-372
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-06-19 21:01 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: