{'fraction_non_alphanumeric': 0.022482893450635387, 'fraction_numerical': 0.0, 'mean_word_length': 5.564102564102564, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Fast and Robust Watermarking Method Based on DCT Specific Location

In many studies related to watermarking, spatial-domain methods have a relatively low information-hiding capacity and limited robustness, and transform-domain methods are not applicable in real-time processes because of their considerably high computational time. In this paper, we propose a novel watermarking method based on a discrete cosine transform (DCT), which guarantees robustness and low computational complexity. First, we calculated the DCT coefficient of a specific location. Then, a variation value was calculated according to the embedding bits and quantization steps to modify the coefficient. Last, we embedded watermark bits by directly modifying the pixel values without full-frame DCT. Tests comparing invisibility, robustness, and computational time were conducted for determining the feasibility of the proposed method. The results showed that the proposed method had the faster and the more robust performance than previous studies.