48,767 research outputs found
Hyperspectral images segmentation: a proposal
Hyper-Spectral Imaging (HIS) also known as chemical or spectroscopic imaging is an emerging technique that combines
imaging and spectroscopy to capture both spectral and spatial information from an object. Hyperspectral images are
made up of contiguous wavebands in a given spectral band. These images provide information on the chemical
make-up profile of objects, thus allowing the differentiation of objects of the same colour but which possess make-up
profile. Yet, whatever the application field, most of the methods devoted to HIS processing conduct data analysis without
taking into account spatial information.Pixels are processed individually, as an array of spectral data without any spatial
structure. Standard classification approaches are thus widely used (k-means, fuzzy-c-means hierarchical
classification...). Linear modelling methods such as Partial Least Square analysis (PLS) or non linear approaches like
support vector machine (SVM) are also used at different scales (remote sensing or laboratory applications). However,
with the development of high resolution sensors, coupled exploitation of spectral and spatial information to process
complex images, would appear to be a very relevant approach. However, few methods are proposed in the litterature.
The most recent approaches can be broadly classified in two main categories. The first ones are related to a direct
extension of individual pixel classification methods using just the spectral dimension (k-means, fuzzy-c-means or FCM,
Support Vector Machine or SVM). Spatial dimension is integrated as an additionnal classification parameter (Markov
fields with local homogeneity constrainst [5], Support Vector Machine or SVM with spectral and spatial kernels
combination [2], geometrically guided fuzzy C-means [3]...). The second ones combine the two fields related to each
dimension (spectral and spatial), namely chemometric and image analysis. Various strategies have been attempted. The
first one is to rely on chemometrics methods (Principal Component Analysis or PCA, Independant Component Analysis or
ICA, Curvilinear Component Analysis...) to reduce the spectral dimension and then to apply standard images processing technics on the resulting score images i.e. data projection on a subspace. Another approach is to extend the definition
of basic image processing operators to this new dimensionality (morphological operators for example [1, 4]).
However, the approaches mentioned above tend to favour only one description either directly or indirectly (spectral or
spatial). The purpose of this paper is to propose a hyperspectral processing approach that strikes a better balance in the
treatment of both kinds of information....Cet article prĂ©sente une stratĂ©gie de segmentation dâimages hyperspectrales liant de façon symĂ©trique et
conjointe les aspects spectraux et spatiaux. Pour cela, nous proposons de construire des variables latentes
permettant de dĂ©finir un sous-espace reprĂ©sentant au mieux la topologie de lâimage. Dans cet article, nous
limiterons cette notion de topologie Ă la seule appartenance aux rĂ©gions. Pour ce faire, nous utilisons dâune
part les notions de lâanalyse discriminante (variance intra, inter) et les propriĂ©tĂ©s des algorithmes de
segmentation en région liées à celles-ci. Le principe générique théorique est exposé puis décliné sous la
forme dâun exemple dâimplĂ©mentation optimisĂ© utilisant un algorithme de segmentation en rĂ©gion type split
and merge. Les résultats obtenus sur une image de synthÚse puis réelle sont exposés et commentés
One-Class Classification: Taxonomy of Study and Review of Techniques
One-class classification (OCC) algorithms aim to build classification models
when the negative class is either absent, poorly sampled or not well defined.
This unique situation constrains the learning of efficient classifiers by
defining class boundary just with the knowledge of positive class. The OCC
problem has been considered and applied under many research themes, such as
outlier/novelty detection and concept learning. In this paper we present a
unified view of the general problem of OCC by presenting a taxonomy of study
for OCC problems, which is based on the availability of training data,
algorithms used and the application domains applied. We further delve into each
of the categories of the proposed taxonomy and present a comprehensive
literature review of the OCC algorithms, techniques and methodologies with a
focus on their significance, limitations and applications. We conclude our
paper by discussing some open research problems in the field of OCC and present
our vision for future research.Comment: 24 pages + 11 pages of references, 8 figure
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hypersurfaces between clusters. The presented kernel clustering methods are the kernel version of many classical clustering algorithms, e.g., K-means, SOM and neural gas. Spectral clustering arise from concepts in spectral graph theory and the clustering problem is configured as a graph cut problem where an appropriate objective function has to be optimized. An explicit proof of the fact that these two paradigms have the same objective is reported since it has been proven that these two seemingly different approaches have the same mathematical foundation. Besides, fuzzy kernel clustering methods are presented as extensions of kernel K-means clustering algorithm. (C) 2007 Pattem Recognition Society. Published by Elsevier Ltd. All rights reserved
- âŠ