• Journal of Korea Multimedia Society
• /
• v.8 no.10
• /
• pp.1347-1359
• /
• 2005

We propose an efficient block classification of the document images using the second-order statistical texture features computed from spatial gray level dependence matrix (SGLDM). We studied on the techniques that will improve the block speed of the segmentation and feature extraction speed and the accuracy of the detailed classification. In order to speedup the block segmentation, we binarize the gray level image and then segmented by applying smoothing method instead of using texture features of gray level images. We extracted seven texture features from the SGLDM of the gray image blocks and we applied these normalized features to the BP (backpropagation) neural network, and classified the segmented blocks into the six detailed block categories of small font, medium font, large font, graphic, table, and photo blocks. Unlike the conventional texture classification of the gray level image in aerial terrain photos, we improve the classification speed by a single application of the texture discrimination mask, the size of which Is the same as that of each block already segmented in obtaining the SGLDM.

• ICROS
• /
• v.3 no.5
• /
• pp.43-50
• /
• 1997

이 글에서는 이진 증류탑을 위한 적응 제어 기법에 대해 소개하였다. 제안된 방법은 최근 개발된 다변수 예측 제어 알고리즘과 공분산 행렬 정규화 기능을 갖는 추정 알고리즘에 기초하고 있다. 이러한 적응 시스템은 그 설계과정이 복잡하지 않아 실저적 적용 가능성이 높다는 점에서 가치가 있다. 필터를 제외하면 단 두 개의 제어기 상수만이 결정되면 되고, 더욱이 이들이 공정의 상승 및 정정 시간과 관련되어 그 설정이 쉽다는 중요한 특징을 갖는다. 이와 같은 제어기 설계의 간소화에도 불구하고 증류탑의 설정값 추종 성능 및 Feed 변화에 대한 제어 성능의 우수함을 공정 모사를 통해 확인하였다.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2016.11a
• /
• pp.304-306
• /
• 2016

본 논문에서는 기계학습 방법에 기반을 둔 119 긴급 신고 전화 전사 데이터에 대한 구급, 구조, 화재 상황 분류 알고리즘을 개발하였다. 신고전화에서 빈번하게 발생하는 비정형 발화 패턴을 효율적으로 정규화하고 자연어 문장 처리 기법에서 일반적으로 사용하는 방법을 적용하여 신고전화 텍스트 데이터를 기계학습에서 사용할 수 있는 특징 벡터로 재구성하였다. 2743개의 신고전화에 대해 선형 서포트 벡터 머신을 이용하여 상황 분류를 수행한 결과, 92% 의 정확도를 얻을 수 있었다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2001

본 논문에서는 정규화된 데이터 공간과 가우스함수에 의한 산 함수 형성 그리고 형성된 산의 기울기를 이용한 산봉우리 붕괴를 특징으로 하는 개선된 산 클러스터링 방법을 제안한다. 이 개선된 방법은 기존의 Yager 등에 의하여 제안된 방법이 조정해야 하는 매개변수가 3개이고 발견된 클러스터 중심 주위에 원치 않는 다른 중심이 발생할 수 있는데 반하여 단지 하나의 매개변수 $\omega$의 조정으로 더욱 타당한 중심을 찾아내는 점에서 유용하다 할 수 있다. 또한 매개변수 $\omega$에 대한 적절한 선정 방법을 제시하고, 수치 자료에 대한 컴퓨터 모의실험을 통하여 개선된 산 클러스터링 방법의 유용성을 입증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.335-337
• /
• 2000

본 연구에서는 문자 인식의 응용으로서 인쇄된 우편봉투의 주소를 인식한다. 스캐너로 입력된 우편봉투 영상으로부터 주소영역과 우편번호 영역을 분리한다. 분리된 각각의 영역에서 문자를 추출하고, 전처리로써 정규화, 특징추출 단계를 거쳐 우편번호와 주소를 각각 인식하였다. 이때, 우편번호 인식에 의하여 알 수 있는 주소와 실제로 인식한 주소의 신뢰도를 계산하여, 주소 인식 결과를 보정하는 과정을 거쳐 우편봉투의 인식을 실행하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1
• /
• pp.61-74
• /
• 2004

In this paper, a contort- and speaker-dependent cepstrum extraction method and a channel normalization method for minimizing the loss of speaker characteristics in the cepstrum were proposed for a robust speaker recognition system over the channel. The proposed extraction method creates a cepstrum based on the pitch synchronous analysis using the inherent pitch of the speaker. Therefore, the cepstrum called the 〃pitch synchronous cepstrum〃 (PSC) represents the impulse response of the vocal tract more accurately in voiced speech. And the PSC can compensate for channel distortion because the pitch is more robust in a channel environment than the spectrum of speech. And the proposed channel normalization method, the 〃formant-broadened pitch synchronous CMS〃 (FBPSCMS), applies the Formant-Broadened CMS to the PSC and improves the accuracy of the intraframe processing. We compared the text-independent closed-set speaker identification on 56 females and 112 males using TIMIT and NTIMIT database, respectively. The results show that pitch synchronous km improves the error reduction rate by up to 7.7% in comparison with conventional short-time cepstrum and the error rates of the FBPSCMS are more stable and lower than those of pole-filtered CMS.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.3
• /
• pp.21-26
• /
• 2003

A new method to realize 3-dimensional object pattern recognition system using Fourier-based feature extractor has been proposed. The procedure to obtain the invariant feature vector is as follows ; A closed surface is generated by tracing the surface of object using the 3-dimensional polar coordinate. The centroidal distances between object's geometrical center and each closed surface points are calculated. The distance vector is translation invariant. The distance vector is normalized, so the result is scale invariant. The Fourier spectrum of each normalized distance vector is calculated, and the spectrum is rotation invariant. The Fourier-based feature generating from above procedure completely eliminates the effect of variations in translation, scale, and rotation of 3-dimensional object with closed-surface. The experimental results show that the proposed method has a high accuracy.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.459-465
• /
• 2013

This paper is a study on an object extraction method which using color features of an object and background in the image. A human recognizes an object through the color difference of object and background in the image. So we must to emphasize the color's difference that apply to extraction result in this image. Therefore, we have converted to HSV color images which similar to human visual system from original RGB images, and have created two each other images that applied Median Filter and we merged two Median filtered images. And we have applied the Mean Shift algorithm which a data clustering method for clustering color features. Finally, we have normalized 3 image channels to 1 image channel for binarization process. And we have created object map through the binarization which using average value of whole pixels as a threshold. Then, have extracted major object from original image use that object map.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.362-371
• /
• 2003

In this paper, we propose an optimal interest point extraction method to support shape-base image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of the shape contour. The threshold is determined dynamically by comparing the contour length ratio of the original shape and the approximated polygon while the algorithm is running. Because our algorithm considers the characteristics of the shape contour, it can minimize the number of interest points. For n points of the contour, the proposed algorithm has O(nlogn) computational cost on an average to extract the number of m optimal interest points. Experiments were performed on the 70 synthetic shapes of 7 different contour types and 1100 fish shapes. It shows the average optimization ratio up to 0.92 and has 14% improvement, compared to the fixed threshold method. The shape features extracted from our proposed method can be used for shape-based image classification, indexing, and similarity search via normalization.

• Journal of Internet Computing and Services
• /
• v.18 no.5
• /
• pp.47-53
• /
• 2017

In past few years, high-throughput sequencing, big-data generation, cloud computing, and computational biology are revolutionary. RNA sequencing is emerging as an attractive alternative to DNA microarrays. And the methods for constructing Gene Regulatory Network (GRN) from RNA-Seq are extremely lacking and urgently required. Because GRN has obtained substantial observation from genomics and bioinformatics, an elementary requirement of the GRN has been to maximize distinguishable genes. Despite of RNA sequencing techniques to generate a big amount of data, there are few computational methods to exploit the huge amount of the big data. Therefore, we have suggested a novel gene selection algorithm combining Support Vector Machines and Intensity-dependent normalization, which uses log differential expression ratio in RNAseq. It is an extended variation of support vector machine recursive feature elimination (SVM-RFE) algorithm. This algorithm accomplishes minimum relevancy with subsets of Big-Data, such as NCBI-GEO. The proposed algorithm was compared to the existing one which uses gene expression profiling DNA microarrays. It finds that the proposed algorithm have provided as convenient and quick method than previous because it uses all functions in R package and have more improvement with regard to the classification accuracy based on gene ontology and time consuming in terms of Big-Data. The comparison was performed based on the number of genes selected in RNAseq Big-Data.