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

A NEW CHARACTERIZATION OF 3-DIMENSIONAL SIMPLE POINTS

PATTERN RECOGNITION LETTERS 1994年第2期15卷 169-175页

作者： BERTRAND, G MALANDAIN, G INRIA F-06902 SOPHIA ANTIPOLISFRANCE

A new characterization of three-dimensional simple points is presented. Unlike previous characterizations, it does not need the calculation of the genus or the number of holes. It only needs the computation of two numbers of connected components in the neighborhood of the considered point. The proof of the validity of the characterization is given.

关键词： SIMPLE POINTS 3 DIMENSIONS DIGITAL TOPOLOGY thinning algorithms

来源：评论

学校读者我要写书评

暂无评论

Silvicultural prescriptions for mixed-species forest stands. A European review and perspective

引用

EUROPEAN JOURNAL OF FOREST RESEARCH 2021年第5期140卷 1267-1294页

作者： Pretzsch, Hans Poschenrieder, Werner Uhl, Enno Brazaitis, Gediminas Makrickiene, Ekaterina Calama, Rafael Tech Univ Munich Sch Life Sci Chair Forest Growth & Yield Sci Hans Carl von Carlowitz Pl 2 D-85354 Freising Weihenstephan Germany Bavarian Inst Forestry Hans Carl von Carlowitz Pl 1 D-85354 Freising Weihenstephan Germany Vytautas Magnus Univ Studentu Inst Forest Biol & Silviculture Str 11 Akad Mstl LT-53361 Kaunas Dist Lithuania INIA iuFOR UVa Forest Res Ctr Dept Forest Dynam & Management Ctra Coruna Km 7-5 Madrid 28040 Spain

Compared with far-developed measures and methods for mono-specific forest stands, the silvicultural prescriptions for mixed-species stands are at their early beginning. However, they are essential for the well-conceived establishment, design, and control of mixed-species stands, currently promoted in many countries worldwide. Here, we review the state of the art and we further develop silvicultural prescriptions for mixed-species stands for steering of experiments, stand modeling, and silviculture. We review which aspects of tree species mixing are most relevant for management goal achievement. We found the maintenance of species diversity and structural heterogeneity for ecological purpose, stabilizing productivity, and social-economic performance as main objectives. We give an overview of quantitatively formulated silvicultural prescriptions for steering mixed-species stands for forest practice, long-term experiments, forest stand models. Compared with the sophisticated guidelines for mono-specific stands, prescriptions for mixed stand are often mainly qualitative and vague. Then, we introduce methodological approaches in development for steering mixture: measures for spatial and temporal separation, species-specific growing space requirements for crop trees, coefficients for equivalence and density modification, and basic relationships for steering tree number and area-based mixing proportions. Finally, we draw conclusions for further development of methodological approaches for silvicultural steering of experiments, implementation in stand simulators, and for silvicultural operations. We see the need for improving the quantitative spatially explicit rules based at tree or cohort level, for substantiating the knowledge on species-specific allometry, growing area, tree-to-tree distances, and position-dependent competition indices for steering tree removal. We discuss the prospects and limitations of establishing silvicultural prescriptions for mixed-species stands

关键词： Species-mixing experiments thinning algorithms Temporal and spatial separation Equivalence coefficients Silvicultural steering Individual tree models Scenario analyses

来源：评论

学校读者我要写书评

暂无评论

CONDITION FOR DIGITAL POINTS REMOVAL

引用

SIGNAL PROCESSING 1979年第4期1卷 283-285页

作者： ARCELLI, C Laboratorio di Cibernetica C.N.R. via Toiano 2 Arco Felice Napoli Italia

Removal operations play a crucial role in most algorithms which transform digital figures into stick-like ones. In this note, digital points that are candidates to deletion are examined and a necessary and sufficient condition for their removal is given. Operationen zur Tilgung von Bildpunkten spielen eine wichtige Rolle in den meisten Algorithmen, die Digitalbilder auf ihr Skelett reduzieren. In dieser werden Kriterien zur Tilgung von Bildpunkten untersucht. Eine notwendige und hinreichende Bedingung für ihre Tilgung wird vorgestellt. Les opérations d'éffacement sont trés importantes dans les algorithmes qui réduisent les images numérisées à leurs squelettes. Dans cette communication, nous examinons les points qui peuvent être effacés et nous presentons une condition necessaire et suffisante qui permet de faire des simples opérations d'éffacement.

关键词： Picture processing binary pictures thinning algorithms removal operations

来源：评论

学校读者我要写书评

暂无评论

Simplifier Points in 2D Binary Images 18th

引用

18th International Workshop on Combinatorial Image Analysis (IWCIA)

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

ISBN: (纸本)9783319591087;9783319591070

The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a black point in a binary picture is simplifier if it is simple, and its deletion turns a non-simple border point into simple. We show that simplifier points are line end points for both (8, 4) and (4, 8) pictures on the square grid. Our result makes efficient implementation of endpoint-based topology-preserving 2D thinning algorithms possible.

关键词： Discrete geometry Digital topology Topology preservation thinning algorithms

来源：评论

学校读者我要写书评

暂无评论

Stochastic model of handwritten letters and words to simulate and recognize handwriting

Stochastic model of handwritten letters and words to simulat...

引用

Conference on Mathematical Modeling, Bayesian Estimation, and Inverse Problems

作者： L'Homer, E Univ Paris 05 UFR Math & Informat F-75270 Paris France

ISBN: (纸本)0819433020

Among the many handwritten character recognition algorithms that have been proposed, few of them use models which are able to simulate handwriting. This can be explained by the fact that simulations require the estimation of strokes starting from statistic images of letters, while crossing and overlapping strokes make this estimation difficult. In this paper an algorithm to extract overlapping strokes that optimizes the reconstruction of crossings of the image is describes, and a stochastic model of off-line handwritten letter deformation for handwritten letter recognition is presented.

关键词： handwritten letter recognition thinning algorithms stroke crossing stochastic model of letter

来源：评论

学校读者我要写书评

暂无评论

Recognition of Atomically-Resolved STM Images of Graphite

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2010年第2期7卷 404-407页

作者： Wang, Maofa Zou, Xiaoping Cheng, Jin Zhu, Guang Su, Yi Yang, Gangqiang Lue, Xueming Beijing Informat Sci & Technol Univ Res Ctr Sensor Technol Beijing Key Lab Sensor Beijing 100101 Peoples R China Minist Educ Key Lab Modern Measurement & Control Technol Beijing 100101 Peoples R China

It is important and interesting thing to recognize the atomic structure of graphite by processing graphite STM images, which is useful to automatically give the hexagonal topology structure during in-situ STM scanning of graphite. In this paper, we report some digital image processing algorithm applications on the recognition of atomic structure of graphite. At last, we also write the software with c(++) codes, which applying the digital image processing algorithms. And from the result of processing a typical STM image of graphite, we can clearly see graphite hexagon structure.

关键词： Graphite STM Digital Image Processing thinning algorithms Mathematical Morphology

来源：评论

学校读者我要写书评

暂无评论

Sufficient Conditions for Topology-Preserving Parallel Reductions on the Face-Centered Cubic Grid (30APR, 10.1007/s10851-024-01177-y, 2024)

引用

JOURNAL OF MATHEMATICAL IMAGING AND VISION 2024年第3期66卷 293-293页

作者： Karai, Gabor Kardos, Peter Palagyi, Kalman Univ Szeged Dept Image Proc & Comp Graph Arpad Ter 2 H-6720 Szeged Hungary

Topology preservation is a crucial issue in parallel reductions that transform binary pictures by changing only a set of black points to white at a time. In this paper, we present sufficient conditions for topology-preserving parallel reductions on the three types of pictures of the unconventional 3D face-centered cubic (FCC) grid. Some conditions provide methods of verifying that a given parallel reduction always preserves the topology, and the remaining ones directly provide deletion rules of topology-preserving parallel reductions, and make us possible to generate topologically correct thinning algorithms. We give local characterizations of P-simple points, whose simultaneous deletion preserves the topology, and the relationships among the existing universal sufficient conditions for arbitrary types of binary pictures and our new FCC-specific results are also established.

关键词： Digital topology Face-centered cubic (FCC)grid thinning algorithms Topology preservation

来源：评论

学校读者我要写书评

暂无评论

Shape understanding system: Understanding the thin object

引用

Computers & Graphics 2002年第6期26卷 951-970页

作者： Z. Les The University of Melbourne PO Box 654 3142 Toorak Melbourne Vic. Australia

This paper presents the method of understanding objects that can be considered as thin objects. The proposed method of understanding thin objects is part of the shape understanding method developed by the author. The main novelty of the presented method is that the process of understanding thin objects is related to the visual concept represented as a symbolic name of the possible class of shapes. The possible classes of shape, viewed as hierarchical structures, are incorporated into the shape model. At each stage of the reasoning process that led to assigning of an examined object to one of the possible classes, novel processing methods are used. These methods are very efficient because they deal with a very specific class of shapes. In this paper, the 2-D objects that are classified as thin objects are regarded as geometrical objects without any reference to the real world objects. However, the shape under standing method is designed to understand an object at many levels of interpretation, such as the topological level, the linguistic level and the real world reference level. This approach influences the way in which the system of shape understanding is designed. The system consists of different types of experts that perform different processing and reasoning tasks.

关键词： Shape understanding thinning algorithms Thin class

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of Fingerprint Shape using Fractal Interpolation

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2019年第5期10卷 103-114页

作者： Bajahzar, Abdullah Guedri, Hichem Majmaah Univ Coll Sci Dept Comp Sci & Informat Zulfi 11932 Saudi Arabia Monastir Univ Fac Sci Phys Dept Elect & Microelect Lab Monastir 5019 Tunisia

One of the severe problems in a fingerprint-based system is retaining the fingerprint images. In this paper, we propose a method to minimize the fingerprint images size and retain the reference points. The method is divided into three parts, the first part is about digital image preprocessing that allows us to eliminate the noise, improve the image, convert it into a binary image, detect the skeleton and locate the reference point. The second part concerns the detection of critical points by the Douglas-Peucker method. The final part presents the methodology for the fingerprint curves reconstruction using the fractal interpolation curves. The experimental result shows the accuracy of this reconstruction method. The relative error (ER) is between 2.007% and 5.627% and the mean squared error (MSE) is between 0.126 and 0.009 at a small iterations number. On the other hand, for a greater number of iterations, the ER is between 0.415% and 1.64% and MSE is between 0.000124 and 0.0167. This clearly indicates that the interpolated curves and the original curves are virtually identical and exceedingly close.

关键词： Fingerprint images enhancement thresholding process thinning algorithms minutiae extraction Douglas-Peucker algorithm fractal interpolation iterated function system (IFS)

来源：评论

学校读者我要写书评

暂无评论

EQUIVALENT SEQUENTIAL AND PARALLEL REDUCTIONS IN ARBITRARY BINARY PICTURES

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2014年第7期28卷

作者： Palagyi, Kalman Univ Szeged Dept Image Proc & Comp Graph Arpad Ter 2 H-6720 Szeged Hungary

A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

关键词： Discrete geometry digital topology topology-preserving reductions order-independency thinning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：