Joni-Kristian Kamarainen

Differential Evolution Training Algorithm for Feed-Forward Neural Networks

An evolutionary optimization method over continuous search spaces, differential evolution, has recently been successfully applied to real world and artificial optimization problems and proposed also for neural network training. However, differential evolution has not been comprehensively studied in the context of training neural network weights, i.e., how useful is differential evolution in finding the global optimum for expense of convergence speed. In this study, differential evolution has been analyzed as a candidate global optimization method for feed-forward neural networks. In comparison to gradient based methods, differential evolution seems not to provide any distinct advantage in terms of learning rate or solution quality. Differential evolution can rather be used in validation of reached optima and in the development of regularization terms and non-conventional transfer functions that do not necessarily provide gradient information.

Invariance properties of Gabor filter-based features-overview and applications

For almost three decades the use of features based on Gabor filters has been promoted for their useful properties in image processing. The most important properties are related to invariance to illumination, rotation, scale, and translation. These properties are based on the fact that they are all parameters of Gabor filters themselves. This is especially useful in feature extraction, where Gabor filters have succeeded in many applications, from texture analysis to iris and face recognition. This study provides an overview of Gabor filters in image processing, a short literature survey of the most significant results, and establishes invariance properties and restrictions to the use of Gabor filters in feature extraction. Results are demonstrated by application examples.

Simple Gabor feature space for invariant object recognition

Invariant object recognition is one of the most challenging problems in computer vision. The authors propose a simple Gabor feature space, which has been successfully applied to applications, e.g., in invariant face detection to extract facial features in demanding environments. In the proposed feature space, illumination, rotation, scale, and translation invariant recognition of objects can be realized within a reasonable amount of computation. In this study, fundamental properties of Gabor features, construction of the simple feature space, and invariant search operations in the feature space are discussed in more detail.

The DIARETDB1 diabetic retinopathy database and evaluation protocol

Automatic diagnosis of diabetic retinopathy from digital fundus images has been an active research topic in the medical image processing community. The research interest is justified by the excellent potential for new products in the medical industry and significant reductions in health care costs. However, the maturity of proposed algorithms cannot be judged due to the lack of commonly accepted and representative image database with a verified ground truth and strict evaluation protocol. In this study, an evaluation methodology is proposed and an image database with ground truth is described. The database is publicly available for benchmarking diagnosis algorithms. With the proposed database and protocol, it is possible to compare different algorithms, and correspondingly, analyse their maturity for technology transfer from the research laboratories to the medical practice.

Feature-based affine-invariant localization of faces

We present a novel method for localizing faces in person identification scenarios. Such scenarios involve high resolution images of frontal faces. The proposed algorithm does not require color, copes well in cluttered backgrounds, and accurately localizes faces including eye centers. An extensive analysis and a performance evaluation on the XM2VTS database and on the realistic BioID and BANCA face databases is presented. We show that the algorithm has precision superior to reference methods.

Feature representation and discrimination based on Gaussian mixture model probability densities-Practices and algorithms

Highly active hydrofining catalysts are prepared by ion exchanging a silica-alumina hydrogel with an ammoniacal solution of a cobalt and/or nickel compound, and thereafter compositing the undried product with an alumina hydrogel and a molybdenum component, followed by drying and calcining. The resulting catalysts are particularly active for the denitrogenation of mineral oil feedstocks.

Diagnosis tool for motor condition monitoring

In the modern industrial environment there is increasing demand for automatic condition monitoring. With reliable condition monitoring, faults such as mechanical motor failures could be identified in their early stages and further damage to the system could be prevented. Successful monitoring is a complex and application-specific problem, but a generic tool would be useful in preliminary analysis of new signals and in verification of known theories. A generic condition diagnosis tool is introduced in this paper. The tool is based on discriminative energy functions which reveal discriminative frequency-domain regions where failures can be identified. The tool was applied to induction motor bearing fault detection and succeeded in finding characteristic frequencies which allow accurate detection of bearing faults.

Pose estimation using local structure-specific shape and appearance context

We address the problem of estimating the alignment pose between two models using structure-specific local descriptors. Our descriptors are generated using a combination of 2D image data and 3D contextual shape data, resulting in a set of semi-local descriptors containing rich appearance and shape information for both edge and texture structures. This is achieved by defining feature space relations which describe the neighborhood of a descriptor. By quantitative evaluations, we show that our descriptors provide high discriminative power compared to state of the art approaches. In addition, we show how to utilize this for the estimation of the alignment pose between two point sets. We present experiments both in controlled and real-life scenarios to validate our approach.

Image Feature Localization by Multiple Hypothesis Testing of Gabor Features

Several novel and particularly successful object and object category detection and recognition methods based on image features, local descriptions of object appearance, have recently been proposed. The methods are based on a localization of image features and a spatial constellation search over the localized features. The accuracy and reliability of the methods depend on the success of both tasks: image feature localization and spatial constellation model search. In this paper, we present an improved algorithm for image feature localization. The method is based on complex-valued multiresolution Gabor features and their ranking using multiple hypothesis testing. The algorithm provides very accurate local image features over arbitrary scale and rotation. We discuss in detail issues such as selection of filter parameters, confidence measure, and the magnitude versus complex representation, and show on a large test sample how these influence the performance. The versatility and accuracy of the method is demonstrated on two profoundly different challenging problems (faces and license plates).

Improving similarity measures of histograms using smoothing projections

Selection of a proper similarity measure is an essential consideration for a success of many methods. In this study, similarity measures are analyzed in the context of ordered histogram type data, such as gray-level histograms of digital images or color spectra. Furthermore, the performance of the studied similarity measures can be improved using a smoothing projection, called neighbor-bank projection. Especially, with distance functions utilizing statistical properties of data, e.g., the Mahalanobis distance, a significant improvement was achieved in the classification experiments on real data sets, resulting from the use of a priori information related to ordered data. The proposed projection seems also to be applicable for dimensional reduction of histograms and to represent sparse data in a more tight form in the projection subspace.