• 대한수학회논문집
• /
• 제25권1호
• /
• pp.11-18
• /
• 2010

The work in this paper was motivated by [3], where Eschenbach and Li listed four 4 by 4 sign patterns, conjectured to be nilpotent sign patterns of nilpotence index at least 3. These sign patterns with no zero entries, called full sign patterns, are shown to be potentially nilpotent of nilpotence index 3. We also generalize these sign patterns of order 4 so that we provide classes of n by n sign patterns of nilpotence indices at least 3, if they are potentially nilpotent. Furthermore it is shown that if a full sign pattern A of order n has nilpotence index k with $2{\leq}k{\leq}n-1$, then sign pattern A has nilpotent realizations of nilpotence indices k, k + 1, $\ldots$, n. Hence, the four 4 by 4 sign patterns in [3, page 91] also allow nilpotent realizations of nilpotence index 4.

• 대한수학회보
• /
• 제56권2호
• /
• pp.305-318
• /
• 2019

A sign pattern is a matrix whose entries belong to the set {+, -, 0}. An n-by-n sign pattern ${\mathcal{A}}$ is said to allow an eventually positive matrix or be potentially eventually positive if there exist at least one real matrix A with the same sign pattern as ${\mathcal{A}}$ and a positive integer $k_0$ such that $A^k>0$ for all $k{\geq}k_0$. Identifying the necessary and sufficient conditions for an n-by-n sign pattern to be potentially eventually positive, and classifying the n-by-n sign patterns that allow an eventually positive matrix are two open problems. In this article, we focus on the potential eventual positivity of broom sign patterns. We identify all the minimal potentially eventually positive broom sign patterns. Consequently, we classify all the potentially eventually positive broom sign patterns.

• East Asian mathematical journal
• /
• 제27권1호
• /
• pp.83-89
• /
• 2011

We denote by $\mathcal{Q}(A)$ the set of all matrices with the same sign pattern as A. A matrix A has signed -space provided there exists a set S of sign patterns such that the set of sign patterns of vectors in the -space of e $\tilde{A}$ is S, for each e $\tilde{A}{\in}\mathcal{Q}(A)$. In this paper, we show that the number of sign patterns of elements in the row space of $\mathcal{S}^*$-matrix is $3^{m+1}-2^{m+2}+2$. Also the number of sign patterns of vectors in the -space of a totally L-matrix is obtained.

• 대한수학회지
• /
• 제36권3호
• /
• pp.469-487
• /
• 1999

Sign patterns of idempotent matrices, especially symmetric idempotent matrices, are investigated. A number of fundamental results are given and various constructions are presented. The sign patterns of symmetric idempotent matrices through order 5 are determined. Some open questions are also given.

• 대한인간공학회지
• /
• 제34권5호
• /
• pp.411-426
• /
• 2015

Objective: The goal of this thesis is to design the interaction structure and framework of system to recognize sign language. Background: The sign language of meaningful individual gestures is combined to construct a sentence, so it is difficult to interpret and recognize the meaning of hand gesture for system, because of the sequence of continuous gestures. This being so, in order to interpret the meaning of individual gesture correctly, the interaction structure and framework are needed so that they can segment the indication of individual gesture. Method: We analyze 700 sign language words to structuralize the sign language gesture interaction. First of all, we analyze the transformational patterns of the hand gesture. Second, we analyze the movement of the transformational patterns of the hand gesture. Third, we analyze the type of other gestures except hands. Based on this, we design a framework for sign language interaction. Results: We elicited 8 patterns of hand gesture on the basis of the fact on whether the gesture has a change from starting point to ending point. And then, we analyzed the hand movement based on 3 elements: patterns of movement, direction, and whether hand movement is repeating or not. Moreover, we defined 11 movements of other gestures except hands and classified 8 types of interaction. The framework for sign language interaction, which was designed based on this mentioned above, applies to more than 700 individual gestures of the sign language, and can be classified as an individual gesture in spite of situation which has continuous gestures. Conclusion: This study has structuralized in 3 aspects defined to analyze the transformational patterns of the starting point and the ending point of hand shape, hand movement, and other gestures except hands for sign language interaction. Based on this, we designed the framework that can recognize the individual gestures and interpret the meaning more accurately, when meaningful individual gesture is input sequence of continuous gestures. Application: When we develop the system of sign language recognition, we can apply interaction framework to it. Structuralized gesture can be used for using database of sign language, inventing an automatic recognition system, and studying on the action gestures in other areas.

• 대한수학회논문집
• /
• 제10권3호
• /
• pp.561-573
• /
• 1995

A matrix whose entries consist of the symbols +, - and 0 is called a sign pattern matrix. In [1], a graph theoretic characterization of sign idempotent pattern matrices was given. A question was given for the sign patterns which allow idempotence. We characterized the sign patterns which allow idempotence in the sign idempotent pattern matrices.

• 호남수학학술지
• /
• 제26권3호
• /
• pp.341-353
• /
• 2004

We denote by ${{\mathcal{Q}}(A)}$ the set of all matrices with the same sign pattern as A. A matrix A has signed null-space provided there exists a set ${\mathcal{S}}$ of sign patterns such that the set of sign patterns of vectors in the null-space of ${\tilde{A}}$ is ${\mathcal{S}}$, for each ${\tilde{A}}{\in}{{\mathcal{Q}}(A)}$. Some properties of matrices with signed null-spaces are investigated.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.105.2-105
• /
• 2001

This paper studies continuous Korean Sign Language (KSL) recognition using color vision. In recognizing gesture words such as sign language, it is a very difficult to segment a continuous sign into individual sign words since the patterns are very complicated and diverse. To solve this problem, we disassemble the KSL into 18 hand motion classes according to their patterns and represent the sign words as some combination of hand motions. Observing the speed and the change of speed of hand motion and using state automata, we reject unintentional gesture motions such as preparatory motion and meaningless movement between sign words. To recognize 18 hand motion classes we adopt Hidden Markov Model (HMM). Using these methods, we recognize 5 KSL sentences and obtain 94% recognition ratio.

• 방송공학회논문지
• /
• 제21권4호
• /
• pp.562-568
• /
• 2016

본 논문에서는 다양한 교통 표지판 중에서 운전자의 안전운행에 밀접하게 관계가 있는 속도 표지판을 인식하는 연구에 초점을 맞추고 있다. HOG (histogram of gradient)와 LBP (local binary patterns) 가 객체 인식을 위한 대표적 특징이지만, 이러한 특징들은 패턴을 생성할 때 목표 객체의 회전을 고려하지 않음으로써 객체의 회전에 약한 특성을 가지고 있다. 따라서 본 논문에서는 회전에 강인한 이진 패턴을 생성하기 위해 FRIBP (fast rotation-invariant binary patterns)를 제안하고 있다. 본 논문에서 제안하는 FRIBP 알고리즘은 히스토그램에서 불필요한 레이어를 삭제하고 비교연산과 시프트 연산을 제거하여 빠르게 원하는 특징을 추출할 수 있도록 설계되었다. 제안된 FRIBP 알고리즘은 GTSRB (German Traffic Sign Recognition Benchmark) 데이터에 적용되어, 다른 비교 알고리즘과 유사한 성능을 보여주었다. 또한, 12,630개의 테스트 데이터에 대해 기존의 방법들보다 약 0.47초가 향상된 인식 속도를 보여주었다.

• 호남수학학술지
• /
• 제30권4호
• /
• pp.659-670
• /
• 2008

We denote by $\mathcal{Q}$(A) the set of all real matrices with the same sign pattern as a real matrix A. A matrix A is an SN-matrix provided there exists a set S of sign pattern such that the set of sign patterns of vectors in the -space of $\tilde{A}$ is S, for each ${\tilde{A}}{\in}\mathcal{Q}(A)$. Some properties of SN-matrices arc investigated.