Tung-Shou Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tung-Shou Chen has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Wien Hong
Department of Computer Science and Information Engineering, National Taichung University of Science and Technology , No. 129, Section 3, Sanmin Road, North District, Taichung City 404336
8 shared publications - Guan-Zhong Su
Department of Computer Science and Information Engineering, National Taichung University of Science and Technology , No. 129, Section 3, Sanmin Road, North District, Taichung City 404336
4 shared publications - Guangsong Yang
School of Ocean Information Engineering, Jimei University, Xiamen, China
2 shared publications - Jeanne Chen
Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, Taichung, Taiwan
2 shared publications - Kai-Sheng Chen
School of Electrical and Computer Engineering, Nanfang College of Sun Yat-sen University, Guangzhou 510970, China
2 shared publications - Chin-Chen Chang
Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung, Taiwan
1 shared publication
Latest Publications
- 3 February 2026
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 143
Inpainting-assisted reversible authentication method for demosaiced image with enhanced recoverability
- 3 February 2026
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 143
Inpainting-assisted reversible authentication method for demosaiced image with enhanced recoverability
- 10 July 2025
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68 (12) , 1926-1937
An enhanced dynamic multi-grouping approach for AMBTC images using pairwise grouping
Absolute Moment Block Truncation Coding (AMBTC) is a cost-effective image compression technique that replaces pixel blocks with two quantization values and a binary map to minimize storage requirements. However, it is less effective for compressing flat and complex blocks. To address this issue, a Dynamic Multi-Grouping (DMG)-based AMBTC method was proposed, which removes the binary map for flat blocks and uses ternary or quaternary maps for complex blocks. Indicators are used to track the encoding methods applied to each block. While this method improves image quality, it fails to account for the correlations among indicators and maps, leading to higher storage requirements. This paper presents a sub-grouping strategy that groups indicators with ternary or quaternary maps to exploit their correlations, and encodes them using entropy coding to reduce the encoding length. During decoding, the compressed codes of indicators can be extracted from the bitstream, and the decompressed indicators are used to reconstruct blocks of various types. Our approach can be integrated with existing DMG methods to reduce bitrate while preserving image quality. When tested on 100 images, it achieved average reductions in bitrate of 31.83% for indicators, 14.68% for ternary maps, and 8.29% for quaternary maps.
- 10 July 2025
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68 (12) , 1926-1937
An enhanced dynamic multi-grouping approach for AMBTC images using pairwise grouping
Absolute Moment Block Truncation Coding (AMBTC) is a cost-effective image compression technique that replaces pixel blocks with two quantization values and a binary map to minimize storage requirements. However, it is less effective for compressing flat and complex blocks. To address this issue, a Dynamic Multi-Grouping (DMG)-based AMBTC method was proposed, which removes the binary map for flat blocks and uses ternary or quaternary maps for complex blocks. Indicators are used to track the encoding methods applied to each block. While this method improves image quality, it fails to account for the correlations among indicators and maps, leading to higher storage requirements. This paper presents a sub-grouping strategy that groups indicators with ternary or quaternary maps to exploit their correlations, and encodes them using entropy coding to reduce the encoding length. During decoding, the compressed codes of indicators can be extracted from the bitstream, and the decompressed indicators are used to reconstruct blocks of various types. Our approach can be integrated with existing DMG methods to reduce bitrate while preserving image quality. When tested on 100 images, it achieved average reductions in bitrate of 31.83% for indicators, 14.68% for ternary maps, and 8.29% for quaternary maps.
- 30 November 2024
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 107
Virtualized three-dimensional reference tables for efficient data embedding
- 30 November 2024
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 107
Virtualized three-dimensional reference tables for efficient data embedding
- 12 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (35) , 82131-82148
On the bitmap compression for joint coding and data hiding of AMBTC compressed images
- 12 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (35) , 82131-82148
On the bitmap compression for joint coding and data hiding of AMBTC compressed images
- Open Access
- 26 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 19-24
A Data Hiding Scheme for JPEG Images Based on EMD with Coefficient Selection Strategy
- 26 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 19-24
Open AccessA Data Hiding Scheme for JPEG Images Based on EMD with Coefficient Selection Strategy
- 10 October 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (10) , 15593-15612
An adaptive data hiding for AMBTC compressed images with recoverability using bound shifting technique
- 10 October 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (10) , 15593-15612
An adaptive data hiding for AMBTC compressed images with recoverability using bound shifting technique
- Open Access
- 10 January 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (2) , 619
Hybrid Encoding Scheme for AMBTC Compressed Images Using Ternary Representation Technique
Absolute moment block truncated coding (AMBTC) is a lossy image compression technique aiming at low computational cost, and has been widely studied. Previous studies have investigated the performance improvement of AMBTC; however, they often over describe the details of image blocks during encoding, causing an increase in bitrate. In this paper, we propose an efficient method to improve the compression performance by classifying image blocks into flat, smooth, and complex blocks according to their complexity. Flat blocks are encoded by their block means, while smooth blocks are encoded by a pair of adjusted quantized values and an index pointing to one of the k representative bitmaps. Complex blocks are encoded by three quantized values and a ternary map obtained by a clustering algorithm. Ternary indicators are used to specify the encoding cases. In our method, the details of most blocks can be retained without significantly increasing the bitrate. Experimental results show that, compared with prior works, the proposed method achieves higher image quality at a better compression ratio for all of the test images.
- 10 January 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (2) , 619
Open AccessHybrid Encoding Scheme for AMBTC Compressed Images Using Ternary Representation Technique
Absolute moment block truncated coding (AMBTC) is a lossy image compression technique aiming at low computational cost, and has been widely studied. Previous studies have investigated the performance improvement of AMBTC; however, they often over describe the details of image blocks during encoding, causing an increase in bitrate. In this paper, we propose an efficient method to improve the compression performance by classifying image blocks into flat, smooth, and complex blocks according to their complexity. Flat blocks are encoded by their block means, while smooth blocks are encoded by a pair of adjusted quantized values and an index pointing to one of the k representative bitmaps. Complex blocks are encoded by three quantized values and a ternary map obtained by a clustering algorithm. Ternary indicators are used to specify the encoding cases. In our method, the details of most blocks can be retained without significantly increasing the bitrate. Experimental results show that, compared with prior works, the proposed method achieves higher image quality at a better compression ratio for all of the test images.
- Open Access
- 24 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 6522-6535
A Color Image Authentication Scheme With Grayscale Invariance
Color image authentication is a method that allows the detection of tampered regions on images. Existing related works evaluated their performance based on visual quality and detection capability of the marked image, but the issue of grayscale invariance was ignored. However, many applications in image processing required the color image to first convert into a grayscale image before any further post-processing such as edge detection, color masking in Photoshop, and the display of e-ink. If the resulting image and the original image are different in their grayscale value, they might produce different outcomes after the post-processing. Therefore, how to maintain unchanged of the grayscale value has become an important issue. This paper presents a grayscale-invariance color image authentication technique. We proposed to embed the authentication code into two of three primary color channels and adjust the remaining one to remedy the distortion of grayscale value. The experimental results showed that, when embedding each four-bit authentication code into two color channels, the visual quality of the marked images has achieved an average 33.26 dB of peak signal-to-noise ratio (PSNR) while providing a satisfactory detectability.
- 24 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 6522-6535
Open AccessA Color Image Authentication Scheme With Grayscale Invariance
Color image authentication is a method that allows the detection of tampered regions on images. Existing related works evaluated their performance based on visual quality and detection capability of the marked image, but the issue of grayscale invariance was ignored. However, many applications in image processing required the color image to first convert into a grayscale image before any further post-processing such as edge detection, color masking in Photoshop, and the display of e-ink. If the resulting image and the original image are different in their grayscale value, they might produce different outcomes after the post-processing. Therefore, how to maintain unchanged of the grayscale value has become an important issue. This paper presents a grayscale-invariance color image authentication technique. We proposed to embed the authentication code into two of three primary color channels and adjust the remaining one to remedy the distortion of grayscale value. The experimental results showed that, when embedding each four-bit authentication code into two color channels, the visual quality of the marked images has achieved an average 33.26 dB of peak signal-to-noise ratio (PSNR) while providing a satisfactory detectability.
- 1 November 2020
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 55, 102629
Reversible and recoverable authentication method for demosaiced images using adaptive coding technique
- 1 November 2020
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 55, 102629
Reversible and recoverable authentication method for demosaiced images using adaptive coding technique
- 9 March 2018
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 61 (8) , 1123-1132
An Authentication Method Based on the Turtle Shell Algorithm for Privacy-Preserving Data Mining
Outsourcing data mining tasks is beneficial for data owners who either lack expertise in data mining or sufficient computing resources. However, directly releasing the original data would leak private information. Research on Privacy-Preserving Data Mining (PPDM) is dedicated to addressing this issue, the aim of this research is to reduce the risk of privacy violations and preserve the knowledge in the original data. However, most existing methods in the literature ignore the case in which service providers want to verify the integrity and authenticity of their clients’ data to avoid data tampering before performing data mining tasks. In this paper, a new method is proposed to extend the turtle shell algorithm of data hiding to protect the privacy of the original data and to acquire authentication functions simultaneously. The act of data perturbation is performed by replacing data values with their closest neighbors according to a reference matrix. Further, a message authentication code is hidden in the perturbed data to verify the integrity and authenticity of the perturbed data. The experimental results showed that the proposed method achieved the purpose of data perturbation and outperformed similar methods in satisfying the PPDM requirement.
- 9 March 2018
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 61 (8) , 1123-1132
An Authentication Method Based on the Turtle Shell Algorithm for Privacy-Preserving Data Mining
Outsourcing data mining tasks is beneficial for data owners who either lack expertise in data mining or sufficient computing resources. However, directly releasing the original data would leak private information. Research on Privacy-Preserving Data Mining (PPDM) is dedicated to addressing this issue, the aim of this research is to reduce the risk of privacy violations and preserve the knowledge in the original data. However, most existing methods in the literature ignore the case in which service providers want to verify the integrity and authenticity of their clients’ data to avoid data tampering before performing data mining tasks. In this paper, a new method is proposed to extend the turtle shell algorithm of data hiding to protect the privacy of the original data and to acquire authentication functions simultaneously. The act of data perturbation is performed by replacing data values with their closest neighbors according to a reference matrix. Further, a message authentication code is hidden in the perturbed data to verify the integrity and authenticity of the perturbed data. The experimental results showed that the proposed method achieved the purpose of data perturbation and outperformed similar methods in satisfying the PPDM requirement.