An Efficient and Fast Extraction Algorithm and System of Subway Crack Trunk Based on Computational Geometry
A computationally geometric and efficient technology, applied in the field of rail transit, which can solve the problem of inaccurate extraction of crack trunk areas
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0066] Example: such as Figure 1 to Figure 8 As shown, the core algorithm process we propose is specifically divided into three modules: the algorithm process for machine identification of connected fractures, the algorithm process for constructing convex polygons in fracture regions, and the algorithm process for identifying fracture backbones with rectangular boxes.
[0067] First, the first module, the algorithm flow of machine identification of connected cracks, is introduced in detail. We first define an empty waiting queue C n , and an empty storage space C xy . Step 1: Take a black pixel point C b1 As a starting point for crack identification, the C b1 Add to waiting queue C n in the C b1 Coordinates are stored in C xy middle. The second step: the C b1 mark as detected crack pixels, and then search with C b1 All the adjacent black pixels, put the unvisited black pixels C b2 , C b3 ,...,C bn Put them in the waiting queue C in turn n and store the respectiv...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com