Search results for "algorithm."
showing 10 items of 4617 documents
Regularized LMS methods for baseline wandering removal in wearable ECG devices
2016
The acquisition of electrocardiogram (ECG) signals by means of light and reduced size devices can be usefully exploited in several health-care applications, e.g., in remote monitoring of patients. ECG signals, however, are affected by several artifacts due to noise and other disturbances. One of the major ECG degradation is represented by the baseline wandering (BW), a slowly varying change of the signal trend. Several BW removal algorithms have been proposed into the literature, even though their complexity often hinders their implementation into wearable devices characterized by limited computational and memory resources. In this study, we formalize the BW removal problem as a mean-square…
Optimization of Vehicle-to-Vehicle Frontal Crash Model Based on Measured Data Using Genetic Algorithm
2017
In this paper, a mathematical model for vehicle-to-vehicle frontal crash is developed. The experimental data are taken from the National Highway Traffic Safety Administration. To model the crash scenario, the two vehicles are represented by two masses moving in opposite directions. The front structures of the vehicles are modeled by Kelvin elements, consisting of springs and dampers in parallel, and estimated as piecewise linear functions of displacements and velocities, respectively. To estimate and optimize the model parameters, a genetic algorithm approach is proposed. Finally, it is observed that the developed model can accurately reproduce the real kinematic results from the crash test…
Reliable diagnostics using wireless sensor networks
2019
International audience; Monitoring activities in industry may require the use of wireless sensor networks, for instance due to difficult access or hostile environment. But it is well known that this type of networks has various limitations like the amount of disposable energy. Indeed, once a sensor node exhausts its resources, it will be dropped from the network, stopping so to forward information about maybe relevant features towards the sink. This will result in broken links and data loss which impacts the diagnostic accuracy at the sink level. It is therefore important to keep the network's monitoring service as long as possible by preserving the energy held by the nodes. As packet trans…
Graph Filtering of Time-Varying Signals over Asymmetric Wireless Sensor Networks
2019
In many applications involving wireless sensor networks (WSNs), the observed data can be modeled as signals defined over graphs. As a consequence, an increasing interest has been witnessed to develop new methods to analyze graph signals, leading to the emergence of the field of Graph Signal Processing. One of the most important processing tools in this field is graph filters, which can be easily implemented distributedly over networks by means of cooperation among the nodes. Most of previous works related to graph filters assume the same connection probability in both link directions when transmitting an information between two neighboring nodes. This assumption is not realistic in practice…
K-nearest neighbor driving active contours to delineate biological tumor volumes
2019
Abstract An algorithm for tumor delineation in positron emission tomography (PET) is presented. Segmentation is achieved by a local active contour algorithm, integrated and optimized with the k-nearest neighbor (KNN) classification method, which takes advantage of the stratified k-fold cross-validation strategy. The proposed approach is evaluated considering the delineation of cancers located in different body districts (i.e. brain, head and neck, and lung), and considering different PET radioactive tracers. Data are pre-processed in order to be expressed in terms of standardized uptake value, the most widely used PET quantification index. The algorithm uses an initial, operator selected re…
A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems
2021
The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…
Accurate keyframe selection and keypoint tracking for robust visual odometry
2016
This paper presents a novel stereo visual odometry (VO) framework based on structure from motion, where a robust keypoint tracking and matching is combined with an effective keyframe selection strategy. In order to track and find correct feature correspondences a robust loop chain matching scheme on two consecutive stereo pairs is introduced. Keyframe selection is based on the proportion of features with high temporal disparity. This criterion relies on the observation that the error in the pose estimation propagates from the uncertainty of 3D points—higher for distant points, that have low 2D motion. Comparative results based on three VO datasets show that the proposed solution is remarkab…
Meta-heuristic Algorithms for Nesting Problem of Rectangular Pieces
2017
Abstract Nesting problems consist of placing multiple items onto larger shapes finding a good arrangement. The goal of the nesting process is to minimize the waste of material. It is common to assume, as in the present work, that the stock sheet has fixed width and infinite height, since in the real world a company may have to cut pieces from a roll of material. The complexity of such problems is often faced with a two-stage approach, so-called “hybrid algorithm”, combining a placement routine and a meta-heuristic algorithm. Starting from a given positioning sequence, the placement routine generates a non-overlapping configuration. The encoded solution is manipulated and modified by the met…
A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
2017
Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approxim…
A Methodology for Modeling and Optimizing Social Systems
2020
[EN] A system methodology for modeling and optimizing social systems is presented. It allows constructing dynamical models formulated stochastically, i.e., their results are given by confidence intervals. The models provide optimal intervention ways to reach the stated objectives. Two optimization methods are used: (1) to test strategies and scenarios and (2) to optimize with a genetic algorithm. The application case presented is a small nonformal education Spanish business. First, the model is validated in the 2008-2012 period, and subsequently, the optimal way to obtain a maximum profit in the 2013-2025 period is obtained using the two methods.