A graph-based mathematical morphology reader - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
L Sun, Q Huo, W Jia, K Chen - Pattern Recognition, 2015 - Elsevier
This paper presents a robust text detection approach based on color-enhanced contrasting extremal region (CER) and neural networks. Given a color natural scene image, six …
To compute the morphological self-dual representation of images, namely the tree of shapes, the state-of-the-art algorithms do not have a satisfactory time complexity …
Discriminating value crops from weeds is an important task in precision agriculture. In this paper, we propose a novel image processing pipeline based on attribute morphology for …
This paper introduces a topological approach to local invariant feature detection motivated by Morse theory. We use the critical points of the graph of the intensity image, revealing …
Connected operators provide well-established solutions for digital image processing, typically in conjunction with hierarchical schemes. In graph-based frameworks, such …
J Havel, F Merciol, S Lefèvre - Journal of Real-Time Image Processing, 2019 - Springer
With the continuous growth of sensor performances, image analysis and processing algorithms have to cope with larger and larger data volumes. Besides, the informative …
Max-trees, or component trees, are graph structures that represent the connected components of an image in a hierarchical way. Nowadays, many application fields rely on …
In recent papers, a new notion of component-graph was introduced. It extends the classical notion of component-tree initially proposed in mathematical morphology to model the …