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

IEEE International Conference on Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)

作者： Viswanathan, Gomathi Kasi Murugesan, Anita Nallaperumal, Krishnan Manonmaniam Sundaranar Univ Ctr Informat Technol & Engn Tirunelveli India

ISBN: (纸本)9781467350372;9781467350365;9781467350358

The thinning algorithm proposed in this paper, is an improved parallel thinning algorithm that aims in both, medial axis based thinning and contour extraction in a same process. In the process of thinning to obtain the medial axis of the character the points are deleted from outer boundary first and then proceeded inside till a single pixel wide skeleton is produced. In this process the outermost boundary line alone is preserved which is then produced as the contour of the image. So within one algorithm we get the two major categories of skeletonization, Medial axis Transform and contour extraction. Experiments are done on printed English characters and the results show that this algorithm is very effective.

关键词： medial axis transform contour extraction parallel thinning algorithm connectivity

来源：评论

学校读者我要写书评

暂无评论

Further considerations of a 1-subcycle parallel thinning algorithm

引用

Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an 1992年第4期15卷 367-367页

作者： Chen, Yung-Sheng Hsu, Wen-Hsing Department of Electrical Engineering Yuan Ze Institute of Technology Taoyuan 320 Taiwan Institute of Electrical Engineering National Tsing Hua University Hsinchu 30043 Taiwan Institute of Information Science Academia Sinica Taipei 10529 Taiwan

In this paper, we present two improved versions of a pseudo 1-subcycle parallel thinning algorithm which we proposed earlier [1] and describe a two- stage structure to realize the 1-subcycle parallel algorithm. The purpose of the first improved algorithm is to produce the P8ET (perfect 8-curve excluding T-junction)-type thin line which is well-defined in general. This algorithm involves local branches containing T-junctions or quasi T-junctions. The second improved algorithm obtains an isotropic skeleton of an L-shape pattern, such that the visual quality of a skeleton is more satisfactory. In this algorithm, another set of thinning conditions especially designed is also involved. We also describe a two-stage structure which consists of a thinning table and a control unit. The thinning table is used to provide the attributes of an input 3x3 local pattern. The control unit is used to check the removal of the center “1” pixel of this local pattern. The inputs of the control unit also comprise the outputs of other neighboring thinning tables. This structure can exactly implement the original 1-subcycle parallel algorithm. The above-mentioned algorithms have been implemented on this realized structure in this paper. Several experiments confirm that the improved algorithms can produce the desired effective thin line, and also show that the realized structure is feasible and practicable. © 1992 Taylor & Francis Group, LLC.

关键词： Image processing parallel thinning algorithm Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Research on the Improvement of EPTA parallel thinning algorithm

Research on the Improvement of EPTA Parallel Thinning Algori...

引用

2018 International Conference on Network, Communication, Computer Engineering (NCCE 2018)

作者： Rui Li Xiaoyu Zhang School of Computer and Communication Lan Zhou University of Technology

ISBN: (纸本)9781510871076

Aiming at the problem of non-smooth contours(contour noises,scratches and jitters),it is easy to generate redundant *** on EPTA algorithm,an improved parallel thinning algorithm is *** an iteration that eliminates the restrictions and proportional iterations,the pixels in the no-branching phenomenon are first regularly refined;then,the global smoothing refinement is performed to solve the branching problem caused by partial *** results show that the improved algorithm can solve the problem of the existing thinning algorithm,such as poor noise immunity,redundant branches and thin lines,and guarantee the robustness of the thinning *** the same time,the erosion problem of the original algorithm for 4 x4 square is also solved.

关键词： Contours Noises Redundant Branches EPTA algorithm parallel thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

Metrical properties of a collection of 2D parallel thinning algorithms

引用

Electronic Notes in Discrete Mathematics 2003年 12卷 255-266页

作者： Manzanera, Antoine Bernard, Thierry M. Ecole Nat. Sup. de Techniques Avancées 75015 Paris 32 Bd Victor France Ecole Nat. Sup. de Techniques Avancées 75015 Paris 32 Bd Victor France

This paper is dedicated to the study of metrical properties of a collection of 2D thinning algorithms that we have proposed. Here, we characterize their underlying metrics and use it to reduce the classical metrical biases that affect thinning algorithms in the square grid. We show that some algorithms from the collection lead to skeletons based on a particular geometry, corresponding to the (4,8)-median axis, which is a new shape descriptor, featuring nice robustness and conditioning-properties. © 2005 Elsevier Ltd. All rights reserved.

关键词： (4,8)-median axis digital geometry parallel thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

New parallel thinning algorithms for 2D grayscale images

New parallel thinning algorithms for 2D grayscale images

引用

Conference on Vision Geometry IX

作者： Lohou, C Bertrand, G ESIEE Lab A2SI F-93162 Noisy Le Grand France

ISBN: (纸本)081943762X

Several approaches have been proposed for the study of topological properties of binary digital images: the digital topology, the connected ordered topological space approach, and the cell complex approach. The topology which is used in the last two approaches is a discrete topology. In fact, the datum of a discrete topology is equivalent to the datum of a partially ordered set (order). One of the authors has proposed a study of homotopy in orders, and has introduced the notion of alpha -simple point. An alpha -simple point is an "inessential point" for the topology in orders. A fundamental characteristic concerning alpha -simple points is that they can be deleted in parallel from an object, while preserving its topological properties. This led us to propose, in a recent work, two parallel thinning algorithms based on the parallel deletion of alpha -simple points, for 2D and 3D binary images. Very few parallel thinning algorithms for 2D grayscale images have already been proposed. The most recent ones have been developped by extending binary notions with the cross-section topology. In the same way, we extend our previous works in orders to the case of 2D grayscale images, and we propose two parallel thinning algorithms for such images.

关键词： discrete topology order simple point destructible point parallel thinning algorithm skeleton

来源：评论

学校读者我要写书评

暂无评论

New performance evaluation of parallel thinning algorithms based on PRAM and MPRAM models

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1998年第12期E81D卷 1494-1506页

作者： Rhee, PK La, CW Inha Univ Dept Comp Sci & Engn Nam Ku Incheon South Korea

The objective of thinning is to reduce the amount of information in image patterns to the minimum needed for recognition. Thinned image helps the extraction of important features such as end points. junction points, and connections from image patterns. The ultimate goal of parallel algorithms is to minimize the execution time while producing high quality thinned image. Though much research has been performed for parallel thinning algorithms, there has been no systematical approach for comparing the execution speed of parallel thinning algorithms. Several rough comparisons have been done in terms of iteration numbers. But, such comparisons may lead to wrong guides since the time required for iterations varies from one algorithm to the other algorithm. This paper proposes a formal method to analyze the performance of parallel thinning algorithms based on PRAM (parallel Random Access Machine) model. Besides, the quality of skeletons, robustness to boundary noise sensitivity, and execution speed are considered. Six parallel algorithms, which shows relatively high performance, are selected, and analyzed based on the proposed analysis method. Experiments show that the proposed analysis method is sufficiently accurate to evaluate the performance of parallel thinning algorithms.

关键词： parallel thinning algorithm performance evaluation PRAM image pattern

来源：评论

学校读者我要写书评

暂无评论

Recognition of hand-printed Latin characters based on generalized Hough transform and decision tree learning techniques

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2000年第3期14卷 369-387页

作者： Amin, A Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia

This paper presents a new technique for the recognition of hand-printed Latin characters using machine learning. Conventional methods have relied on manually constructed dictionaries which are not only tedious to construct but also difficult to make tolerant to variation in writing styles. The advantages of machine learning are that it can generalize over a large degree of variation between writing styles, and recognition rules can be constructed by example. Characters are scanned into the computer and preprocessing techniques transform the bit-map representation of the characters into a set of primitives which can be represented in an attribute base form. A set of such representations for each character is then input to C4.5 which produces a decision tree for classifying each character.

关键词： parallel thinning algorithm Latin characters Hough transform feature extraction machine learning C4.5

来源：评论

学校读者我要写书评

暂无评论

Recognition of hand-printed Chinese characters using decision trees/machine learning C4.5 system

引用

PATTERN ANALYSIS AND APPLICATIONS 1998年第2期1卷 130-141页

作者： Amin, A Singh, S Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia Univ Plymouth Sch Comp Plymouth PL4 8AA Devon England

Recognition of Chinese characters has been an area of major interest for many years, and a large number of research papers and reports have already been published in this area. There are several major problems with Chinese character recognition: Chinese characters are distinct and ideographic, the character size is very large and a lot of structurally similar characters exist in the character set. Thus, classification criteria are difficult to generate. This paper presents a new technique for the recognition of hand-printed Chinese characters using the C4.5 machine learning system. Conventional methods have relied on hand-constructed dictionaries which are tedious to construct and difficult to make tolerant to variation in writing styles. The gaper discusses Chinese character recognition using the Hough transform for feature extraction and C4.5 system. The system was tested with 900 characters written by different writers from poor to acceptable quality (each character has 40 samples) and the rate of recognition obtained was 84%.

关键词： Chinese characters feature extraction hough transform machine learning parallel thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

PSEUDO ONE PASS thinning algorithm

引用

PATTERN RECOGNITION LETTERS 1991年第9期12卷 543-555页

作者： KUMAR, P BHATNAGAR, D RAO, PSU School of Mathematics/Computer Information Sciences University of Hyderabad Old Bombay Highway Gachi Bowli Hyderabad-500134 India

A One Pass thinning algorithm (OPTA) and a Pseudo One Pass thinning algorithm (POPTA) are proposed in this paper. The one pass thinning algorithm uses the concept of thinning and restoring. The OPTA deletes pixels from North, South, East, and West in one pass. The POPTA uses an additional concept of corner pixels, which detects the corner pixels and deletes them to yield better skeletons with little or no distortion. Experimental results show that each of the patterns is thinned to a skeleton of unit pixel width, with no loss of connectivity or distortion. The algorithms are width independent and work for both even pixel wide and odd pixel wide images.

关键词： parallel thinning algorithm RIGHT ANGLE CORNERS ACUTE ANGLE CORNERS T-JUNCTIONS OPTICAL CHARACTER RECOGNITION (OCR)

来源：评论

学校读者我要写书评

暂无评论

AN APPROACH TO IMPROVE THE ZS thinning algorithm

AN APPROACH TO IMPROVE THE ZS THINNING ALGORITHM

引用

IEEE International Conference on Network Infrastructure and Digital Content

作者： Zhang, Yuanyuan Jing, Xiaojun Wang, Xiaoyong Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100088 Peoples R China

ISBN: (纸本)9781424448982

A critical and Indispensable step of an automatic Fingerprint identification system (AFIS) is Fingerprint image thinning. many algorithms have been devised and applied trying to obtain one pixel wide and 8 neighbor connected thinning result. Ill this paper, a method of improving the thinning result through adding eliminate structure templates is proposed. The ZS algorithm is a parallel thinning algorithm which has fast converge speed, but it also has some problems such as Distortion of, the fingerprint ridge, incapability of gaining one-pixel wide skeleton. the proposed improved algorithm will solve the problems without paying extra times, as a result, more effective fingerprint minutiae points could be extracted.

关键词： AFIS ZS thinning algorithm eliminate structure template parallel thinning algorithm sequence thinning algorithm Minutiae Points extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：