• Journal of the Korea Computer Graphics Society
• /
• v.10 no.3
• /
• pp.34-39
• /
• 2004

물체의 반사(specular reflection)는 물체의 재질을 이해하는 중요한 실마리임과 더불어, 반사 영역의 모양은 국소적으로 물체의 기하학적 정보를 표시하는 중요한 부분이다. 기존의 비사실적 렌더링 분야에서 다루어져 왔던 만화적 표현 관련 연구들은 극도로 단순화된 쉐이딩 모델을 사용하여 모델의 상세도를 줄이는 방법을 사용하기 때문에 반사 효과와 같은 상세함을 표현하기에는 부족하다. 본 논문에서는 물체의 반사 영역을 만화적으로 표현하는 새로운 비사실적 렌더링 기법을 제안한다. 물체의 국소 반사 모델(local reflection model)을 사용하여 물체의 모든 정점에 대한 빛의 세기를 계산한 후, 반사 영역을 추출한다. 해당 반사 영역에 만화적으로 패턴화된 텍스처를 투영하여 반사 영역을 만화적인 느낌으로 표현한다. 본 논문에서 제시하는 결과는 국소 반사 모델의 계산을 사용하고 투영 텍스처(projective texture)를 이용하는 모델 공간(object space)의 계산으로, 오늘날 보편화되고 있는 그래픽 하드웨어의 가속 성능을 최대로 사용할 수 있는 장점이 있다. 따라서 본 논문의 연구결과는 실시간성이 매우 중요한 게임 등의 분야에서 만화적인 렌더링 기법을 적용하는데 사용할 수 있다.

• International Journal of Precision Engineering and Manufacturing
• /
• v.6 no.3
• /
• pp.29-36
• /
• 2005

With the rapid growth of the Internet, the Internet-based robot has been realized by connecting off-line robot to the Internet. However, because the Internet is often irregular and unreliable, the varying time delay in data transmission is a significant problem for the construction of the Internet-based robot system. Thus, this paper is concerned with the development of an Internet-based robot system, which is insensitive to the Internet time delay. For this purpose, the PPS (Position Prediction Simulator) is suggested and implemented on the system. The PPS consists of two parts : the robot position prediction part and the projective virtual scene part. In the robot position prediction part, the robot position is predicted for more accurate operation of the mobile robot, based on the time at which the user's command reaches the robot system. The projective virtual scene part shows the 3D visual information of a remote site, which is obtained through image processing and position prediction. For the verification of this proposed PPS, the robot was moved to follow the planned path under the various network traffic conditions. The simulation and experimental results showed that the path error of the robot motion could be reduced using the developed PPS.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.461-469
• /
• 2001

Existing area-based stereo algorithms rely heavily on rectangular windows for computing correspondence. While the algorithms with the rectangular windows are efficient, they generate relatively large matching errors due to variations of disparity profiles near depth discontinuities and doesnt take into account local deformations of the windows due to projective distortion. In this paper, in order to deal with these problems, a new correlation function with 4 directional line masks, based on robust estimator, is proposed for the selection of potential matching points. These points is selected to consider depth discontinuities and reduce effects on outliers. The proposed matching method finds an arbitrarily-shaped variable window around a pixel in the 3d array which is constructed with the selected matching points. In addition, the method take into account the local deformation of the variable window with a constant disparity, and perform the estimation of sub-pixel disparities. Experiments with various synthetic images show that the proposed technique significantly reduces matching errors both in the vicinity of depth discontinuities and in continuously smooth areas, and also does not be affected drastically due to outlier and noise.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.1
• /
• pp.21-27
• /
• 2015

A conventional fire detection has been developed based on images captured from a fixed camera. However, It is difficult to apply current algorithms to a flying Quad-rotor to detect fire. To solve this problem, we propose that the fire detection algorithm can be modified for Quad-rotor using Ego-motion compensation. The proposed fire detection algorithm consists of color detection, motion detection, and fire determination using a randomness test. Color detection and randomness test are adapted similarly from an existing algorithm. However, Ego-motion compensation is adapted on motion detection for compensating the degree of Quad-rotor's motion using Planar Projective Transformation based on Optical Flow, RANSAC Algorithm, and Homography. By adapting Ego-motion compensation on the motion detection step, it has been proven that the proposed algorithm has been able to detect fires 83% of the time in hovering mode.

• Journal of the Korean Society of Costume
• /
• v.58 no.2
• /
• pp.120-133
• /
• 2008

The purpose of this study is to analysis types of light and to find the characteristics of light in contemporary fashion design. In a scientific context, light is electromagnetic radiation of a wavelength that has the characteristics of straightness, reflection, refraction, scattering and diffraction. But in philosophical speculations, light has been used as a metaphor of 'being', 'to-be' or 'enlightenment.' And through the ages, people have tried to represent and apply the light into plastic art like painting and architecture. The types of light in fashion design was categorized as those; reflective light from the surface of clothing which is the result of interaction between illumination and material, representative light as the pattern of light or light effect such as sun or its rays and optical or psychedelic patterns, luminescent light from light emitting material like phosphorescence or LED which combines into fashion design, projective light from a medium to reveal virtual patterns on the surface or a fashion design itself using holography. These lights in fashion design can be considered as reflection of emphasis of sexuality, longing for fantasy and mystique, visualization of interaction and communication and groping for the play.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.423-428
• /
• 2005

This paper proposes a new edge detection method using a $3{\times}3$ ideal binary pattern and lookup table (LUT) for the mobile robot localization without any parameter adjustments. We take the mean of the pixels within the $3{\times}3$ block as a threshold by which the pixels are divided into two groups. The edge magnitude and orientation are calculated by taking the difference of average intensities of the two groups and by searching directional code in the LUT, respectively. And also the input image is not only partitioned into multiple groups according to their intensity similarities by the histogram, but also the threshold of each group is determined by fuzzy reasoning automatically. Finally, the edges are determined through non-maximum suppression using edge confidence measure and edge linking. Applying this edge detection method to the mobile robot localization using projective invariance of the cross ratio. we demonstrate the robustness of the proposed method to the illumination changes in a corridor environment.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1355-1370
• /
• 2019

A curve $X{\subset}\mathbb{P}^r$ has maximal rank if for each $t{\in}\mathbb{N}$ the restriction map $H^0(\mathcal{O}_{\mathbb{P}r}(t)){\rightarrow}H^0(\mathcal{O}_X(t))$ is either injective or surjective. We show that for all integers $d{\geq}r+1$ there are maximal rank, but not arithmetically Cohen-Macaulay, smooth curves $X{\subset}\mathbb{P}^r$ with degree d and genus roughly $d^2/2r$, contrary to the case r = 3, where it was proved that their genus growths at most like $d^{3/2}$ (A. Dolcetti). Nevertheless there is a sector of large genera g, roughly between $d^2/(2r+2)$ and $d^2/2r$, where we prove the existence of smooth curves (even aCM ones) with degree d and genus g, but the only integral and non-degenerate maximal rank curves with degree d and arithmetic genus g are the aCM ones. For some (d, g, r) with high g we prove the existence of reducible non-degenerate maximal rank and non aCM curves $X{\subset}\mathbb{P}^r$ with degree d and arithmetic genus g, while (d, g, r) is not realized by non-degenerate maximal rank and non aCM integral curves.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.246-248
• /
• 2022

Binary Edwards curves (BEdC), a new form of elliptic curves proposed by Bernstein, satisfy the complete addition law without exceptions. This paper describes an efficient hardware implementation of point scalar multiplication on BEdC using projective coordinates. Modified Montgomery ladder algorithm was adopted for point scalar multiplication, and binary field arithmetic operations were implemented using 257-bit binary adder, 257-bit binary squarer, and 32-bit binary multiplier. The hardware operation of the BEdC crypto-core was verified using Zynq UltraScale+ MPSoC device. It takes 521,535 clock cycles to compute point scalar multiplication.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1083-1091
• /
• 2017

This paper describes a design of cryptographic processor supporting 224-bit elliptic curves over prime field defined by NIST. Scalar point multiplication that is a core arithmetic function in elliptic curve cryptography(ECC) was implemented by adopting the modified Montgomery ladder algorithm. In order to eliminate division operations that have high computational complexity, projective coordinate was used to implement point addition and point doubling operations, which uses addition, subtraction, multiplication and squaring operations over GF(p). The final result of the scalar point multiplication is converted to affine coordinate and the inverse operation is implemented using Fermat's little theorem. The ECC processor was verified by FPGA implementation using Virtex5 device. The ECC processor synthesized using a 0.18 um CMOS cell library occupies 2.7-Kbit RAM and 27,739 gate equivalents (GEs), and the estimated maximum clock frequency is 71 MHz. One scalar point multiplication takes 1,326,985 clock cycles resulting in the computation time of 18.7 msec at the maximum clock frequency.

• Journal of the HCI Society of Korea
• /
• v.1 no.1
• /
• pp.37-44
• /
• 2006

Specular reflections provide the visual feedback that describes the material type of an object, its local shape, and lighting environment. In photorealistic rendering, there have been a number of research available to render specular reflections effectively based on a local reflection model. In traditional cel animations and cartoons, specular reflections plays important role in representing artistic intentions for an object and its related environment reflections, so the shapes of highlights are quite stylistic. In this paper, we present a method to render and control stylized specular reflections using projective textures based on principal curvature analysis. Specifying a texture as a pattern of a highlight and projecting the texture on the specular region of a given 3D model, we can obtain a stylized representation of specular reflections. For a given polygonal model, a view point, and a light source, we first find the maximum specular intensity point, and then locate the texture projector along the line parallel to the normal vector and passing through the point. The orientation of the projector is determined by the principal directions at the point. Finally, the size of the projection frustum is determined by the principal curvatures corresponding to the principal directions. The proposed method can control the position, orientation, and size of the specular reflection efficiently by translating the projector along the principal directions, rotating the projector about the normal vector, and scaling the principal curvatures, respectively. The method is be applicable to real-time applications such as cartoon style 3D games. We implement the method by Microsoft DirectX 9.0c SDK and programmable vertex/pixel shaders on Nvidia GeForce FX 7800 graphics subsystems. According to our experimental results, we can render and control the stylized specular reflections for a 3D model of several ten thousands of triangles in real-time.