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

Rebar binding point location method based on improved YOLOv5 and thinning algorithm

MEASUREMENT 2025年 242卷

作者： Xu, Kejia Lu, Xinyun Shen, Tao Zhu, Xingfan Wang, Shuo Wang, Xu Wang, Junchi Hohai Univ Sch Mech & Elect Engn Changzhou Jiangsu Peoples R China Hohai Univ Sch Comp & Software Changzhou Jiangsu Peoples R China

In order to solve the problem that the location of rebar binding points is unstable and easy to be affected by environmental noise, this paper proposes a rebar binding point location method based on object depth classification and thinning algorithm. Firstly, YOLOv5 is used to locate the target frame of the rebar binding point, and the Biformer module suitable for small target detection is added to YOLOv5. Secondly, the continuous depth data in the target frame is classified by the depth-first algorithm, and the top level rebar is classified and stored as a binary image, and the Zhang-Suen thinning algorithm is used to obtain the reinforced skeleton. Finally, the skeleton intersection point recognition algorithm is used to obtain the position of the rebar binding point. From the training results, 95 % of the target frames for rebar binding points were recognized. Experiments show that the method can accurately obtain the location of the binding points of the rebar, and can accurately classify the noise, non-target binding points and target binding points, and has high stability for the location of binding points, which is better than YOLOv8-POSE.

关键词： Rebar binding point localization YOLOv5 thinning algorithm Biformer Vision Transformer

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL-SYMMETRIC thinning algorithm

引用

PATTERN RECOGNITION 1989年第4期22卷 387-396页

作者： BOURBAKIS, NG George Mason University Machine Vision Lab Dept. ECE SITE Fairfax VA 22030 U.S.A

This paper presents a parallel-symmetric thinning algorithm (PSTA), which is a modification of the one-pass thinning algorithm (OPTA). The OPTA is applied on raster scanned binary images to produce their skeleton, using a set of 10 predefined templates of 3 × 3 and 3 × 4 elements. The PSTA uses almost the same 10 templates of 4 × 4 elements in order to create the skeleton of the picture elements received by a parallel-symmetric manner, which applies the raster method and its vertical symmetric. Here, both the OPTA and PSTA algorithms are implemented sequentially in software for comparison purpose in accuracy (using ideal skeletons), memory requirements and execution time.

关键词： thinning algorithm Parallel-symmetric processing 2-D processing array

来源：评论

学校读者我要写书评

暂无评论

A modified ZS thinning algorithm by a hybrid approach

引用

VISUAL COMPUTER 2018年第5期34卷 689-706页

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

thinning is one of the most important techniques in the field of image processing. It is applied to erode the image of an object layer-by-layer until a skeleton is left. Several thinning algorithms allowing to get a skeleton of a binary image are already proposed in the literature. This paper investigates several well-known parallel thinning algorithms and proposes a modified version of the most widely used thinning algorithm, called the ZS algorithm. The proposed modified ZS (MZS) algorithm is implemented and compared against seven existing algorithms. Experimental results and performances evaluation, using different image databases, confirm the proposed MZS algorithm improvement over the seven examined algorithms both in terms of the obtained results quality and the computational speed. Moreover, for an efficient implementation (on Graphics Processing Units), a parallel model of the MZS algorithm is proposed (using the Compute Unified Device Architecture, CUDA, as a parallel programming model). Evaluation results have shown that the parallel version of the proposed algorithm is, on average, more than 21 times faster than the traditional CPU sequential version.

关键词： thinning algorithm Binary image thinning rate thinning speed Connectivity Noise sensitivity GPU

来源：评论

学校读者我要写书评

暂无评论

Tissue Characterization of Equine Tendons With Clinical B-Scan Images Using a Shock Filter thinning algorithm

引用

IEEE TRANSACTIONS ON MEDICAL IMAGING 2011年第3期30卷 597-605页

作者： Meghoufel, Ali Cloutier, Guy Crevier-Denoix, Nathalie de Guise, Jacques A. Univ Quebec Ecole Technol Super Dept Genie Prod Automatisee Montreal PQ H3C 1K3 Canada Univ Montreal Hosp CRCHUM Lab Biorheol & Ultrasonog Med Montreal PQ H2L 2W5 Canada Univ Montreal Dept Radiol Radiooncol & Nucl Med Montreal PQ H3T 1J4 Canada Univ Montreal Inst Biomed Engn Montreal PQ H3T 1J4 Canada Ecole Natl Vet Alfort Unite INRA ENVA Biomecan & Pathol Locomotrice Che F-94704 Maisons Alfort France Univ Montreal Hosp CRCHUM Lab Rech Imagerie & Orthopedie Montreal PQ H2L 2W5 Canada

The fiber bundle density (FBD) calculated from ultrasound B-scan images of the equine superficial digital flexor tendon (SDFT) can serve as an objective measurement to characterize the three metacarpal sites of normal SDFTs, and also to discriminate a healthy SDFT from an injured one. In this paper, we propose a shock filter algorithm for the thinning of hyper-echoic structures observed in B-scan images of the SDFT. This algorithm is further enhanced by applying closing morphological operations on filtered images to facilitate extraction and quantification of fiber bundle fascicles. The mean FBD values were calculated from a clinical B-scan image dataset of eight normal and five injured SDFTs. The FBD values measured at three different tendon sites in normal cases show a highest density on the proximal site (five cases out of eight) and a lowest value on the distal part (seven cases out of eight). The mean FBD values measured on the entire tendon from the whole B-scan image dataset show a significant difference between normal and injured SDFTs: 51 (+/- 9) for the normal SDFTs and 39 (+/- 7) for the injured ones (p = 0.004). This difference likely indicates disruption of some fiber fascicle bundles where lesions occurred. To conclude, the potential of this imaging technique is shown to be efficient for anatomical structural SDFT characterizations, and opens the way to clinically identifying the integrity of SDFTs.

关键词： B-scan images equine tendon fiber bundle density mathematical morphological operations shock filter thinning algorithm two-dimensional/three-dimensional (2D/3D) anatomical structures ultrasound imaging

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL thinning algorithm WITH FINE-GRAIN SUBTASKING

引用

PARALLEL COMPUTING 1989年第3期10卷 329-334页

作者： HOLT, C STEWART, A QUEENS UNIV BELFAST DEPT COMP SCIBELFAST BT7 1NNANTRIMNORTH IRELAND

A one-pass iterative parallel thinning algorithm has been designed to reduce a two-dimensional pattern of strokes to its skeleton by removing layers of edge element until stroke has unitary thickness. An edge test computation is simulataneously carried out for each element in the two-dimensional pattern by inspecting the values of its neighbours. However, there is a degree of duplication among edge computations for elements with common neighbours. A modified algorithm described in this paper which avoids duplication at the cost of extra communication. The speed of the modified algorithm compared to the original algorithm is 1.(i) approximately 45% better on the ICL DAP; 2.(ii) approximately 30% better on the CRAY X-MP.

关键词： thinning algorithm SIMD machines

来源：评论

学校读者我要写书评

暂无评论

A novel single-pass thinning algorithm and an effective set of performance criteria

引用

PATTERN RECOGNITION LETTERS 1995年第12期16卷 1267-1275页

作者： Zhou, RW Quek, C Ng, GS NANYANG TECHNOL UNIV SCH APPL SCIINTELLIGENT SYST LABSINGAPORE 2263SINGAPORE

A new sequential thinning algorithm, which uses both flag map and bitmap simultaneously to decide if a boundary pixel can be deleted, as well as the incorporation of smoothing templates to smooth the final skeleton, is proposed in this paper. Three performance measurements are proposed for an objective evaluation of this novel algorithm against a set of well established techniques. Extensive result comparison and analysis are presented in this paper for discussion.

关键词： single pass performance criteria smoothing templates performance and complexity analysis boundary noise noise immunity thinning algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel thinning algorithm based on stroke continuity detection

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2017年第5期11卷 873-879页

作者： Dong, Jianwei Chen, Yanmei Yang, Zhijing Ling, Bingo Wing-Kuen Guangdong Pharmaceut Univ Sch Basic Courses Guangzhou 510006 Guangdong Peoples R China Guangdong Polytech Normal Univ Sch Comp Sci Guangzhou 510665 Guangdong Peoples R China Guangdong Univ Technol Sch Informat Engn Guangzhou 510006 Guangdong Peoples R China

thinning algorithms often cause stroke distortions at the crosses or intersections of strokes, which lead to bad results in pattern recognition tasks. In order to overcome these drawbacks, this paper proposes a parallel thinning algorithm based on stroke continuity detection. In the algorithm, before it uses the conditions of parallel algorithms to delete a boundary point, it first detects whether the boundary point is a reserved point to keep stroke's continuity or not. Consequently, it can produce a skeleton with good symmetry, control the large deformation at the cross or intersection of strokes, and make a better skeleton more quickly. Moreover, it is practically immune to noise.

关键词： Skeleton thinning algorithm Stroke distortion Reserved point Stroke continuity detection

来源：评论

学校读者我要写书评

暂无评论

A NOVEL FAST AND RELIABLE thinning algorithm

引用

IMAGE AND VISION COMPUTING 1993年第9期11卷 588-603页

作者： KALLES, D MORRIS, DT Department of Computation UMIST PO Box 88 Manchester M60 1QD UK

In this paper a new algorithm is proposed for skeletonizing binary digital images. The algorithm does not employ the conventional pixel- or non-pixel-based techniques. Instead, it identifies regions of particular shapes in the image and substitutes apppropriate skeleton patterns for them. Initially, as many horizontal and vertical strips as possible are detected. These correspond to rather straight, long and narrow regions in the original image. Any remaining regions correspond to joints between strips. The strips are then grouped into trapezoidal regions which may be replaced by the appropriate skeleton patterns. The individual skeleton patterns are then merged using the skeletons due to the jointing regions, generating the final skeleton. A compact representation is obtained for post-processing, and the issue of robustness with respect to noise is addressed.

关键词： IMAGE PROCESSING thinning algorithm SKELETONIZATION

来源：评论

学校读者我要写书评

暂无评论

A DYNAMIC SHAPE PRESERVING thinning algorithm

引用

SIGNAL PROCESSING 1991年第2期22卷 199-208页

作者： LAM, L SUEN, CY Centre for Pattern Recognition Machine Intelligence Department of Computer Science Concordia University 1455 de Maisonneuve Blvd. W. Montréal Québec H3G 1M8 Canada

This paper presents algorithms for improving the quality of skeletons obtained from sequential thinning processes. The algorithms take into consideration the shape of the contours in the dynamic removal and placement of pixels in order to obtain skeletons that are more representative of the shapes of the original patterns. The algorithms have been implemented and tested on different character patterns. The resulting skeletons do preserve important characteristics of patterns such as smooth curves and sharp corners, and they are close approximations of skeletons produced by human subjects.

关键词： thinning thinning algorithm PATTERN PROCESSING SKELETONIZATION

来源：评论

学校读者我要写书评

暂无评论

A CORRECTION ON FURTHER CONSIDERATIONS OF A 1-SUBCYCLE PARALLEL thinning algorithm

引用

JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS 1994年第5期17卷 737-741页

作者： CHEN, YS Department of Electrical Engineering Yuan Ze Institute of Technology Taoyuan 320 Taiwan

A disconnectedness problem which appeared in the 1-subcycle parallel thinning algorithm [1] is shown and a correct condition is presented to overcome this problem. As a result, to preserve the connectivity of a P8ET-type thin line, the removal of a (quasi) T-junction should be guaranteed by its neighbors that do not belong to any one of the commonly used subwindows, mutually opposite subwindows, and T-junction cases.

关键词： thinning algorithm PARALLEL PROCESSING

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：