Connected Filtering on Tree-Based Shape-Spaces

International audienceConnected filters are well-known for their good contour preservation property. A popular implementation strategy relies on tree-based image representations: for example, one can compute an attribute characterizing the connected component represented by each node of the tree and keep only the nodes for which the attribute is sufficiently high. This operation can be seen as a thresholding of the tree, seen as a graph whose nodes are weighted by the attribute. Rather than being satisfied with a mere thresholding, we propose to expand on this idea, and to apply connected filters on this latest graph. Consequently, the filtering is performed not in the space of the image, but in the space of shapes built from the image. Such a processing of shape-space filtering is a generalization of the existing tree-based connected operators. Indeed, the framework includes the classical existing connected operators by attributes. It also allows us to propose a class of novel connected operators from the leveling family, based on non-increasing attributes. Finally, we also propose a new class of connected operators that we call morphological shapings. Some illustrations and quantitative evaluations demonstrate the usefulness and robustness of the proposed shape-space filters

Automatic Selection of Stochastic Watershed Hierarchies

International audienceThe segmentation, seen as the association of a partition with an image, is a difficult task. It can be decomposed in two steps: at first, a family of contours associated with a series of nested partitions (or hierarchy) is created and organized, then pertinent contours are extracted. A coarser partition is obtained by merging adjacent regions of a finer partition. The strength of a contour is then measured by the level of the hierarchy for which its two adjacent regions merge. We present an automatic segmentation strategy using a wide range of stochastic watershed hierarchies. For a given set of homogeneous images, our approach selects automatically the best hierarchy and cut level to perform image simplification given an evaluation score. Experimental results illustrate the advantages of our approach on several real-life images datasets

A study of observation scales based on Felzenswalb-Huttenlocher dissimilarity measure for hierarchical segmentation

International audienceHierarchical image segmentation provides a region-oriented scale-space, i.e., a set of image segmentations at different detail levels in which the segmentations at finer levels are nested with respect to those at coarser levels. Guimarães et al. proposed a hierarchical graph based image segmentation (HGB) method based on the Felzenszwalb-Huttenlocher dissimilarity. This HGB method computes, for each edge of a graph, the minimum scale in a hierarchy at which two regions linked by this edge should merge according to the dissimilarity. In order to generalize this method, we first propose an algorithm to compute the intervals which contain all the observation scales at which the associated regions should merge. Then, following the current trend in mathematical morphology to study criteria which are not increasing on a hierarchy, we present various strategies to select a significant observation scale in these intervals. We use the BSDS dataset to assess our observation scale selection methods. The experiments show that some of these strategies lead to better segmentation results than the ones obtained with the original HGB method

Development of criteria suitable for machine learning based on morphological hierarchical trees

The goal of this work is to study image criteria to be assigned to morphological trees such as Max/Mintree, Binary Partition Trees or similar representations to be able to classify the tree node and to identify the presence of object of interest in the scene.Nowadays the technology is changing the way of performing and it is adapting towards Artificial Intelligence. However this technique is still being introduced and is not common in the domain of image processing based on morphological trees. This thesis focuses on the creation of a criterion based on machine learning to be assigned into morphological tree. The developed criterion is based on a Convolutional Neural Network, called Overfeat, which runs in to the nodes of a Binary Partition Tree, in order to be able to detect traffic signs. It has turned out to be a suitable criterion to identify traffic sings in images but it has room of improvement due to its performance is lower than 70% of success.Hoy en día la tecnología está cambiando su forma de actuar y se está adaptando hacia la Inteligencia Artificial. Aunque esta técnica se está introduciendo, no es muy común en el dominio del procesamiento de imagen basado en arboles morfológicos. Esta tesis se centra en la creación de un criterio basado en Machine learning que se asigna a un árbol morfológico. El criterio desarrollado en este proyecto se basa en una Red Neuronal Colvolucional, llamada Overfeat, que trabaja sobre los nodos de un árbol de partición binaria, para ser capaz de identificar señales de tráfico. El criterio ha resultado ser adecuado para identificar señales de tráfico pero aún tiene margen de mejora ya que los resultados obtenidos no son superiores al 70% de acierto.Avui en dia la tecnologia esta canviant la seva forma d'actuar i s'està adaptant cap a la Intel·ligència Artificial. Tot i que aquesta tècnica s'està introduint no és gaire comú en el domini del processament d'imatge basat en arbres morfològics. Aquesta tesis es centra en la creació d'un criteri basat en machine learning que s'assigna a un arbre morfològic. El criteri desenvolupat en aquest projecte es basa en una Xarxa Neuronal Convolucional, anomenada Overfeat, que treballa sobre els nodes d'un arbre de partició binaria, per ser capaç d'identificar senyals de transit. El criteri ha resultat ser adequat per identificar senyals de transit però encara te marge de millora ja que els resultats obtinguts no son superiors al 70% d'encert

Logarithmic Mathematical Morphology: theory and applications

Classically, in Mathematical Morphology, an image (i.e., a grey-level function) is analysed by another image which is named the structuring element or the structuring function. This structuring function is moved over the image domain and summed to the image. However, in an image presenting lighting variations, the analysis by a structuring function should require that its amplitude varies according to the image intensity. Such a property is not verified in Mathematical Morphology for grey level functions, when the structuring function is summed to the image with the usual additive law. In order to address this issue, a new framework is defined with an additive law for which the amplitude of the structuring function varies according to the image amplitude. This additive law is chosen within the Logarithmic Image Processing framework and models the lighting variations with a physical cause such as a change of light intensity or a change of camera exposure-time. The new framework is named Logarithmic Mathematical Morphology (LMM) and allows the definition of operators which are robust to such lighting variations. In images with uniform lighting variations, those new LMM operators perform better than usual morphological operators. In eye-fundus images with non-uniform lighting variations, a LMM method for vessel segmentation is compared to three state-of-the-art approaches. Results show that the LMM approach has a better robustness to such variations than the three others

Ship detection in SAR images based on Maxtree representation and graph signal processing

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper discusses an image processing architecture and tools to address the problem of ship detection in synthetic-aperture radar images. The detection strategy relies on a tree-based representation of images, here a Maxtree, and graph signal processing tools. Radiometric as well as geometric attributes are evaluated and associated with the Maxtree nodes. They form graph attribute signals which are processed with graph filters. The goal of this filtering step is to exploit the correlation existing between attribute values on neighboring tree nodes. Considering that trees are specific graphs where the connectivity toward ancestors and descendants may have a different meaning, we analyze several linear, nonlinear, and morphological filtering strategies. Beside graph filters, two new filtering notions emerge from this analysis: tree and branch filters. Finally, we discuss a ship detection architecture that involves graph signal filters and machine learning tools. This architecture demonstrates the interest of applying graph signal processing tools on the tree-based representation of images and of going beyond classical graph filters. The resulting approach significantly outperforms state-of-the-art algorithms. Finally, a MATLAB toolbox allowing users to experiment with the tools discussed in this paper on Maxtree or Mintree has been created and made public.Peer ReviewedPostprint (author's final draft

REGION HOMOGENEITY IN THE LOGARITHMIC IMAGE PROCESSING FRAMEWORK: APPLICATION TO REGION GROWING ALGORITHMS

In order to create an image segmentation method robust to lighting changes, two novel homogeneity criteria of an image region were studied. Both were defined using the Logarithmic Image Processing (LIP) framework whose laws model lighting changes. The first criterion estimates the LIP-additive homogeneity and is based on the LIP-additive law. It is theoretically insensitive to lighting changes caused by variations of the camera exposure-time or source intensity. The second, the LIP-multiplicative homogeneity criterion, is based on the LIP-multiplicative law and is insensitive to changes due to variations of the object thickness or opacity. Each criterion is then applied in Revol and Jourlin’s (1997) region growing method which is based on the homogeneity of an image region. The region growing method becomes therefore robust to the lighting changes specific to each criterion. Experiments on simulated and on real images presenting lighting variations prove the robustness of the criteria to those variations. Compared to a state-of the art method based on the image component-tree, ours is more robust. These results open the way to numerous applications where the lighting is uncontrolled or partially controlled