Search results for " Computer Science"

Classification of Pollen Apertures Using Bag of Words

2013

International audience; The taxonomical recognition of microscopic biological parti- cles such as pollen and spores is relevant for medical and aerobiological applications. Focusing on an accurate and automatic vision-based pollen recognition system, we propose a method for classification of pollen aper- tures based on bag-of-words strategy, with the ability of learning new types from different taxa without the need of new algorithms. Results demonstrate suitable performance and ability to add new taxa.

Parallel filter estimation algorithm for segmentation on a LAN of workstations

1994

International audience

Optimized Parallel Implementation of Face Detection based on GPU component

2015

Display Omitted An algorithm for face detection has been implemented on CPU.An acceleration of this algorithm on GPU migration.Performance of GPU implementation shows the effectiveness of this implementation.Another optimization method on GPU are operated. Face detection is an important aspect for various domains such as: biometrics, video surveillance and human computer interaction. Generally a generic face processing system includes a face detection, or recognition step, as well as tracking and rendering phase. In this paper, we develop a real-time and robust face detection implementation based on GPU component. Face detection is performed by adapting the Viola and Jones algorithm. We hav…

Classifier Optimized for Resource-constrained Pervasive Systems and Energy-efficiency

2017

Computational intelligence is often used in smart environment applications in order to determine a user’scontext. Many computational intelligence algorithms are complex and resource-consuming which can beproblematic for implementation devices such as FPGA:s, ASIC:s and low-level microcontrollers. Thesetypes of devices are, however, highly useful in pervasive and mobile computing due to their small size,energy-efficiency and ability to provide fast real-time responses. In this paper, we propose a classi-fier, CORPSE, specifically targeted for implementation in FPGA:s, ASIC:s or low-level microcontrollers.CORPSE has a small memory footprint, is computationally inexpensive, and is suitable for…

A distributed genetic algorithm for restoration of vertical line scratches

2008

This paper reports a distributed algorithm for the restoration of still frames corrupted by vertical line scratches. The restoration is here approached as an optimisation problem, and is solved using an ad-hoc Genetic Algorithm. The distributed algorithm is designed following a pipeline logical structure. The front end is a network of standard workstations with heterogeneous operating systems. The quality of image is appreciable and the computational time is quite low with respect the sequential version.

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics

2015

We consider the problem of scheduling a set of jobs on a set of identical parallel machines where the objective is to minimize the total weighted earliness and tardiness penalties with respect to a common due date. We propose a hybrid heuristic algorithm for constructing good solutions, combining priority rules for assigning jobs to machines and a local search with exact procedures for solving the one-machine subproblems. These solutions are then used in two metaheuristic frameworks, Path Relinking and Scatter Search, to obtain high quality solutions for the problem. The algorithms are tested on a large number of test instances to assess the efficiency of the proposed strategies. The result…

Dynamic interface for machine vision systems

2002

Iconic programming intends to provide expressive tools to implement, to debug, and to execute programs. For this purpose, visual languages need pictorial constructs and metaphors to guide the design of algorithms in interactive fashion. In the paper a new class of dynamic visual interfaces, named DIVA (Dynamic Interface for Visual Applications), is introduced, its properties are described, and an application to visual compilers in a multi-processors system dedicated to image analysis is given. Moreover, a formal definition of dynamic icon (DI) is also given.

Combining Mendonça-Cipolla self-calibration and scene constraints

2011

International audience; In this paper, we propose a method that combines plane parallelism and the Mendonça/Cipolla self-calibration constraints. In our method each pair of images is treated independently and can therefore use a different pair of parallel planes not necessarily visible in the other views. While, for each pair of images, constraints on the singular values of the essential matrix provide two algebraic constraints on the intrinsic parameters, those we derive from plane parallelism have the advantage of providing two additional ones making the calibration of a no-skew camera possible from two images only.

2020

This work introduces a method to estimate reflectance, shading, and specularity from a single image. Reflectance, shading, and specularity are intrinsic images derived from the dichromatic model. Estimation of these intrinsic images has many applications in computer vision such as shape recovery, specularity removal, segmentation, or classification. The proposed method allows for recovering the dichromatic model parameters thanks to two independent quadratic programming steps. Compared to the state of the art in this domain, our approach has the advantage to address a complex inverse problem into two parallelizable optimization steps that are easy to solve and do not require learning. The p…

ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization

2018

Real-world optimization problems may involve a number of computationally expensive functions with a large number of input variables. Metamodel-based optimization methods can reduce the computational costs of evaluating expensive functions, but this does not reduce the dimension of the search domain nor mitigate the curse of dimensionality effects. The dimension of the search domain can be reduced by functional anova decomposition involving Sobol' sensitivity indices. This approach allows one to rank decision variables according to their impact on the objective function values. On the basis of the sparsity of effects principle, typically only a small number of decision variables significantl…