A strategy for repetitive neighbor finding in images represented by quadtrees

被引:13
|
作者
Voros, J [1 ]
机构
[1] Slovak Univ Technol Bratislava, Fac Elect Engn & Informat Technol, Dept Automat & Control, Bratislava 81219, Slovakia
关键词
quadtrees; neighbor finding;
D O I
10.1016/S0167-8655(97)80001-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper presents an effective strategy for repetitive neighbor finding in binary images which is proper for mobile robot path planning, connected component labeling, etc. It is based on a new neighbor finding method which is universal and generates all the possible and arbitrary sized neighbors (larger, smaller, equal) for any quadtree node using simple algebraic operations. (C) 1997 Elsevier Science B.V.
引用
收藏
页码:955 / 962
页数:8
相关论文
共 50 条