• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2014년도 춘계학술발표대회
• /
• pp.830-833
• /
• 2014

This paper proposes dynamic constraint parameter to filter out degenerate configurations (i.e. set of collinear or adjacent features) in RANSAC algorithm. We define five different groups of image based on the feature distribution pattern. We apply the same linear and distance constraints for every image, but we use different constraint parameter for every group, which will affect the filtering result. An evaluation is done by comparing the proposed dynamic CS-RANSAC algorithm with the classic RANSAC and regular CS-RANSAC algorithms in the calculation of a homography matrix. The experimental results show that dynamic CS-RANSAC algorithm provides the lowest error rate compared to the other two algorithms.

• 대한수학회보
• /
• 제60권1호
• /
• pp.83-91
• /
• 2023

A ring R is called a UN ring if every non unit of it can be written as product of a unit and a nilpotent element. We obtain results about lifting of conjugate idempotents and unit regular elements modulo an ideal I of a UN ring R. Matrix rings over UN rings are discussed and it is obtained that for a commutative ring R, a matrix ring M_n(R) is UN if and only if R is UN. Lastly, UN group rings are investigated and we obtain the conditions on a group G and a field K for the group algebra KG to be UN. Then we extend the results obtained for KG to the group ring RG over a ring R (which may not necessarily be a field).

• 호남수학학술지
• /
• 제19권1호
• /
• pp.157-164
• /
• 1997

We are concerned with three classes of matrices that are relevant to the linear complementary problem. We prove that within the class of $P_0$-matrices, the Q-matrices are precisely the regular matrices and we show that the same characterizations hold for an L-matrix as well, and that the symmetric copositive-plus Q-matrices are precisely those which are strictly copositive.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.25-35
• /
• 2009

In this paper, we study the regularity of induced splittings from multisplitting and two-stage multisplitting methods of monotone matrices under the assumption that splittings are weak regular, and we also study some comparison theorems for two-stage multisplitting methods of monotone matrices.

• 대한수학회보
• /
• 제50권2호
• /
• pp.667-674
• /
• 2013

Considering a special double-cover Q of the symmetric group of degree 3, we show that a proper non-regular approximate symmetry occurs from its quasigroup homogeneous space. The weak compatibility of any two elements of Q is completely characterized in any such quasigroup homogeneous space of degree 4.

• 대한수학회보
• /
• 제55권2호
• /
• pp.675-677
• /
• 2018

• 호남수학학술지
• /
• 제36권2호
• /
• pp.387-398
• /
• 2014

In this paper, we give a structure theorem for a class of Gorenstein ideal of grade 4 which is the sum of an almost complete intersection of grade 3 and a Gorenstein ideal of grade 3 geometrically linked by a regular sequence. We also present the Hilbert function of a Gorenstein ideal of grade 4 induced by a Gorenstein matrix f.

• 대한수학회지
• /
• 제47권1호
• /
• pp.1-15
• /
• 2010

We introduce, in this article, the quasi-stable exchange ideal for associative rings. If I is a quasi-stable exchange ideal of a ring R, then so is $M_n$(I) as an ideal of $M_n$(R). As an application, we prove that every square regular matrix over quasi-stable exchange ideal admits a diagonal reduction by quasi invertible matrices. Examples of such ideals are given as well.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1991년도 추계종합학술발표회논문집
• /
• pp.215-219
• /
• 1991

This paper is equivalent model transform which reduces the restriction of digitalization in the discrete linear system. This algorithm is the method that weight is given to contribillity and obserbility gramian, the regular matrix T of coordinate transform is obtained and then the state space coefficents of weighted model can be obtained. This study shows the frequency reponse of low quantization error according to the order of weighting function. The result shows that frequency response of the proposed algorithm is better than that of the balanced realization in the system of smaller bit.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.1051-1052
• /
• 2006

In this paper, we propose a puncturing scheme to design low-density parity-matrix (LDPC) codes for unequal error protection (UEP). Two different puncturing schemes are compared. Simulation results show that proposed puncturing scheme outperforms regular puncturing scheme for more important bits. Future work is to find an optimized puncturing patten for UEP irregular LDPC codes.