Search results for "Mathematical optimization"
showing 10 items of 1300 documents
Analysis of human skin hyper-spectral images by non-negative matrix factorization
2011
International audience; This article presents the use of Non-negative Matrix Factorization, a blind source separation algorithm, for the decomposition of human skin absorption spectra in its main pigments: melanin and hemoglobin. The evaluated spectra come from a Hyper-Spectral Image, which is the result of the processing of a Multi-Spectral Image by a neural network-based algorithm. The implemented source separation algorithm is based on a multiplicative coeffi cient upload. The goal is to represent a given spectrum as the weighted sum of two spectral components. The resulting weighted coefficients are used to quantify melanin and hemoglobin content in the given spectra. Results present a …
Subsignal-based denoising from piecewise linear or constant signal
2011
15 pages; International audience; n the present work, a novel signal denoising technique for piecewise constant or linear signals is presented termed as "signal split." The proposed method separates the sharp edges or transitions from the noise elements by splitting the signal into different parts. Unlike many noise removal techniques, the method works only in the nonorthogonal domain. The new method utilizes Stein unbiased risk estimate (SURE) to split the signal, Lipschitz exponents to identify noise elements, and a polynomial fitting approach for the sub signal reconstruction. At the final stage, merging of all parts yield in the fully denoised signal at a very low computational cost. St…
Non Linear Image Restoration in Spatial Domain
2011
International audience; In the present work, a novel image restoration method from noisy data samples is presented. The restoration was per-formed by using some heuristic approach utilizing data samples and smoothness criteria in spatial domain. Unlike most existing techniques, this approach does not require prior modelling of either the image or noise statistics. The proposed method works in an interactive mode to find the best compromise between the data (mean square error) and the smoothing criteria. The method has been compared with the shrinkage approach, Wiener filter and Non Local Means algorithm as well. Experimental results showed that the proposed method gives better signal to noi…
Signal Restoration via a Splitting Approach
2012
International audience; In the present study, a novel signal restoration method from noisy data samples is presented and is termed as "signal split (SSplit)" approach. The new method utilizes Stein unbiased risk estimate estimator to split the signal, the Lipschitz exponents to identify noise elements and a heuristic approach for the signal reconstruction. However, unlike many noise removal techniques, the present method works only in the non-orthogonal domain. Signal restoration was performed on each individual part by finding the best compromise between the data samples and the smoothing criteria. Statistical results are quite promising and suggest better performance than the conventional…
Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks
2017
International audience; In time varying data communication networks (TVCN), traffic congestion, system utility maximization and network performance enhancement are the prominent issues. All these issues can be resolved either by optimizing the network structure or by selecting efficient routing approaches. In this paper, we focus on the design of a time varying network model and propose an algorithm to find efficient user route in this network. Centrality plays a very important role in finding congestion free routes. Indeed, the more a node is central, the more it can be congested by the flow coming from or going to its neighborhood. For that reason, classically, routes are chosen such that…
The squared symmetric FastICA estimator
2017
In this paper we study the theoretical properties of the deflation-based FastICA method, the original symmetric FastICA method, and a modified symmetric FastICA method, here called the squared symmetric FastICA. This modification is obtained by replacing the absolute values in the FastICA objective function by their squares. In the deflation-based case this replacement has no effect on the estimate since the maximization problem stays the same. However, in the symmetric case we obtain a different estimate which has been mentioned in the literature, but its theoretical properties have not been studied at all. In the paper we review the classic deflation-based and symmetric FastICA approaches…
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
2012
This paper presents the first full-fledged branch-and-price (bap) algorithm for the capacitated arc-routing problem (CARP). Prior exact solution techniques either rely on cutting planes or the transformation of the CARP into a node-routing problem. The drawbacks are either models with inherent symmetry, dense underlying networks, or a formulation where edge flows in a potential solution do not allow the reconstruction of unique CARP tours. The proposed algorithm circumvents all these drawbacks by taking the beneficial ingredients from existing CARP methods and combining them in a new way. The first step is the solution of the one-index formulation of the CARP in order to produce strong cut…
Comparison of continuous and discontinuous Galerkin approaches for variable-viscosity Stokes flow
2015
We describe a Discontinuous Galerkin (DG) scheme for variable-viscosity Stokes flow which is a crucial aspect of many geophysical modelling applications and conduct numerical experiments with different elements comparing the DG approach to the standard Finite Element Method (FEM). We compare the divergence-conforming lowest-order Raviart-Thomas (RT0P0) and Brezzi-Douglas-Marini (BDM1P0) element in the DG scheme with the bilinear Q1P0 and biquadratic Q2P1 elements for velocity and their matching piecewise constant/linear elements for pressure in the standard continuous Galerkin (CG) scheme with respect to accuracy and memory usage in 2D benchmark setups. We find that for the chosen geodynami…
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
2019
Abstract The vehicle-routing problem with private fleet and common carrier (VRPPC) extends the capacitated VRP by considering the option of outsourcing customers to subcontractors at a customer-dependent cost instead of serving them with the private fleet. The VRPPC has important applications in small package shipping and manufacturing, but despite its relevance, no exact solution approach has been introduced so far. We propose a branch-price-and-cut algorithm that is able to solve small to medium-sized instances and provides tight lower bounds for larger instances from the literature. In addition, we develop a large neighborhood search that shows a decent solution quality and competitive r…
Patch-Based Image Denoising Model for Mixed Gaussian Impulse Noise Using L1 Norm
2017
Image denoising is the classes of technique used to free the image form the noise. The noise in the image may be added during the observation process due to the improper setting of the camera lance, low-resolution camera, cheap, and low-quality sensors, etc. Noise in the image may also be added during the image restoration, image transmission through the transmission media. To obtain required information from image, image must be noise free, i.e., high-frequency details must be present in the image. There are number of applications where image denoising is needed such as remote location detection, computer vision, computer graphics, video surveillance, etc. In last two decades, numbers of m…