Search results for " learning"
showing 10 items of 5299 documents
Maximum Common Subgraph based locally weighted regression
2012
This paper investigates a simple, yet effective method for regression on graphs, in particular for applications in chem-informatics and for quantitative structure-activity relationships (QSARs). The method combines Locally Weighted Learning (LWL) with Maximum Common Subgraph (MCS) based graph distances. More specifically, we investigate a variant of locally weighted regression on graphs (structures) that uses the maximum common subgraph for determining and weighting the neighborhood of a graph and feature vectors for the actual regression model. We show that this combination, LWL-MCS, outperforms other methods that use the local neighborhood of graphs for regression. The performance of this…
Classification Similarity Learning Using Feature-Based and Distance-Based Representations: A Comparative Study
2015
Automatically measuring the similarity between a pair of objects is a common and important task in the machine learning and pattern recognition fields. Being an object of study for decades, it has lately received an increasing interest from the scientific community. Usually, the proposed solutions have used either a feature-based or a distance-based representation to perform learning and classification tasks. This article presents the results of a comparative experimental study between these two approaches for computing similarity scores using a classification-based method. In particular, we use the Support Vector Machine as a flexible combiner both for a high dimensional feature space and …
An improved distance-based relevance feedback strategy for image retrieval
2013
Most CBIR (content based image retrieval) systems use relevance feedback as a mechanism to improve retrieval results. NN (nearest neighbor) approaches provide an efficient method to compute relevance scores, by using estimated densities of relevant and non-relevant samples in a particular feature space. In this paper, particularities of the CBIR problem are exploited to propose an improved relevance feedback algorithm based on the NN approach. The resulting method has been tested in a number of different situations and compared to the standard NN approach and other existing relevance feedback mechanisms. Experimental results evidence significant improvements in most cases.
Evaluating State-Based Intention Recognition Algorithms against Human Performance
2014
In this paper, we describe a novel intention recognition approach based on the representation of state information in a cooperative human-robot environment. We compare the output of the intention recognition algorithms to those of an experiment involving humans attempting to recognize the same intentions in a manufacturing kitting domain. States are represented by a combination of spatial relationships in a Cartesian frame along with cardinal direction information. Based upon a set of predefined high-level states relationships that must be true for future actions to occur, a robot can use the approaches described in this paper to infer the likelihood of subsequent actions occurring. This wo…
Quality-preserving low-cost probabilistic 3D denoising with applications to Computed Tomography
2021
AbstractWe propose a pipeline for a synthetic generation of personalized Computer Tomography (CT) images, with a radiation exposure evaluation and a lifetime attributable risk (LAR) assessment. We perform a patient-specific performance evaluation for a broad range of denoising algorithms (including the most popular Deep Learning denoising approaches, wavelets-based methods, methods based on Mumford-Shah denoising etc.), focusing both on accessing the capability to reduce the patient-specific CT-induced LAR and on computational cost scalability. We introduce a parallel probabilistic Mumford-Shah denoising model (PMS), showing that it markedly-outperforms the compared common denoising methods…
Classification Boundary Approximation by Using Combination of Training Steps for Real-Time Image Segmentation
2007
We propose a method of real-time implementation of an approximation of the support vector machine decision rule. The method uses an improvement of a supervised classification method based on hyperrectangles, which is useful for real-time image segmentation. We increase the classification and speed performances using a combination of classification methods: a support vector machine is used during a pre-processing step. We recall the principles of the classification methods and we evaluate the hardware implementation cost of each method. We present our learning step combination algorithm and results obtained using Gaussian distributions and an example of image segmentation coming from a part …
Improving estimation of distribution genetic programming with novelty initialization
2021
Estimation of distribution genetic programming (EDA-GP) replaces the standard variation operations of genetic programming (GP) by learning and sampling from a probabilistic model. Unfortunately, many EDA-GP approaches suffer from a rapidly decreasing population diversity which often leads to premature convergence. However, novelty search, an approach that searches for novel solutions to cover sparse areas of the search space, can be used for generating diverse initial populations. In this work, we propose novelty initialization and test this new method on a generalization of the royal tree problem and compare its performance to ramped half-and-half (RHH) using a recent EDA-GP approach. We f…
Divisive normalization image quality metric revisited.
2010
Structural similarity metrics and information-theory-based metrics have been proposed as completely different alternatives to the traditional metrics based on error visibility and human vision models. Three basic criticisms were raised against the traditional error visibility approach: (1) it is based on near-threshold performance, (2) its geometric meaning may be limited, and (3) stationary pooling strategies may not be statistically justified. These criticisms and the good performance of structural and information-theory-based metrics have popularized the idea of their superiority over the error visibility approach. In this work we experimentally or analytically show that the above critic…
Three-dimensional Fuzzy Kernel Regression framework for registration of medical volume data
2013
Abstract In this work a general framework for non-rigid 3D medical image registration is presented. It relies on two pattern recognition techniques: kernel regression and fuzzy c-means clustering. The paper provides theoretic explanation, details the framework, and illustrates its application to implement three registration algorithms for CT/MR volumes as well as single 2D slices. The first two algorithms are landmark-based approaches, while the third one is an area-based technique. The last approach is based on iterative hierarchical volume subdivision, and maximization of mutual information. Moreover, a high performance Nvidia CUDA based implementation of the algorithm is presented. The f…
Applying Wavelet Packet Decomposition and One-Class Support Vector Machine on Vehicle Acceleration Traces for Road Anomaly Detection
2013
Road condition monitoring through real-time intelligent systems has become more and more significant due to heavy road transportation. Road conditions can be roughly divided into normal and anomaly segments. The number of former should be much larger than the latter for a useable road. Based on the nature of road condition monitoring, anomaly detection is applied, especially for pothole detection in this study, using accelerometer data of a riding car. Accelerometer data were first labeled and segmented, after which features were extracted by wavelet packet decomposition. A classification model was built using one-class support vector machine. For the classifier, the data of some normal seg…