Geometry-Aware Neighborhood Search for Learning Local Models for Image Reconstruction

Local learning of sparse image models has proven to be very effective to solve inverse problems in many computer vision applications. To learn such models, the data samples are often clustered using the K-means algorithm with the Euclidean distance as a dissimilarity metric. However, the Euclidean distance may not always be a good dissimilarity measure for comparing data samples lying on a manifold. In this paper, we propose two algorithms for determining a local subset of training samples from which a good local model can be computed for reconstructing a given input test sample, where we take into account the underlying geometry of the data. The first algorithm, called Adaptive Geometry-driven Nearest Neighbor search (AGNN), is an adaptive scheme which can be seen as an out-of-sample extension of the replicator graph clustering method for local model learning. The second method, called Geometry-driven Overlapping Clusters (GOC), is a less complex nonadaptive alternative for training subset selection. The proposed AGNN and GOC methods are evaluated in image super-resolution, deblurring and denoising applications and shown to outperform spectral clustering, soft clustering, and geodesic distance based subset selection in most settings.Comment: 15 pages, 10 figures and 5 table

Fuzzy-Neural Cost Estimation for Engine Tests

This chapter discusses artificial computational intelligence methods as applied to cost prediction. We present the development of a suite of hybrid fuzzy-neural systems for predicting the cost of performing engine tests at NASA’s Stennis Space Center testing facilities. The system is composed of several adaptive network-based fuzzy inference systems (ANFIS), with or without neural subsystems. The output produced by each system in the suite is a rough order of magnitude (ROM) cost estimate for performing the engine test. Basic systems predict cost based solely on raw test data, whereas others use preprocessing of these data, such as principal components and locally linear embedding (LLE), before entering the fuzzy engines. Backpropagation neural networks and radial basis functions networks (RBFNs) are also used to aid in the cost prediction by merging the costs estimated by several ANFIS into a final cost estimate

Comparison of incomplete data handling techniques for neuro-fuzzy system

Real-life data sets sometimes miss some values. The incomplete data needs specialized algorithms or preprocessing that allows the use of the algorithms for complete data. The paper presents a comparison of various techniques for handling incomplete data in the neuro-fuzzy system ANNBFIS. The crucial procedure in the creation of a fuzzy model for the neuro-fuzzy system is the partition of the input domain. The most popular approach (also used in the ANNBFIS) is clustering. The analyzed approaches for clustering incomplete data are: preprocessing (marginalization and imputation) and specialized clustering algorithms (PDS, IFCM, OCS, NPS). The objective of our research is the comparison of the preprocessing techniques and specialized clustering algorithms to find the the most-advantageous technique for handling incomplete data with a neuro-fuzzy system. This approach is also the indirect validation of clustering