• 대한수학회보
• /
• 제46권1호
• /
• pp.171-182
• /
• 2009

In this paper, we consider the parameter space of the rational plane curves with uni-branched singularity. We show that such a parameter space is decomposable into irreducible components which are rational varieties. Rational parametrizations of the irreducible components are given in a constructive way, by a repeated use of Abhyankar-Moh Epimorphism Theorem. We compute an enumerative invariant of this parameter space, and include explicit computational examples to recover some classically-known invariants.

• 대한전자공학회논문지SD
• /
• 제42권1호
• /
• pp.57-67
• /
• 2005

고속 스칼라곱 연산은 타원곡선 암호 응용을 위해서 매우 중요하다. 보안 상황에 따라 유한체의 크기를 변경하려면 타원곡선 암호 보조프로세서가 크기 가변 유한체 연산 장치를 제공하여야 한다. 크기 가변 유한체 연산기의 효율적인 연산 구조를 연구하기 위하여 전형적인 두 종류의 스칼라곱 연산 알고리즘을 FPGA로 구현하였다. Affine 좌표계 알고리즘은 나눗셈 연산기를 필요로 하며, projective 좌표계 알고리즘은 곱셈 연산기만 사용하나 중간 결과 저장을 위한 메모리가 더 많이 소요된다. 크기 가변 나눗셈 연산기는 각 비트마다 궤환 신호선을 추가하여야 하는 문제점이 있다. 본 논문에서는 이로 인한 클록 속도저하를 방지하는 간단한 방법을 제안하였다. Projective 좌표계 구현에서는 곱셈 연산으로 널리 사용되는 디지트 serial 곱셈구조를 사용하였다. 디지트 serial 곱셈기의 크기 가변 구현은 나눗셈의 경우보다 간단하다. 최대 256 비트 크기의 연산이 가능한 크기 가변 유한체 연산기를 이용한 암호 프로세서로 실험한 결과, affine 좌표계 알고리즘으로 스칼라곱 연산을 수행한 시간이 6.0 msec, projective 좌표계 알고리즘의 경우는 1.15 msec로 나타났다. 제안한 타원곡선 암호 프로세서를 구현함으로써, 하드웨어 구현의 경우에도 나눗셈 연산을 사용하지 않는 projective 좌표계 알고리즘이 속도 면에서 우수함을 보였다. 또한, 메모리의 논리회로에 대한 상대적인 면적 효율성이 두 알고리즘의 하드웨어 구현 면적 요구에 큰 영향을 미친다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.260-262
• /
• 2003

New Image registration techniques are developed for determining geometric distortions between two images of the same scene. First, the properties of the Fourier transform of a two dimensional function under the affine transformation are given. As a result, techniques for the estimation of the coefficients of the distortion model using the spectral frequency information are developed. Image registration can be achieved by applying the fast Fourier transform (FFT) technique for cross correlation of misregistered imagery to determine spatial distances. The correlation results may be rather broad, making detection of the peak difficult, what can be suppressed by enhancing cross-correlation technique. Yield greatly improves the delectability and high precision of image misregistration.

• 한국수학사학회지
• /
• 제28권4호
• /
• pp.181-190
• /
• 2015

In spite of various attempts to characterize the ontological status of space-time, Newtonian substantivalism and Leibnizian relationism, what is really at issue in the controversy between the two parties is by no means clear. This essay argues that from the perspective of space-time symmetries, classical space-time can be unambiguously classified as substantival space-time and relational space-time. The symmetries of space-time theories distinguish the invariant geometric relationships between events. The essential difference between the two space-times stems from whether or not there exists the affine structure that distinguishes the inertial trajectories of a given body.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권9호
• /
• pp.3782-3796
• /
• 2020

A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

• East Asian mathematical journal
• /
• 제15권2호
• /
• pp.277-290
• /
• 1999

In this paper, we investigate the existence of a two dimensional surface in a four dimensional equiaffine space and characterize that surface.

• 대한수학회지
• /
• 제33권3호
• /
• pp.507-512
• /
• 1996

A totally umbilic submanifold of a pseudo-Riemanian manifold is a submanifold whose first fundamental form and second fundamental form are proportiona. An ordinary hypersphere $S^n(r)$ of an affine (n + 1)-space of the Euclidean space $E^m$ is the best known example of totally umbilic submanifolds of $E^m$.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.685-696
• /
• 1999

We present local and semilocal convergence results for New-ton's method in a Banach space setting. In particular using Lipschitz-type assumptions on the second Frechet-derivative we find results con-cerning the radius of convergence of Newton's method. Such results are useful in the context of predictor-corrector continuation procedures. Finally we provide numerical examples to show that our results can ap-ply where earlier ones using Lipschitz assumption on the first Frechet-derivative fail.

• 대한수학회지
• /
• 제54권6호
• /
• pp.1759-1786
• /
• 2017

We examine the moduli space of oriented locally homogeneous manifolds of Type ${\mathcal{A}}$ which have non-degenerate symmetric Ricci tensor both in the setting of manifolds with torsion and also in the torsion free setting where the dimension is at least 3. These exhibit phenomena that is very different than in the case of surfaces. In dimension 3, we determine all the possible symmetry groups in the torsion free setting.

• 대한수학회보
• /
• 제61권3호
• /
• pp.849-866
• /
• 2024

In this paper, we study the rectifying curves in multiplicative Euclidean space of dimension 3, i.e., those curves for which the position vector always lies in its rectifying plane. Since the definition of rectifying curve is affine and not metric, we are directly able to perform multiplicative differential-geometric concepts to investigate such curves. By several characterizations, we completely classify the multiplicative rectifying curves by means of the multiplicative spherical curves.