default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYafan Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j7]Chunyun Hu, Yafan Zhao, Long Yu, Yang Jiang
, Yunhui Xiong:
A simple encoder scheme for distributed residual video coding. Multim. Tools Appl. 79(27-28): 20061-20078 (2020)- [c8]Manjula Narayanaswamy, Yafan Zhao, Wai-Keung Fung, Nazila Fough:
A Low-complexity Wavelet-based Visual Saliency Model to Predict Fixations. ICECS 2020: 1-4
2010 – 2019
- 2015
- [c7]Akshay Nagaraghatta, Yafan Zhao, Grant M. Maxwell, Sampath Kannangara:
Fast H.264/AVC to HEVC transcoding using mode merging and mode mapping. ICCE-Berlin 2015: 165-169 - 2012
- [j6]Abharana Bhat, C. Sampath Kannangara, Yafan Zhao, Iain E. Garden Richardson:
A Full Reference Quality Metric for Compressed Video Based on Mean Squared Error and Video Content. IEEE Trans. Circuits Syst. Video Technol. 22(2): 165-173 (2012)
2000 – 2009
- 2009
- [j5]C. Sampath Kannangara, Iain E. Garden Richardson, Maja Bystrom, Yafan Zhao:
Complexity Control of H.264/AVC Based on Mode-Conditional Cost Probability Distributions. IEEE Trans. Multim. 11(3): 433-442 (2009) - 2008
- [j4]Maja Bystrom, Iain E. Garden Richardson, Yafan Zhao:
Efficient mode selection for H.264 complexity reduction in a Bayesian framework. Signal Process. Image Commun. 23(2): 71-86 (2008) - 2006
- [j3]C. Sampath Kannangara, Iain E. Garden Richardson, Maja Bystrom, J. R. Solera, Yafan Zhao, Andrew MacLennan, Robert Cooney:
Low-complexity skip prediction for H.264 through Lagrangian cost estimation. IEEE Trans. Circuits Syst. Video Technol. 16(2): 202-208 (2006) - [c6]Yafan Zhao, Maja Bystrom, Iain E. Garden Richardson:
A MAP Framework for Efficient Skip/Code Mode Decision in H.264. ICIP 2006: 45-48 - 2005
- [c5]Wei Wei Lee, Iain E. Garden Richardson, Ken Gow, Yafan Zhao, Roger T. Staff:
Hybrid segmentation of the hippocampus in MR images. EUSIPCO 2005: 1-4 - 2004
- [b1]Yafan Zhao:
Complexity management for video encoders. Robert Gordon University, Aberdeen, UK, 2004 - [c4]Iain E. Garden Richardson, Yafan Zhao:
Video encoder complexity reduction by estimating skip mode distortion. ICIP 2004: 103-106 - 2003
- [j2]Yafan Zhao, Iain E. Garden Richardson:
Macroblock classification for complexity management of video encoders. Signal Process. Image Commun. 18(9): 801-811 (2003) - 2002
- [j1]Iain E. Garden Richardson, Yafan Zhao:
Adaptive Management of Video Encoder Complexity. Real Time Imaging 8(4): 291-301 (2002) - [c3]Yafan Zhao, Iain E. Garden Richardson:
Computational Complexity Management of Motion Estimation in Video Encoders. DCC 2002: 483 - [c2]Yafan Zhao, Iain E. Garden Richardson:
Complexity management for video encoders. ACM Multimedia 2002: 647-649 - 2001
- [c1]Iain E. Garden Richardson, Yafan Zhao:
Adaptive algorithms for variable-complexity video coding. ICIP (1) 2001: 457-460
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-08-26 21:10 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:
