• 전자공학회논문지S
• /
• 제34S권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.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1994년도 추계학술대회
• /
• 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
• /
• 제13권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
• /
• 제11권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• 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년도 Asia Display / IMID 04
• /
• 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.

• 한국컴퓨터정보학회논문지
• /
• 제18권5호
• /
• pp.35-42
• /
• 2013

비디오 데이터를 효율적으로 검색, 정렬, 탐색, 분류하기 위해서는 프레임 간의 샷 전환 탐지가 선행되어야 한다. 프레임 간 화소 밝기와 객체 이동은 높은 탐지율을 보장하는 샷 탐지 알고리즘이 극복해야할 문제이다. 본 논문에서는 프레임의 블록화 및 객체의 이동과 프레임의 밝기를 고려하는 샷 탐지 방법을 제안한다. 먼저 연속하는 두 프레임 사이에서 발생할 수 있는 객체의 이동을 고려하여 계산된 히스토그램과 밝기 차이를 반영하는 모폴러지 팽창 연산을 이용하는 알고리즘을 제안한다. 다음으로 화소 밝기 차를 보상한 프레임 블록의 화소정보와 프레임의 전역적인 밝기 히스토그램의 변화를 함께 이용하는 샷 탐지 방법을 제안한다. 제안된 방법들은 국가기록원 소장 비디오 데이터에 대한 실험에서 화소 또는 히스토그램 기반 알고리즘에 비해 높은 샷 탐지율을 보였다.

• 한국정보전자통신기술학회논문지
• /
• 제17권1호
• /
• pp.17-24
• /
• 2024

본 논문에서는 4중 암호화 기법을 사용하여 영상 픽셀에 기밀 데이터를 은닉하는 보안이 강력한 기법을 제안한다. 제안된 기법에서는 영상의 윤곽선이 존재하는 경계면과 픽셀값의 변화가 거의 없는 평탄면을 조사한다. 영상의 경계면에서는 경계면의 특성을 보존하기 위해 경계면에 위치하는 픽셀의 LSB(Least Significant Bit)에 다중으로 암호화된 기밀 데이터 1비트를 또다시 공간적으로 암호화하여 기밀 데이터를 은닉한다. 영상의 경계면이 아니고 픽셀값의 변화가 적은 평탄면에 존재하는 픽셀들에서는 다중으로 암호화된 기밀 데이터 2비트를 위치기반 암호화 기법과 공간적 암호화 기법을 사용하여 픽셀의 하위 2비트에 은닉한다. 제안 기법을 적용하여 기밀 데이터를 은닉하는 경우 스테고 이미지의 화질이 최대 49.64dB이고, 기존 LSB 방식에 비해 은닉되는 기밀 데이터의 양이 최대 92.2% 증가하고, 암호화키가 없으면 스테고 이미지에 은닉된 암호화된 기밀 데이터를 추출할 수 없으며 추출한다 해도 해독할 수 없어 스테고 이미지에 은닉된 기밀 데이터의 보안은 매우 강력하게 유지된다. 제안된 기법은 가역 데이터 은닉 기법이 사용되지 않아도 되는 웹툰과 같은 일반적인 상업적 이미지에 저작권 정보를 숨기는 데 효과적으로 사용될 수 있다.

• International Journal of Advanced Culture Technology
• /
• 제6권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.

• 한국정보처리학회논문지
• /
• 제6권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.