Search results for "A* algorithm"
showing 10 items of 2538 documents
Local Feature Selection with Dynamic Integration of Classifiers
2000
Multidimensional data is often feature space heterogeneous so that individual features have unequal importance in different sub areas of the feature space. This motivates to search for a technique that provides a strategic splitting of the instance space being able to identify the best subset of features for each instance to be classified. Our technique applies the wrapper approach where a classification algorithm is used as an evaluation function to differentiate between different feature subsets. In order to make the feature selection local, we apply the recent technique for dynamic integration of classifiers. This allows to determine which classifier and which feature subset should be us…
M-GRASP: A GRASP With Memory for Latency-Aware Partitioning Methods in DVE Systems
2009
A necessary condition for providing quality of service to distributed virtual environments (DVEs) is to provide a system response below a maximum threshold to the client computers. In this sense, latency-aware partitioning methods try to provide response times below the threshold to the maximum number of client computers as possible. These partitioning methods should find an assignment of clients to servers that optimizes system throughput, system latency, and partitioning efficiency. In this paper, we present a new algorithm based on greedy randomized adaptive search procedure with memory for finding the best solutions as possible to this problem. We take into account several different alt…
Parallel implementation on DSPs of a face detection algorithm
2002
In order to localize the face in an image, our approach consists of approximating the face oval shape with an ellipse and to compute coordinates of the center of the ellipse. For this purpose, we explore a new version of the Hough transformation: the fuzzy generalized Hough transformation. To reduce the computation time, we present also a parallel implementation of the algorithm on 2 digital signal processors and we show that an acceleration of a factor of 1.62 has been obtained.
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…
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…
Fingerprint Registration Using Specialized Genetic Algorithms
2005
One of the most common problem to realize a robust matching algorithm in an Automated Fingerprint Identification System (AFIS) is the images registration. In this paper a fingerprints registration method based on a specialized genetic algorithm (GA) is proposed. A global transformation between two fingerprint images is performed using genetic data evolutions based on specialized mutation rate and solution refining. An AFIS including the above method has been developed and tested on two different fingerprint databases: NIST 4 ink-on-paper and self optical scanned. The obtained experimental results show that the proposed approach is comparable with literature systems working on medium quality…
Real-Time Human Pose Estimation from Body-Scanned Point Clouds
2015
International audience; This paper presents a novel approach to estimate the human pose from a body-scanned point cloud. To do so, a predefined skeleton model is first initialized according to both the skeleton base point and its torso limb obtained by Principal Component Analysis (PCA). Then, the body parts are iteratively clustered and the skeleton limb fitting is performed, based on Expectation Maximization (EM). The human pose is given by the location of each skeletal node in the fitted skeleton model. Experimental results show the ability of the method to estimate the human pose from multiple point cloud video sequences representing the external surface of a scanned human body; being r…
A Windowing strategy for Distributed Data Mining optimized through GPUs
2017
Abstract This paper introduces an optimized Windowing based strategy for inducing decision trees in Distributed Data Mining scenarios. Windowing consists in selecting a sample of the available training examples (the window) to induce a decision tree with an usual algorithm, e.g., J48; finding instances not covered by this tree (counter examples) in the remaining training examples, adding them to the window to induce a new tree; and repeating until a termination criterion is met. In this way, the number of training examples required to induce the tree is reduced considerably, while maintaining the expected accuracy levels; which is paid in terms of time performance. Our proposed enhancements…
A comparative study of best spectral bands selection systems for face recognition
2014
Multispectral images (MI) have shown promising capabilities to solve problems resulting from high illumination variation in face recognition. However, the use of MI, with the huge number of captured spectral bands for each subject, is impractical unless a system for best spectral bands selection (BSBS) is used. In this work, first we give an up to date overview of the existing BSBS techniques proposed for face recognition. We aim to highlight the imporatnce of this component of MI based systems. The reviewed techniques are then experimented using the multispectral face database IRIS - M3 to compare their performances. To the best of our knowledge this is the first study that reviews and com…