• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.603-613
• /
• 2006

Near-rings considered are right near-rings and R is a near-ring. $J_0^r(R)$, the right Jacobson radical of R of type-0, was introduced and studied by the present authors. In this paper $J_1^r(R)$ and $J_2^r(R)$, the right Jacobson radicals of R of type-1 and type-2 are introduced. It is proved that both $J_1^r$ and $J_2^r$ are radicals for near-rings and $J_0^r(R){\subseteq}J_1^r(R){\subseteq}J_2^r(R)$. Unlike the left Jacobson radical classes, the right Jacobson radical class of type-2 contains $M_0(G)$ for many of the finite groups G. Depending on the structure of G, $M_0(G)$ belongs to different right Jacobson radical classes of near-rings. Also unlike left Jacobson-type radicals, the constant part of R is contained in every right 1-modular (2-modular) right ideal of R. For any family of near-rings $R_i$, $i{\in}I$, $J_{\nu}^r({\oplus}_{i{\in}I}R_i)={\oplus}_{i{\in}I}J_{\nu}^r(R_i)$, ${\nu}{\in}\{1,2\}$. Moreover, under certain conditions, for an invariant subnear-ring S of a d.g. near-ring R it is shown that $J_2^r(S)=S{\cap}J_2^r(R)$.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.5
• /
• pp.477-486
• /
• 2020

Drone has been widely used for many applications ranging from amateur and leisure to professionals to get fast and accurate 3-D information of the surface of the interest. Most of commercial softwares developed for this purpose are performing automatic matching based on SIFT (Scale Invariant Feature Transform) or SURF (Speeded-Up Robust Features) using nadir-looking stereo image sets. Since, there are some situations where not only nadir and nadir-looking matching, but also nadir and oblique-looking matching is needed, the existing software for the latter case could not get good results. In this study, a matching experiment was performed to utilize images with differences in geometry. Nadir and oblique-looking images were acquired through drone for a total of 2 times. SIFT, SURF, which are feature point-based, and IMAS (Image Matching by Affine Simulation) matching techniques based on affine transformation were applied. The experiment was classified according to the identity of the geometry, and the presence or absence of a building was considered. Images with the same geometry could be matched through three matching techniques. However, for image sets with different geometry, only the IMAS method was successful with and without building areas. It was found that when performing matching for use of images with different geometry, the affine transformation-based matching technique should be applied.

• Progress in Superconductivity and Cryogenics
• /
• v.14 no.4
• /
• pp.28-31
• /
• 2012

We report the solid-liquid phase equilibria on the $GdBa_2Cu_3O_{7-{\delta}}$ (GdBCO) stability phase diagram in low oxygen pressures ($PO_2$) ranging from 1 to 100 mTorr. On the basis of the GdBCO stability phase diagram experimentally determined in low oxygen pressures, the isothermal sections of three different phase fields on log $PO_2$ vs. 1/T diagram were schematically constructed within the $Gd_2O_3-Ba_2CuO_y-Cu_2O$ ternary system, and the solid-liquid phase equilibria in each phase field were described. The invariant points on the phase boundaries include the following three reactions; a pseudobinary peritectic reaction of $GdBCO{\leftrightarrow}Gd_2O_3$ + liquid ($L_1$), a ternary peritectic reaction of $GdBCO{\leftrightarrow}Gd_2O_3+GdBa_6Cu_3O_y$ + liquid ($L_2$), and a monotectic reaction of $L_1{\leftrightarrow}GdBa_6Cu_3O_y+L_2$. A conspicuous feature of the solid-liquid phase equilibria in low $PO_2$ regime (1 - 100 mTorr) is that the GdBCO phase is decomposed into $Gd_2O_3+L_1$ or $Gd_2O_3+GdBa_6Cu_3O_y+L_2$ rather than $Gd_2BaCuO_5+L$ well-known in high $PO_2$ like air.

• Journal of the Korea Concrete Institute
• /
• v.13 no.2
• /
• pp.146-152
• /
• 2001

The fractal geometry is a non-Euclidean geometry which discribes the naturally irregular or fragmented shaps, so that it can be applied to fracture behavior of materials to investigate the fracture process. Fractal curves have a characteristic that represents a self-similarity as an invariant based on the fractal dimension. This fractal geometry was applied to the crack growth of cementitious composites in order to correlate the fracture behavior to microstructures of cemposite composites. The purpose of this study was to find relationships between fractal dimensions and fracture energy. Fracture test was carried out in order to investigate the fracture behavior of plain and fiber reinforced cement composites. The load-CMOD curve and fracture energy of the beams were observed under the three point loading system. The crack profiles were obtained by the image processing system. Box counting method was used to determine the fractal dimension, D$_{f}$. It was known that the linear correlation exists between fractal dimension and fracture energy of the cement composites. The implications of the fractal nature for the crack growth behavior on the fracture energy, G$_{f}$ is appearent.ent.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.5
• /
• pp.34-45
• /
• 1997

In this paper, we present hardware implemcntation of self-organizing feature map (SOFM) neural networkwith constant adaptation gain and binary reinforcement function on FPGA. Whereas a tnme-varyingadaptation gain is used in the conventional SOFM, the proposed SOFM has a time-invariant adaptationgain and adds a binary reinforcement function in order to compensate for the lowered abilityof SOFM due to the constant adaptation gain. Since the proposed algorithm has no multiplication operation.it is much easier to implement than the original SOFM. Since a unit neuron is composed of 1adde $r_tracter and 2 adders, its structure is simple, and thus the number of neurons fabricated onFPGA is expected to he large. In addition, a few control signal: ;:rp sufficient for controlling !he neurons.Experimental results show that each componeni ot thi inipiemented neural network operates correctlyand the whole system also works well.stem also works well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1025-1034
• /
• 2009

In steel making production line, steel slabs are given a unique identification number. This identification number, Slab management number(SMN), gives information about the use of the slab. Identification of SMN has been done by humans for several years, but this is expensive and not accurate and it has been a heavy burden on the workers. Consequently, to improve efficiency, automatic recognition system is desirable. Generally, a recognition system consists of text localization, text extraction, character segmentation, and character recognition. For exact SMN identification, all the stage of the recognition system must be successful. In particular, the text localization is great important stage and difficult to process. However, because of many text-like patterns in a complex background and high fuzziness between the slab and background, directly extracting text region is difficult to process. If the slab region including SMN can be detected precisely, text localization algorithm will be able to be developed on the more simple method and the processing time of the overall recognition system will be reduced. This paper describes about the slab region localization using SIFT(Scale Invariant Feature Transform) features in the image. First, SIFT algorithm is applied the captured background and slab image, then features of two images are matched by Nearest Neighbor(NN) algorithm. However, correct matching rate can be low when two images are matched. Thus, to remove incorrect match between the features of two images, geometric locations of the matched two feature points are used. Finally, search rectangle method is performed in correct matching features, and then the top boundary and side boundaries of the slab region are determined. For this processes, we can reduce search region for extraction of SMN from the slab image. Most cases, to extract text region, search region is heuristically fixed [1][2]. However, the proposed algorithm is more analytic than other algorithms, because the search region is not fixed and the slab region is searched in the whole image. Experimental results show that the proposed algorithm has a good performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.805-808
• /
• 2004

본 논문에서는 두 단백질의 구조적 유사성을 기반으로 한 단백질 비교를 위해서 전처리 기법으로서의 주성분분석기법을 소개한다. 기존의 백본 및 알파탄소 간의 거리행렬(distance matrix), 2차 구조 비교기법, 구역(segment)단위의 비교 기법과 같은 단백질 비교 기법들은 위치이동(translation)와 회전(rotation)에 불변한(invariant) 차이를 구하기 위하여 거리행렬을 이용하였다. 그리고, 난 다음 이들의 최적화 과정을 거쳤다. 그러나, 본 논문에서 제시하는 전처리 기법으로서의 주성분분석기법은 단백질 구조를 전체적인 구조 관점에서 위치를 정렬시킨 후에 단백질 간의 구조를 비교하는 방식이다. 단백질의 구조의 방향성(Orientation)을 맞춘 다음에는 다양한 단백질 표현으로 구를 비교할 수 있다. 본 논문에서는 두 단백질의 구조의 유사성을 측정하기 위한 간결한 단백질 표현(representation)으로 3 차원 에지 히스토그램을 사용하였다. 이 기법은 방향성을 정렬하기 위하여 기존의 방법에서 사용되었던 반복적인 거리계산을 통한 최적화하는 과정을 없앰으로써 단백질 구조 비교 시간을 단축할 수 있는 새로운 단백질 구조 비교 패러다임을 가능하게 한다. 따라서, 이 패러다임을 통하여 적절한 단백질 구조 방향성 정렬과 단백질 구조 표현을 이용한 단백질 구조 비교 검색 시스템은 많은 양의 단백질 구조 정보로부터 원하는 형태의 단백질 구조를 빠른 시간에 검색할 수 있는 장점을 가질 수 있다.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.387-394
• /
• 2005

This paper describes an idea for determining self-localization using visual landmark. The critical geometric dimensions of a pentagon are used here to locate the relative position of the mobile robot with respect to the pattern. This method has the advantages of simplicity and flexibility. This pentagon is also provided nth a unique identification, using invariant features and colors that enable the system to find the absolute location of the patterns. This algorithm determines both the correspondence between observed landmarks and a stored sequence, computes the absolute location of the observer using those correspondences, and calculates relative position from a pentagon using its (ive vortices. The algorithm has been implemented and tested. In several trials it computes location accurate to within 5 centimeters in less than 0.3 second.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2540-2547
• /
• 1999

Chromakey method is one of key technologies for realizing virtual studio, and the blue portions of a captured image in virtual studio, are replaced with a computer generated or real image. The replaced image must be changed according to the camera parameter of studio for natural merging with the non-blue portions of a captured image. This paper proposes a novel method to extract camera parameters using the recognition of pentagonal patterns that are painted on a blue screen. We extract corresponding points between a blue screen. We extract corresponding points between a blue screen and a captured image using the projective invariant features of a pentagon. Then, calculate camera parameters using corresponding points by the modification of Tsai's method. Experimental results indicate that the proposed method is more accurate compared to conventional method and can process about twelve frames of video per a second in Pentium-MMX processor with CPU clock of 166MHz.