Search results for "image processing"
showing 10 items of 3285 documents
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 Placement of Pressure Sensors Using Fuzzy DEMATEL-Based Sensor Influence
2020
[EN] Nowadays, optimal sensor placement (OSP) for leakage detection in water distribution networks is a lively field of research, and a challenge for water utilities in terms of network control, management, and maintenance. How many sensors to install and where to install them are crucial decisions to make for those utilities to reach a trade-off between efficiency and economy. In this paper, we address the where-to-install-them part of the OSP through the following elements: nodes' sensitivity to leakage, uncertainty of information, and redundancy through conditional entropy maximisation. We evaluate relationships among candidate sensors in a network to get a picture of the mutual influenc…
Seed Activation Scheduling for Influence Maximization in Social Networks
2018
This paper addresses the challenge of strategically maximizing the influence spread in a social network, by exploiting cascade propagators termed “seeds”. It introduces the Seed Activation Scheduling Problem (SASP) that chooses the timing of seed activation under a given budget, over a given time horizon, in the presence/absence of competition. The SASP is framed as a blogger-centric marketing problem on a two-level network, where the decisions are made to buy sponsored posts from prominent bloggers at calculated points in time. A Bayesian evidence diffusion model – the Partial Parallel Cascade (PPC) model – allows the network nodes to be partially activated, proportional to their accumulat…
A fully adaptive multiresolution scheme for image processing
2007
A nonlinear multiresolution scheme within Harten's framework [A. Harten, Discrete multiresolution analysis and generalized wavelets, J. Appl. Numer. Math. 12 (1993) 153-192; A. Harten, Multiresolution representation of data II, SIAM J. Numer. Anal. 33 (3) (1996) 1205-1256] is presented. It is based on a centered piecewise polynomial interpolation fully adapted to discontinuities. Compression properties of the multiresolution scheme are studied on various numerical experiments on images.
M-bornologies on L-valued Sets
2017
We develop an approach to the concept of bornology in the framework of many-valued mathematical structures. It is based on the introduced concept of an M-bornology on an L-valued set (X, E), or an LM-bornology for short; here L is an iccl-monoid, M is a completely distributive lattice and \(E: X\times X \rightarrow L\) is an L-valued equality on the set X. We develop the basics of the theory of LM-bornological spaces and initiate the study of the category of LM-bornological spaces and appropriately defined bounded “mappings” of such spaces.
Randomized heuristics for the Capacitated Clustering Problem
2017
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-less approach that constructs independent solutions, while the latter is a memory-based method that constructs linked solutions, obtained by partially rebuilding previous ones. Both are based on the combination of greediness and randomization in the constructive process, and coupled with a subsequent l…
A Parallel Approach for Statistical Texture Parameter Calculation
2014
This chapter focusses on the development of a new image processing technique for the processing of large and complex images, especially SAR images. We propose here a new and effective approach that outperforms the existing methods for the calculation of high order textural parameters. With a single processor, this approach is about \(256^{n-1}\) times faster than the co-occurrence matrix approach considered as classical, where \(n\) is the order of the textural parameter for a 256-gray scales image. In a parallel environment made of N processor, this performance can almost be multiply by the factor N. Our approach is based on a new modeling of textural parameters of a generic order \(n>1\) …
Use of Guided Regularized Random Forest for Biophysical Parameter Retrieval
2018
This paper introduces a feature selection method based on random forest -the Guided Regularized Random Forest (GRRF)- which can be used in classification and regression tasks. The method is based on the regularization of the information gain in the random forest nodes to obtain a subset of relevant and non-redundant features. The proposed method is used as a preliminary step In the process of retrieving biophysical parameters from a hyperspectral image. Preliminary experiments show that we can reduce the RMSE of the retrievals by around 7% for the Leaf Area Index and around 8% for the fraction of vegetation cover when compared to the results using random forest features.
Advantages of fitting contrast curves using logistic function: a technical note.
2013
Objective The aim of this article is to demonstrate how the contrast properties of an imaging system can be ideally fitted with the use of stripe patterns and the logistic function. Study Design Stripe patterns with defined amounts of line pairs (lp/mm) per mm (10-20 lp/mm) were recorded with the use of digital photostimulable storage phosphor. Scan data and normalized image data were analyzed with the use of ImageJ and MatLab to calculate different contrast curves. Results For original scan data, the goodness of fit was 0.0000019 (sum of squared error [SSE]). The R-square was 0.9998. For normalized data the goodness of fit was 0.0007 (SSE) and the R-square 0.998. An amount of 50% contrast …