• 전자공학회논문지B
• /
• 제31B권5호
• /
• pp.95-107
• /
• 1994

A new efficient contour following algorithm for connected-component labeling processing is proposed. The basic idea of the algorithm is that the total number of downward chain codes is the same as one of upward chain codes along the closed contour. If the chain code direction is upward, then region start mark is assigned at the chain code departure pixel and if the chain code is downward, then region end mark is assigned at the chain code arrival pixel. The proposed algorithm extracts directly the contour information from only the current direction information of chain. This makes the algorithm simple and fast and requires less memory with comparison to the conventional algorithms.The proposed contour following algorithm can be applied to the various kind of image processing such as region filling, restoration and region feature extraction.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.259-262
• /
• 2004

In most of the character recognition systems, the method of template matching or statistical method using hidden Markov model is used to extract and recognize feature shapes. In this paper, we used modified chain-code which has 8-directions but 4-codes, and made the chain-code of hand-written character, after that, converted it into transition chain-code by applying to HMM(Hidden Markov Model). The transition chain code by HMM is analyzed as signal flow graph by Mason's theory which is generally used to calculate forward gain at automatic control system. If the specific forward gain and feedback gain is properly set, the forward gain of transition chain-code using Mason's theory can be distinguished depending on each object for recognition. This data of the gain is reorganized as tree structure, hence making it possible to distinguish different hand-written characters. With this method, $91\%$ recognition rate was acquired.

• Journal of Computing Science and Engineering
• /
• 제10권2호
• /
• pp.39-50
• /
• 2016

In this paper, we present a comparative study of spatial domain features for writer identification and verification with different ink width conditions. The existing methods give high error rates, when comparing two handwritten images with different pen types. To the best of our knowledge, we are the first to design the feature with different ink width conditions. To address this problem, contour based features were extracted using a chain code method. To improve accuracy at higher levels, we considered histograms of chain code and variance in bins of histogram of chain code as features to discriminate handwriting samples. The system was trained and tested for 1,000 writers with two samples using different writing instruments. The feature performance is tested on our newly created dataset of 4,000 samples. The experimental results show that the histogram of chain code feature is good compared to other methods with false acceptance rate of 11.67%, false rejection rate of 36.70%, average error rates of 24.18%, and average verification accuracy of 75.89% on our new dataset. We also studied the effect of amount of text and dataset size on verification accuracy.

• 대한수학회지
• /
• 제59권1호
• /
• pp.193-204
• /
• 2022

We present construction methods for free self-orthogonal (self-dual or Type II) codes over ℤ₄[v]/〈v² + 2v〉 which is one of the finite commutative local non-chain Frobenius rings of order 16. By considering their Gray images on ℤ₄, we give a construct method for a code over ℤ₄. We have some new and optimal codes over ℤ₄ with respect to the minimum Lee weight or minimum Euclidean weight.

• 충청수학회지
• /
• 제33권2호
• /
• pp.255-270
• /
• 2020

We studied the MDS self-dual codes over finite chain rings. We stated the projection and lifting of codes over the finite chain rings with respect to the MDS self-dual codes, and then we applied the results to the MDS self-dual codes over Galois rings.

• 한국통신학회논문지
• /
• 제13권1호
• /
• pp.41-53
• /
• 1988

선도형은 디지털 영상의 형상과 특성을 표현하기에 가장 적합한 정보이므로 인식과 데이터 전송에 많이 사용되고 있다. 선도형의 부호화로는 8방향 체인코드가 가장 많이 사용되나. 보고에서는 선도형을 효율적으로 부호화하여 기존의 8방향 체인코드에 비해서 약 20% 정도의 데이터 압축 효과를 낼 수 있고 정확도를 요구하는 선도형의 부호화형식으로 사용될 수 있는 모드설정 체인부호화법을 새로이 제시하고 이것의 응용으로 선도형의 특징점이 될 수 있는 에지결정법을 제시한다. 이 부호화는 한 점의 8근방에 대하여 각 상한마다 기준모드를 설정하고, 이 기준모드에 3개의 방향코드를 할당하여 3비트로 하나의 선화소가 부호화되도록 한다.

• 융합보안논문지
• /
• 제14권4호
• /
• pp.19-26
• /
• 2014

모바일 악성코드는 웜에 의한 전파가 대표적이며, 웜의 확산 특징을 분석하기 위한 모델링 기법들이 제시되었지만 거시적인 분석만 가능하였고 특정 바이러스, 악성코드에 대해 예측하기는 한계점이 있다. 따라서 본 논문에서는 과거의 악성코드 데이터를 활용하여 미래의 악성코드의 발생을 예측 할 수 있는 마코프 체인을 기반으로 한 예측 방법을 제시하였다. 마코프 체인 예측 모델링에 적용할 악성코드 평균값은 전체 평균값, 최근 1년 평균값, 최근 평균값(6개월)의 세 가지 범위로 분류하여 적용하였고, 적용하여 얻어진 예측 값을 비교하여 최근 평균 값(6개월)을 적용하는 것이 악성코드 예측 확률을 높일 수 있음을 확인하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 춘계 학술대회 학술발표 논문집
• /
• pp.165-168
• /
• 2003

본 논문에서는 CCD 흑백 카메라를 이용하여 프로그래머의 알고리즘이 표현된 flowchart의 영상을 입력받아 C언어 코드로 변환하는 시스템을 구현하였다. 입력된 영상을 이진화 처리한 영상으로부터 flowchart 기호들을 인식하기 위하여 chain code 방법을 이용하였고, flowchart 기호에 기술된 영문자 및 특수문자의 인식을 위하여 가로 및 세로 히스토그램을 이용하여 한 문자색 분할한 후 각 문자들을 구성하는 흑화소 pixel의 합과 chain code 방법을 사용하였다. 가로 및 세로 투영을 이용하여 흐름선을 인식함으로써 flowchart의 논리흐름을 파악할 수 있었다. 이 시스템을 수치연산에 적용하여, 프로그래머의 알고리즘에 부합하는 프로그램이 작성되어짐을 확인할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 제13회 신호처리 합동 학술대회 논문집
• /
• pp.375-378
• /
• 2000

In this paper, we propose a novo] content-based image retrieval system using both Hidden Markov Model(HMM) and an improved chain code. The Gaussian Mixture Model(GMM) is applied to statistically model a color information of the image, and Deterministic Annealing EM(DAEM) algorithm is employed to estimate the parameters of GMM. This result is used to segment the given image. We use an improved chain code, which is invariant to rotation, translation and scale, to extract the feature vectors of the shape for each image in the database. These are stored together in the database with each HMM whose parameters (A, B, $\pi$) are estimated by Baum-Welch algorithm. With respect to feature vector obtained in the same way from the query image, a occurring probability of each image is computed by using the forward algorithm of HMM. We use these probabilities for the image retrieval and present the highest similarity images based on these probabilities.

• 한국군사과학기술학회지
• /
• 제10권1호
• /
• pp.101-106
• /
• 2007

In this paper, we propose chain code based decision technique of edge orientation. Edge Information is one of the most important information for handling image signals, and is applied to various civilian and military area, such as image surveillance for military reconnaissance, restoration of noised image signal, fingerprint recognition, and so on. The conventional methods to find edge orientations exploit a certain size of mask which weights for a certain direction, so they showed limitations in the case of diagonal edges except 45 degrees. We find edge orientations using chain code. According to the experiments, the proposed method shows better performance than the conventional approaches. The exact edge orientations including diagonal directions are well found.