Cell image classification using histograms, higher order statistics and adaboost

A cell classification algorithm that uses first, second and third order statistics of pixel intensity distributions over pre-defined regions is implemented and evaluated. A cell image is segmented into 6 regions extending from a boundary layer to an inner circle. First, second and third order statistical features are extracted from histograms of pixel intensities in these regions. Third order statistical features used are one-dimensional bispectral invariants. 108 features were considered as candidates for Adaboost based fusion. The best 10 stage fused classifier was selected for each class and a decision tree constructed for the 6-class problem. The classifier is robust, accurate and fast by design.

Estimation of fuzzy memberships from histograms

Based on the conclusions drawn in the bijective transformation between possibility and probability, a method is proposed to estimate the fuzzy membership function for pattern recognition purposes. A rational function approximation to the probability density function is obtained from the histogram of a finite (and sometimes very small) number of samples. This function is normalized such that the highest ordinate is one. The parameters representing the rational function are used for classifying the pattern samples based on a max-min decision rule. The method is illustrated with examples.

Efficient topological localization using orientation adjacency coherence histograms

This paper describes an efficient vision-based global topological localization approach that uses a coarse-to-fine strategy. Orientation Adjacency Coherence Histogram (OACH), a novel image feature, is proposed to improve the coarse localization. The coarse localization results are taken as inputs for the fine localization which is carried out by matching Harris-Laplace interest points characterized by the SIFT descriptor. Computation of OACHs and interest points is efficient due to the fact that these features are computed in an integrated process. We have implemented and tested the localization system in real environments. The experimental results demonstrate that our approach is efficient and reliable in both indoor and outdoor environments. © 2006 IEEE.

Rank histograms of stratified Monte-Carlo ensembles

The application of forecast ensembles to probabilistic weather prediction has spurred considerable interest in their evaluation. Such ensembles are commonly interpreted as Monte Carlo ensembles meaning that the ensemble members are perceived as random draws from a distribution. Under this interpretation, a reasonable property to ask for is statistical consistency, which demands that the ensemble members and the verification behave like draws from the same distribution. A widely used technique to assess statistical consistency of a historical dataset is the rank histogram, which uses as a criterion the number of times that the verification falls between pairs of members of the ordered ensemble. Ensemble evaluation is rendered more specific by stratification, which means that ensembles that satisfy a certain condition (e.g., a certain meteorological regime) are evaluated separately. Fundamental relationships between Monte Carlo ensembles, their rank histograms, and random sampling from the probability simplex according to the Dirichlet distribution are pointed out. Furthermore, the possible benefits and complications of ensemble stratification are discussed. The main conclusion is that a stratified Monte Carlo ensemble might appear inconsistent with the verification even though the original (unstratified) ensemble is consistent. The apparent inconsistency is merely a result of stratification. Stratified rank histograms are thus not necessarily flat. This result is demonstrated by perfect ensemble simulations and supplemented by mathematical arguments. Possible methods to avoid or remove artifacts that stratification induces in the rank histogram are suggested.

An empirical investigation of the effects of rounding on the SPF probabilities of decine and output growth histograms

I consider the possibility that respondents to the Survey of Professional Forecasters round their probability forecasts of the event that real output will decline in the future, as well as their reported output growth probability distributions. I make various plausible assumptions about respondents’ rounding practices, and show how these impinge upon the apparent mismatch between probability forecasts of a decline in output and the probabilities of this event implied by the annual output growth histograms. I find that rounding accounts for about a quarter of the inconsistent pairs of forecasts.

Spatial information in histograms for shape representation

Histograms have been used for Shape Representation and Retrieval. In this paper, the traditional technique has been modified to capture additional information. We compare the performance of the proposed method with the traditional method by performing experiments on a database of shapes. The results show that the proposed enhancement to the histogram based method improves the effectiveness significantly.

Coherence based histograms for shape retrieval

Histograms have been used for Shape Representation and Retrieval. The drawback of the histograms method is that histograms can be same for dissimilar shapes, which renders the method less effective for retrieval of shapes. In this paper, we describe the concept of coherence. We show how coherence can be used with distance and angular histograms. We perform experiments to test the effectiveness of the proposed method. It is found that coherence improves accuracy of retrieval significantly.

Angular histograms for shape retrieval

Distance histograms have been used for Shape Representation and Retrieval [1][2]. In this paper, we have proposed the use of angular histograms for shape representation. We have implemented a system for conducting experiments and evaluating the effectiveness of the proposed method. The proposed method is compared with the distance histograms method. It is found that the
proposed method is effective.

Stream quantiles via maximal entropy histograms

We address the problem of estimating the running quantile of a data stream when the memory for storing observations is limited.We (i) highlight the limitations of approaches previously described in the literature which make them unsuitable for non-stationary streams, (ii) describe a novel principle for the utilization of the available storage space, and (iii) introduce two novel algorithms which exploit the proposed principle. Experiments on three large realworld data sets demonstrate that the proposed methods vastly outperform the existing alternatives.

CENSUS HISTOGRAMS: A SIMPLE FEATURE EXTRACTION and MATCHING APPROACH FOR FACE RECOGNITION

Most face recognition approaches require a prior training where a given distribution of faces is assumed to further predict the identity of test faces. Such an approach may experience difficulty in identifying faces belonging to distributions different from the one provided during the training. A face recognition technique that performs well regardless of training is, therefore, interesting to consider as a basis of more sophisticated methods. In this work, the Census Transform is applied to describe the faces. Based on a scanning window which extracts local histograms of Census Features, we present a method that directly matches face samples. With this simple technique, 97.2% of the faces in the FERET fa/fb test were correctly recognized. Despite being an easy test set, we have found no other approaches in literature regarding straight comparisons of faces with such a performance. Also, a window for further improvement is presented. Among other techniques, we demonstrate how the use of SVMs over the Census Histogram representation can increase the recognition performance.

The use of elevation map histograms for topographic heterogeneity analysis

Surface defects are extremely important in mechanical characterization of several different materials. Therefore, the analysis of surface finishing is essential for a further simulation of surface mechanical properties in a customized project in materials science and technology. One of the methods commonly employed for such purpose is the statistical mapping of different sample surface regions using the depth from focus technique. The analysis is usually performed directly from the elevation maps which are obtained from the digital image processing. In this paper, the possibility of quantifying the surface heterogeneity of Silicon Carbide porous ceramics by elevation map histograms is presented. The advantage of this technique is that it allows the qualitative or quantitative verification of all surface image fields that cannot be done by using the Surface Plot plugin of image J™ platform commonly used in digital image processing. © 2012 Springer Science+Business Media, LLC.

Patch-based local histograms and contour estimation for static foreground classification

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)