論文

査読有り
2017年1月

A new algorithmic framework for basic problems on binary images

DISCRETE APPLIED MATHEMATICS
  • T. Asano
  • ,
  • L. Buzer
  • ,
  • S. Bereg

216
開始ページ
376
終了ページ
392
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.1016/j.dam.2016.02.025
出版者・発行元
ELSEVIER SCIENCE BV

This paper presents a new algorithmic framework for some basic problems on binary images. Algorithms for binary images such as. one of extracting a connected component containing a query pixel and that of connected components labeling play basic roles in image processing. Those algorithms usually use linear work space for efficient implementation. In this paper we propose algorithms for several basic problems on binary images which are efficient in time and space, using space-efficient algorithms for grid graphs. More exactly, some of them run in O(n log n) time using O(1) work space and the others run in O(n) or O(n log n) time using O(root n) work space for a binary image of n pixels stored in a read-only array. (C) 2016 Elsevier B.V. All rights reserved.

Web of Science ® 被引用回数 : 1

リンク情報
DOI
https://doi.org/10.1016/j.dam.2016.02.025
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000390504100006&DestApp=WOS_CPL
URL
http://dblp.uni-trier.de/db/journals/dam/dam216.html#journals/dam/AsanoBB17
ID情報
  • DOI : 10.1016/j.dam.2016.02.025
  • ISSN : 0166-218X
  • eISSN : 1872-6771
  • DBLP ID : journals/dam/AsanoBB17
  • Web of Science ID : WOS:000390504100006

エクスポート
BibTeX RIS