Éditeur(s) : HAL CCSD
Résumé : International audience
More and more animal species are endangered. In order to study and protect them, several measures have been taken, which now seem to show their limit. This work focuses on the counting process, a key issue for any project that aims to protect animals. Indeed, this paper proposes an algorithm for automatic counting of singing birds in their habitat by using wireless sensors fitted with microphone. Sensors are used to record audio samples of bird songs. These samples are used to extract some kinds of song fingerprint that are thereafter used to recognize the bird species, through a classification process. Afterwards, by analyzing data which have been collected by a central base, the network structure derived from detection fields of sensors, allows our algorithm to propose an estimate of singing birds in the habitat. This paper details the counting algorithm which uses graph theory and audio inputs comparison. Finally, we demonstrate our scheme efficiency through experimentations.
Local Computer Networks (LCN)
Clearwater, United States

hal-00786165
https://hal.archives-ouvertes.fr/hal-00786165
DOI : 10.1109/LCNW.2012.6424060

Éditeur(s) : HAL CCSD Institute of Electrical and Electronics Engineers
Résumé : International audience
Tailoring nearest neighbors algorithms to boosting is an important problem. Recent papers study an approach, UNN, which provably minimizes particular convex surrogates under weak assumptions. However, numerical issues make it necessary to experimentally tweak parts of the UNN algorithm, at the possible expense of the algorithm's convergence and performance. In this paper, we propose a lightweight alternative algorithm optimizing proper scoring rules from a very broad set, and establish formal convergence rates under the boosting framework that surprisingly compete with those known for UNN. It is an adaptive Newton-Raphson algorithm, which belongs to the same lineage as the popular Gentle Adaboost. To the best of our knowledge, no such boosting-compliant convergence rates were previously known for these algorithms. We provide experiments on a dozen domains, including the challenging Caltech and SUN computer vision databases. They display that GNNB significantly outperforms UNN, both in terms of convergence rate and quality of the solution obtained, and GNNB provides a simple and efficient contender to techniques that can be used on very large domains, like stochastic gradient descent -- for which little is known to date. Experiments include a divide-and-conquer improvement of GNNB which exploits the link with proper scoring rules optimization.
ISSN: 0162-8828

hal-00958809
https://hal.archives-ouvertes.fr/hal-00958809
https://hal.archives-ouvertes.fr/hal-00958809/document
https://hal.archives-ouvertes.fr/hal-00958809/file/PAMI.pdf
DOI : 10.1109/TPAMI.2014.2307877

Éditeur(s) : HAL CCSD Institute for Scientific Computing and Information
Résumé : International audience
In this paper, we solve a problem describing the mechanical deformations of a porous medium in the presence of a monophasic linear flow or a two phase nonlinear flow with the purpose of modelizing subsidence of hydrocarbon reservoirs. An essential characteristics of this problem is that the mechanical deformation and the flow have different time scales. In petroleum industry, one uses different very efficient simulators for the flow problem and the mechanical deformations, which enables to handle complex models. Therefore it is necessary to be able to combine as efficiently as possible the exploitation of these simulators. We propose two alternative splitting approaches. The first one is the staggered algorithm used by engineers, which amounts to a Gauss-Seidel method in the one phase linear case. The second approach is based upon the preconditioned conjugate gradient method. We use a numerical multi-scale method in both of these algorithms. We compare these two approaches and we show that the preconditioned conjugate gradient algorithm is faster and more robust than the staggered algorithm. Applying the preconditioned conjugate gradient algorithm therefore seems to compensate for the fact that the inf-sup condition for the mixed discretization method is not satisfied when combining the simulators for the mechanical deformations and for the flow computations.
ISSN: 1705-5105

Droits : http://creativecommons.org/licenses/by/
hal-01449039
https://hal.archives-ouvertes.fr/hal-01449039
https://hal.archives-ouvertes.fr/hal-01449039/document
https://hal.archives-ouvertes.fr/hal-01449039/file/DHLE.pdf

Éditeur(s) : HAL CCSD
Résumé : International audience
We propose an algorithm based on a model of visual perception that is meant to reflect the human judgment about the similarity of handwritten samples. The algorithm builds upon the Fuzzy Feature Contrast model and proposes an implementation of such a model in the domain of handwriting. The algorithm has been validated on the RIMES dataset, by comparing its performance with those of a panel of human experts. The experimental results show that the performance of the proposed algorithm is almost indistinguishable from the expert one and therefore may be a viable tool for handwriting comparison.
17th Biennial Conference of the International Graphonomics Society
Pointe-à-Pitre, Guadeloupe

hal-01165766
https://hal.univ-antilles.fr/hal-01165766
https://hal.univ-antilles.fr/hal-01165766/document
https://hal.univ-antilles.fr/hal-01165766/file/IGS_2015_submission_5.pdf

Éditeur(s) : HAL CCSD
Résumé : International audience
In this note we study the convergence of a descent-proximal method for finding critical points of a DC function. From a practical point of view, we propose an algorithmic pattern obtained by coupling the latter with cutting plane approximations.
Journal of Applied Functional Analysis

hal-00815499
https://hal.univ-antilles.fr/hal-00815499

Éditeur(s) : HAL CCSD Yokohama
Résumé : International audience
We make use of the viscosity technique to develop a convergent method for approximating a common element of the set of fixed points of a demicontractive operator and the set of solutions of a monotone equilibrium problem. The proposed algorithm is obtained by coupling a modified hybrid steepest descent method with the extragradient algorithm. Under mild conditions, the strong convergence of the sequences generated by the algorithm is obtained. Using this result we obtain two corollaries which improve or develop several corresponding results in this field.
Journal of Nonlinear and Convex Analysis

hal-00779988
https://hal.univ-antilles.fr/hal-00779988

Éditeur(s) : HAL CCSD
Résumé : International audience
We present a study on the optimasation of the number of messages for medical diagnosis over wireless sensors networks (WSNs). We suggest distributed algorithms to diagnosis some diseases while monitoring a patient. Then, we compare the number of messages needed to make a decision between the algorithms. In our approach, each sensor will make some computations in order to participate to the decision. Indeed, some computation and collaboration tasks are performed over the sensors and the final diagnosis is performed in a distributed way. During the experimentation of our algorithms, we used a real data flow extracted from hospital monitoring.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), July 5-8, Sousse, Tunisia
Sousse, Tunisia

hal-00519593
https://hal.archives-ouvertes.fr/hal-00519593

Éditeur(s) : Université Paris 7 – Denis Diderot
Résumé : Sea surface salinity (SSS) influences numerous oceanic phenomena, for instance surface water ventilation, deep water formation and thermohaline circulation. SSS also controls some ocean-atmosphere coupled processes, such as the intensity of freshwater flux and the penetration of heat flux and turbulence. Salinity is more difficult to measure than temperature from in situ surveys, which results in 20 times less data being currently available. Moreover, sea surface temperature (SST) is routinely estimated from satellites, which is not possible yet for SSS. Two space missions will fill this gap soon: SMOS from the European Space Agency and Aquarius/SAC-D from NASA and CONAE. To contribute to the SMOS project, we propose a method for estimating SSS from current satellite observations and for studying the mechanisms governing its variability. We developed a simplified model of the ocean mixed layer, based on the "slab mixed layer" formulation (Frankignoul et Hasselmann, 1977). This 2D horizontal model is implemented over the global ocean, using a near 100 km resolution, and integrated during a climatological year. Air-sea fluxes are taken from the ECMWF meteorological model (ERA40 reanalysis) and the surface currents are provided by altimeter data (SSALTO-DUACS analysis). The mixed layer depth (MLD) is derived from SST observations, using an original inversion technique. The MLD fields obtained from this inversion are well correlated to in situ estimates. This effective depth represents the air-sea fluxes penetration and ensures consistency between fluxes, les currents and SST. We first validate the simulation through examination of the heat balance in north-eastern Atlantic, by comparing to measurements and models from the POMME experiment. Then we study the salinity balance in the global domain, in terms of its geographical distribution and seasonal evolution. Equilibrium between the various processes appears generally more complex than for temperature. Noteworthy, the role of atmospheric flux is less predominant (22%), while geostrophic advection (33%) and diapycnal mixing (22%) contribute more strongly. Our results indicate this model succeeds in reconstructing SSS variability over most of the oceans. Daily SSS variations are also simulated, whereas they are not represented in current observed data at a global scale. Owing to its simplicity and fast computation, the model will be useful to the SMOS mission. It can help for the measurement calibration/validation and provide a first guess estimate to the sophisticated algorithm required for SSS restitution.
La salinité de surface des océans (SSS) influence de nombreux phénomènes océaniques, parmi lesquels la ventilation des eaux de surface, la formation d'eaux profondes et la circulation thermohaline. Elle détermine aussi certains processus couplés océan-atmosphère, notamment l'intensité du flux d'eau douce, la pénétration du flux de chaleur et de la turbulence. La mesure in situ de salinité est plus compliquée que celle de température, si bien qu'on dispose actuellement de 20 fois moins de données pour cette propriété. De plus, la température de surface (SST) est couramment estimée par satellite, ce qui n'est pas encore le cas de la SSS. Deux missions spatiales vont prochainement combler cette lacune : le satellite SMOS de l'Agence Spatiale Européenne et le satellite Aquarius/SAC-D de la NASA et de la CONAE. En préparation du projet SMOS, nous proposons une méthode pour estimer la SSS à partir des observations satellitaires actuelles et étudier les mécanismes de sa variabilité. Nous avons développé un modèle simplifié de couche mélangée océanique, basé sur la formulation "slab mixed layer" (Frankignoul et Hasselmann, 1977). Ce modèle 2D horizontal est implémenté sur l'océan global, avec une résolution proche de 100 km, et intégré au cours d'une année climatologique. Les flux air-mer proviennent du modèle météorologique ECMWF (réanalyse ERA40) et les courants de surface sont issus de l'altimétrie (analyse SSALTO-DUACS). La profondeur de la couche mélangée (MLD) est dérivée des observations de SST, grâce à une technique d'inversion originale. La MLD obtenue par inversion est bien corrélée aux estimations basées sur des données in situ. Cette profondeur effective représente la pénétration des flux air-mer et assure la cohérence entre les flux, les courants et la SST. La simulation est d'abord validée en examinant le bilan de chaleur dans l'Atlantique Nord-Est, par comparaison aux mesures et aux modèles de l'expérience POMME. Puis le bilan de salinité est étudié dans le domaine global, en termes de distribution géographique et d'évolution saisonnière. L'équilibre entre les différents processus est généralement plus complexe que pour la température. Notamment, le rôle du flux atmosphérique est moins prépondérant (22%), tandis que l'advection géostrophique (33%) et le mélange diapycnal (22%) contribuent fortement. Nos résultats montrent que ce modèle parvient à restituer la variabilité de la SSS sur la majeure partie des océans. Le modèle simule aussi les variations journalières de SSS, qui ne sont pas représentées à l'échelle globale dans les observations actuelles. Grâce à sa simplicité et à sa rapidité, le modèle pourra être utile dans le cadre de SMOS. Il pourra aider à la calibration/validation de la mesure et fournir une estimation a priori pour l'algorithme complexe nécessaire à la restitution de la SSS.

Droits : info:eu-repo/semantics/openAccess
http://archimer.ifremer.fr/doc/2006/these-2302.pdf
http://archimer.ifremer.fr/doc/00000/2302/

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
We consider a variable Krasnosel'skii-Mann algorithm for approximating critical points of a prox-regular function or equivalently for finding fixed-points of its proximal mapping proxλf. The novelty of our approach is that the latter is not non-expansive any longer. We prove that the sequence generated by such algorithm (via the formula xk+1=(1−αk)xk+αkproxλkfxk, where (αk) is a sequence in (0,1)), is an approximate fixed-point of the proximal mapping and converges provided that the function under consideration satisfies a local metric regularity condition.
ISSN: 0362-546X

hal-00778175
https://hal.univ-antilles.fr/hal-00778175
DOI : 10.1016/j.na.2009.07.011

Résumé : Cette thèse est consacrée à la résolution d'un problème fondamental de l'analyse variationnelle qu'est la recherchede zéros d'opérateurs maximaux monotones dans un espace de Hilbert. Nous nous sommes tout d'abord intéressés au cas de l'opérateur somme étendue de deux opérateurs maximaux monotones; la recherche d'un zéro de cet opérateur est un problème dont la bibliographie est peu fournie: nous proposons une version modifiée de l'algorithme d'éclatement forward-backward utilisant à chaque itération, l'epsilon-élargissement d'un opérateur maximal monotone,afin de construire une solution. Nous avons ensuite étudié la convergence d'un nouvel algorithme de faisceaux pour construire ID zéro d'un opérateur maximal monotone quelconque en dimension finie. Cet algorithme fait intervenir une double approximation polyédrale de l'epsilon-élargissement de l'opérateur considéré
This thesis is devoted to solving a basic problem of variational analysis which is the search of zeros of maximal monotone operators in a Hilbert space. First of aIl, we concentrate on the case of the extended som of two maximal monotone operators; the search of a zero of this operator is a problem for which the bibliography is not abondant: we purpose a modified version of the forward-backward splitting algorithm using at each iteration, the epsilon-enlargement of a maximal monotone operator, in order to construet a solution. Secondly, we study the convergence of a new bondie algorithm to construet a zero of an arbitrary maximal monotone operator in a finite dimensional space. In this algorithm, intervenes a double polyhedral approximation of the epsilon-enlargement of the considered operator

http://www.theses.fr/2012AGUY0548/document

Éditeur(s) : HAL CCSD
Résumé : International audience
Several assessments of vulnerability and resilience have been attempted at a country level through composite indices but they are barely in accord with a holistic view of sustainable development. We suggest graph theory to structure a network of variables that depict vulnerability and resilience from a sustainable development perspective. Vulnerability is defined as the propensity to incur adverse shocks whereas resilience is the capacity to cope with their negative effects. We identify two control dimensions of vulnerability–resilience (economic and political) and three contingency factors (the social, environmental and the peripheral dimensions). The specificity of the control dimensions is rooted in their impact on all other sides of the pentagon. We propose an algorithm to select the key variables useful in building a composite index that conforms to the structure of these five dimensions while preventing loss of information. An application is provided on Singapore, which has been specified as a typical case of resilience.
Economic Modelling

hal-01291338
https://hal.archives-ouvertes.fr/hal-01291338

Éditeur(s) : HAL CCSD
Résumé : J'étais à l'époque dans le laboratoire I3S de Sophia-Antipolis. Je suis dorénavant au laboratoire GRIMAAG en Guadeloupe.
We focused on the communication problem within multi-agents systems, inspirited by nature and more precisely by the ants that are a perfect example of living integrating learning (ontogenesis) to genetic inheritance (phylogenesis): the Baldwin Effect.
We worked with agents represented by classifiers systems using genetic algorithm. We introduced a new fixed knowledge based classifiers system, the simplified Pittsburgh classifier system, which we studied in a spontaneous coordination multi-agents problem. Then, we successfully allowed “homogeneous” agents to communicate their “knowledge” using distributed elitism.
Finally, “heterogeneous” agents efficiently exchanged information thanks to a minimal communication model we defined, bound to reality and extended.
Nous nous sommes intéressés à la problématique de la communication au sein des systèmes multi-agents en nous inspirant de la nature et plus particulièrement des fourmis qui sont un parfait exemple de l'intégration de l'apprentissage du vivant (ontogenèse) au capital génétique de celui-ci (phylogénie) : l'effet Baldwin.
Nous avons choisi de travailler avec des systèmes de classeurs à algorithme génétique pour représenter les agents. Nous avons introduit un nouveau type de système de classeurs à base de connaissance de taille fixe, les systèmes de classeurs de type Pittsburgh simplifié, dont nous avons étudié les propriétés dans un contexte multi-agents de coordination spontanée.
Nous avons ensuite proposé avec succès aux agents "homogènes" de communiquer pour échanger leur "connaissance" à l'aide de l'élitisme distribué.
Enfin, les agents "hétérogènes" ont échangé efficacement des informations grâce à un modèle minimal de communication que nous avons ancré dans la réalité puis étendu.
https://tel.archives-ouvertes.fr/tel-00192372

tel-00192372
https://tel.archives-ouvertes.fr/tel-00192372
https://tel.archives-ouvertes.fr/tel-00192372/document
https://tel.archives-ouvertes.fr/tel-00192372/file/These.pdf

Éditeur(s) : HAL CCSD
Résumé : In this paper we introduce k-laminar graphs a new class of graphs which extends the idea of Asteroidal triple free graphs. Indeed a graph is k-laminar if it admits a diametral path that is k-dominating. This bio-inspired class of graphs was motivated by a biological application dealing with sequence similarity networks of reads (called hereafter read networks for short). We briefly develop the context of the biological application in which this graph class appeared and then we consider the relationships of this new graph class among known graph classes and then we study its recognition problem. For the recognition of k-laminar graphs, we develop polynomial algorithms when k is fixed. For k=1, our algorithm improves a Deogun and Krastch's algorithm (1999). We finish by an NP-completeness result when k is unbounded.
https://hal.inria.fr/hal-01282715

hal-01282715
https://hal.inria.fr/hal-01282715
ARXIV : 1603.01179

Éditeur(s) : HAL CCSD
Résumé : International audience
In this paper we propose a hybrid approach using mutual information and multi-objective optimization for feature subset selection problem. The hybrid aspect is due to the sequence of a filter method and a wrapper method in order to take advantages of both. The filter method reduces the exploration space by keeping subsets having good internal properties and the wrapper method chooses among the remaining subsets with a classification performances criterion. In the filter step, the subsets are evaluated in a multi-objective way to ensure diversity within the subsets. The evaluation is based on the mutual information to estimate the dependency between features and classes and the redundancy between features within the same subset. We kept the non-dominated (Pareto optimal) subsets for the second step. In the wrapper step, the selection is made according to the stability of the subsets regarding classification performances during learning stage on a set of classifiers to avoid the specialization of the selected subsets for a given classifiers. The proposed hybrid approach is experimented on a variety of reference data sets and compared to the classical feature selection methods FSDD and mRMR. The resulting algorithm outperforms these algorithms and the computation complexity remains acceptable even if it increases with regards to these two fast selection methods.
Journal of Informatics and Mathematical Sciences

hal-01375982
https://hal.archives-ouvertes.fr/hal-01375982

Éditeur(s) : HAL CCSD ACM
Résumé : International audience
In 2008 a scientific paper written by Butz and al. investigated Matching in Learning Classifier Systems. Matching represents at least 65% of the computational time when executing a classifier system as reported in Llora and al. We propose to modify that encoding using a fast and accurate matching replacing standard matching algorithm for character-based classifier systems.
Proceedings of the 12th annual conference comp on Genetic and evolutionary computation
Portland, Oregon, United States

hal-00520610
https://hal.archives-ouvertes.fr/hal-00520610
DOI : 10.1145/1830761.1830820

Éditeur(s) : HAL CCSD
Résumé : International audience
In this paper, we investigate image segmentation by region merging. Given any similarity measure between regions , satisfying some weak constraints, we give a general predicate for answering if two regions are to be merged or not during the segmentation process. Our predicate is generic and has six properties. The first one is its inde-pendance with respect to the similarity measure, that leads to a user-independant and adaptative predicate. Second, it is non-parametric, and does not rely on any assumption concerning the image. Third, due to its weak constraints, knowledge may be included in the predicate to fit better to the user's behaviour. Fourth, provided the similarity is well-chosen by the user, we are able to upperbound one type of error made during the image segmentation. Fifth, it does not rely on a particular segmentation algorithm and can be used with almost all region-merging algorithms in various application domains. Sixth, it is calculated quickly, and can lead with appropriated algorithms to very efficient segmentation.
10th IEEE International Conference on Tools with Artificial Intelligence
Taipei, Taiwan

lirmm-01168371
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01168371/file/FioNocICTAI98_Image%20Segmentation%20Using.pdf
DOI : 10.1109/TAI.1998.744885

Éditeur(s) : HAL CCSD
Résumé : International audience
Beaucoup de phénomènes sont de nature stochastique et nécessitent pour être modélisés et prédits des techniques statistiques appropriées. Un processus ponctuel (Daley et Veres Jones (1988); Karr (1991) ; van Lieshout (2000)) est un mécanisme stochastique qui modélise des localisations de points dans un espace donné. Une répartition de points dans l'espace ou dans le temps peut-être considérée comme la réalisation d'un processus ponctuel (Vaillant (1991,1992)). Elle se présente sous la forme d'un ensemble de coordonnées et/ou de dates d'occurrences. On ne dispose en général que d'une réalisation de ce processus (Vaillant et al. (1997)). La loi d'un processus ponctuel est complètement caractérisée par son processus intensité conditionnelle et la modélisation se fait donc uniquement à travers ce dernier. Notre étude concerne l'apport des modèles de mélange de processus ponctuels dans de telles modélisations. Elle fait également apparaître l'utilité de l'approche bayésienne pour apprécier la variabilité associée à certains facteurs environnementaux. Le lien avec les lois a priori Stick-Breaking (Ishwaran et James (2001)) telles que le processus de Dirichlet (Ferguson (1973,1974)) est présenté. Des modèles de mélange de processus de Poisson non homogènes ont été présentés par différents auteurs, par exemple, Kottas et Sanso (2007) ont considéré pour la loi mélangeante un processus de Dirichlet. Il est à noter cependant, que lorsque les données sont sous forme de comptages régionalisés, la modélisation concerne plutôt la loi de dénombrement (Green et Richardson (2002)). Pour notre part, nous nous intéressons à des processus Stick-Breaking à noyaux pour la prise en compte des localisations locales dans les mélanges spatiaux de processus ponctuels. Des algorithmes de type MCMC pour le traitement approprié de données incomplètes sont présentés et discutés puis sont testés sur des données artificielles.
42èmes Journées de Statistique
Marseille, France, France

inria-00494724
https://hal.inria.fr/inria-00494724
https://hal.inria.fr/inria-00494724/document
https://hal.inria.fr/inria-00494724/file/p65.pdf

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Given a graph, its hyperbolicity is a measure of how close its distance distribution is to the one of a tree. This parameter has gained recent attention in the analysis of some graph algorithms and the classification of complex networks. We study on practical improvements for the computation of hyperbolicity in large graphs. Precisely, we investigate on relations between the hyperbolicity of a graph G and the hyperbolicity of its atoms, that are the subgraphs output by the clique-decomposition invented by Tarjan [51, 65]. We prove that the maximum hyperbolicity taken over the atoms is at most one unit off from the hyperbol-icity of G and the bound is sharp. We also give an algorithm to slightly modify the atoms, called the " substitution method " , which is at no extra cost than computing the clique-decomposition, and so that the maximum hyperbolicity taken over the resulting graphs is exactly the hyperbolicity of the input graph G. An experimental evaluation of our method for computing the hyperbolicity of a given graph from its atoms is provided for collaboration networks and biological networks. Finally, on a more theoretical side, we deduce from our results the first linear-time algorithm for computing the hyperbolicity of an outerplanar graph.
ISSN: 0304-3975

hal-01540756
https://hal.inria.fr/hal-01540756
https://hal.inria.fr/hal-01540756/document
https://hal.inria.fr/hal-01540756/file/CCDL-2017.pdf
DOI : 10.1016/j.tcs.2017.06.001

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Magnetic Resonance Imaging (MRI), a reference examination for cardiac morphology and function in humans, allows to image the cardiac right ventricle (RV) with high spatial resolution. The segmentation of the RV is a difficult task due to the variable shape of the RV and its ill-defined borders in these images. The aim of this paper is to evaluate several RV segmentation algorithms on common data. More precisely, we report here the results of the Right Ventricle Segmentation Challenge (RVSC), concretized during the MICCAI'12 Conference with an on-site competition. Seven automated and semi-automated methods have been considered, along them three atlas-based methods, two prior based methods, and two prior-free, image-driven methods that make use of cardiac motion. The obtained contours were compared against a manual tracing by an expert cardiac radiologist, taken as a reference, using Dice metric and Hausdorff distance. We herein describe the cardiac data composed of 48 patients, the evaluation protocol and the results. Best results show that an average 80% Dice accuracy and a 1cm Hausdorff distance can be expected from semi-automated algorithms for this challenging task on the datasets, and that an automated algorithm can reach similar performance, at the expense of a high computational burden. Data are now publicly available and the website remains open for new submissions (http://www.litislab.eu/rvsc/).
ISSN: 1361-8415

hal-01141170
https://hal.archives-ouvertes.fr/hal-01141170
PUBMED : 25461337

Éditeur(s) : HAL CCSD Oxford University Press (OUP)
Résumé : International audience
Several studies, both theoretical and experimental, show that sedimentary rocks have a fractal pore-grain interface. In this paper a computer simulated 3-D sedimentary rock structure generated by the Relaxed Ballistic Bidisperse Deposition Model (RBBDM), is investigated to characterize the micro structure of its pores. The pore volume and the rock-pore interface show the same fractal dimension indicating that the pore volume is a fractal. The two point density correlation is computed for the pore space and the results compare favourably with the range reported from experiments. An array of 2-D X-ray tomography micrograph sections of a real sedimentary rock, an oolitic limestone (pure calcite) from the Mondeville formation of Middle Jurassic age (Paris Basin, France), was used to generate a 3-D bitmap. The 3-D real rock sample generated in this manner, was analysed for similar studies as the simulated structure. The results were compared with those obtained from simulation. The simulation results agree qualitatively with the real rock sample. Diffusion through the connected pore space of the simulated structure was studied using a random walk algorithm and the results compared with the similar simulation study done on the 3-D oolitic limestone specimen. In both cases diffusion was found to be anomalous indicating that the sedimentary rock has a fractal geometry. The favourable comparability of results between the simulated and real rock supports the usefulness of the model of sedimentary rock generation which can be applicable to transport phenomena.
ISSN: 0956-540X

hal-00823061
https://hal.archives-ouvertes.fr/hal-00823061
DOI : 10.1093/gji/ggs084