• Journal of Korea Game Society
• /
• v.3 no.1
• /
• pp.86-93
• /
• 2003

In this paper, we propose a new antialiasing method using filtering technique which is base on morphological pixel structure Aliasing occurs along the edge of lines and polygons. This undesirable effect happens because there are not enough pixels available on a typical monitor to properly display mathematically smooth lines and polygon edges. Aliasing can be very distracting. In a typical graphic scene, aliasing artifact will be visible along the edges of all objects that greatly diminish of realism. The proposed antialiasing method attempts to smooth extreme jagged contour lines and edges by properly handling pixel's structure, surface type and adjusting the pixel color according to the amount of pixel coverage. Next, we use filtering technique considering morphological pixel structure. Experimental results have shown that the propose algorithm achieves better performance in reducing noise for antialiasing. The method will be widely applied to basic antialiasing technique for computer graphic applications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.468-471
• /
• 2008

이 논문은 응급상황을 인식하기 위하여 어안렌즈를 통해 획득된 영상을 이용하여 기절 동작을 인식하는 방법을 제안한다. 거실의 천장 중앙에 위치한 어안렌즈(fish-eye lens)를 장착한 카메라로부터 화각이 170인 RGB 컬러 모델의 어안 영상을 입력 받은 뒤, 가우시안 혼합 모델 기반의 적응적 배경 모델링 방법을 이용하여 동적으로 배경 영상을 갱신한다. 입력 영상의 평균 밝기를 구하고 평균 밝기가 급격하게 변화하지 않도록 영상 픽셀을 보정한 뒤, 입력 영상과 배경 영상과 차이가 큰 픽셀을 찾음으로써 움직이는 객체를 추출하였다. 그리고 연결되어 있는 전경 픽셀 영역들의 외곽점들을 추적하여 타원으로 매핑하고 움직이는 객체 영역의 형태를 단순화하였다. 이 타원을 추적하면서 어안 렌즈 영상을 투시 영상으로 변환한 다음 타원의 크기 변화, 위치 변화, 이동 속도 정보를 추출하여 이동과 정지 및 움직임이 기절동작과 유사한지를 판단하도록 하였다. 본 논문에서는 실험자로 하여금 기절동작, 걷기 동작, 앉기 동작 등 여러 동작을 취하게 하고 기절 동작 인식을 실험하였다. 실험 결과 어안 렌즈 영상을 그대로 사용하는 것보다 투시 영상으로 변환하여 타원의 크기변화, 위치변화, 이동속도 정보를 이용하는 것이 높은 인식률을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• pp.481-483
• /
• 2018

AR은 VR과 달리 실세계 공간의 객체에 대한 서비스를 제공하므로 서비스 개발을 방해하는 많은 요인들이 발생한다. 이를 보완하기위해 비주얼 마커, SLAM, 객체인식 등 여러 AR 기술이 존재한다. 본 논문은 AR 기술 중에서 객체인식의 정확도 향상을 위해 지역가변 이진화(Local variable binarization)와 색상의 군집화를 사용해서 이미지에서 객체를 추출하는 방법을 제안한다. 지역 가변화는 픽셀을 순차적으로 읽어 들이면서 픽셀 주위의 값의 평균을 구하고, 이 값을 해당 픽셀의 임계 값으로 사용하는 알고리즘이다. 픽셀마다 주위 색상 값에 의해 임계 값이 변화되므로 윤곽선 표현이 기존의 이진화보다 뚜렷이 나타난다. 색상의 군집화는 객체의 중요색상과 배경의 중요색상을 중심으로 유사한 색상끼리 군집화 하는 것이다. 객체 내에서 가장 많이 나온 값과 객체 외에 가장 많이 나온 값을 각 각 기준으로 색조와 채도의 값을 Euclidean 거리를 사용해 객체의 색상과 배경 색상을 분리했다.

• Journal of the HCI Society of Korea
• /
• v.2 no.1
• /
• pp.25-31
• /
• 2007

We develop an interactive relighting renderer allowing camera view changes based on a deep-frame buffer approach. The renderer first caches the rendering parameters for a given 3D scene in an auxiliary buffer with the same size of the output image. The rendering parameters independent from light changes are selected from the shading models used for shading pixels. Next, as the user interactively edits one light at one time, the relighting renderer instantly re-shades each pixel by updating the contribution of the changed light with the shading parameters cached in the deep-frame buffer. When the camera moves, the cache values should be re-computed because the currently cached values become obsolete. We present a novel method to synthesize them quickly from the cache images of the user specified cameras by using an image-based technique. This computations are all performed on GPU to achieve real-time performance.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.107-113
• /
• 2006

Error Concealment method for Intra frames in H.264 reconstructs the lost block by computing weighted average value of the boundary pixels of the neighboring blocks; up, bottom, left and right blocks. However a simple average of pixel values of the neighboring blocks for Intra frames in H.264 leads to excessive blurring and degrades the picture quality severely. To solve this problem, in this paper we estimate the dominant edge of lost block using the pixel values of the neighboring blocks and reconstruct the pixel values by choosing adaptive interpolation between directional interpolation and weighted average interpolation considering the result value of the interference function based on statistics. Finally directional interpolation method improves by determining the dominant edge direction considering the relation of the dominent edge and the edges of neighboring blocks. Experiments show improvement of picture quality of about $0.5{\sim}2.0dB$ compared with the method of H.264.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1469-1475
• /
• 2010

This paper presents a problem of existing encryption methods using pseudo-random numbers based on MLCA or complemented MLCA and proposes a method to resolve this problem. The existing encryption methods have a problem which the edge of original image appear on encrypted image because the image have color similarity of adjacent pixels. In this proposed method, we transform the value and spatial coordinates of all pixels by using pseudo-random numbers based on MLCA. This method can resolve the problem of existing methods and improve the level of encryption by encrypting pixel coordinates and pixel values of original image. The effectiveness of the proposed method is proved by conducting histogram and key space analysis.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.287-293
• /
• 2012

This paper presents an efficient image registration method by measuring the similarity, which is based on multi-dimensional intensity fluctuation. Multi-dimensional intensity which considers 4 directions of the image, is applied to reflect more properties in similarity decision. And an intensity fluctuation is also applied to measure comprehensively the similarity by considering a change in brightness between the adjacent pixels of image. The normalized cross-correlation(NCC) is calculated by considering an intensity fluctuation to each of 4 directions. The 5 correlation coefficients based on the NCC have been used to measure the registration, which are total NCC, the arithmetical mean and a simple product on the correlation coefficient of each direction and on the normalized correlation coefficient by the maximum NCC, respectively. The proposed method has been applied to the problem for registrating the 22 face images of 243*243 pixels and the 9 person images of 500*500 pixels, respectively. The experimental results show that the proposed method has a superior registration performance that appears the image properties well. Especially, the arithmetical mean on the correlation coefficient of each direction is the best registration measure.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• Journal of Cadastre & Land InformatiX
• /
• v.47 no.2
• /
• pp.79-90
• /
• 2017

Urban environment represent one of the most dynamic regions on earth. As in other countries, forests, green areas, agricultural lands are rapidly changing into residential or industrial areas in South Korea. Monitoring such rapid changes in land use requires rapid data acquisition, and satellite imagery can be an effective method to this demand. In general, SAR(Synthetic Aperture Radar) satellites acquire images with an active system, so the brightness of the image is determined by the surface roughness. Therefore, the water areas appears dark due to low reflection intensity, In the residential area where the artificial structures are distributed, the brightness value is higher than other areas due to the strong reflection intensity. If we use these characteristics of SAR images, settlement areas can be extracted efficiently. In this study, extraction of settlement areas was performed using TerraSAR-X of German high-resolution X-band SAR satellite and KOMPSAT-5 of South Korea, and object-oriented image classification method using the image segmentation technique is applied for extraction. In addition, to improve the accuracy of image segmentation, the speckle divergence was first calculated to adjust the reflection intensity of settlement areas. In order to evaluate the accuracy of the two satellite images, settlement areas are classified by applying a pixel-based K-means image classification method. As a result, in the case of TerraSAR-X, the accuracy of the object-oriented image classification technique was 88.5%, that of the pixel-based image classification was 75.9%, and that of KOMPSAT-5 was 87.3% and 74.4%, respectively.

• Journal of Broadcast Engineering
• /
• v.25 no.2
• /
• pp.208-217
• /
• 2020

The classification of plant diseases by images captured by a camera sensor has been studied over past decades. A method that has gained much interest is to use image segmentation, from which statistical features are derived and analyzed by machine learning. Recently, deep learning has been adopted in this area. However, image segmentation is still a difficult task to achieve stable performance due to a variety of environmental variations. The end-to-end learning in neural network has a demerit that train images may be different from real images acquired in outdoor fields. To solve these problems, we propose superpixel-based disease classification method using end-to-end CNN (convolutional neural network) learning. Based on experiments performed on PlantVillage apple images, the classification accuracy is 98.29% and 92.43% for full-image and superpixel. As well, the multivariate F1-score is (0.98, 0.93). Therefore we validate that the method of using superpixel is comparable to that of full-image.