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

Method for detecting 2D grapevine winter pruning location based on thinning algorithm and Lightweight Convolutional Neural Network

引用

International Journal of Agricultural and Biological Engineering 2022年第3期15卷 177-183页

作者： Qinghua Yang Yuhao Yuan Yiqin Chen Yi Xun Key Laboratory of E&M(Zhejiang University of Technology) Ministry of Education&Zhejiang ProvinceHangzhou 310023China

In viticulture,there is an increasing demand for automatic winter grapevine pruning devices,for which detection of pruning location in vineyard images is a necessary task,susceptible to being automated through the use of computer vision *** this study,a novel 2D grapevine winter pruning location detection method was proposed for automatic winter pruning with a Y-shaped cultivation *** method can be divided into the following four ***,the vineyard image was segmented by the threshold two times Red minus Green minus Blue(2R−G−B)channel and S channel;Second,extract the grapevine skeleton by Improved Enhanced Parallel thinning algorithm(IEPTA);Third,find the structure of each grapevine by judging the angle and distance relationship between branches;Fourth,obtain the bounding boxes from these grapevines,then pre-trained MobileNetV3_small×0.75 was utilized to classify each bounding box and finally find the pruning *** to the detection experiment result,the method of this study achieved a precision of 98.8%and a recall of 92.3%for bud detection,an accuracy of 83.4%for pruning location detection,and a total time of 0.423 ***,the results indicated that the proposed 2D pruning location detection method had decent robustness as well as high precision that could guide automatic devices to winter prune efficiently.

关键词： grapevine winter pruning Lightweight Convolutional Neural Network thinning algorithm detection method

来源：评论

学校读者我要写书评

暂无评论

A thinning algorithm based approach to controlling structural complexity in topology optimization

引用

FINITE ELEMENTS IN ANALYSIS AND DESIGN 2022年 207卷

作者： He, Yunzhen Zhao, Zi-Long Cai, Kun Kirby, James Xiong, Yulin Xie, Yi Min RMIT Univ Ctr Innovat Struct & Mat Sch Engn Melbourne 3001 Australia Beihang Univ Inst Solid Mech Sch Aeronaut Sci & Engn Beijing 100191 Peoples R China

Shape and topology optimization techniques aim to maximize structural performance through material redis-tribution. Effectively controlling structural complexity during the form-finding process remains a challenging issue. Structural complexity is usually characterized by the number of connected components (e.g., beams and bars), tunnels, and cavities in the structure. Existing structural complexity control approaches often prescribe the number of existing cavities. However, for three-dimensional problems, it is highly desirable to control the number of tunnels during the optimization process. Inspired by the topology-preserving feature of a thinning algorithm, this paper presents a direct approach to controlling the topology of continuum structures under the framework of the bi-directional evolutionary structural optimization (BESO) method. The new approach can explicitly control the number of tunnels and cavities for both two-and three-dimensional problems. In addition to the structural topology, the minimum length scale of structural components can be easily controlled. Nu-merical results demonstrate that, for a given set of loading and boundary conditions, the proposed methodology may produce multiple high-performance designs with distinct topologies. The techniques developed from this study will be useful for practical applications in architecture and engineering, where the structural complexity usually needs to be controlled to balance the aesthetic, functional, economical, and other considerations.

关键词： Topology optimization Structural complexity control Diverse and competitive structural designs BESO thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

A thinning algorithm BASED ON THE FORCE BETWEEN CHARGED PARTICLES

引用

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

作者： AKILA ARUMUGAM T. RADHAKRISHNAN C.Y. SUEN P.S.P. WANG Department of Computer Science Concordia University 1455 DeMaisonneuve Blvd West Montreal Quebec H3G 1M8 Canada College of Computer Science Northeastern University Boston MA 02115 USA

A new thinning algorithm based on the well known concept of the force of attraction or repulsion between charged particles is presented. This algorithm generates connected skeletons which preserve the shape and end-points of the original patterns. Its performance is experimentally compared with four other known algorithms published in the literature. For the sake of comparison, a reasoned set of test data is introduced. The results of our comparison reveal that the proposed CPM (Charge Particle Method) algorithm is almost as fast as the fastest of those compared. For thin images obtainable from low resolution scanners or coarse scanned images, the CPM algorithm is the fastest.

关键词： Charge Particle Method thinning algorithm skeletonisation comparison of thinning algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel thinning and skeletonization algorithm based on cellular automaton

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2020年第43-44期79卷 33215-33232页

作者： Zhang, Fan Chen, Xiaopan Zhang, Xinhong Henan Univ Sch Comp & Informat Engn Kaifeng 475004 Peoples R China Henan Univ Henan Key Lab Big Data Anal & Proc Kaifeng 475004 Peoples R China Henan Univ Sch Software Kaifeng 475004 Peoples R China

This paper proposes a parallel image thinning algorithm and a skeletonization algorithm based on cellular automaton (CA). Cellular automaton is a parallel computation model and a non-linear dynamical system. In this paper, each image pixel is identified as a cell of CA and the change of cell depends on the current state of itself and the state of its neighbors. In a binary image, this paper assumes that the objects (white pixel) are preys which are surrounded by many ants (every black pixels). The movement of ants is controlled by cellular automation. The ants gnaw preys until the preys (objects) become skeleton. The proposed parallel skeletonization algorithm can produce a traditional skeleton with a thin line located in the center of object, and the proposed thinning algorithm can produce a new kind of skeleton which is named as the ants-gnawing skeleton. The computation of ants-gnawing skeleton is faster than the traditional skeleton while it contains more the structural features of image. Benefiting from the properties of cellular automation, the proposed thinning algorithm does not change the basic geometry structure of image, and it is invariant for image rotation.

关键词： thinning algorithm Skeletonization algorithm Cellular automation Parallel computation

来源：评论

学校读者我要写书评

暂无评论

A New thinning algorithm for Binary Images

A New Thinning Algorithm for Binary Images

引用

International Conference on Control, Engineering & Information Technology

作者： Lynda Ben Boudaoud Abderrahmane Sider Abdelkamel Tari LIMED Laboratory University of Bejaia

ISBN: (纸本)9781479982134

thinning plays a crucial role in image analysis and pattern recognition applications. It is one of the most frequently used pre-processing methods to analyze different types of images. thinning consists basically of reducing a thick digital object into a thin skeleton. There are several thinning algorithms for getting a skeleton of a binary image in the literature. The most popular, and well proved one is the ZS algorithm proposed by Zheng and Suen. In the present paper, we propose a new thinning algorithm which combines the directional approach used by ZS and the subfield approach in order to produce a new hybrid thinning algorithm which is more efficient, produces thinner results (skeleton thickness is equal to one) than the ZS algorithm and solves the ZS's loss of connectivity problem in 2 × 2 squares. Results of applying the proposed algorithm on a variety of binary images and comparison with ZS algorithm show better results in terms of thinning rate, thinning speed, visual quality and connectivity preservation.

关键词： thinning algorithm Binary images Skeleton Parallel thinning Iterative thinning thinning rate thinning speed

来源：评论

学校读者我要写书评

暂无评论

The study of a new image thinning algorithm

The study of a new image thinning algorithm

引用

2014 3rd International Conference on Electrical and Electronics Engineering(ICEEE 2014)

作者： Wei Wang Mingyi Duan Yajun Yang College of Information and Engineering Zhongzhou University

There exist many image thinning algorithms. Compared with the parallel thinning algorithm, in this paper, a new algorithm is proposed. Simulation result shows that the new algorithm has considerable improvement in speed and quality over the existing methods, and the "burrs" and "strokes fracture" phenomena decrease greatly. It can be further used in the development of Chinese Character Recognition(CCR) software.

关键词： Chinese character recognition thinning algorithm image processing

来源：评论

学校读者我要写书评

暂无评论

AN ALTERNATE SMOOTHING AND STRIPPING algorithm FOR thinning DIGITAL BINARY PATTERNS

引用

SIGNAL PROCESSING 1986年第3期11卷 207-222页

作者： CHU, YK SUEN, CY Department of Engineering and Computing Applications Pratt & Whitney P.O. Box 10 Longueil Quebec J4K 4X9 Canada Department of Computer Science Concordia University 1455 de Maisonneuve Bouleard West Montréal Quebec H3G 1M8 Canada

This paper presents an algorithm for thinning digital binary patterns (skeletonization). The algorithm consists of two phases. The first phase thins the input pattern to unit thickness by alternately smoothing of the pattern and stripping of the contour points. The second phase adjusts the resulting skeleton from phase one so that a medial skeleton can be obtained. The performance of this algorithm is first compared experimentally with recent results of two other research groups and then with nine other skeletonization algorithms proposed by other researchers. Results show that the alternate smoothing and stripping algorithm produces skeletons which are smooth and with least distortion and well-formed than the others. Zusammenfassung Dieser Beitrag beschreibt einen zweistufigen algorithmus zur Ausdünnung (Skelettierung) digitaler binärer Muster. In der ersten Stufe wird das Eingangsmuster bis hinunter zu einer Strichstärke von einem Abtastwert ausgedünnt, indem es abwechselnd geglättet und von seinen Randpunkten befreit wird. In der 2. Stufe wird das verbleibende Skelett justiert, so daß sich ein nach der Mitte hinausgerichtetes Skelett ergibt. Die Wirkungsweise des algorithmus wird zunächst mit neueren Ergebnissen zweier anderer Forschungsgruppen verglichen und sodann neun bekannten Skelettierungsalgorithmen gegenübergestellt. Wie die Ergebnisse zeigen, liefert die abwechselnde Glättung und Entfernung von Randpunkten Skelette, die glatt und wohlgeformt sind und im Vergleich zu anderen Verfahren die geringsten Verzerrungen aufweisen.

关键词： thinning thinning algorithm pattern processing skeletonization stripping

来源：评论

学校读者我要写书评

暂无评论

thinning algorithms as Multivalued N-Retractions

Thinning Algorithms as Multivalued <i>N</i>-Retractions

引用

15th International Conference on Discrete Geometry for Computer Imagery

作者： Escribano, Carmen Giraldo, Antonio Sastre, Maria Asuncion Univ Politecn Madrid Fac Informat Dept Matemat Aplicada E-28660 Madrid Spain

ISBN: (纸本)9783642043963

In a recent paper we have introduced a notion of continuity in digital spaces which extends the usual notion of digital continuity. Our approach, which uses multivalued maps, provides a better framework to define topological notions, like retractions, in a far more realistic way than by using just single-valued digitally continuous functions. In particular, we characterized the deletion of simple points, one of the most important processing operations in digital topology, as a particular kind of retraction. In this work we give a simpler algorithm to define the retraction associated to the deletion of a simple point and we use this algorithm to characterize some well known parallel thinning algorithm as a particular kind of multivalued retraction, with the property that each point is retracted to its neighbors.

关键词： Digital images digital topology continuous multivalued function simple point retraction thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional thinning algorithms on graphics processing units and multicore CPUs

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2012年第14期24卷 1551-1571页

作者： Jimenez, J. Ruiz de Miras, J. Univ Jaen Dept Comp Sci Jaen 23071 Spain

Three-dimensional curve skeletons are a very compact representation of three-dimensional objects with many uses and applications in ?elds such as computer graphics, computer vision, and medical imaging. An important problem is that the calculation of the skeleton is a very time-consuming process. thinning is a widely used technique for calculating the curve skeleton because of the properties it ensures and the ease of implementation. In this paper, we present parallel versions of a thinning algorithm for e?cient implementation in both graphics processing units and multicore CPUs. The parallel programming models used in our implementations are Compute Uni?ed Device Architecture (CUDA) and Open Computing Language (OpenCL). The speedup achieved with the optimized parallel algorithms for the graphics processing unit achieves 106.24x against the CPU single-process version and more than 19x over the CPU multithreaded version. Copyright (c) 2011 John Wiley & Sons, Ltd.

关键词： 3D curve skeleton thinning algorithm CUDA OpenCL

来源：评论

学校读者我要写书评

暂无评论

Using scale space filtering to make thinning algorithms robust against noise in sketch images

引用

PATTERN RECOGNITION LETTERS 2014年第1期42卷 1-10页

作者： Chatbri, Houssem Kameyama, Keisuke Univ Tsukuba Grad Sch Syst & Informat Engn Dept Comp Sci Tsukuba Ibaraki Japan Univ Tsukuba Fac Engn Informat & Syst Tsukuba Ibaraki Japan

We apply scale space filtering to thinning of binary sketch images by introducing a framework for making thinning algorithms robust against noise. Our framework derives multiple representations of an input image within multiple scales of filtering. Then, the filtering scale that gives the best trade-off between noise removal and shape distortion is selected. The scale selection is done using a performance measure that detects extra artifacts (redundant branches and lines) caused by noise and shape distortions introduced by high amount of filtering. In other words, our contribution is an adaptive preprocessing, in which various thinning algorithms can be used, and which task is to estimate automatically the optimal amount of filtering to deliver a neat thinning result. Experiments using five state-of-the-art thinning algorithms, as the framework's thinning stage, show that robustness against various types of noise was achieved. They are mainly contour noise, scratch, and dithers. In addition, application of the framework in sketch matching shows its usefulness as a preprocessing and normalization step that improves matching performances. (C) 2014 Elsevier B.V. All rights reserved.

关键词： thinning algorithm Robustness against noise Scale space filtering Sketch image preprocessing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：