skip to main content
Primo Search
Search in: Busca Geral
Tipo de recurso Mostra resultados com: Mostra resultados com: Índice

A New Framework for Connected Components Labeling of Binary Images

Asano, Tetsuo ; Bereg, Sergey

Combinatorial Image Analaysis, Vol.7655, p.90-102 [Periódico revisado por pares]

Berlin, Heidelberg: Springer Berlin Heidelberg

Texto completo disponível

Citações Citado por
  • Título:
    A New Framework for Connected Components Labeling of Binary Images
  • Autor: Asano, Tetsuo ; Bereg, Sergey
  • Assuntos: Computational complexity ; Connected component ; Limited work space
  • É parte de: Combinatorial Image Analaysis, Vol.7655, p.90-102
  • Descrição: Given a binary image of n pixels, assign integral labels to all pixels so that any background pixel has label 0 and any two foreground pixels have the same positive integral labels, if and only if they belong to the same connected components. This problem is referred to as ’Connected Components Labeling’ and it is one of the most fundamental problems in image processing and analysis. This paper presents a new algorithmic framework for the problem. From an algorithmic point of view, the problem can be solved in O(n) time and O(n) space. We propose new algorithms which use smaller work space without much sacrifice of the running time. More specifically, assuming that an input binary image is given by a read-only array, our algorithm outputs correct labels in the raster order in O(n logn) time using only \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$O(\sqrt{n})$\end{document} work space. Some applications of the algorithms are also given.
  • Títulos relacionados: Lecture Notes in Computer Science
  • Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.