Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wei-Sung Chen

dblp:183/2087 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2017
0000-0003-1314-4487ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 100%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
information hiding
0.312017
A Novel Data Hiding Algorithm for High Dynamic Range Images · IEEE Trans. Multim. 2017
Digital forensics and information hiding › steganography › steganography security
steganalysis resistance
0.312017
A Novel Data Hiding Algorithm for High Dynamic Range Images · IEEE Trans. Multim. 2017
Digital forensics and information hiding
steganography
0.312017
A Novel Data Hiding Algorithm for High Dynamic Range Images · IEEE Trans. Multim. 2017
Image and video coding › image compression
high dynamic range image coding
0.112017
A Novel Data Hiding Algorithm for High Dynamic Range Images · IEEE Trans. Multim. 2017

Methods — techniques the papers use, named apart from their topics

luminance-aware adaptive embedding · 0.6bit inversion embedding · 0.6bit encoding and decomposition · 0.6
YearPublicationVenuePosition
2017 A novel message embedding algorithm using the optimal weighted modulus
Wei-Sung Chen, Kuo-Chen Wu, Chung-Ming Wang
Inf. Sci.1
2017 A Novel Data Hiding Algorithm for High Dynamic Range Images
abstract
In this paper, we propose a novel data hiding algorithm for high dynamic range (HDR) images encoded by the OpenEXR file format. The proposed algorithm exploits each of three 10-bit mantissa fields as an embedding unit in order to conceal k bits of a secret message using an optimal base which produces the least pixel variation. An aggressive bit encoding and decomposition scheme is recommended, which offers a high probability to convey (k + 1) bits without increasing the pixel variation caused by message concealment. In addition, we present a bit inversion embedding strategy to further increase the capacities when the probability of appearance of secret bit “1” is greater than 0.5. Furthermore, we introduce an adaptive data hiding approach for concealing more secret messages in pixels with low luminance, exploiting the features of the human visual system to achieve luminance-aware adaptive data hiding. The stego HDR images produced by our algorithm coincide with the HDR image file format, causing no suspicion from malicious eavesdroppers. The generated stego HDR images and their tone-mapped low dynamic range (LDR) images reveal no perceptual differences when subjected to quantitative testing by visual difference predictor. Our algorithm can resist steganalytic attacks from the HDR and LDR RS and SPAM steganalyzers. We present the first data hiding algorithm for OpenEXR HDR images offering a high embedding rate and producing high visual quality of the stego images. Our algorithm outperforms the current state-of-the-art works.
Yun-Te Lin, Chung-Ming Wang, Wei-Sung Chen, Fang-Pang Lin, Woei Lin
IEEE Trans. Multim.3
2016 Optimizing color transfer using color similarity measurement
abstract
Color transfer algorithms alter the color appearance in the source image by borrowing colors from the target image. In this paper, we present a simple yet effective generalized color transfer algorithm, taking into consideration the influences contributed from both the source and target images. We introduce the Gaussian membership function as our first color similarity measurement. This function aims at balancing the degree of similarity of color distributions between source and resultant images and that between target and resultant images, respectively. With regard to the second color similarity measurement, we combine color histogram with the statistic concept of the correlation. Referring to different weights, the histogram correlation method derives correlations at each color channel between source and resultant images and those between target and resultant images. Color transfer is optimized by automatically stabilizing correlations before producing the final color transfer resultant image. Experimental results demonstrate that our proposed algorithm automatically takes into consideration the source and target images producing a visually plausible result. The statics comparison shows that our scheme outperforms current state-of-the-art methods.
Wei-Sung Chen, Ming-Long Huang, Chung-Ming Wang
ICIS1
2016 A novel general multiple-base data embedding algorithm
Wei-Sung Chen, Yi-Kai Liao, Yun-Te Lin, Chung-Ming Wang
Inf. Sci.1
2016 GPU-accelerated blind and robust 3D mesh watermarking by geometry image
Hung-Kuang Chen, Wei-Sung Chen
Multim. Tools Appl.2