• Communications of the Korean Mathematical Society
• /
• v.10 no.2
• /
• pp.385-392
• /
• 1995

Along with certain properties of a chronal or a causal isomorphism, we discuss the invariant nature of a causality conditions of a given space-time.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.755-761
• /
• 2016

Let A be an abelian variety over a global field K. We show that, in "many" cases, Chen-Kuan's invariant M(A[n]), that is the average number of n-torsion points of A over various residue fields of K, has the minimal possible value.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.1
• /
• pp.66-74
• /
• 2008

This paper presents a new small target detection method using scale invariant feature. Detecting small targets whose sizes are varying is very important to automatic target detection. Scale invariant feature using the Laplacian scale-space can detect different sizes of targets robustly compared to the conventional spatial filtering methods with fixed kernel size. Additionally, scale-reflected adaptive thresholding can reduce many false alarms. Experimental results with real IR images show the robustness of the proposed target detection in real world.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.5
• /
• pp.485-493
• /
• 2002

Broadband interference patterns are studied using ship as an acoustic source in shallow waters with varying bathymetry. Waveguide invariant index (β) indicating the pattern of constructive (or destructive) interference in range-frequency domain is derived in a waveguide with constant bottom slope based on adiabatic mode theory. Using this invariant, changes of the interference patterns resulting from the variation of bottom bathymetry are analyzed. Results of the analytic interpretation is compared with those from sea experiments and numerical simulations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.30-41
• /
• 1996

This paper presents a comparative study of four pattern recognition algorithms which are invariant to translations, rotations, and scale changes of the input object; namely, object shape features (OSF), geometrica fourier mellin transform (GFMT), moment invariants (MI), and centered polar exponential transform (CPET). Pattern description is obviously one of the most important aspects of pattern recognition, which is useful to describe the object shape independently of translation, rotation, or size. We first discuss problems that arise in the conventional invariant pattern recognition algorithms, or size. We first discuss problems that arise in the coventional invariant pattern recognition algorithms, then we analyze their performance using the same criterion. Computer simulations with several distorted images show that the CPET algorithm yields better performance than the other ones.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.149-156
• /
• 2021

This study intended to test the structure of the latent factor of an effectiveness scale and the stability of invariance across groups of students' classifications (gender and levels of education). In the large, non-clinical sample (850), students completed the effectiveness scale. The (CFA) confirmatory factor analysis was used to investigate the factor-structure of the measure, and multiple-group confirmatory factor analysis (MGCFA) model was used to test the stability of invariance across groups of students' classifications. The findings of the CFA indicated support for the original four-factor model. Additional analyses of the MGCFA method support the measurement (configural, metric and strong) invariant and practical invariant components of this model. There was an invariant across gender. There was partially invariant across groups of levels of education. The scale exists in groups of levels of education assess the same concepts of, excluding Items 15 and 10. Given that this study is the first investigation for the structure of the effectiveness scale.

• Communications of the Korean Mathematical Society
• /
• v.15 no.4
• /
• pp.649-668
• /
• 2000

In this paper we prove the following : Let M be a real (2n-1)-dimensional compact minimal semi-invariant submanifold in a complex projective space P(sub)n+1C. If the scalar curvature $\geq$2(n-1)(2n+1), then m is a homogeneous type $A_1$ or $A_2$. Next suppose that the third fundamental form n satisfies dn = 2$\theta\omega$ for a certain scalar $\theta$$\neq$c/2 and $\theta$$\neq$c/4 (4n-1)/(2n-1), where $\omega$(X,Y) = g(X,øY) for any vectors X and Y on a semi-invariant submanifold of codimension 3 in a complex space form M(sub)n+1 (c). Then we prove that M has constant principal curvatures corresponding the shape operator in the direction of the distingusihed normal and the structure vector ξ is an eigenvector of A if and only if M is locally congruent to a homogeneous minimal real hypersurface of M(sub)n (c).

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.375-380
• /
• 2014

Under controlled environment, such as fixed viewpoints or consistent illumination, the performance of face recognition is usually high enough to be acceptable nowadays. Face recognition is, however, a still challenging task in real world. SIFT(Scale Invariant Feature Transformation) algorithm is scale and rotation invariant, which is powerful only in the case of small viewpoint changes. However, it often fails when viewpoint of faces changes in wide range. In this paper, we use Affine SIFT (Scale Invariant Feature Transformation; ASIFT) to detect affine invariant local descriptors for face recognition under wide viewpoint changes. The ASIFT is an extension of SIFT algorithm to solve this weakness. In our scheme, ASIFT is applied only to gallery face, while SIFT algorithm is applied to probe face. ASIFT generates a series of different viewpoints using affine transformation. Therefore, the ASIFT allows viewpoint differences between gallery face and probe face. Experiment results showed our framework achieved higher recognition accuracy than the original SIFT algorithm on FERET database.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.695-698
• /
• 2008

A simple proof of the fact that the j-invariants for Weierstrass equations are invariant under birational transformations which keep the forms of Weierstrass equations is given by finding a non-trivial explicit birational transformation which sends a normalized Weierstrass equation to the same equation.

• Journal of the Chungcheong Mathematical Society
• /
• v.1 no.1
• /
• pp.85-90
• /
• 1988

We develope a signature invariant for odd higher dimensional links. This signature has an advantage that it is defined as a G-signature for a non-abelian group G so that it can distinguish two links whose different were not detected by other invariants defined on commutative set-ups.