| Full text | |
| Author(s): |
Morimitsu, Alexandre
;
Luz Alves, Wonder Alexandre
;
Silva, Dennis Jose
;
Gobber, Charles Ferreira
;
Hashimoto, Ronaldo Fumio
;
Couprie, M
;
Cousty, J
;
Kenmochi, Y
;
Mustafa, N
Total Authors: 9
|
| Document type: | Journal article |
| Source: | DISCRETE GEOMETRY FOR COMPUTER IMAGERY, DGCI 2019; v. 11414, p. 12-pg., 2019-01-01. |
| Abstract | |
Component trees are interesting structures of nested connected components, efficiently represented by max-trees, used to implement fast algorithms in Image Processing. In these structures, connected components are constructed using a single neighborhood. In recent years, an extension of component trees, called component-hypertrees, was introduced. It consists of a sequence of component trees, generated from a sequence of increasing neighborhoods, in which their connected components are also hierarchically organized. Although this structure could be useful in applications dealing with clusters of objects, not much attention has been given to component-hypertrees. A naive implementation can be costly both in terms of time and memory. So, in this paper, we present algorithms and data structures to efficiently compute and store these structures without redundancy obtaining a minimal representation of component-hypertrees. Experimental results using our efficient algorithm show that the number of nodes is reduced by approximately 70% in comparison to a naive implementation. (AU) | |
| FAPESP's process: | 18/15652-7 - Image segmentation based on shape constraints through the ultimate levelings |
| Grantee: | Wonder Alexandre Luz Alves |
| Support Opportunities: | Regular Research Grants |