• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2514-2526
• /
• 2013

This paper presents a detection method for least significant bit matching revisited (LSBMR) steganography. Previous research shows that the adjacent pixels of natural images are highly correlated and the value 0 appears most frequently in pixel difference. Considering that the message embedding process of LSBMR steganography has a weighted-smoothing effect on the distribution of pixel difference, the frequency of the occurrence of value 0 in pixel difference changes most significantly whereas other values approximately remain unchanged during message embedding. By analyzing the effect of LSBMR steganography on pixel difference distribution, an equation is deduced to estimate the frequency of difference value 0 using the frequencies of difference values 1 and 2. The sum of the ratio of the estimated value to the actual value as well as the ratio of the frequency of difference value 1 to difference value 0 is used as the steganalytic detector. Experimental results show that the proposed method can effectively detect LSBMR steganography and can outperform previous proposed methods.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.261-270
• /
• 2019

In order to protect secret digital documents against vulnerabilities while communicating, steganography algorithms are applied. It protects a digital file from unauthorized access by hiding the entire content. Pixel-value-difference being a method from spatial domain steganography utilizes the difference gap between neighbor pixels to fulfill the same. The proposed approach is a block-wise embedding process where blocks of variable size are chosen from the cover image, therefore, a stream of secret digital contents is hidden. Least significant bit (LSB) substitution method is applied as an adaptive mechanism and optimal pixel adjustment process (OPAP) is used to minimize the error rate. The proposed application succeeds to maintain good hiding capacity and better signal-to-noise ratio when compared against other existing methods. Any means of digital communication specially e-Governance applications could be highly benefited from this approach.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.1
• /
• pp.449-454
• /
• 2020

We propose an improved de-interlacing method that converts the interlaced images into the progressive images by one field. In the first, Inter-pixel values are calculated by applying Newton's forward difference, backward difference interpolation from upper and lower 5 pixel values. Using inter-pixel values obtained from upper and lower 5 pixel values, it makes more accurate a direction estimate by applying the correlation between upper and lower pixel. If an edge direction is determined from the correlation, a missing pixel value is calculated into the average of upper and lower pixel obtained from predicted direction of edge. From simulation results, it is shown that the proposed method improves subjective image quality at edge region and objective image quality at 0.2~0.3dB as quantitative calculation result of PSNR, compared to previous various de-interlacing methods.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.1259-1262
• /
• 2006

In this paper, we propose a modified cubic convolution interpolation for the enlargement or reduction of digital images using a pixel difference value. The proposed method has a low complexity: the number of multiplier of weighted value to calculate one pixel of a scaled image has seven less than that of cubic convolution interpolation has sixteen. We use the linear function of the cubic convolution and the difference pixel value for selecting interpolation methods. The proposed method is compared with the conventional one for the computational complexity and the image quality. The simulation results show that the proposed method has less computational complexity than one of the cubic convolution interpolation.

• Journal of the Korea Convergence Society
• /
• v.9 no.2
• /
• pp.151-156
• /
• 2018

In this paper, an efficient reversible watermarking algorithm is proposed. By using the proposed algorithm, it is possible to increase the amount of copyright-related information to be embedded in cover image. Depending on the spatial locality and surface characteristics, it is possible to precisely predict the pixel value using neighboring pixels. If the predicted pixel value almost the same as the pixel value of the cover image, the differential value between the predicted pixel value and the pixel value of cover image is very small. So, the frequency is increased greatly at the peak point of histogram of difference sequence. Thus, it is possible to increase greatly the amount of secret data to be embedded in cover image. The experimental results show that the proposed watermarking algorithm is superior to the previous algorithms.

• Journal of Sensor Science and Technology
• /
• v.29 no.2
• /
• pp.123-127
• /
• 2020

In this paper, the estimation of the disparity for depth extraction in monochrome complementary metal-oxide-semiconductor (CMOS) image sensors with offset pixel apertures is presented. To obtain the depth information, the disparity information between two different channel data of the offset pixel apertures is required. The disparity is caused by the difference in the response angle between the left- and right-offset pixel aperture images. A depth map is implemented by the generated disparity. Therefore, the disparity is the most important factor for realizing 3D images from the designed CMOS image sensor with offset pixel apertures. The disparity is influenced by the pixel height and offset value of the offset pixel aperture. To confirm this correlation, the offset value is set to maximum within the pixel area, and the disparity values corresponding to the difference in the heights are calculated and compared. The disparity is derived using the camera-lens formula. Two monochrome CMOS image sensors with offset pixel apertures are used in the disparity estimation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.381-387
• /
• 2002

In this paper, an efficient method to find shot boundaries in the MPEG video stream data is proposed. For this purpose, we first assume that the histogram difference value(HDV) and pixel difference value(PDV) as an one dimensional signal and apply the median filter to these signals. The output of the median filter is subtracted from the original signal to produce the median filtered difference(MFD). The MFD is a criterion of shot boundary. In addition a neural network is employed and trained to find exactly cut boundary. The proposed algorithm shows that the cut boundaries are well extracted, especially in a dynamic video.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.231-241
• /
• 2013

In this paper, we propose an average approximation filter which can effectively remove the noises of the images. The noises include impulse noises, gaussian noises and mixed noises. The algorithm is as follows. First, as a step of noise detection, we find whether the difference between the pixel value and the average value is greater than the threshold value or not after getting the average value that removed the minimum and maximum values in the applied mask. If the pixel value is greater than the threshold value, the pixel value is processed as noise. If it is less than or equal to the threshold value, it is processed as non-noise. Next, as the noise reduction step, we output the approximate value in mask as the pixel value and the average value except the minimum and maximum values of the pixel including the noise. As the result of applying this average approximation filter to the mixed noise images, the approximation filter can reduce the noises effectively more than 0.4[dB] as compared with applying the median filter and the average filter, respectively.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.629-639
• /
• 2017

Interpolation based information hiding methods are widely used to get information security. Conventional interpolation methods use the neighboring pixel value and simple calculation like average to embed secret bit stream into the image. But these information hiding methods are not appropriate to color images like military images because the characteristics of military images are not considered and these methods are restricted in grayscale images. In this paper, the new information hiding method based on interpolation using RGB pixel values of color image is proposed and the effectiveness is analyzed through experiments.