Search results for "Vector"
showing 10 items of 2660 documents
Calibration of a three-dimensional reconstruction system using a structured light source
2002
We present a method for calibrating a range finder system composed of a camera and a structured light source. The system is used to reconstruct the three-dimensional (3-D) surface of an object. This is achieved by projecting a pattern, represented by a set of regularly spaced spots, on the surface of the object using the structured light source. An image of the illuminated object is next taken and by analyzing the distortion of the projected pattern, the 3-D surface of the object can be reconstructed. This reconstruction operation can be envisaged only if the system is calibrated. Instead of using a classical calibration method, which is based on the determination of the matrices that chara…
Bag of words representation and SVM classifier for timber knots detection on color images
2015
Knots as well as their density have a huge impact on the mechanical properties of wood boards. This paper addresses the issue of their automatic detection. An image processing pipeline which associates low level processing (contrast enhancement, thresholding, mathematical morphology) with bag-of-words approach is developed. We propose a SVM classification based on features obtained by SURF descriptors on RGB images, followed by a dictionary created using the bag-of-words approach. Our method was tested on color images from two different datasets with a total number of 640 knots. The mean recall (true positive) rate achieved was (92%) and (97%) for a single dictionary (built only on samples …
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…
Why is this an anomaly? Explaining anomalies using sequential explanations
2022
Abstract In most applications, anomaly detection operates in an unsupervised mode by looking for outliers hoping that they are anomalies. Unfortunately, most anomaly detectors do not come with explanations about which features make a detected outlier point anomalous. Therefore, it requires human analysts to manually browse through each detected outlier point’s feature space to obtain the subset of features that will help them determine whether they are genuinely anomalous or not. This paper introduces sequential explanation (SE) methods that sequentially explain to the analyst which features make the detected outlier anomalous. We present two methods for computing SEs called the outlier and…
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 …
A one class KNN for signal identification: a biological case study
2009
The paper describes an application of a one class KNN to identify different signal patterns embedded in a noise structured background. The problem becomes harder whenever only one pattern is well-represented in the signal; in such cases, one class classifier techniques are more indicated. The classification phase is applied after a preprocessing phase based on a multi layer model (MLM) that provides preliminary signal segmentation in an interval feature space. The one class KNN has been tested on synthetic and real (Saccharomyces cerevisiae) microarray data in the specific problem of DNA nucleosome and linker regions identification. Results have shown, in both cases, a good recognition rate.
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.
Interactive Image Retrieval Using Smoothed Nearest Neighbor Estimates
2010
Relevance feedback has been adopted by most recent Content Based Image Retrieval systems to reduce the semantic gap that exists between the subjective similarity among images and the similarity measures computed in a given feature space. Distance-based relevance feedback using nearest neighbors has been recently presented as a good tradeoff between simplicity and performance. In this paper, we analyse some shortages of this technique and propose alternatives that help improving the efficiency of the method in terms of the retrieval precision achieved. The resulting method has been evaluated on several repositories which use different feature sets. The results have been compared to those obt…
Non-linear Invertible Representation for Joint Statistical and Perceptual Feature Decorrelation
2000
The aim of many image mappings is representing the signal in a basis of decorrelated features. Two fundamental aspects must be taken into account in the basis selection problem: data distribution and the qualitative meaning of the underlying space. The classical PCA techniques reduce the statistical correlation using the data distribution. However, in applications where human vision has to be taken into account, there are perceptual factors that make the feature space uneven, and additional interaction among the dimensions may arise. In this work a common framework is presented to analyse the perceptual and statistical interactions among the coefficients of any representation. Using a recen…
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 …