Tubular structure rapid tracking method based on curvature regularization perception grouping
A tubular structure and curvature technology, applied in the field of image processing, can solve a large number of problems such as manual interaction, time-consuming and labor-consuming, short cutting, etc., to achieve the effect of reducing manual interaction and improving tracking speed
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment 1
[0057] Step b) includes the following features:
[0058] b-1) by formula Calculate the response ψ(x,r) of the optimal directional gradient flux filter, where G σ is a Gaussian kernel function with standard deviation σ, for the core for G σ The Hessian matrix, r is the radius, r∈[R min , R max ], [R min , R max ] is the radius range, x is the point in the image, * is the convolution operator, is a circular area with radius r.
[0059] b-2) Decompose the response ψ(x,r) into eigenvalues λ 1 (x,r) and λ 2 (x,r), via the formula Calculate the tubular structure probability map ψ(x), through the formula Calculate the eigenvalue λ 1 (x,r) corresponds to the optimal scale ρ(x).
[0060] b-3) by formula Build orientation-lifted spaces Realize the mapping of two-dimensional plane curves into three-dimensional space, Ω is the two-dimensional image space of image I, is the direction space, by formula Construct points in orientation-lifted space point It i...
Embodiment 2
[0063] Step c) comprises the following steps:
[0064] c-1) Realize the centerline pre-segmentation of the binary image of the tubular structure through skeletonization, and then remove the intersection points and branch points of the skeleton structure to obtain skeleton fragments that do not intersect each other.
[0065] c-2) Use the threshold method to remove the skeleton segment whose length is less than a given threshold, and obtain the pre-segmented centerline segment as N is the number of pre-segmented centerline segments.
Embodiment 3
[0067] Using the Euclidean distance between the pre-segmented centerline segments to search for adjacent pre-segmented centerline segments in step d) includes the following steps:
[0068] d-1) For each pre-segmented centerline segment from The two ends extend the length ι outward along the tangent direction to obtain the extended pre-segmented centerline segment
[0069] d-2) by formula Calculate the pre-segmented centerline segment Neighborhood M i , where τ is a given threshold.
[0070] d-3) By formula Finding and Pre-Segmenting Centerline Segments Adjacent pre-divided centerline segments For pre-segmented centerline segments The extended pre-segmentation centerline segment, j∈[0,N] and i≠j, φ is an empty set.
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