• 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.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.43.3-43.3
• /
• 2019

Magnetic fields play an important role in supporting molecular clouds against gravitational collapse. The measured magnetic field strengths in molecular clods enable us to see the effect of magnetic fields in star-forming regions. People have used the Chandrasekhar and Fermi (CF) method to estimate magnetic field strength from observational quantities of molecular cloud density, turbulent velocity and polarization angle dispersion. However, previous studies obtained just one magnetic field strength over the quite large region of a molecular cloud by using the CF method. We here suggest a way to estimate magnetic field strength distribution in Orion A region. We used 450 and 850-micron polarization data of James Clerk Maxwell Telescope (JCMT). Magnetic field strengths were estimated in two wavelengths with 4 pixel resolutions of 16, 20, 24 and 28". Through statistical analysis, we proved the difference of magnetic field strengths between two wavelengths were caused by the difference of their beam sizes. Additionally, we calculated the radii of curvature of polarization segments to select a best pixel resolution for estimating the magnetic field distribution. The pixel resolution should be larger than a radius of curvature. We selected that 20 or 24" pixel resolutions are good choices towards Orion A region.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.1-10
• /
• 2001

In order to generate the gray scale image by the binary state imaging devices such as a digital printer, the gray scale image needs to be converted into the binary image by the halftoning techniques. This paper presents a new error diffusion technique to achieve the homogeneous dot distributions on the binary images. In this paper,'the minimum pixel distance'from the current pixel under binarization to the nearest minor pixel is defined first. Also, the gray levels of the input image are converted into a new variable based on the principal distance for the error diffusion. In the proposed method, the difference in the principal distances is utilized for the error propagation, whereas the gray level difference due to the binarization is diffused to the neighboring pixels in the existing error diffusion techniques. The quantization is accomplished by comparing the updated principal distance with the minimum pixel distance. In order to calculate the minimum pixel distance, MPOA(Minor Pixel Offset Array) is employed to reduce the computational loads and memory resources.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1507-1510
• /
• 2003

We propose UPGMA(Unweighted Pair Group Method using Average distance) as hierarchical clustering to detect abrupt shot changes using multiple features such as pixel-by-pixel difference, global and local histogram difference. Conventional $\kappa$-means algorithm which is a method of the partitional clustering, has to select an efficient initial cluster center adaptively UPGMA that we propose, does not need initial cluster center because of agglomerative algorithm that it starts from each sample for clusters. And UPGMA results in stable performance. Experiment results show that the proposed algorithm works not only well but also stably.

• 한국정보디스플레이학회:학술대회논문집
• /
• 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 KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.411-417
• /
• 2006

Motion Estimation (ME) is an important part of video coding process and it takes the largest amount of computation in video compression. Half-pixel and quarter-pixel motion estimation can improve the video compression rate at the cost of higher computational complexity In this paper, we suggest a new efficient low-complexity algorithm for half-pixel and quarter pixel motion estimation. It is based on the experimental results that the sum of absolute differences(SAD) shows parabolic shape and thus can be approximated by using interpolation techniques. The sub-pixel motion vector is searched from the minimum SAD integer-pixel motion vector. The sub-pixel search direction is determined toward the neighboring pixel with the lowest SAD among 8 neighbors. Experimental results show that more than 20% reduction in computation time can be achieved without affecting the quality of video.

• 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 Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.3
• /
• pp.148-155
• /
• 2005

A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.956-962
• /
• 2005

To improve video quality and coding efficiency, H.264/AVC adopts different half pixel calculating method compared with the previous standards. So, the transcoder requires additional works to transcode the pre-coded video contents with the previous standards to H.264/AVC in DCT domain. In this paper, we propose the first half-pixel correction method for MPEG-2 to H.264 transcoding in DCT domain. In the proposed method, MPEG-2 block is added to the correction block obtained by difference calculation of half-pixel values between two standards using DCT reference frame. Experimental results show that the proposed achieves better quality than pixel based cascaded transcoding method.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.349-354
• /
• 2010

Moving pixel displacement detection algorithm using correlation functions for making panorama image on the continuous images is presented in this paper. The input images get from a CMOS image sensor (CIS). The camera is maintained by constant brightness and uniform sensing area in test input pattern. For simple navigation and capture image has to 70% overlapped region. A correlation rate in two image data is evaluated by using reference image with first captures, and compare image with next captures. The displacement of the two images are expressed to second order function of x, y and solved with finding the coefficient in second order function. That results in the change in the peak correlation displacement from the reference to the compare image, is moving to pixel length. The navigating error is reduced by varying the path because the error is shown in the difference of the positioning vector between the true pixel position and the navigated pixel position. The algorithm performance is evaluated to be different from the error vector to vary the navigating path grid.