Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Zhongbo Shi"'
Publikováno v:
Current drug metabolism. 23(2)
Backgrond: Astragaloside IV (AST) and metoprolol are often used together to treat cardiovascular diseases, while the herb-drug interaction (HDI) between them is still unclear. Objective: This study investigates the effect of AST on the pharmacokineti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3507944a94df2cb9a829cc4e8a985dd
https://pubmed.ncbi.nlm.nih.gov/35088663
https://pubmed.ncbi.nlm.nih.gov/35088663
Publikováno v:
IEEE Journal on Emerging and Selected Topics in Circuits and Systems. 4:17-28
This paper proposes a novel feature-based photo album compression scheme for cloud storage. The main contribution of this paper is the use of local features rather than pixel values for analyzing and exploring the correlation between images. Unlike p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57e47dc4a6a33d2c5a6fea66e8f536ce
https://doi.org/10.1109/jetcas.2014.2298291
https://doi.org/10.1109/jetcas.2014.2298291
Publikováno v:
ICME
Spatially scalable video coding (SSVC) provides an efficient way to transmit one video at different resolutions. Based on the emerging High Efficiency Video Coding (HEVC), we propose an SSVC scheme to support both single-loop (SL) and multiloop (ML)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3864b3bf12142ab59ce74533247e9cd
https://doi.org/10.1109/tcsvt.2012.2223031
https://doi.org/10.1109/tcsvt.2012.2223031
Publikováno v:
VCIP
The key task in image set compression is how to efficiently remove set redundancy among images and within a single image. In this paper, we propose the first multi-model prediction (MoP) method for image set compression to significantly reduce inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::914897730feb0bceafd1a81614708738
https://doi.org/10.1109/vcip.2013.6706334
https://doi.org/10.1109/vcip.2013.6706334
Publikováno v:
ICME
The biggest challenge in image set compression is how to efficiently remove the set redundancy among images as well as the redundancy inside a single image. Different from all the previous schemes, in this paper we are the first to propose a generic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa3800ca50379378e8b10febecde3846
https://doi.org/10.1109/icme.2013.6607570
https://doi.org/10.1109/icme.2013.6607570
Publikováno v:
Advances in Multimedia Information Processing – PCM 2012 ISBN: 9783642347771
PCM
PCM
In this paper, we propose a novel cloud-based image compression scheme. In contrast to traditional compression schemes, our scheme targets a new scenario that ensures large scale images in the cloud are always available. Thus, our proposed scheme mak
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bceab09bc6eb58bdbe4f44a4afacf1ba
https://doi.org/10.1007/978-3-642-34778-8_62
https://doi.org/10.1007/978-3-642-34778-8_62
Publikováno v:
MMSP
Scalable video coding provides an efficient way to serve video contents at different quality levels. Based on the development of emerging High Efficiency Video Coding (HEVC), we propose two coarse granular scalable (CGS) video coding schemes here. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d828e3f2603c8d28eb09fec29ef365c2
https://doi.org/10.1109/mmsp.2011.6093816
https://doi.org/10.1109/mmsp.2011.6093816
Publikováno v:
Advances in Multimedia Information Processing-PCM 2009 ISBN: 9783642104664
PCM
PCM
This paper proposes a new image compression approach. The high frequency information in an image is adaptively decreased to facilitate compression, which is then compensated through learning-based mapping. Specifically, an adaptive DCT-domain down-sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f66fbf1ff27ebde2d08ed5847657fe87
https://doi.org/10.1007/978-3-642-10467-1_19
https://doi.org/10.1007/978-3-642-10467-1_19