• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.700-707
• /
• 2013

In this paper, we propose a non-rigid registration method of lung parenchyma in temporal chest CT scans using region binarization modeling and locally deformable model. To cope with intensity differences between CT scans, we segment the lung vessel and parenchyma in each scan and perform binarization modeling. Then, we match them without referring any intensity information. We globally align two lung surfaces. Then, locally deformable transformation model is developed for the subsequent non-rigid registration. Subtracted quantification results after non-rigid registration are visualized by pre-defined color map. Experimental results showed that proposed registration method correctly aligned lung parenchyma in the full inspiration and expiration CT images for ten patients. Our non-rigid lung registration method may be useful for the assessment of various lung diseases by providing intuitive color-coded information of quantification results about lung parenchyma.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1998.05b
• /
• pp.169-174
• /
• 1998

두께는 일정하나 너비가 균일하게 변하는 판스프링들로 구성된 너비감소 판형 홀다운 스프링 집합체에 대한 탄성강성도 특성해석을 수행하였다. 국산 경수로 핵연료의 홀다운스프링 집합체와 동일한 설계공간내에 있도록 고안한 여러 종류의 너비감소 판형 홀다운 스프링 집합체 시편에 대한 탄성강성도를 해석적으로 평가하였고 특성시험을 수행하였다 또한 실제 시험 결과들을 잘 예측할 수 있도록 Euler 보 이론과 변형률 에너지법에 근거한 탄성강성도 평가방법을 보정하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1267-1275
• /
• 2017

This paper describes a design of cryptographic processor supporting 233-bit elliptic curves over binary field defined by NIST. Scalar point multiplication that is core arithmetic in elliptic curve cryptography(ECC) was implemented by adopting modified Montgomery ladder algorithm, making it robust against simple power analysis attack. Point addition and point doubling operations on elliptic curve were implemented by finite field multiplication, squaring, and division operations over $GF(2^{233})$, which is based on affine coordinates. Finite field multiplier and divider were implemented by applying shift-and-add algorithm and extended Euclidean algorithm, respectively, resulting in reduced gate counts. The ECC processor was verified by FPGA implementation using Virtex5 device. The ECC processor synthesized using a 0.18 um CMOS cell library occupies 49,271 gate equivalents (GEs), and the estimated maximum clock frequency is 345 MHz. One scalar point multiplication takes 490,699 clock cycles, and the computation time is 1.4 msec at the maximum clock frequency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.35-41
• /
• 2002

In this paper, we generalize the family of binary bent sequences introduced by Olsen, Scholtz and Welch [2] to obtain the generalized binary bent sequences with optimal correlation and balance properties. The modified trace transform is introduced and it enables us to use linear function from ${F_{2^n}}$ to the intermediate field ${F_{2^e}}$, where e|n. If we choose e=1, our method becomes the conventional binary bent sequence case. Also, some examples are given which show that our construction gives the family of simple binary sequences with optimal correlation and balance properties.

• Proceedings of the Korean Ceranic Society Conference
• /
• 2000.04a
• /
• pp.143.2-143.2
• /
• 2000

• Cement Symposium
• /
• no.30
• /
• pp.63-68
• /
• 2003

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1992.10a
• /
• pp.487-491
• /
• 1992

• The Zoological Society Korea : Newsletter
• /
• v.17 no.1
• /
• pp.41-48
• /
• 2000

• Proceedings of the Plant Resources Society of Korea Conference
• /
• 1999.05a
• /
• pp.23-23
• /
• 1999

• The Bulletin of The Korean Astronomical Society
• /
• v.34 no.1
• /
• pp.110.2-110.2
• /
• 2009