• Journal of the Korea Computer Graphics Society
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2006

본 논문에서는 점묘화를 생성하기 위한 회화적 렌더링 기법을 제안한다. 신인상파(Neo-Impressionist) 화가 쇠라는 캔버스위의 독립 색채들은 망막위에서 재조직된다는 이론을 바탕으로 점묘화를 제안한다. 이는 색의 병치혼합과 보색대비를 이용해 빛의 가산혼합이 회화작품에 적용될 수 있도록 하기위해 브러시 스트로크로 작은 점을 이용한다. 이러한 점묘화를 표현하기위해서 쇠라의 작품과 동시대의 색이론 분석을 통해 색의 분할과 병치혼합의 이론적 배경을 알아보고 이를 통해 점묘 스트로크의 색상, 모양, 방향등을 결정할 수 있는 알고리즘을 소개한다. 먼저 신인상파의 팔레트 분석을 통해 칼라모델을 설계한다. 그리고 입력영상을 영상분할 기법을 이용해 공간적 구도를 잡고 각 분할 영역의 관계를 고려해 색상을 할당한다. 각 할당된 색은 보색과 함께 정의된다. 각 분할영역은 해당영역에서 표현될 수 있는 색상의 작은 점묘 브러시 스트로크로 렌더링이 된다. 이때 입력영상의 밝기정보를 유지할 수 있도록 점묘 스트로크는 색상이 결정된다. 점묘 스트로크의 방향은 입력영상의 에지방향을 따르도록 보간법을 이용해 계산한다.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.400-408
• /
• 1999

This paper describes a method for making the "disparity pattern" which is basis of image matching with brightness difference; called disparity, between multiple model images, and an algorithm which recognizes hand shape by utilizing the pattern in measuring the distance between a input image and model images. The virtue of the algorithm is that only simple brightness difference calculated from multiple images by managing a whole image as the fundamental processing unit is patterned in two dimensional shape and then is used in the recognition process. Consequently, this method is very useful for other recognition algorithm requiring comparison of large scale image since correlation among multiple model images is applied simultaneously in recognition process.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.239-246
• /
• 2004

Image snapping for an image moves the cursor location to nearby features in the image, such as edges. In this paper, we propose geometric snapping for 3D triangular meshes, which is extended from image snapping. Similar to image snapping, geometric snapping also moves the cursor location naturally to a location which represents main geometric features in the 3D triangular meshes. Movement of cursor is based on the approximate curvatures which appear geometric features on the 3D triangular meshes. The proposed geometric snapping can be applied to extract main geometric features on 3D triangular meshes. Moreover, it can be applied to extract the geometric features of a tooth which are necessary for generating the occlusal surfaces in dental prostheses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1155-1171
• /
• 1996

In this paper, we have analized the characteristics of pseudomedian filter based on the preceding study. The proposed pseudomedian filter methods consist of two types, that are H-shaped and Asterisk-shaped window types. At first, the definition of pseudomedian filter and its algorithm for de-interlacing scan conversion have been descibed, especially its charateristics, this, is the edge preserving characteristics and the required computation have been compared with the conventional algorithms. And PSNR has been introduced to evaluate the pseudomedian filter methods and the conventional algorithms. Finally, it has been discussed on the features and trade off of the pseudomedian filter methods. And the merit and application fields of the pseudomedian filter methods have been discussed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.62-65
• /
• 2018

This paper comes out with the study on sensing data collection strategy in a Software-Defined Mobile Edge vehicular networking. The two cooperative data dissemination are Direct Vehicular cloud mode and edge cell trajectory prediction decision mode. In direct vehicular cloud, the vehicle observe its neighboring vehicles and sets up vehicular cloud for cooperative sensing data collection, the data collection output can be transmitted from vehicles participating in the cooperative sensing data collection computation to the vehicle on which the sensing data collection request originate through V2V communication. The vehicle on which computation originate will reassemble the computation out-put and send to the closest RSU. The SDMEVN (Software Defined Mobile Edge Vehicular Network) Controller determines how much effort the sensing data collection request requires and calculates the number of RSUs required to support coverage of one RSU to the other. We set up a simulation scenario based on realistic traffic and communication features and demonstrate the scalability of the proposed solution.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.3
• /
• pp.437-444
• /
• 2014

In this paper, we introduce a Graph based Binary Code Execution Path Exploration Platform. In the graph, a node is defined as a conditional branch instruction, and an edge is defined as the other instructions. We implemented prototype of the proposed method and works well on real binary code. Experimental results show proposed method correctly explores execution path of target binary code. We expect our method can help Software Assurance, Secure Programming, and Malware Analysis more correct and efficient.

• Korean Journal of Optics and Photonics
• /
• v.21 no.6
• /
• pp.247-253
• /
• 2010

A dual-layer light guide plate (DLGP) was designed and a simulation was done to optimize the structure of the light guide plates used at backlight units while maintaining the luminance, uniformity and viewing angle by reducing the optical sheet. The characteristic of DLGP with prism pattern with curvature on the top surface is simulated and the luminance and uniformity are obtained. In order to improve the uniformity, the V groove prism pattern on the bottom surface was turned by an angle of $90^{\circ}$. In particular, we used the pitch calculation program to select the value of the ratio (Max : Min) between the pitch at the extreme outside and the pitch at the middle, the number of V groove lines and the variance at the bottom pattern of DLGP. After that, the optimum distance between V grooves was determined. For optimizing the DLGP, we examined the uniformity again by changing the number of pattern grooves on the bottom surface of DLGP. As a result of the simulation, we find that the BLU with DLGP has a uniformity of 90.6% and viewing angle $145^{\circ}$.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.1
• /
• pp.33-38
• /
• 2011

This paper proposes the method of image cartooning, that makes cartoon-like images of a target, using reference images. We deform a target image using pre-defined reference images. For this deformation, we extract feature points from the target image by Active Appearance Model(AAM) and apply the warping method to the target using feature points of target and feature points of reference image as a basis of warping function. We create simplified cartoon-like images by abstraction of the deformed target image and drawing of edges and quantization of luminance of the abstracted image. Two main concept of cartoon(exaggeration and simplification) is inhered in this method when we use a exaggerated cartoon image as a reference image. It is possible for this method to create various results by control of warping and change of reference image.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.556-564
• /
• 2003

A Star and Pancake graph also have such a good property of a hypercube and have a low network cost than the hypercube. A Macro-star graph which has the star graph as a basic module has the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. And, it is an interconnection network which improves the network cost against the Star graph. In this paper, we propose a method to embed between Star graph, Pancake graph, and Macro-star graph using the edge definition of graphs. We prove that the Star graph $S_n$ can be embedded into Pancake graph $P_n$ with dilation 4, and Macro-star graph MS(2,n) can be embedded into Pancake graph $P_{2n＋1}$ with dilation 4. Also, we have a result that the embedding cost, a Pancake graph can be embedded into Star and Macro-star graph, is O(n).

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.208-216
• /
• 2009

A number of estimation of distribution algorithms have been proposed that do not use explicitly crossover and mutation of traditional genetic algorithms, but estimate the distribution of population for more efficient search. But because it is not easy to discover higher-order correlations of variables, lower-order correlations are estimated most cases under various constraints. In this paper, we propose a new estimation of distribution algorithm that represents higher-order correlations of the data and finds global optimum more efficiently. The proposed algorithm represents the higher-order correlations among variables by building random hypergraph model composed of hyperedges consisting of variables which are expected to be correlated, and generates the next population by Bayesian sampling algorithm Experimental results show that the proposed algorithm can find global optimum and outperforms the simple genetic algorithm and BOA(Bayesian Optimization Algorithm) on decomposable functions with deceptive building blocks.