• Title/Summary/Keyword: Unsupervised Approach

Search Result 140, Processing Time 0.026 seconds

Automatic Change Detection Using Unsupervised Saliency Guided Method with UAV and Aerial Images

  • Farkoushi, Mohammad Gholami;Choi, Yoonjo;Hong, Seunghwan;Bae, Junsu;Sohn, Hong-Gyoo
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.5_3
    • /
    • pp.1067-1076
    • /
    • 2020
  • In this paper, an unsupervised saliency guided change detection method using UAV and aerial imagery is proposed. Regions that are more different from other areas are salient, which make them more distinct. The existence of the substantial difference between two images makes saliency proper for guiding the change detection process. Change Vector Analysis (CVA), which has the capability of extracting of overall magnitude and direction of change from multi-spectral and temporal remote sensing data, is used for generating an initial difference image. Combined with an unsupervised CVA and the saliency, Principal Component Analysis(PCA), which is possible to implemented as the guide for change detection method, is proposed for UAV and aerial images. By implementing the saliency generation on the difference map extracted via the CVA, potentially changed areas obtained, and by thresholding the saliency map, most of the interest areas correctly extracted. Finally, the PCA method is implemented to extract features, and K-means clustering is applied to detect changed and unchanged map on the extracted areas. This proposed method is applied to the image sets over the flooded and typhoon-damaged area and is resulted in 95 percent better than the PCA approach compared with manually extracted ground truth for all the data sets. Finally, we compared our approach with the PCA K-means method to show the effectiveness of the method.

Multiple Texture Objects Extraction with Self-organizing Optimal Gabor-filter (자기조직형 최적 가버필터에 의한 다중 텍스쳐 오브젝트 추출)

  • Lee, Woo-Beom;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.311-320
    • /
    • 2003
  • The Optimal filter yielding optimal texture feature separation is a most effective technique for extracting the texture objects from multiple textures images. But, most optimal filter design approaches are restricted to the issue of supervised problems. No full-unsupervised method is based on the recognition of texture objects in image. We propose a novel approach that uses unsupervised learning schemes for efficient texture image analysis, and the band-pass feature of Gabor-filter is used for the optimal filter design. In our approach, the self-organizing neural network for multiple texture image identification is based on block-based clustering. The optimal frequency of Gabor-filter is turned to the optimal frequency of the distinct texture in frequency domain by analyzing the spatial frequency. In order to show the performance of the designed filters, after we have attempted to build a various texture images. The texture objects extraction is achieved by using the designed Gabor-filter. Our experimental results show that the performance of the system is very successful.

Building Topic Hierarchy of e-Documents using Text Mining Technology

  • Kim, Han-Joon
    • Proceedings of the CALSEC Conference
    • /
    • 2004.02a
    • /
    • pp.294-301
    • /
    • 2004
  • ·Text-mining approach to e-documents organization based on topic hierarchy - Machine-Learning & information Theory-based ㆍ 'Category(topic) discovery' problem → document bundle-based user-constraint document clustering ㆍ 'Automatic categorization' problem → Accelerated EM with CU-based active learning → 'Hierarchy Construction' problem → Unsupervised learning of category subsumption relation

  • PDF

Improved Linear Dynamical System for Unsupervised Time Series Recognition

  • Thi, Ngoc Anh Nguyen;Yang, Hyung-Jeong;Kim, Soo-Hyung;Lee, Guee-Sang;Kim, Sun-Hee
    • International Journal of Contents
    • /
    • v.10 no.1
    • /
    • pp.47-53
    • /
    • 2014
  • The paper considers the challenges involved in measuring the similarities between time series, such as time shifts and the mixture of frequencies. To improve recognition accuracy, we investigate an improved linear dynamical system for discovering prominent features by exploiting the evolving dynamics and correlations in a time series, as the quality of unsupervised pattern recognition relies strongly on the extracted features. The proposed approach yields a set of compact extracted features that boosts the accuracy and reliability of clustering for time series data. Experimental evaluations are carried out on time series applications from the scientific, socio-economic, and business domains. The results show that our method exhibits improved clustering performance compared to conventional methods. In addition, the computation time of the proposed approach increases linearly with the length of the time series.

Multiple Texture Image Recognition with Unsupervised Block-based Clustering (비교사 블록-기반 군집에 의한 다중 텍스쳐 영상 인식)

  • Lee, Woo-Beom;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.327-336
    • /
    • 2002
  • Texture analysis is an important technique in many image understanding areas, such as perception of surface, object, shape and depth. But the previous works are intend to the issue of only texture segment, that is not capable of acquiring recognition information. No unsupervised method is basased on the recognition of texture in image. we propose a novel approach for efficient texture image analysis that uses unsupervised learning schemes for the texture recognition. The self-organization neural network for multiple texture image identification is based on block-based clustering and merging. The texture features used are the angle and magnitude in orientation-field that might be different from the sample textures. In order to show the performance of the proposed system, After we have attempted to build a various texture images. The final segmentation is achieved by using efficient edge detection algorithm applying to block-based dilation. The experimental results show that the performance of the system Is very successful.

A Text Detection Method Using Wavelet Packet Analysis and Unsupervised Classifier

  • Lee, Geum-Boon;Odoyo Wilfred O.;Kim, Kuk-Se;Cho, Beom-Joon
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.4
    • /
    • pp.174-179
    • /
    • 2006
  • In this paper we present a text detection method inspired by wavelet packet analysis and improved fuzzy clustering algorithm(IAFC).This approach assumes that the text and non-text regions are considered as two different texture regions. The text detection is achieved by using wavelet packet analysis as a feature analysis. The wavelet packet analysis is a method of wavelet decomposition that offers a richer range of possibilities for document image. From these multi scale features, we adapt the improved fuzzy clustering algorithm based on the unsupervised learning rule. The results show that our text detection method is effective for document images scanned from newspapers and journals.

Efficient Classification of High Resolution Imagery for Urban Area

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.6
    • /
    • pp.717-728
    • /
    • 2011
  • An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.

Efficient Multistage Approach for Unsupervised Image Classification

  • Lee Sanghoon
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.428-431
    • /
    • 2004
  • A multi-stage hierarchical clustering technique, which is an unsupervised technique, has been proposed in this paper for classifying the hyperspectral data .. The multistage algorithm consists of two stages. The 'local' segmentor of the first stage performs region-growing segmentation by employing the hierarchical clustering procedure with the restriction that pixels in a cluster must be spatially contiguous. The 'global' segmentor of the second stage, which has not spatial constraints for merging, clusters the segments resulting from the previous stage, using a context-free similarity measure. This study applied the multistage hierarchical clustering method to the data generated by band reduction, band selection and data compression. The classification results were compared with them using full bands.

  • PDF

Unsupervised Image Classification for Large Remotely-sensed Imagery using Regiongrowing Segmentation

  • Lee, Sang-Hoon
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.188-190
    • /
    • 2006
  • A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The local segmentor of the first stage performs regiongrowing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. This stage uses a sliding window strategy with boundary blocking to alleviate a computational problem in computer memory for an enormous data. The global segmentor of the second stage has not spatial constraints for merging to classify the segments resulting from the previous stage. The experimental results show that the new approach proposed in this study efficiently performs the segmentation for the images of very large size and an extensive number of bands

  • PDF

Neural Learning Algorithms for Independent Component Analysis

  • Choi, Seung-Jin
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.24-33
    • /
    • 1998
  • Independent Component analysis (ICA) is a new statistical method for extracting statistically independent components from their linear instantaneous mixtures which are generated by an unknown linear generative model. The recognition model is learned in unsupervised manner so that the recovered signals by the recognition model become the possibly scaled estimates of original source signals. This paper addresses the neural learning approach to ICA. As recognition models a linear feedforward network and a linear feedback network are considered. Associated learning algorithms for both networks are derived from maximum likelihood and information-theoretic approaches, using natural Riemannian gradient [1]. Theoretical results are confirmed by extensive computer simulations.

  • PDF