• 전자공학회논문지CI
• /
• 제47권1호
• /
• pp.152-159
• /
• 2010

본 논문에서는 기울어진 문자, 다양한 크기, 글씨체, 흐린 문자를 포함한 입력영상의 문자 복원과 인식, 효율적인 도서 검색을 위한 광학문자인식 알고리즘을 제안한다. 본 논문에서 제안한 광학문자 인식알고리즘은 검출부와 인식부로 구성되며, 검출부에서는 복잡한 배경에서 정확한 도서 영역 검출을 위하여 로버츠 에지 연산자와 허도로프 거리 알고리즘을 적용하여 필요한 영역을 검출하였다. 또한 인식부에서는 문자의 크기와 경사도, 부분 손실 등의 영상에 강인성을 갖는 바이큐빅 보간법을 적용하여 데이터 손실 복원과, 반자동 기울기를 갖는 입력 영상의 보정을 하였다. 모의실험 결과 기존 알고리즘 보다 인식률에서는 6%, 검색시간에서는 1.077초 더 우수함을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.413-435
• /
• 2018

Although the accuracy of handwritten character recognition based on deep networks has been shown to be superior to that of the traditional method, the use of an overly deep network significantly increases time consumption during parameter training. For this reason, this paper took the training time and recognition accuracy into consideration and proposed a novel handwritten character recognition algorithm with newly designed network structure, which is based on an extended nonlinear kernel residual network. This network is a non-extremely deep network, and its main design is as follows:(1) Design of an unsupervised apriori algorithm for intra-class clustering, making the subsequent network training more pertinent; (2) presentation of an intermediate convolution model with a pre-processed width level of 2;(3) presentation of a composite residual structure that designs a multi-level quick link; and (4) addition of a Dropout layer after the parameter optimization. The algorithm shows superior results on MNIST and SVHN dataset, which are two character benchmark recognition datasets, and achieves better recognition accuracy and higher recognition efficiency than other deep structures with the same number of layers.

• 정보과학회 논문지
• /
• 제43권8호
• /
• pp.848-856
• /
• 2016

해상 안전을 위한 선박의 탐색 및 식별은 매우 중요하다. 선박의 탐색은 레이더로 가능하나, 식별은 선박자동식별장치, 통신장비, 시각 등에 의해 이루어지며, 이러한 식별수단이 불능 시 레이더 운용자의 경험과 지식을 바탕으로 선박의 기동특성을 참고하여 식별하는 매우 어려운 경우가 발생한다. 본 논문에서는 지속적인 관찰임무를 수행해야 할 선박 탐색요원의 임무를 보조하기 위하여 레이더 상 선박의 기동특성을 이용, 자동식별 및 사고발생 가능성을 탐지하는 방법을 제안한다. 4가지 유형의 선박 정보, 레이더 상 접촉거리 및 침로, 속력을 이용하여 그 특징을 추출하고, SVM을 활용하여 식별 정확도를 평가하였으며, 이를 이용한 자동식별 알고리즘을 통해 사고발생 가능성이 있는 선박을 선별하는 방법을 제시하였다. 실험 결과 90% 이상의 식별 정확도를 보였으며, 실제 사고선박인 세월호의 정보를 자동식별 알고리즘에 적용하여 선별 가능함을 보였다. 이 방법은 다양한 상황에서 선박 탐색요원의 경험과 지식을 효과적으로 보완하고, 다수의 선박 중 관심필요선박을 사전 식별하여 정보를 제공함으로서 탐색요원의 노력을 경감시키고, 문제점을 보다 빨리 인지하는데 도움이 될 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2824-2838
• /
• 2013

There has been a lot of attention paid recently to analyze dynamic human gestures that vary over time. Most attention to dynamic gestures concerns with spatio-temporal features, as compared to analyzing each frame of gestures separately. For accurate dynamic gesture recognition, motion feature extraction algorithms need to find representative features that uniquely identify time-varying gestures. This paper proposes a new feature-extraction algorithm using temporal self-similarity based on a hierarchical human model. Because a conventional temporal self-similarity method computes a whole movement among the continuous frames, the conventional temporal self-similarity method cannot recognize different gestures with the same amount of movement. The proposed model-based temporal self-similarity method groups body parts of a hierarchical model into several sets and calculates movements for each set. While recognition results can depend on how the sets are made, the best way to find optimal sets is to separate frequently used body parts from less-used body parts. Then, we apply a multiclass support vector machine whose optimization algorithm is based on structural support vector machines. In this paper, the effectiveness of the proposed feature extraction algorithm is demonstrated in an application for taebo gesture recognition. We show that the model-based temporal self-similarity method can overcome the shortcomings of the conventional temporal self-similarity method and the recognition results of the model-based method are superior to that of the conventional method.

• 한국통신학회논문지
• /
• 제30권9C호
• /
• pp.907-912
• /
• 2005

H/W에 구현되는 음성인식 시스템에서 인식속도의 향상을 위한 새로운 알고리즘이 본 논문에서 제안되었다. 제안된 고속 관측확률 계산(Fast Computation of Observation Probability : FCOP) 알고리즘은 관측확률식을 근사화시키는 방법으로, CDHMM에서 상태(state)로 주어지는 확률분포함수들 중에서 일부를 효과적으로 제거하여 계산량을 최소화시키는 방법이다. 실제 H/W 환경의 음성인식에 응용한 실험 결과, 기존의 방법에 비해 인식률의 저하를 최소로 유지하며, 명령어 사이클을 $20\%\~32\%$ 감소시킬 수 있었으며, 인식속도를 약 $30\%$향상시킬 수 있었다. 제안된 알고리즘을 제한된 자원을 가지는 실제의 휴대폰에 탑재하여. 인식속도 및 인식률을 측정한 결과 인식률의 저하를 $0.2\%$ 이하로 유지하면서, 인식속도를 $30\%$ 이상 증가시킬 수 있었다.

• 한국지능시스템학회논문지
• /
• 제14권3호
• /
• pp.349-356
• /
• 2004

The automatic recognition of transport containers using image processing is very hard because of the irregular size and position of identifiers, diverse colors of background and identifiers, and the impaired shapes of identifiers caused by container damages and the bent surface of container, etc. In this paper we propose and evaluate a novel recognition algorithm for container identifiers that effectively overcomes these difficulties and recognizes identifiers from container images captured in various environments. The proposed algorithm, first, extracts the area containing only the identifiers from container images by using CANNY masking and bi-directional histogram method. The extracted identifier area is binarized by the fuzzy binarization method newly proposed in this paper. Then a contour tracking method is applied to the binarized area in order to extract the container identifiers which are the target for recognition. In this paper we also propose and apply a novel ART2-based hybrid network for recognition of container identifiers. The results of experiment for performance evaluation on the real container images showed that the proposed algorithm performs better for extraction and recognition of container identifiers compared to conventional algorithms.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.88-95
• /
• 2003

The automatic recognition of transport containers using image processing is very hard because of the irregular size and position of identifiers, diverse colors of background and identifiers, and the impaired shapes of identifiers caused by container damages and the bent surface of container, etc. We proposed and evaluated the novel recognition algorithm of container identifiers that overcomes effectively the hardness and recognizes identifiers from container images captured in the various environments. The proposed algorithm, first, extracts the area including only all identifiers from container images by using CANNY masking and bi-directional histogram method. The extracted identifier area is binarized by the fuzzy binarization method newly proposed in this paper and by applying contour tracking method to the binarized area, container identifiers which are targets of recognition are extracted. We proposed and applied the ART2-based RBF network for recognition of container identifiers. The results of experiment for performance evaluation on the real container images showed that the proposed algorithm has more improved performance in the extraction and recognition of container identifiers than the previous algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.196-212
• /
• 2014

Facial expression recognition is an important part in emotional interaction between human and machine. This paper proposes a facial expression recognition approach based on multi-classifier fusion with stacking algorithm. The kappa-error diagram is employed in base-level classifiers selection, which gains insights about which individual classifier has the better recognition performance and how diverse among them to help improve the recognition accuracy rate by fusing the complementary functions. In order to avoid the influence of the chance factor caused by guessing in algorithm evaluation and get more reliable awareness of algorithm performance, kappa and informedness besides accuracy are utilized as measure criteria in the comparison experiments. To verify the effectiveness of our approach, two public databases are used in the experiments. The experiment results show that compared with individual classifier and two other typical ensemble methods, our proposed stacked ensemble system does recognize facial expression more accurately with less standard deviation. It overcomes the individual classifier's bias and achieves more reliable recognition results.

• Journal of Multimedia Information System
• /
• 제9권1호
• /
• pp.1-10
• /
• 2022

China is a big country in animal fur industry. The total production and consumption of fur are increasing year by year. However, the recognition of fur in the fur production process still mainly relies on the visual identification of skilled workers, and the stability and consistency of products cannot be guaranteed. In response to this problem, this paper proposes a feature fusion-based animal fur recognition network on the basis of typical convolutional neural network structure, relying on rapidly developing deep learning techniques. This network superimposes texture feature - the most prominent feature of fur image - into the channel dimension of input image. The output feature map of the first layer convolution is inverted to obtain the inverted feature map and concat it into the original output feature map, then Leaky ReLU is used for activation, which makes full use of the texture information of fur image and the inverted feature information. Experimental results show that the algorithm improves the recognition accuracy by 9.08% on Fur_Recognition dataset and 6.41% on CIFAR-10 dataset. The algorithm in this paper can change the current situation that fur recognition relies on manual visual method to classify, and can lay foundation for improving the efficiency of fur production technology.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.368-391
• /
• 2018

Face recognition (FR) with a single sample per person (SSPP) is common in real-world face recognition applications. In this scenario, it is hard to predict intra-class variations of query samples by gallery samples due to the lack of sufficient training samples. Inspired by the fact that similar faces have similar intra-class variations, we propose a virtual sample generating algorithm called k nearest neighbors based virtual sample generating (kNNVSG) to enrich intra-class variation information for training samples. Furthermore, in order to use the intra-class variation information of the virtual samples generated by kNNVSG algorithm, we propose image set based multimanifold discriminant learning (ISMMDL) algorithm. For ISMMDL algorithm, it learns a projection matrix for each manifold modeled by the local patches of the images of each class, which aims to minimize the margins of intra-manifold and maximize the margins of inter-manifold simultaneously in low-dimensional feature space. Finally, by comprehensively using kNNVSG and ISMMDL algorithms, we propose k nearest neighbor virtual image set based multimanifold discriminant learning (kNNMMDL) approach for single sample face recognition (SSFR) tasks. Experimental results on AR, Multi-PIE and LFW face datasets demonstrate that our approach has promising abilities for SSFR with expression, illumination and disguise variations.