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

Implementation and comparison of binary thinning algorithms on GPU

COMPUTING 2019年第8期101卷 1091-1117页

作者： Ben Boudaoud, Lynda Solaiman, Basel Tari, Abdelkamel Univ Bejaia Fac Sci Exactes LIMED Lab Informat Med Bejaia Algeria IMT Atlantique Inst Image & Informat Proc Dept Brest France

thinning algorithms have been widely applied in many applications such as computer graphics, computer vision and medical imaging. The performances of thinning algorithms are hampered by the increase of image's size and image's content. By employing graphics processing units (GPUs), the calculation of thinning algorithms can be accelerated. In this paper, we present GPU parallel versions of well-known binary thinning algorithms namely the ZS algorithm, the GH algorithm, the AW algorithm and the hybrid algorithm belonging to different classes for an efficient implementation using CUDA as a parallel programming model. These thinning algorithms are then evaluated and compared according to quality and runtime measures. The obtained results show that the GPU multithreaded implementations of the selected algorithms present high computational speed outperforming the central processing unit sequential implementations achieving the best average speedup when executing the AW algorithm.

关键词： thinning algorithm Binary image Performance evaluation CUDA GPU

来源：评论

学校读者我要写书评

暂无评论

A Fast Robot Path Planning algorithm Based on Image thinning

A Fast Robot Path Planning Algorithm Based on Image Thinning

引用

3rd International Conference on Intelligent Robotics and Applications (ICIRA)

作者： Xu, Ke Fu, Ruiqing Deng, Lei Ou, Yongsheng Wu, Xinyu Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China

ISBN: (纸本)9783642165832

A fast, reliable mapping and path planning method is essential to autonomous mobile robots. Popular global algorithms usually adopt occupancy gird maps (OGM) or a topological map (TM) to generate a practicable path. In this paper, we present a new path planning algorithm based on the image thinning process and the extraction of key nodes. It requires much less time and memory compared with the OGM method for generating a path, and much simpler, more robust than the TM, while preserving advantages of both. With the new algorithm, a collision-free path could be obtained in real time. Results from simulation experiments validate its efficiency and reliability.

关键词： mobile robots thinning algorithm path planning

来源：评论

学校读者我要写书评

暂无评论

Improved 3D thinning algorithms for Skeleton Extraction

Improved 3D Thinning Algorithms for Skeleton Extraction

引用

11th Conference on Digital Image Computing: Techniques and Applications

作者： She, F. H. Chen, R. H. Gao, W. M. Hodgson, P. D. Kong, L. X. Hong, H. Y. Deakin Univ Ctr Mat & Fiber Innovat Waurn Ponds Vic 3217 Australia Wuhan Inst Technol Lab Image Proc Wuhan 430074 Peoples R China

ISBN: (纸本)9781424452972

In this study, we focused on developing a novel 3D thinning algorithm to extract one-voxel wide skeleton from various 3D objects aiming at preserving the topological information. The 3D thinning algorithm was testified on computer-generated and real 3D reconstructed image sets acquired from TEMT and compared with other existing 3D thinning algorithms. It is found that the algorithm has conserved medial axes and simultaneously topologies very well, demonstrating many advantages over the existing technologies. They are versatile, rigorous, efficient and rotation invariant.

关键词： three dimensional image skeleton extraction thinning algorithm topoplogical information

来源：评论

学校读者我要写书评

暂无评论

Sufficient conditions for 3D parallel thinning algorithms 4

Sufficient conditions for 3D parallel thinning algorithms

引用

Vision Geometry IV Conference

作者： BERTRAND, G ESIEE PSI LABF-93162 NOISY LE GRANDFRANCE

ISBN: (纸本)081941932X

A simple point of an object is a point whose removal does not change the topology. However, the simultaneous deletion of simple points may change the topology. A popular way for overcoming this problem is to use a directional strategy. This method has good properties in 2D discrete spaces but it does not work in 3D. Through the notion of P-simple point we propose a general strategy for removing points in parallel without altering the topology of a 3D space. We derive some new sufficient conditions such that any parallel thinning algorithm satisfying these conditions is ensured to preserve topology.

关键词： thinning algorithm SKELETON TOPOLOGICAL NUMBERS SIMPLE POINTS CUBIC GRIDS DISCRETE TOPOLOGY

来源：评论

学校读者我要写书评

暂无评论

Isthmus-Based 6-Directional Parallel thinning algorithms

Isthmus-Based 6-Directional Parallel Thinning Algorithms

引用

16th International Conference on Discrete Geometry for Computer Imagery

作者： Raynal, Benjamin Couprie, Michel Univ Paris Est Equipe A3SI Lab Informat Gaspard Monge Paris France

ISBN: (纸本)9783642198663

Skeletons are widely used in pattern recognition and image analysis. A way to obtain skeletons is the thinning approach, consisting in iteratively removing points from the object without changing the topology. In order to preserve geometric information, it is usual to preserve curve end points (for curve skeletons) or surface end points (for surface skeletons). In this paper we propose a new fast directional parallel thinning scheme, preserving isthmuses (a generalization of curve/surface interior points), and providing skeletons with low amount of noise. We also prove the topology preservation of our approach.

关键词： thinning algorithm Surface Skeleton Curvilinear Skeleton Topology Preservation Directional thinning Isthmus

来源：评论

学校读者我要写书评

暂无评论

Powerful Parallel and Symmetric 3D thinning Schemes Based on Critical Kernels

引用

JOURNAL OF MATHEMATICAL IMAGING AND VISION 2014年第1期48卷 134-148页

作者： Bertrand, Gilles Couprie, Michel Univ Paris Est ESIEE Paris Lab Informat Gaspard Monge F-93162 Cite Descartes Noisy Le Grand France

The main contribution of the present article consists of new 3D parallel and symmetric thinning schemes which have the following qualities: They are effective and sound, in the sense that they are guaranteed to preserve topology. This guarantee is obtained thanks to a theorem on critical kernels;They are powerful, in the sense that they remove more points, in one iteration, than any other symmetric parallel thinning scheme;They are versatile, as conditions for the preservation of geometrical features (e.g., curve extremities or surface borders) are independent of those accounting for topology preservation;They are efficient: we provide in this article a small set of masks, acting in the grid a"currency sign(3), that is sufficient, in addition to the classical simple point test, to straightforwardly implement them.

关键词： thinning algorithm Skeleton Parallel algorithm Critical kernel Cubical complex Simple point Collapse

来源：评论

学校读者我要写书评

暂无评论

INTERPRETATION OF AMBIGUOUS ZONE TO IMPROVE thinning RESULTS OF HANDWRITTEN CHINESE CHARACTERS

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2010年第2期24卷 303-320页

作者： Su, Zhe-Wen Cao, Zhong-Sheng Wang, Yuan-Zhen Huazhong Univ Sci & Technol Coll Comp Sci & Technol Database & Multimedia Res Inst Wuhan 430074 Peoples R China

The skeleton representation of characters is a fundamental step to handwriting recognition, but traditional skeletonization algorithms always produce unwanted artifacts or pattern distortions at regions with intersections or junctions of strokes. In this paper, we propose a novel method to eliminate these unreliable skeleton segments and improve the skeletonization of handwritten Chinese characters on the basis of ambiguous zone interpretation. This method consists of two main phases. In the first phase, the parts of characters which contain the distortions of skeleton, called ambiguous zones, are detected. Instead of exploiting any corner or dominant point detection, a set of feature points from the original skeleton and the contour information around them are manipulated in our approach. In the phase of interpretation, the continuity of skeleton segments of substrokes is estimated based on the minimum curvature variation criterion, and compensations are made to fix interstices of terminated skeleton segments. Finally, the distorted parts of characters are reconstructed by applying a cubic B-spline interpolation. Experimental results show that the proposed method can detect ambiguous zones with arbitrary shapes accurately, and produce skeletons that are close to human perceptions.

关键词： thinning algorithm ambiguous zone skeleton fork point handwriting recognition

来源：评论

学校读者我要写书评

暂无评论

Real-time building of a thinning-based topological map

引用

INTELLIGENT SERVICE ROBOTICS 2008年第3期1卷 211-220页

作者： Kwon, Tae-Bum Song, Jae-Bok Korea Univ Dept Mech Engn 5 Anam Dong Seoul 136713 South Korea

An accurate and compact map is essential to an autonomous mobile robot system. A topological map, one of the most popular map types, can be used to represent the environment in terms of discrete nodes with edges connecting them. It is usually constructed by Voronoi-like graphs, but in this paper the topological map is incrementally built based on the local grid map by using a thinning algorithm. This algorithm, when combined with the application of the C-obstacle, can easily extract only the meaningful topological information in real-time and is robust to environment change, because this map is extracted from a local grid map generated based on the Bayesian update formula. In this paper, position probability is defined to evaluate the quantitative reliability of the end node extracted by the thinning process. Since the thinning process builds only local topological maps, a global topological map should be constructed by merging local topological maps according to nodes with high position probability. For real and complex environments, experiments showed that the proposed map building method based on the thinning process can accurately build a local topological map in real-time, with which an accurate global topological map can be incrementally constructed.

关键词： Topological map building thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

thinning and segmenting handwritten characters by line following

引用

Machine Vision and Applications: An International Journal 1992年第3期5卷 185-197页

作者： Chouinard, Claude Plamondon, Réjean Laboratoire Scribens Département de Génie Électrique Et de Génie Informatique Ecole Polytechnique de Montréal Montréal Québec H3C 3A7 C.P. 6079 Station A Canada

This article presents a new thinning algorithm particularly well suited to handwriting characters or engineering drawing images. The line following scheme is used with major improvements to reduce the distortion at intersections. The new algorithm uses a thinning window to detect the shape and type of each intersection it is about to thin. This added information allows for a much more accurate thinning process. The algorithm also segments the skeleton into line segments as it is generated. These lines correlate partly with the strokes that produced the image. To analyze the performance of the new algorithm, a comparative study of the skeletons is performed over speed and quality criteria. This study shows that the algorithm reduces the distortion at the line intersections while remaining fast. © 1992, Springer-Verlag New York Inc.. All rights reserved.

关键词： handwriting line following segmentation skeleton thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

Topological Map Building Based on thinning 3

Topological Map Building Based on Thinning

引用

3rd Asian Pacific Conference on Mechanical Components and Control Engineering (ICMCCE)

作者： Wang, Na Wang, Haiyan Zhu, Qingqing Qingdao Huanghai Coll Qingdao Peoples R China

ISBN: (纸本)9783038353126

In order to accomplish navigation and path planning, map building is the key technology and fundamental problem in mobile robotic control in unknown environment. In this paper the topological map is built based on the grid map by using a thinning algorithm. The environment is modeled in grid map, next the thinning algorithm is applied in the map, and then the effective topological information is extracted. Simulation results show that the topological map based on thinning is clear and succinct, and it also avoids producing unnecessary nodes and paths. This topological map stores much less information which will improve the ability of autonomous operation, navigation and path planning further.

关键词： Mobile robot Topological map Voronoi thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：