Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing
- 30 December 2010
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 20 (6) , 1504-1516
Abstract
Mathematical morphology (MM) offers a wide range of operators to address various image processing problems. These operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this paper, we introduce a nonlocal PDEs-based morphological framework defined on weighted graphs. We present and analyze a set of operators that leads to a family of discretized morphological PDEs on weighted graphs. Our formulation introduces nonlocal patch-based configurations for image processing and extends PDEs-based approach to the processing of arbitrary data such as nonuniform high dimensional data. Finally, we show the potentialities of our methodology in order to process, segment and classify images and arbitrary data.Keywords
This publication has 41 references indexed in Scilit:
- Graph-based tools for microscopic cellular image segmentationPattern Recognition, 2009
- A comparative study on multivariate mathematical morphologyPattern Recognition, 2007
- Image filtering using morphological amoebasImage and Vision Computing, 2007
- Adaptive mathematical morphology for edge linkingInformation Sciences, 2004
- Fast extraction of minimal paths in 3D images and applications to virtual endoscopyMedical Image Analysis, 2001
- Morphological Operators for Image SequencesComputer Vision and Image Understanding, 1995
- Efficient algorithms for globally optimal trajectoriesIEEE Transactions on Automatic Control, 1995
- Morphological gradientsJournal of Electronic Imaging, 1993
- A Level Set Formulation for the Solution of the Dirichlet Problem for Hamilton–Jacobi EquationsSIAM Journal on Mathematical Analysis, 1993
- Relative neighborhood graphs and their relativesProceedings of the IEEE, 1992