Search results for " image processing."
showing 10 items of 2265 documents
Constraint Cellular Automata for Urban Development Simulation: An Application to the Strasbourg-Kehl Cross-Border Area
2017
AcknowledgementsThe research presented in this chapter is part of the Smart. Boundary project supported by the Fonds National de la Recherche in Luxembourg and CNRS in France (ref. INTER/CNRS/12/02). The authors would like also to thank the Grasp Program of LISER for allowing cross-collaboration between the two teams based in Luxembourg and France.; International audience; Urban sprawl and space consumption have become key issues in sustainable territorial development. Traditional planning approaches are often insufficient to anticipate their complex spatial consequences, especially in cross-border areas. Such complexity requires the use of dynamic spatial simulations and the development of…
An Adaptive Combination of Dark and Bright Channel Priors for Single Image Dehazing
2017
Dehazing methods based on prior assumptions derived from statistical image properties fail when these properties do not hold. This is most likely to happen when the scene contains large bright areas, such as snow and sky, due to the ambiguity between the airlight and the depth information. This is the case for the popular dehazing method Dark Channel Prior. In order to improve its performance, the authors propose to combine it with the recent multiscale STRESS, which serves to estimate Bright Channel Prior. Visual and quantitative evaluations show that this method outperforms Dark Channel Prior and competes with the most robust dehazing methods, since it separates bright and dark areas and …
Channel aggregation with guard-band in D-OFDM based CRNs: Modeling and performance evaluation
2016
Channel aggregation (CA) techniques can offer flexible channel allocation and improve overall system performance in multi-channel cognitive radio networks (CRNs). Although many CA techniques have been proposed and studied, the impact of guard-band on CA for channel access has not been addressed in-depth. In this paper, we study the guard-band allocation mechanisms in discontinuous-orthogonal frequency division multiplexing (D-OFDM) based CRNs, and investigate the impact of guard-band sharing on SU flows when CA is enabled. Continuous time Markov chain (CTMC) based models have been developed in order to investigate the stochastic behavior of PU and SU flows. Based on our mathematical analysi…
Dynamics of Colloidal Hard Spheres in Thin Aqueous Suspension Layers—Particle Tracking by Digital Image Processing and Brownian Dynamics Computer Sim…
1993
Abstract A new experimentally simple technique is introduced for studying dynamical properties of hard sphere colloids in thin aqueous suspension layers by light-microscopy observation supported by computer-aided digital image processing. The thickness of the layers of the colloidal samples confined between two smooth glass plates is accurately adjusted by monodisperse "spacer" spheres which are larger than the diffusing spheres. Tracking of single particles in concentrated phases is accomplished using fluorescence light microscopy where a few dyed particles are mixed with the undyed colloidal spheres of the same size. First results are presented for the self-diffusion coefficient—(i) in ve…
Détection de formes compactes en imagerie : développement de méthodes cumulatives basées sur l'étude des gradients : Applications à l'agroalimentaire
2018
The counting cells (Malassez, Thoma ...) are designed to allow the enumeration of cells under a microscope and the determination of their concentration thanks to the calibrated volume of the grid appearing in the microscopic image. Manual counting has major disadvantages: subjectivity, non-repeatability ... There are commercial automatic counting solutions, the disadvantage of which is that a well-controlled environment is required which can’t be obtained in certain studies ( eg glycerol greatly affects the quality of the images ). The objective of the project is therefore twofold: an automated cell count and sufficiently robust to be feasible regardless of the acquisition conditions.In a f…
The expressive power of the shuffle product
2010
International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…
Fast Matrix Multiplication
2015
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time O(n2.3725), and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078}); in particular, this approach cannot prove the conjecture that for every e > 0, …
On a class of languages with holonomic generating functions
2017
We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in L-NFCM but not in L-DFCM, and strictly includes L-CPA. We conjecture that L-DFCM subset of RCM
The arithmetic decomposition of central Cantor sets
2018
Abstract Every central Cantor set of positive Lebesgue measure is the arithmetic sum of two central Cantor sets of Lebesgue measure zero. Under some mild condition this result can be strengthened by stating that the summands can be chosen to be C s regular if the initial set is of this class.
A new paradigm for pattern classification: Nearest Border Techniques
2013
Published version of a chapter in the book: AI 2013: Advances in Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-319-03680-9_44 There are many paradigms for pattern classification. As opposed to these, this paper introduces a paradigm that has not been reported in the literature earlier, which we shall refer to as the Nearest Border (NB) paradigm. The philosophy for developing such a NB strategy is as follows: Given the training data set for each class, we shall first attempt to create borders for each individual class. After that, we advocate that testing is accomplished by assigning the test sample to the class whose border it lies closest to…