Incremental bit-quads count in component trees: Theory, algorithms, and optimization

Autor(es)

Silva, Dennis J. ^[1] ; Alves, Wonder A. L. ^[2] ; Hashimoto, Ronaldo Fumio ^[1]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Inst Matemat & Estat, Rua Matao, BR-1010 Sao Paulo, SP - Brazil

^[2] Univ Nove Julho, Informat & Knowledge Management Grad Program, Sao Paulo, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: PATTERN RECOGNITION LETTERS; v. 129, p. 33-40, JAN 2020.
• Citações Web of Science: 0

Resumo

Component tree is a full image representation which encodes all connected components from upper (resp. lower) level sets of a given image through the inclusion relation. Information from this representation can be used in many image processing and computational vision applications, e.g. connected filtering, image segmentation, feature extraction, among others. In general, each node of a component tree represents a connected component of a level set and stores attributes which describes features of this connected component. This paper presents a review of a previously published method to compute attributes such as area, perimeter, and number of Euler by incrementally counting patterns while traversing nodes of a component tree. This method foundation is further detailed in this paper by presenting a novel theoretical background and algorithm correctness intuition. We also present a novel approach for this algorithm showing improvements for run-time execution and precision analysis. (C) 2019 Elsevier B.V. All rights reserved. (AU)

• Processo FAPESP: 18/15652-7 - Segmentação de imagens baseada em restrições de formas por meio dos últimos levelings
• Beneficiário: Wonder Alexandre Luz Alves
• Modalidade de apoio: Auxílio à Pesquisa - Regular
• Processo FAPESP: 15/01587-0 - Armazenagem, modelagem e análise de sistemas dinâmicos para aplicações em e-Science
• Beneficiário: João Eduardo Ferreira
• Modalidade de apoio: Auxílio à Pesquisa - Programa eScience e Data Science - Temático