• Journal of Electrical Engineering and Technology
• /
• 제11권6호
• /
• pp.1825-1838
• /
• 2016

The detection of skin pigment is crucial in the diagnosis of skin diseases and in the evaluation of medical cosmetics and hairdressing. Accuracy in the detection is a basis for the prompt cure of skin diseases. This study presents a method to recognize and measure human skin pigment using Hemoglobin-Melanin (HM) coordinate. The proposed method extracts the skin area through a Gaussian skin-color model estimated from statistical analysis and decomposes the skin area into two pigments of hemoglobin and melanin using an Independent Component Analysis (ICA) algorithm. Then, we divide the two-dimensional (2D) HM coordinate into rectangular bins and compute the location histograms of hemoglobin and melanin for all the bins. We label the skin pigment of hemoglobin, melanin, and normal skin on all bins according to the Bayesian classifier. These bin-based HM projective histograms can quantify the skin pigment and compute the standard deviation on the total quantification of skin pigments surrounding normal skin. We tested our scheme using images taken under different illumination conditions. Several cosmetic coverings were used to test the performance of the proposed method. The experimental results show that the proposed method can detect skin pigments with more accuracy and evaluate cosmetic covering effects more effectively than conventional methods.

• International Journal of Contents
• /
• 제12권2호
• /
• pp.1-5
• /
• 2016

Extensible 3D (X3D) is the ISO standard for defining 3D interactive web- and broadcast-based 3D content integrated with multimedia. With the advent of this integration of interactive 3D graphics into the web, users can easily produce 3D scenes within web contents. Even though there are diverse texture nodes in X3D, projective textures are not provided. We enable X3D to provide SingularProjectiveTexture and MultiProjectiveTexture nodes by materializing independent nodes of projector nodes for a singular projector and multi-projector. Our approach takes the creation of an independent projective texture node instead of Kamburelis's method, which requires inconvenient and duplicated specifications of two nodes, ImageTexture and Texture Coordinate.

• ETRI Journal
• /
• 제30권1호
• /
• pp.68-80
• /
• 2008

Since many efficient algorithms for implementing pairings have been proposed such as ${\eta}_T$ pairing and the Ate pairing, pairings could be used in constraint devices such as smart cards. However, the secure implementation of pairings has not been thoroughly investigated. In this paper, we investigate the security of ${\eta}_T$ pairing over binary fields in the context of side-channel attacks. We propose efficient and secure ${\eta}_T$ pairing algorithms using randomized projective coordinate systems for computing the pairing.

• Journal of Communications and Networks
• /
• 제10권4호
• /
• pp.437-443
• /
• 2008

The randomized projective coordinate (RPC) method applied to a pairing computation algorithm is a good solution that provides an efficient countermeasure against side channel attacks. In this study, we investigate measures for increasing the efficiency of the RPC-based countermeasures and construct a method that provides an efficient RPC-based countermeasure against side channel attacks. We then apply our method to the well-known $\eta_T$ pairing algorithm over binary fields and obtain an RPC-based countermeasure for the $\eta_T$ pairing; our method is more efficient than the RPC method applied to the original $\eta_T$ pairing algorithm.

• 호남수학학술지
• /
• 제43권3호
• /
• pp.403-416
• /
• 2021

It is known that the rank 2 stably free syzygy module P⁽²⁾ is not free. This algebraic fact was proved analytically, but this remarkable fact still lacks of a simple algebraic proof. The main purpose of this paper is to give a partially algebraic proof by making use of a theorem whose proof is quite topological, and the further properties of the module will be discussed.

• 대한수학회보
• /
• 제53권1호
• /
• pp.263-272
• /
• 2016

By using the finite projective geometry method, the separating properties of linear constant-weight codes are presented. An algorithm is given for computing the cardinality of separating coordinate positions of certain disjoint codeword sets of linear constant-weight codes.

• 한국CDE학회논문집
• /
• 제9권4호
• /
• pp.397-405
• /
• 2004

Texture mapping is the process of covering 3D models with texture images in order to increase the visual realism of the models. For proper mapping the coordinates of texture images need to coincide with those of the 3D models. When projective images from the camera are used as texture images, the texture image coordinates are defined by a camera calibration method. The texture image coordinates are determined by the relation between the coordinate systems of the camera image and the 3D object. With the projective camera images, the distortion effect caused by the camera lenses should be compensated in order to get accurate texture coordinates. The distortion effect problem has been dealt with iterative methods, where the camera calibration coefficients are computed first without considering the distortion effect and then modified properly. The methods not only cause to change the position of the camera perspective line in the image plane, but also require more control points. In this paper, a new iterative method is suggested for reducing the error by fixing the principal points in the image plane. The method considers the image distortion effect independently and fixes the values of correction coefficients, with which the distortion coefficients can be computed with fewer control points. It is shown that the camera distortion effects are compensated with fewer numbers of control points than the previous methods and the projective texture mapping results in more realistic image.

• 전자공학회논문지CI
• /
• 제47권4호
• /
• pp.25-33
• /
• 2010

본 논문에서는 단일 카메라를 이용하여 얼굴의 움직임 정보를 추정하고 3차원 모델을 합성하기 위한 기법을 제안한다. 먼저 단일 카메라 입력 영상에서 사용자의 얼굴 영역 특징 점 취득을 위한 4개의 하부 이미지를 획득한다. 획득된 4개의 하부 이미지를 템플릿으로 사용하여 사용자 얼굴 영역의 정보를 추출하며, 이들 4개의 특징 점을 사용하여 사용자 얼굴과 카메라 영상 평면 사이의 사영 관계를 계산한다. 취득된 카메라 행렬로부터 얼굴의 움직임 정보인 이동과 회전 성분을 추정할 수 있으며, 이를 기반으로 3차원 모델의 자세 정보를 설정한 다음 이를 사용자 얼굴에 가상의 객체를 합성하기 위한 정보로 이용한다. 다양한 실험을 통하여 사용자 얼굴의 움직임에 대한 정보 추출의 정확도를 검증하였다.

• 한국정보통신학회논문지
• /
• 제21권6호
• /
• pp.1083-1091
• /
• 2017

NIST 표준에 정의된 소수체(prime field) GF(p) 상의 224-비트 타원곡선을 지원하는 타원곡선 암호 프로세서를 설계하였다. 타원곡선 암호의 핵심 연산인 스칼라 점 곱셈을 수정형 Montgomery ladder 알고리듬을 이용하여 구현하였다. 점 덧셈과 점 두배 연산은 투영(projective) 좌표계를 이용하여 연산량이 많은 나눗셈 연산을 제거하였으며, 소수체 상의 덧셈, 뺄셈, 곱셈, 제곱 연산만으로 구현하였다. 스칼라 점 곱셈의 최종 결과값은 다시 아핀(affine) 좌표계로 변환되어 출력하며, 이때 사용되는 역원 연산은 Fermat's little theorem을 이용하여 구현하였다. 설계된 ECC 프로세서를 Virtex5 FPGA로 구현하여 정상 동작함을 확인하였다. $0.18{\mu}m$공정의 CMOS 셀 라이브러리로 합성한 결과 10 MHz의 동작 주파수에서 2.7-Kbit RAM과 27,739 GE로 구현되었고, 최대 71 MHz의 동작 주파수를 갖는다. 스칼라 점 곱셈에 1,326,985 클록 사이클이 소요되며, 최대 동작 주파수에서 18.7 msec의 시간이 소요된다.

• ETRI Journal
• /
• 제30권3호
• /
• pp.365-376
• /
• 2008

This paper presents the design and implementation of a hyperelliptic curve cryptography (HECC) coprocessor over affine and projective coordinates, along with measurements of its performance, hardware complexity, and power consumption. We applied several design techniques, including parallelism, pipelining, and loop unrolling, in designing field arithmetic units, group operation units, and scalar multiplication units to improve the performance and power consumption. Our affine and projective coordinate-based HECC processors execute in 0.436 ms and 0.531 ms, respectively, based on the underlying field GF($2^{89}$). These results are about five times faster than those for previous hardware implementations and at least 13 times better in terms of area-time products. Further results suggest that neither case is superior to the other when considering the hardware complexity and performance. The characteristics of our proposed HECC coprocessor show that it is applicable to high-speed network applications as well as resource-constrained environments, such as PDAs, smart cards, and so on.