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

ANALYSIS OF thinning algorithms USING MATHEMATICAL MORPHOLOGY

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1990年第6期12卷 541-551页

作者： JANG, BK CHIN, RT Dept. of Electr. & Comput. Eng. Wisconsin Univ. Madison WI USA

A precise definition of digital skeletons and a mathematical framework for the analysis of a class of thinning algorithms, based on morphological set transformation, are presented. A particular thinning algorithm (algorithm A) is used as an example in the analysis. Precise definitions and analyses associated with the thinning process are presented, including the proof of convergence, the condition for one-pixel-thick skeletons, and the connectedness of skeletons. In addition, a necessary and sufficient condition for the thinning process in general is derived, and an algorithm (algorithm B) based on this condition is developed. Experimental results are used to compare the two thinning algorithms, and issues involving noise immunity and skeletal bias are addressed.

关键词： Algorithm design and analysis Morphology Skeleton Convergence Sufficient conditions INSPEC: Controlled Indexing computerised picture processing INSPEC: Non-Controlled Indexing skeletal bias thinning algorithms mathematical morphology digital skeletons convergence noise immunity

来源：评论

学校读者我要写书评

暂无评论

COMPARATIVE-EVALUATION OF FAST thinning algorithms ON A MULTIPROCESSOR ARCHITECTURE

引用

IMAGE AND VISION COMPUTING 1992年第4期10卷 210-218页

作者： HAYAT, L NAQVI, A SANDLER, MB QUAID I AZAM UNIV DEPT ELECTRISLAMABADPAKISTAN

A comparative evaluation of some fast parallel thinning algorithms for elongated shapes on an overlapped shared memory multiprocessor architecture (OSMMA) is presented. The evaluation is based on the execution time and multiprocessor speed-up of the algorithms, as well as the quality of the skeletonized image structures. Issues relating to efficient algorithm implementation on the distributed memory architecture and refinements in the algorithms for better results are also discussed. The algorithms implemented include our own thinning technique based on the concept of object edges width compresssion that achieves efficient results while significantly decreasing execution timings. Experimental results for some real images are presented.

关键词： thinning algorithms PARALLEL IMPLEMENTATION

来源：评论

学校读者我要写书评

暂无评论

Improving Hilditch thinning algorithms for text image

Improving Hilditch thinning algorithms for text image

引用

International Conference on E-Learning, E-Business, Enterprise Information Systems and E-Government

作者： Yu, Jia Li, Yaqin Wuhan Polytech Univ Dept Comp & Informat Engn Wuhan Peoples R China

ISBN: (纸本)9780769539072

Hilditch thinning algorithm is widely used in image pre-processing process. In this paper, we propose an improved Hilditch algorithm to acquire a more stable output. We conclude that the skeletons obtained from our algorithms give better results in Chinese characters and numbers. The advantage of this algorithm corrects the beard by modifying the warp in the part of intersection.

关键词： image processing thinning algorithms character recognizing Hilditch's algorithm

来源：评论

学校读者我要写书评

暂无评论

Topology Preserving 3D thinning algorithms Using Four and Eight Subfields

Topology Preserving 3D Thinning Algorithms Using Four and Ei...

引用

7th International Conference on Image Analysis and Recognition

作者： Nemeth, Gabor Kardos, Peter Palagyi, Kalman Univ Szeged Dept Image Proc & Comp Graph Szeged Hungary

ISBN: (纸本)9783642137716

thinning is a frequently applied technique for extracting skeleton-like shape features (i.e., centerline, medial surface, and topological kernel) from volumetric binary images. Subfield-based thinning algorithms partition the image into some subsets which are alternatively activated, and some points in the active subfield are deleted. This paper presents a set of new 3D parallel subfield-based thinning algorithms that use four and eight subfields. The three major contributions of this paper are: 1) The deletion rules of the presented algorithms are derived from some sufficient conditions for topology preservation. 2) A novel thinning scheme is proposed that uses iteration-level endpoint checking. 3) Various characterizations of endpoints yield different algorithms.

关键词： 3D image analysis Shape representation Feature extraction thinning algorithms Topology preservation

来源：评论

学校读者我要写书评

暂无评论

Approximation to Boolean functions by neural networks with applications to thinning algorithms

Approximation to Boolean functions by neural networks with a...

引用

17th IEEE Instrumentation and Measurement Technology Conference

作者： Xiong, SS Zhou, ZY Zhong, LM Zhang, WD Tsinghua Univ Dept Precis Instruments & Mechanol Beijing 100084 Peoples R China

ISBN: (纸本)0780358902

In this paper, a theorem on approximation to Boolean functions by neural networks and its proof are proposed. A Boolean function, f:{0,1}(n) --> {0,1}, is proved to be approximated by a three layer neural network with 2(n) hidden nodes. With the theorem, a thinning algorithm using the neural network technique is concluded. A hard processor implementing the thinning algorithm is designed to raise the thinning efficiency, which can meet the practical needs better This makes the algorithm suitable for real-time image processing.

关键词： Boolean functions neural nets functional analysis mathematics computing signal processing approximation theory Boolean functions neural networks thinning algorithms three layer neural network hidden nodes thinning efficiency real-time image processing engineering applications

来源：评论

学校读者我要写书评

暂无评论

3D Parallel thinning algorithms Based on Isthmuses

3D Parallel Thinning Algorithms Based on Isthmuses

引用

14th International Conference on Advanced Concepts for Intelligent Vision Systems (ACIVS)

作者： Nemeth, Gabor Palagyi, Kalman Univ Szeged Dept Image Proc & Comp Graph Szeged Hungary

ISBN: (纸本)9783642331404

thinning is a widely used technique to obtain skeleton-like shape features (i.e., centerlines and medial surfaces) from digital binary objects. Conventional thinning algorithms preserve endpoints to provide important geometric information relative to the object to be represented. An alternative strategy is also proposed that preserves isthmuses (i.e., generalization of curve/surface interior points). In this paper we present ten 3D parallel isthmus-based thinning algorithm variants that are derived from some sufficient conditions for topology preserving reductions.

关键词： Shape analysis Feature extraction Skeletons thinning algorithms Topology preservation

来源：评论

学校读者我要写书评

暂无评论

thinning algorithms ON RECTANGULAR, HEXAGONAL, AND TRIANGULAR ARRAYS

引用

COMMUNICATIONS OF THE ACM 1972年第9期15卷 827-&页

作者： DEUTSCH, ES Univ. of Maryland College Park

In this report three thinning algorithms are developed: one each for use with rectangular, hexagonal, and triangular arrays. The approach to the development of each algorithm is the same. Pictorial results produced by each of the algorithms are presented and the relative performances of the algorithms are compared. It is found that the algorithm operating with the triangular array is the most sensitive to image irregularities and noise, yet it will yield a thinned image with an overall reduced number of points. It is concluded that the algorithm operating in conjunction with the hexagonal array has features which strike a balance between those of the other two arrays. [ABSTRACT FROM AUTHOR]

关键词： hexagonal image processing rectangular skeleton thinning algorithms triangular arrays

来源：评论

学校读者我要写书评

暂无评论

METHODOLOGIES FOR EVALUATING thinning algorithms FOR CHARACTER RECOGNITION

引用

International Journal of Pattern Recognition and Artificial Intelligence 1993年第5期7卷 1247-1270页

作者： RÉJEAN PLAMONDON CHING Y. SUEN MARC BOURDEAU CAROLINE BARRIÈRE Département de Génie Électrique et Génie Informatique École Polytechnique de Montréal Canada Department of Computer Science Concordia University Canada Département de Mathématiques Appliquées École Polytechnique de Montréal Canada Département de Génie Électrique et Génie Informatique École Polytechnique de Montréal Canada

This paper investigates three different methods of comparing preference structures for thinning algorithms. The first method involves a series of experiments with human subjects. The second makes use of neural networks and the third is based on dissimilarities and distance measures that is computer generated. Several statistical tests have been performed to analyze the preference structures exhibited by the data. This study highlights human coherence in comparing skeletons and the novelty of using reference skeletons to facilitate the evaluation of thinning algorithms. None of the automatic approaches provides a useful insight although a measure of information content manifests some consistency. The overall study suggests a systematic protocol involving human coherence to evaluate preprocessing algorithms.

关键词： thinning algorithms character recognition evaluation of thinning algorithms skeletonization techniques

来源：评论

学校读者我要写书评

暂无评论

Meshfree thinning of 3D point clouds

引用

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS 2008年第4期8卷 409-425页

作者： Dyn, Nira Iske, Armin Wendland, Holger Univ Hamburg Dept Math D-20146 Hamburg Germany Tel Aviv Univ Dept Math IL-69978 Tel Aviv Israel Univ Sussex Dept Math Brighton BN1 9RH E Sussex England

An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point removal algorithm, termed thinning, which outputs a data hierarchy of point-samples for multiresolution surface approximation. The thinning algorithm works with a point removal criterion, which measures the significances of the points in their local neighbourhoods, and which removes a least significant point at each step. For any point x in the current point set Y subset of X, its significance reflects the approximation quality of a local surface reconstructed from neighbouring points in Y. The local surface reconstruction is done over an estimated tangent plane at x by using radial basis functions. The approximation quality of the surface reconstruction around x is measured by using its maximal deviation from the given point-samples X in a local neighbourhood of x. The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D surface point-samples, and so it does not require any further topological information, such as point connectivities. Computational details of the thinning algorithm and the required data structures for efficient implementation are explained and its complexity is discussed. Two examples are presented for illustration.

关键词： surface simplification thinning algorithms meshfree methods approximation by radial basis functions 3D point cloud

来源：评论

学校读者我要写书评

暂无评论

ANOMALOUS DIFFUSION - THE thinning PROPERTY OF FRACTIONAL BROWNIAN MOTION

引用

ACTA PHYSICA POLONICA B 2012年第5期43卷 1157-1167页

作者： Sikora, Grzegorz Wroclaw Univ Technol Hugo Steinhaus Ctr PL-50370 Wroclaw Poland Wroclaw Univ Technol Inst Math & Comp Sci PL-50370 Wroclaw Poland

We show that thinning of increments of the fractional Brownian motion with Hurst exponent H not equal 1/2 breaks its H-self-similarity property. As a result, we obtain a new Gaussian process with stationary increments which is not the fractional Brownian motion for any H. Moreover, in the subdiffusion case (H < 1/2), the new process statistically resembles the classical Brownian motion (H = 1/2). To this end, we study analytically the second moment of such processes. Finally, Monte Carlo simulations show that the H estimator obtained by mean square displacement is close to the Brownian motion case with H = 1/2. These results show that stationary data describing anomalous diffusion phenomenon can lead to different statistical conclusions for different resolution of measurement. Therefore, one should be very careful in statistical inference, especially in strong subdiffusion regimes (H approximate to 0).

关键词： DIFFUSION thinning algorithms FRACTIONAL calculus BROWNIAN motion processes EXPONENTS (Algebra) MONTE Carlo method STATISTICS MEAN square algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：