检索结果-内蒙古大学图书馆

A linear-time component-labeling algorithm using contour tracing technique

COMPUTER VISION AND IMAGE UNDERSTANDING 2004年第2期93卷 206-220页

作者： Chang, F Chen, CJ Lu, CJ Acad Sinica Inst Informat Sci Taipei 115 Taiwan

A new linear-time algorithm is presented in this paper that simultaneously, labels connected components (to be referred to merely as components in this paper) and their contours in binary images. The main step of this algorithm is to use a contour tracing technique to detect the external contour and possible internal contours of each component, and also to identify and label the interior area of each component. labeling is done in a single pass over the image, while contour points are revisited more than once, but no more than a constant number of times. Moreover, no re-labeling is required throughout the entire process, as it is required by other algorithms. Experimentation on various types of images (characters, halftone pictures, photographs, newspaper, etc.) shows that our method outperforms methods that use the equivalence technique. Our algorithm not only labels components but also extracts component contours and sequential orders of contour points, which can be useful for many applications. (C) 2003 Elsevier Inc. All rights reserved.

关键词： component-labeling algorithm contour tracing linear-time algorithm

来源：评论

学校读者我要写书评

暂无评论

Local maximum component-labeling based on parallel local operation sequence for layout analysis

Local maximum component-labeling based on parallel local ope...

引用

6th World Congress on Intelligent Control and Automation

作者： Li, Feng Wu, Wei Dalian Univ Technol Dept Appl Math Dalian 116024 Peoples R China

ISBN: (纸本)1424403316

A definition of the local maximum component (the component for short) is presented for layout analysis in document image analysis (DIA), and a novel algorithm for component labeling was described. This algorithm uses a contour tracing technique to detect and label the external contour of each component, and removes the interior area of each component from the copy of the source image. labeling and removing are completed in a single pass over source image. Experiments on various kinds of images (title, text, picture, table and formula) show that the new definition and algorithm are more efficient and flexible than the traditional labeling ones.

关键词： local maximum component component-labeling algorithm parallelizable layout analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：