• Title/Summary/Keyword: image clustering

Search Result 599, Processing Time 0.02 seconds

Word Segmentation in Handwritten Korean Text Lines based on GAP Clustering (GAP 군집화에 기반한 필기 한글 단어 분리)

  • Jeong, Seon-Hwa;Kim, Soo-Hyung
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.6
    • /
    • pp.660-667
    • /
    • 2000
  • In this paper, a word segmentation method for handwritten Korean text line images is proposed. The method uses gap information to segment words in line images, where the gap is defined as a white run obtained after vertical projection of line images. Each gap is assigned to one of inter-word gap and inter-character gap based on gap distance. We take up three distance measures which have been proposed for the word segmentation of handwritten English text line images. Then we test three clustering techniques to detect the best combination of gap metrics and classification techniques for Korean text line images. The experiment has been done with 305 text line images extracted manually from live mail pieces. The experimental result demonstrates the superiority of BB(Bounding Box) distance measure and sequential clustering approach, in which the cumulative word segmentation accuracy up to the third hypothesis is 88.52%. Given a line image, the processing time is about 0.05 second.

  • PDF

A new Design of Granular-oriented Self-organizing Polynomial Neural Networks (입자화 중심 자기구성 다항식 신경 회로망의 새로운 설계)

  • Oh, Sung-Kwun;Park, Ho-Sung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.2
    • /
    • pp.312-320
    • /
    • 2012
  • In this study, we introduce a new design methodology of a granular-oriented self-organizing polynomial neural networks (GoSOPNNs) that is based on multi-layer perceptron with Context-based Polynomial Neurons (CPNs) or Polynomial Neurons (PNs). In contrast to the typical architectures encountered in polynomial neural networks (PNN), our main objective is to develop a methodological design strategy of GoSOPNNs as follows : (a) The 1st layer of the proposed network consists of Context-based Polynomial Neuron (CPN). In here, CPN is fully reflective of the structure encountered in numeric data which are granulated with the aid of Context-based Fuzzy C-Means (C-FCM) clustering method. The context-based clustering supporting the design of information granules is completed in the space of the input data while the build of the clusters is guided by a collection of some predefined fuzzy sets (so-called contexts) defined in the output space. (b) The proposed design procedure being applied at each layer of GoSOPNN leads to the selection of preferred nodes of the network (CPNs or PNs) whose local characteristics (such as the number of contexts, the number of clusters, a collection of the specific subset of input variables, and the order of the polynomial) can be easily adjusted. These options contribute to the flexibility as well as simplicity and compactness of the resulting architecture of the network. For the evaluation of performance of the proposed GoSOPNN network, we describe a detailed characteristic of the proposed model using a well-known learning machine data(Automobile Miles Per Gallon Data, Boston Housing Data, Medical Image System Data).

Robust k-means Clustering-based High-speed Barcode Decoding Method to Blur and Illumination Variation (블러와 조명 변화에 강인한 k-means 클러스터링 기반 고속 바코드 정보 추출 방법)

  • Kim, Geun-Jun;Cho, Hosang;Kang, Bongsoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.1
    • /
    • pp.58-64
    • /
    • 2016
  • In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.

Clustering Technique Using Relevance of Data and Applied Algorithms (데이터와 적용되는 알고리즘의 연관성을 이용한 클러스터링 기법)

  • Han Woo-Yeon;Nam Mi-Young;Rhee PhillKyu
    • The KIPS Transactions:PartB
    • /
    • v.12B no.5 s.101
    • /
    • pp.577-586
    • /
    • 2005
  • Many algorithms have been proposed for (ace recognition that is one of the most successful applications in image processing, pattern recognition and computer vision fields. Research for what kind of attribute of face that make harder or easier recognizing the target is going on recently. In flus paper, we propose method to improve recognition performance using relevance of face data and applied algorithms, because recognition performance of each algorithm according to facial attribute(illumination and expression) is change. In the experiment, we use n-tuple classifier, PCA and Gabor wavelet as recognition algorithm. And we propose three vectorization methods. First of all, we estimate the fitnesses of three recognition algorithms about each cluster after clustering the test data using k-means algorithm then we compose new clusters by integrating clusters that select same algorithm. We estimate similarity about a new cluster of test data and then we recognize the target using the nearest cluster. As a result, we can observe that the recognition performance has improved than the performance by a single algorithm without clustering.

Automatic Color Palette Extraction for Paintings Using Color Grouping and Clustering (색상 그룹핑과 클러스터링을 이용한 회화 작품의 자동 팔레트 추출)

  • Lee, Ik-Ki;Lee, Chang-Ha;Park, Jae-Hwa
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.7
    • /
    • pp.340-353
    • /
    • 2008
  • A computational color palette extraction model is introduced to describe paint brush objectively and efficiently. In this model, a color palette is defined as a minimum set of colors in which a painting can be displayed within error allowance and extracted by the two step processing of color grouping and major color extraction. The color grouping controls the resolution of colors adaptively and produces a basic color set of given painting images. The final palette is obtained from the basic color set by applying weighted k-means clustering algorithm. The extracted palettes from several famous painters are displayed in a 3-D color space to show the distinctive palette styles using RGB and CIE LAB color models individually. And the two experiments of painter classification and color transform of photographic image has been done to check the performance of the proposed method. The results shows the possibility that the proposed palette model can be a computational color analysis metric to describe the paint brush, and can be a color transform tool for computer graphics.

The Clustering Threshold Image Processing Technique in fMRI (핵자기 뇌기능 영상에서 군집경계기법을 이용한 영상처리법)

  • Jeong, Sun-Cheol;No, Yong-Man;Jo, Jang-Hui
    • Journal of Biomedical Engineering Research
    • /
    • v.16 no.4
    • /
    • pp.425-430
    • /
    • 1995
  • The correlation technique has been widely used in ctRl data processing. The proposed CLT (clus- tering threshold) technique is a modified CCT (correlation coefficient threshold) technique and has many advantages compared with the conventional CCT technique. The CLT technique is explained by the following two steps. First, once the correlation coefficient map above the proper TH value is obtained using the CCT technique which is discrete and includes splash noise data, then the spurious pixels are rejected and the real neural activity pixels extracted using an nxn matrix box. Second, a clustering operation is performed by the two correction rules. The real neuronal activated pixels can be clustered and the false spurious pixels can be suppressed by the proposed CLT technique. The proposed CLT technique used in the post processing in ctRl has advantages over other existing techniques. It is especially proved to be robust in noisy environment.

  • PDF

Recovery of Missing Motion Vectors Using Modified ALA Clustering Algorithm (수정된 ALA 클러스터링 알고리즘을 이용한 손실된 움직임 벡터 복원 방법)

  • Son, Nam-Rye;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.12B no.7 s.103
    • /
    • pp.755-760
    • /
    • 2005
  • To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.

A Study on the Classification for Satellite Images using Hybrid Method (하이브리드 분류기법을 이용한 위성영상의 분류에 관한 연구)

  • Jeon, Young-Joon;Kim, Jin-Il
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.159-168
    • /
    • 2004
  • This paper presents hybrid classification method to improve the performance of satellite images classification by combining Bayesian maximum likelihood classifier, ISODATA clustering and fuzzy C-Means algorithm. In this paper, the training data of each class were generated by separating the spectral signature using ISODATA clustering. We can classify according to pixel's membership grade followed by cluster center of fuzzy C-Means algorithm as the mean value of training data for each class. Bayesian maximum likelihood classifier is performed with prior probability by result of fuzzy C-Means classification. The results shows that proposed method could improve performance of classification method and also perform classification with no concern about spectral signature of the training data. The proposed method Is applied to a Landsat TM satellite image for the verifying test.

Cluster-based Linear Projection and %ixture of Experts Model for ATR System (자동 목표물 인식 시스템을 위한 클러스터 기반 투영기법과 혼합 전문가 구조)

  • 신호철;최재철;이진성;조주현;김성대
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.3
    • /
    • pp.203-216
    • /
    • 2003
  • In this paper a new feature extraction and target classification method is proposed for the recognition part of FLIR(Forwar Looking Infrared)-image-based ATR system. Proposed feature extraction method is "cluster(=set of classes)-based"version of previous fisherfaces method that is known by its robustness to illumination changes in face recognition. Expecially introduced class clustering and cluster-based projection method maximizes the performance of fisherfaces method. Proposed target image classification method is based on the mixture of experts model which consists of RBF-type experts and MLP-type gating networks. Mixture of experts model is well-suited with ATR system because it should recognizee various targets in complexed feature space by variously mixed conditions. In proposed classification method, one expert takes charge of one cluster and the separated structure with experts reduces the complexity of feature space and achieves more accurate local discrimination between classes. Proposed feature extraction and classification method showed distinguished performances in recognition test with customized. FLIR-vehicle-image database. Expecially robustness to pixelwise sensor noise and un-wanted intensity variations was verified by simulation.

MONITORING OF MOUNTAINOUS AREAS USING SIMULATED IMAGES TO KOMPSAT-II

  • Chang Eun-Mi;Shin Soo-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.653-655
    • /
    • 2005
  • More than 70 percent of terrestrial territory of Korea is mountainous areas where degradation becomes serious year by year due to illegal tombs, expanding golf courses and stone mine development. We elaborate the potential usage of high resolution image for the monitoring of the phenomena. We made the classification of tombs and the statistical radiometric characteristics of graves were identified from this project. The graves could be classified to 4 groups from the field survey. As compared with grouping data after clustering and discriminant analysis, the two results coincided with each other. Object-oriented classification algorithm for feature extraction was theoretically researched in this project. And we did a pilot project, which was performed with mixed methods. That is, the conventional methods such as unsupervised and supervised classification were mixed up with the new method for feature extraction, object-oriented classification method. This methodology showed about $60\%$ classification accuracy for extracting tombs from satellite imagery. The extraction of tombs' geographical coordinates and graves themselves from satellite image was performed in this project. The stone mines and golf courses are extracted by NDVI and GVI. The accuracy of classification was around 89 percent. The location accuracy showed extraction of tombs from one-meter resolution image is cheaper and quicker way than GPS method. Finally we interviewed local government officers and made analyses on the current situation of mountainous area management and potential usage of KOMPSAT-II images. Based on the requirement analysis, we developed software, which is to management and monitoring system for mountainous area for local government.

  • PDF