• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1984-1994
• /
• 1989

Techniques for approximating digitalcurves by polygonal lines are a valuable tool for image analysis and data compression. S. Shilien proposed a method for segmenting a digital curve into digital straight line segments digital straight line segments which are not satisfied with the structural properties, and have more than one break point by Shilien's method. Here, the structural representation of digital straight lines and digital staight line segments is described. And a method for segmenting a digital curve into digital straight line segments which are not satisfied with the structural properties, and have more than one break point by Shilien's method. Here, the structural representation of digital straight lines and digital staight line segments is described. And a method for segmenting a digital curve into digital straight line segments which may be not satisfied with the structural properties is proposed. The number of break points extracted by this method is less than that by S. Shilien's method from the digital curve which includes the digital straight line segments not satisfied with the structural properties.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.4
• /
• pp.1-11
• /
• 2012

This paper is the study on the development of a torque precision measuring system using the curve fitting algorithm. This system can be divided into the hardware part and the software part. The hardware part consists of the main base board, the DAQ(Data Aquisition) board and Calibration parts. The software part consists of the software filter module and the curve fitting algorithm module. We have tested the torque transducer including the strain gauge for 200 Nm range and have analyzed the data acquired with the curve fitting algorithm by using this system. The DAQ board converts the electric signal induced by the transducer to the digital value precisely by using the shunt calibration procedure. The main board including the curve fitting algorithm calculates the exact digital torque value by using the digital value from the DAQ board. In this study, we confirmed that the result of the appropriate high-order power-series polynomial function is more accurate than the result of the low-order power-series polynomial through the system.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.984-990
• /
• 2009

Halftoning is very important image processing techniques in the digital printing industry which is a process of converting a continuous-tone image to bi-level tone image. In this paper we introduce a new digital halftoning method based on maze generation algorithm as a replacement algorithm of halftoning with space-filling curve. Previous error-diffusion methods based on space-filling curve suffer from regular pattern artifacts from uniform scan pattern. We use maze generation algorithm to remove this undesirable pattern of space-filling curve method.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.599-608
• /
• 2002

This paper proposes DIT (Digital Investment Trust) agent based on ECSSL (Elliptic Curve SSL). This DIT agent is a banking project using IT (Investment Trust) conception based on EC (Electronic Commerce) and can manage micro payment, account opening and account transferring. In addition, ECSSL (Elliptic Curve SSL) protocol is implemented which consists of much better encryption functions than existing SSL (Secure Socket Layer) Protocol. Therefore, This DIT agent based on ECSSL protocol protects a customer's information and asset from third party.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.415-421
• /
• 2014

In this paper, we proposed problem and improvement of halftoning using random space filling curve. Random space filling curve is developed as a solution for shortcoming which space filling curve has self-similarity. It is used to reduce regular pattern can be occurred in constant brightness area in order that randomness apply to scanning path. But there is a problem that some area along scanning path can show too bright result in halftoning using random space filling curve. In this paper, we analyzed cause of problem and proposed single pixel error diffusion as a solution method. This method can avoid over-accumulated error and show better result in halftoning.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2004.10a
• /
• pp.142-143
• /
• 2004

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.695-706
• /
• 2014

Various properties of digital covering spaces have been substantially used in studying digital homotopic properties of digital images. In particular, these are so related to the study of a digital fundamental group, a classification of digital images, an automorphism group of a digital covering space and so forth. The goal of the present paper, as a survey article, to speak out utility of digital covering theory. Besides, the present paper recalls that the papers [1, 4, 30] took their own approaches into the study of a digital fundamental group. For instance, they consider the digital fundamental group of the special digital image (X, 4), where X := $SC^{2,8}_4$ which is a simple closed 4-curve with eight elements in $Z^2$, as a group which is isomorphic to an infinite cyclic group such as (Z, +). In spite of this approach, they could not propose any digital topological tools to get the result. Namely, the papers [4, 30] consider a simple closed 4 or 8-curve to be a kind of simple closed curve from the viewpoint of a Hausdorff topological structure, i.e. a continuous analogue induced by an algebraic topological approach. However, in digital topology we need to develop a digital topological tool to calculate a digital fundamental group of a given digital space. Finally, the paper [9] firstly developed the notion of a digital covering space and further, the advanced and simplified version was proposed in [21]. Thus the present paper refers the history and the process of calculating a digital fundamental group by using various tools and some utilities of digital covering spaces. Furthermore, we deal with some parts of the preprint [11] which were not published in a journal (see Theorems 4.3 and 4.4). Finally, the paper suggests an efficient process of the calculation of digital fundamental groups of digital images.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.529-532
• /
• 2004

The ECC(Elliptic Curve Cryptogrphics), one of the representative Public Key encryption algorithms, is used in Digital Signature, Encryption, Decryption and Key exchange etc. The key operation of an Elliptic curve cryptosystem is a scalar multiplication, hence the design of a scalar multiplier is the core of this paper. Although an Integer operation is computed in infinite field, the scalar multiplication is computed in finite field through adding points on Elliptic curve. In this paper, we implemented scalar multiplier in Elliptic curve based on the finite field GF($2^{163}$). And we verified it on the Embedded digital system using Xilinx FPGA connected to an EISC MCU. If my design is made as a chip, the performance of scalar multiplier applied to Samsung $0.35 {\mu}m$ Phantom Cell Library is expected to process at the rate of 8kbps and satisfy to make up an encryption processor for the Embedded digital doorphone.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.769-780
• /
• 2015

Smoothing a digital curve by averaging its connected points is widely employed to minimize sharp changes of the curve that are generally introduced by noise. An appropriate degree of smoothing is critical since the area or features of the original shape can be distorted at a higher degree while the noise is insufficiently removed at a lower degree. In this paper, we provide a mathematical relationship between the parameters, such as the number of iterations, average distance between neighboring points, weighting factors for averaging and the moving distance of the point on the curve after smoothing. Based on these findings, we propose to control the smoothed curve such that its deviation is bounded particular error level as well as to significantly expedite smoothing for a pixel-based digital curve.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1071-1074
• /
• 2005

The ECC(Elliptic Curve Cryptogrphics), one of the representative Public Key encryption algorithms, is used in Digital Signature, Encryption, Decryption and Key exchange etc. The key operation of an Elliptic curve cryptosystem is a scalar multiplication, hence the design of a scalar multiplier is the core of this paper. Although an Integer operation is computed in infinite field, the scalar multiplication is computed in finite field through adding points on Elliptic curve. In this paper, we implemented scalar multiplier in Elliptic curve based on the finite field $GF(2^{163})$. And we verified it on the Embedded digital system using Xilinx FPGA connected to an EISC MCU(Agent 2000). If my design is made as a chip, the performance of scalar multiplier applied to Samsung $0.35\;{\mu}m$ Phantom Cell Library is expected to process at the rate of 8kbps and satisfy to make up an encryption processor for the Embedded digital information home system.