• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.879-897
• /
• 2013

Shannon entropy is one of the widely used randomness measures especially for cryptographic applications. However, the conventional entropy tests are less sensitive to the inter-bit dependency in random samples. In this paper, we propose new online randomness test schemes for true random number generators (TRNGs) based on the mutual information between consecutive ${\kappa}$-bit output blocks for testing of inter-bit dependency in random samples. By estimating the block entropies of distinct lengths at the same time, it is possible to measure the mutual information, which is closely related to the amount of the statistical dependency between two consecutive data blocks. In addition, we propose a new estimation method for entropies, which accumulates intermediate values of the number of frequencies. The proposed method can estimate entropy with less samples than Maurer-Coron type entropy test can. By numerical simulations, it is shown that the new proposed scheme can be used as a reliable online entropy estimator for TRNGs used by cryptographic modules.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1378-1387
• /
• 2013

Histogram equalization, which stretches the dynamic range of intensity, is the most common method for enhancing the contrast of image. Contrast limited adaptive histogram equalization(CLAHE), proposed by K. Zuierveld, has two key parameters: block size and clip limit. These parameters mainly control image quality, but have been heuristically determined by user. In this paper, we propose a novel method of determining two parameters of CLAHE using entropy of image. The key idea is based on the characteristics of entropy curves: clip limit vs entropy and block size vs entropy. Clip limit and block size are determined at the point with maximum curvature on entropy curve. Experimental results show that the proposed method improves images with very low contrast.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.6
• /
• pp.810-812
• /
• 2014

In this paper, a hagwon-bus boarding danger warning system based on computer vision is proposed to protect children from an accident causing injuries or death. Three zones are defined and different algorithms are applied to detect moving objects. In zone 1, a block-based entropy value is calculated using the absolute difference image generated by the absolute differential estimation between background image and incoming video frame. In zone 2, an effective and robust motion object tracking algorithm is performed based on the particle filter. Experimental results demonstrate the efficient and effectively of the algorithm for moving object inspection in each zone.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.333-337
• /
• 2002

A content-based image retrieval method using color, texture, and shape features is proposed in this paper. A region segmentation technique using PIM(Picture Information Measure) entropy is used for similarity indexing. For segmentation, a color image is first transformed to a gray image and it is divided into n$\times$n non-overlapping blocks. Entropy using PIM is obtained from each block. Adequate variance to perform good segmentation of images in the database is obtained heuristically. As variance increases up to some bound, objects within the image can be easily segmented from the background. Therefore, variance is a good indication for adequate image segmentation. For high variance image, the image is segmented into two regions-high and low entropy regions. In high entropy region, hue-saturation-intensity and canny edge histograms are used for image similarity calculation. For image having lower variance is well represented by global texture information. Experiments show that the proposed method displayed similar images at the average of 4th rank for top-10 retrieval case.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2677-2684
• /
• 2009

In this paper, we study a watermarking method based on the informed coding and embedding by means of trellis code and entropy masking. An image is divided as $8{\times}8$ block with no overlapping and the discrete cosine transform(DCT) is applied to each block. Then the 16 medium-frequency AC terms of each block are extracted. Next it is compared with gaussian random vectors having zero mean and unit variance. As these processing, the embedding vectors with minimum value of linear combination between linear correlation and Watson distance can be obtained by Viterbi algorithm at each stage of trellis coding. For considering the image characteristics, we apply different weight value between the linear correlation and the Watson distance using the entropy masking. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images. By the experiments the proposed method is improved in terms of the average bit error rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.192-210
• /
• 2024

Most frequency-domain remote sensing image watermarking algorithms embed watermarks at random locations, which have negative impact on the watermark invisibility. In this study, we propose an adaptive watermarking scheme for remote sensing images that considers the information complexity to select where to embed watermarks to improve watermark invisibility without affecting algorithm robustness. The scheme converts remote sensing images from RGB to YCbCr color space, performs two-level DWT on luminance Y, and selects the high frequency coefficient of the low frequency component (HH^Y₂) as the watermark embedding domain. To achieve adaptive embedding, HH^Y₂ is divided into several 8*8 blocks, the entropy of each sub-block is calculated, and the block with the maximum entropy is chosen as the watermark embedding location. During embedding phase, the watermark image is also decomposed by two-level DWT, and the resulting high frequency coefficient (HH^W₂) is then embedded into the block with maximum entropy using α- blending. The experimental results show that the watermarked remote sensing images have high fidelity, indicating good invisibility. Under varying degrees of geometric, cropping, filtering, and noise attacks, the proposed watermarking can always extract high identifiable watermark images. Moreover, it is extremely stable and impervious to attack intensity interference.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.133-136
• /
• 2003

In this paper, we propose a low bit-rate embedded video coding scheme with 3-D block partition in the wavelet domain. The proposed video coding scheme includes multi-level three dimensional dyadic wavelet decomposition, raster scanning within each subband, partitioning of blocks, and adaptive arithmetic entropy coding. Although the proposed video coding scheme is quite simple, it produces bit-streams with good features, including SNR scalability from the embedded nature. Experimental results demonstrate that the proposed video coding scheme is quite competitive to other good wavelet-based video coders in the literature.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.31-40
• /
• 2016

In this paper, we analyse the characteristics of the edge image and propose a new entropy coding optimized to the compression of the edge image. The pixel values of the edge image have the Gaussian distribution around '0', and most of the pixel values are '0'. By using this analysis, the Zero Block technique is utilized in spatial domain. And the Intra Prediction Mode of the edge image is similar to the mode of the surrounding blocks or likely to be the Planar Mode or the Horizontal Mode. In this paper, we make use of the MPM technique that produces the Intra Prediction Mode with high probability modes. By utilizing the above properties, we design a new entropy coding method that is suitable for edge image and perform the compression. In case the existing compression techniques are applied to edge image, compression ratio is low and the algorithm is complicated as more than necessity and the running time is very long, because those techniques are based on the natural images. However, the compression ratio and the running time of the proposed technique is high and very short, respectively, because the proposed algorithm is optimized to the compression of the edge image. Experimental results indicate that the proposed algorithm provides better visual and PSNR performance up to 11 times than the JPEG.

• Journal of Internet Computing and Services
• /
• v.19 no.4
• /
• pp.7-13
• /
• 2018

The methods for detecting copy move frogery (CMF) are divided into two categories, block-based methods and keypoint-based methods. Block-based methods have a high computational cost because a large number of blocks should be examined for CMF detection. In addition, the forgery detection may fail if a tampered region undergoes geometric transformation. On the contrary, keypoint-based methods can overcome the disadvantages of the block-based approach, but it can not detect a tampered region if the CMF forgery occurs in the low entropy region of the image. Therefore, in this paper, we propose a method to detect CMF forgery in all areas of image by combining keypoint-based and block-based methods. The proposed method first performs keypoint-based CMF detection on the entire image. Then, the areas for which the forgery check is not performed are selected and the block-based CMF detection is performed for them. Therefore, the proposed CMF detection method makes it possible to detect CMF forgery occurring in all areas of the image. Experimental results show that the proposed method achieves better forgery detection performance than conventional methods.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.190-192
• /
• 2004

In this paper, we propose a low bit-rate embedded video compression scheme with 3-D block partition coding in the wavelet domain. The proposed video compression scheme includes multi-level 3-dimensional dyadic wavelet decomposition, raster scanning within each subband, formation of block, 3-D partitioning of block, and adaptive arithmetic entropy coding. Although the proposed video compression scheme is quit simple, it produces bit-stream with good features, including SNR scalability from the embedded nature. Experimental results demonstrate that the proposed video compression scheme is quit competitive to other good wavelet-based video coders in the literature.