• 한국전자통신학회논문지
• /
• 제6권2호
• /
• pp.193-198
• /
• 2011

행렬들 중 그것의 성분으로 부호인 + 와 0 만을 갖는 행렬을 우리는 비음인 부호화 행렬이라 한다. 또한 비음인 부호화 행렬 A가 그것과 같은 부호를 갖는 실수 정규행렬 B가 존재하면 정규성을 허용한다고 한다. 본 논문은 참고문헌[1] 에서 밝힌 형태와 다른 특별한 형태를 조사했고, 실수 행렬 중 비음인 정규행렬을 구성하는 흥미로운 방법을 제공했다.

• 대한수학회보
• /
• 제34권1호
• /
• pp.51-61
• /
• 1997

• 호남수학학술지
• /
• 제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.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.209-216
• /
• 2010

A spectrally arbitrary complex sign pattern A is a complex sign pattern of order n such that for every monic nth degree polynomial f(x) with coefficients from $\mathbb{C}$, there is a matrix in the qualitative class of A having the characteristic polynomial f(x). In this paper, we show a necessary condition for a spectrally arbitrary complex sign pattern and introduce a minimal spectrally arbitrary complex sign pattern $A_n$ all of whose superpatterns are also spectrally arbitrary for $n\;{\geq}\;2$. Furthermore, we study the minimum number of nonzero parts in a spectrally arbitrary complex sign pattern.

• 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.

• 호남수학학술지
• /
• 제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.

• 제어로봇시스템학회논문지
• /
• 제15권11호
• /
• pp.1088-1095
• /
• 2009

In this paper, we describe the reorientation method of distorted road sign by using projection transformation for improving recognition rate of road sign. RSR (Road Sign Recognition) is one of the most important topics for implementing driver assistance in intelligent transportation systems using pattern recognition and vision technology. The RS (Road Sign) includes direction of road or place name, and intersection for obtaining the road information. We acquire input images from mounted camera on vehicle. However, the road signs are often appeared with rotation, skew, and distortion by perspective camera. In order to obtain the correct road sign overcoming these problems, projection transformation is used to transform from 4 points of image coordinate to 4 points of world coordinate. The 4 vertices points are obtained using the trajectory as the distance from the mass center to the boundary of the object. Then, the candidate areas of road sign are transformed from distorted image by using homography transformation matrix. Internal information of reoriented road signs is segmented with arrow and the corresponding indicated place name. Arrow area is the largest labeled one. Also, the number of group of place names equals to that of arrow heads. Characters of the road sign are segmented by using vertical and horizontal histograms, and each character is recognized by using SAD (Sum of Absolute Difference). From the experiments, the proposed method has shown the higher recognition results than the image without reorientation.

• 한국산학기술학회논문지
• /
• 제15권9호
• /
• pp.5446-5451
• /
• 2014

내비게이션 단말기에 사용되는 전자지도 제작이 수작업으로 이루어지고 있어 오기가 발생할 수 있기 때문에, 본 논문에서는 내비게이션 정보의 요소로 다루어지는 교통 표지판에 대한 오프라인 자동 인식에 대해 제안하였다. 컴퓨터 비전과 패턴 인식 응용 분야로 2차원 얼굴 인식 분야에 널리 활용되고 있는 주성분분석기법(PCA)과 선형판별분석기법(LDA)을 이용하여 교통표지판을 인식하고자 한다. 먼저 PCA를 이용하여 높은 차원의 2차원 이미지 데이터를 저차원의 특징 벡터영역으로 투영을 시킨다. PCA로부터 구해진 저차원의 특징 벡터를 이용하여 LDA로 분산 매트릭스들 간에 최대가 되고 하고, 분산 매트릭스 내에서는 최소가 되도록 하였다. 실제 도로 환경에서 추출된 교통 신호판의 대부분을 제안된 알고리즘에 의해서 특징 벡터를 40개 이상 사용하였을 경우 92.3%이상의 높은 인식률을 보임을 확인하였다.

• Korean Journal of Mathematics
• /
• 제22권3호
• /
• pp.491-500
• /
• 2014

The base of a signed digraph S is the minimum number k such that for any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. Let K be a signed complete graph of order n, which is a signed digraph obtained by assigning +1 or -1 to each arc of the n-th order complete graph $K_n$ considered as a digraph. In this paper we show that for $n{\geq}3$ the base of a primitive non-powerful signed complete graph K of order n is 2, 3 or 4.

• Korean Journal of Mathematics
• /
• 제23권1호
• /
• pp.29-36
• /
• 2015

A signed digraph S is the digraph D by assigning signs 1 or -1 to each arc of D. The base of S is the minimum number k such that there is a pair walks which have the same initial and terminal point with length k, but different signs. In this paper we show that for $n{\geq}5$ the upper bound of the base of a primitive non-powerful signed tournament Sn, which is the signed digraph by assigning 1 or -1 to each arc of a primitive tournament $T_n$, is max{2n + 2, n+11}. Moreover we show that it is extremal except when n = 5, 7.