• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.30-37
• /
• 1997

We present an efficient technique, bidirectioanl inertial maximum cost search technique, for th edetection and segmentation of circular shaped objects using the spatial information around the neighborhood of the boundary candidates. This technique searches boundary candidates using local pixdl information such as pixel value and its direction. And then to exclude pseudo-boundary caused by shadows or noises, the local contrast is defined between the clique of the boundary candidates and the cliques of the background. In order to effectively segment circular shaped boundary, the technique also uses the curvature based on trigonometirc function which determines circular shaped boundary segments. Since the proposed technique is applied to the pixel cliques instead of a pixel itself, it is proposed method can easily find out circular boundaries form iamges of the PCB containing circular shaped parts and the trees with round fruits compared to boundary detection by using the pixel information and the laplacian curvature.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.47-51
• /
• 1994

In this paper we propose an algorithm to extract connected boundary with one-pixel thickness of chromosome, which has advantages as follows: easy to implement, low computational complexities, and ability to extract the boundary with either 4-pixel connectivity or 8-pixel connectivity

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.187-193
• /
• 2021

In this paper, we propose an image watermarking technique that effectively hides confidential data in the LSB of image pixels by utilizing the characteristics of the image. In the proposed technique, the image is precisely divided into boundary surface and normal region other than the boundary surface and performs different processing. The boundary surface existing in the image is created by meeting different regions and contains important information of the image. One bit of confidential data is concealed in the LSB of the pixel at the boundary surface to preserve the characteristics of the boundary surface. In normal region other than the boundary surface, the pixel values are similar, and the change with the adjacent pixel values is smooth. Based on this property, even if the 2 bits of confidential data are hidden in the lower 2 bits of the pixel in the normal region, the difference cannot be visually distinguished. When confidential data is concealed in an image as described above, the amount of confidential data concealed in an image can be increased while maintaining excellent image quality. Concealing confidential data by applying the proposed method increases the amount of confidential data concealed by up to 84.6% compared to the existing method. The proposed technique can be effectively used for commercial image watermarking that hides copyright information.

• International journal of advanced smart convergence
• /
• v.11 no.4
• /
• pp.163-169
• /
• 2022

In this paper, we propose a data hiding technique that effectively hides confidential data in the LSB of an image pixel by using the characteristics of the neighboring pixels of the image and the encryption techniques. In the proposed technique, the boundary surface of the image and the flat surface with little change in pixel values are investigated. At the boundary surface of the image, 1 bit of confidential data is encrypted and hidden in the LSB of the boundary pixel to preserve the characteristics of the boundary surface. In the pixels of the plane where the change in pixel value is small, 2 bits secret data is encrypted and hidden in the lower 2 bits of the corresponding pixel. In this way, when confidential data is hidden in an image, the amount of confidential data hidden in the image is greatly increased while maintaining excellent image quality. In addition, the security of hidden confidential data is strongly maintained. When confidential data is hidden by applying the proposed technique, the amount of confidential data concealed increases by up to 92.2% compared to the existing LSB method. The proposed technique can be effectively used to hide copyright information in commercial images.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1117-1120
• /
• 1999

The main purpose of padding methods is to extend the boundary segments of arbitrarily shaped objects to a regular grid so that the common block based coding technique, such as 8${\times}$8 DCT, can be applied. In the conventional padding methods used in MPEG-4: LPE and zero padding, the main process is based on 8${\times}$8 blocks. On the contrary, we propose a new padding method based on pixel-by-pixel. The proposed method puts pixels into a multi-busier using the typical value of each boundary blocks and reproduces new boundary blocks. Simulation results show that the proposed method reduces the conventional padding method and improves the coding efficiency of the conventional padding method.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1151-1154
• /
• 2004

In this study, we presented a novel method to calculate unknown voltages on the floating electrodes introduced in a unit pixel of TFT-LCDs using three-dimensional molecular director simulation. For the simulation of the potential distribution profiles generated under the influence of the floating electrodes, we used the floating boundary condition on the surface enclosing the floating electrodes. The constraint for the floating boundary condition was derived from the charge neutrality condition about the floating electrodes disconnected from voltage sources. For the pixel with the floating electrodes patterned between the pixel and the data electrodes, we simulated the molecular director and the potential distribution in three-dimension, and then observed the location of the disclination lines around the edge of the pixel electrode. As a result, it was revealed that the floating electrodes significantly affect the electro-optical characteristics such as the location of the disclination line.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.35-42
• /
• 2013

Shot boundary detection is an essential step for efficient browsing, sorting, and classification of video data. Robust shot detection method should overcome the disturbances caused by pixel brightness and object movement between frames. In this paper, two shot boundary detection methods are presented to address these problem by using segmentation, object movement, and pixel brightness. The first method is based on the histogram that reflects object movements and the morphological dilation operation that considers pixel brightness. The second method uses the pixel brightness information of segmented and whole blocks between frames. Experiments on digitized video data of National Archive of Korea show that the proposed methods outperforms the existing pixel-based and histogram-based methods.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.1
• /
• pp.17-24
• /
• 2024

In this paper, we propose a highly secure technique to hide confidential data in image pixels using a quadruple encryption techniques. In the proposed technique, the boundary surface where the image outline exists and the flat surface with little change in pixel values are investigated. At the boundary of the image, in order to preserve the characteristics of the boundary, one bit of confidential data that has been multiply encrypted is spatially encrypted again in the LSB of the pixel located at the boundary to hide the confidential data. At the boundary of an image, in order to preserve the characteristics of the boundary, one bit of confidential data that is multiplely encrypted is hidden in the LSB of the pixel located at the boundary by spatially encrypting it. In pixels that are not on the border of the image but on a flat surface with little change in pixel value, 2-bit confidential data that is multiply encrypted is hidden in the lower 2 bits of the pixel using location-based encryption and spatial encryption techniques. When applying the proposed technique to hide confidential data, the image quality of the stego-image is up to 49.64dB, and the amount of confidential data hidden increases by up to 92.2% compared to the existing LSB method. Without an encryption key, the encrypted confidential data hidden in the stego-image cannot be extracted, and even if extracted, it cannot be decrypted, so the security of the confidential data hidden in the stego-image is maintained very strongly. The proposed technique can be effectively used to hide copyright information in general commercial images such as webtoons that do not require the use of reversible data hiding techniques.

• International Journal of Advanced Culture Technology
• /
• v.6 no.3
• /
• pp.173-177
• /
• 2018

Masks are generated by adding different fonts of learning data characters in pixel unit, and pixel values belonging to each of the masks are divided into 3 groups. Using the directional expansion operators, we expand the text area of the test data character into 4 diagonal directions in order to create the boundary areas to distinguish it from the background area. A mask with a minimum average discordance is selected as the final recognition result by calculating the degree of discordance between the expanded test data and the masks. Image comparison using directional expansion operations more accurately recognizes test data through 4 subdivided recognition processes. It is also possible to expand the ranges of 3 groups of pixel values of masks more evenly such that new fonts can easily be added to the given learning data.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3140-3149
• /
• 1999

Skew correction for document images can be using a rotational transformation of pixel coordinates. In this paper we propose a method which corrects the document skew, by an amount of $\theta$ degrees, using block information, where the block is defined as a rectangular area containing adjacent black pixels. Processing speed of the proposed method is faster than that of the method using pixel transformation, since the number of floating-point operations can be reduced significantly. In the proposed method, we rotate only the four corner points of each block, and then identify the pixels inside the block. Two methods for inside pixel identification are proposed; the first method finds two points intersecting the boundary of the rotated block in each row, and determines the pixels between the two intersection points as the inside pixel. The second method finds boundary points based on Bresenham's line drawing algorithm, using fixed-point operation, and fills the region surrounded by these boundaries as black pixels. We have measured the performance of the proposed method by experimenting it with 2,016 images of various English and Korean documents. We have also proven the superiority of our algorithm through performance comparison with respect to existing methods based on pixel transformation.