IP Library › Granted Patent US 12,367,589
Granted Patent B2
US 12,367,589 · App. 17/774,204 · Granted Jul 22, 2025

Method and terminal for detecting protrusion in intestinal tract, and computer-readable storage medium

Inventors: Wei Chen (Beijing, CN); Boyang Wu (Beijing, CN)
Assignee: BEIJING GMINE VISION TECHNOLOGIES LTD.
G06T7/12G01R33/48G06T3/04G06T3/06G06T3/067G06T7/11G06T7/13G06T7/149G06T7/521G06T7/62G06T7/66G06T7/70G06T17/20G06T19/20G16H30/20G16H30/40G06T2200/08G06T2207/10024G06T2207/10028G06T2207/10081G06T2207/10088G06T2207/10108G06T2207/20021G06T2207/30016G06T2207/30028G06T2210/41G06T2219/2008G06T2219/2021
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,367,589
App. No.
17/774,204
Granted
Jul 22, 2025
Kind
B2
Abstract

A method of detecting a protrusion in an intestinal tract in a computer according to an embodiment of the present disclosure includes acquiring a three-dimensional model of the intestinal tract scanned by a scanning device, the three-dimensional model comprising three-dimensional data of the intestinal tract; mapping, in the computer, the three-dimensional model to a two-dimensional plane in an area-preserving manner; and detecting an area of the protrusion in the two-dimensional plane. The method can replace traditional modes such as enteroscopy, and the protrusion in the intestinal tract is detected in a painless and low-cost mode.

Claims (59)

1. A method of detecting a protrusion in an intestinal tract in a computer, comprising:

acquiring a three-dimensional model of the intestinal tract scanned by a scanning device, the three-dimensional model comprising three-dimensional data of the intestinal tract;

mapping, in the computer, the three-dimensional model to a two-dimensional plane in an area-preserving manner; and

detecting an area of the protrusion in the two-dimensional plane;

wherein the mapping the three-dimensional model to a two-dimensional plane in an area-preserving manner comprises:

determining a boundary of the two-dimensional plane;

harmonically mapping the three-dimensional data to an interior of the boundary to form harmonic mapping points;

calculating second weights of the harmonic mapping points, and further calculating a weighted Voronoi diagram of the harmonic mapping points; and

mapping the three-dimensional model to the two-dimensional plane in the area-preserving manner according to the weighted Voronoi diagram.

2. The method of claim 1 , wherein the acquiring a three-dimensional model of the intestinal tract comprises:

acquiring a plurality of sections containing intestinal tract information;

positioning the intestinal tract information in the plurality of sections; and

forming the three-dimensional model according to the positioned intestinal tract information.

3. The method of claim 2 , wherein the plurality of sections containing the intestinal tract information are acquired by one of:

acquiring the plurality of sections by CT scanning technology;

acquiring the plurality of sections by a magnetic resonance (MR) device; and

acquiring the plurality of sections by single photon emission computed tomography (SPECT).

4. The method of claim 2 , wherein the positioning the intestinal tract information in the plurality of sections comprises:

positioning the intestinal tract information by edge detection or curvature segmentation.

5. The method of claim 2 , further comprising:

performing topology repair on the formed three-dimensional model.

6. The method of claim 5 , wherein the performing topology repair on the formed three-dimensional model comprises:

determining positions of genera in the three-dimensional model; and

eliminating the genera to reduce the number of the genera in the three-dimensional model.

7. The method of claim 1 , wherein the boundary of the two-dimensional plane is a rectangle.

8. The method of claim 7 , wherein the determining a boundary of the two-dimensional plane comprises:

determining a closed curve L in the three-dimensional model;

selecting four points v 0 , v 1 , v 2 , v 3 from the closed curve L, and letting γ 0 =v 0 −v 1 , γ 1 =v 1 −v 2 , γ 2 =v 2 −v 3 , γ 3 =v 3 −v 0 ; and

mapping γ 0 ˜γ 3 to four edges of the rectangle, respectively.

9. The method of claim 1 , wherein the harmonically mapping the three-dimensional data to an interior of the boundary to form harmonic mapping points comprises:

initializing the three-dimensional data to form mapping points in the two-dimensional plane;

calculating a harmonic energy between the mapping points in the two-dimensional plane;

when the harmonic energy is greater than a preset energy gradient threshold, adjusting coordinates of the mapping points, and adjusting the harmonic energy according to the adjusted coordinates of the mapping points, and when the harmonic energy is less than the preset energy gradient threshold, stopping the adjustment; and

taking, as the harmonic mapping points, coordinates of the mapping points when the adjustment is stopped.

10. The method of claim 9 , wherein the calculating a harmonic energy between the mapping points in the two-dimensional plane comprises:

calculating a square value of a difference between locations of adjacent mapping points;

calculating a first product of the square value and a first weight of an edge formed by the adjacent mapping points; and

calculating a sum of the first products for all the mapping points.

11. The method of claim 10 , wherein the first weight of the edge formed by the adjacent mapping points is calculated by:

determining an angle of a triangle that corresponds to the edge;

if the edge is an edge common to two triangles, the first weight of the edge being equal to half of a sum of cotangent trigonometric functions of angles that are opposite to the edge in the two triangles; and

if the edge is an edge on the boundary, the first weight of the edge being equal to half of a cotangent trigonometric function of an angle that is opposite to the edge in a triangle where the edge is located.

12. The method of claim 1 , wherein the calculating second weights of the harmonic mapping points, and further calculating a weighted Voronoi diagram of the harmonic mapping points comprises:

initializing the second weight of each harmonic mapping point, wherein at least three harmonic mapping points form one initial face;

determining weighted dual points of each initial face, the weighted dual points having equal weighted distances to vertices of each initial face, wherein the weighted dual points are connected to form a dual face of the weighted dual points, and a plurality of dual faces determine a weighted Voronoi diagram; and

updating the second weight of each harmonic mapping point, and readjusting the weighted Voronoi diagram according to the updated second weight.

13. The method of claim 12 , wherein the updating the second weight of each harmonic mapping point comprises:

determining an area A i , of an initial face of each harmonic mapping point;

determining an area A i ′ of a dual face of each harmonic mapping point;

determining an area gradient g i ==A i −A i ′ of each harmonic mapping point;

determining a sum of squares of the area gradients of all the harmonic mapping points; and

if the sum of squares is greater than a preset weight threshold, reducing the second weight until the sum of squares is less than the weight threshold.

14. The method of claim 12 , wherein the mapping the three-dimensional model to the two-dimensional plane in the area-preserving manner according to the weighted Voronoi diagram comprises:

determining a center of gravity of each dual face in the weighted Voronoi diagram; and

mapping each of the harmonic mapping points to the center of gravity of each dual face, thereby mapping the three-dimensional model to the two-dimensional plane in the area-preserving manner.

15. A terminal for detecting a protrusion in an intestinal tract, comprising:

a processor; and

a memory connected with the processor, the memory having stored therein computer program code which, when executed, causes the processor to perform the method of claim 1 .

16. A non-transitory computer-readable medium having stored thereon computer-readable instructions which, when executed by one or more processors, implement the method of claim 1 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 4, 2022
From: CHEN, WEI; WU, BOYANG
To: BEIJING GMINE VISION TECHNOLOGIES LTD.
Reel/Frame 059808/0892 →
Priority Claims (2)
CN 201911068702.2 · Nov 5, 2019 · national
CN 201911361335.5 · Dec 26, 2019 · national
Continuity (1)
Related Publication 20220351388A1 · Nov 3, 2022
References Cited (20)
US 20100328311A1 · Lakshmanan et al. · 2010 [cited by applicant]
US 20160350979A1 · Zeng · 2016 [cited by examiner]
US 20210019939A1 · Hu et al. · 2021 [cited by applicant]
CN 1781111A · 2006 [cited by applicant]
CN 105261052A · 2016 [cited by applicant]
CN 105411505A · 2016 [cited by applicant]
CN 105741270A · 2016 [cited by applicant]
CN 107146287A · 2017 [cited by applicant]
CN 108648231A · 2018 [cited by applicant]
CN 108875813A · 2018 [cited by applicant]
CN 110766692A · 2020 [cited by applicant]
CN 111127314A · 2020 [cited by applicant]
WO WO2019146903A1 · 2019 [cited by applicant]
Office action issued on Aug. 31, 2023 from US Patent Office in a parent U.S. Appl. No. 17/773,918. [cited by applicant]
Office action issued on Jul. 17, 2023 from US Patent Office in a parent U.S. Appl. No. 17/773,932. [cited by applicant]
Havaei M, et al., “Within-brain classification for brain tumor segmentation”, International journal of computer assisted radiology and surgery. May 2009;11 :777-88, 2016. [cited by applicant]
Wu Ming-Ni et al., “Brain tumor detection using color-based k-means clustering segmentation”, In Third international conference on intelligent information hiding and multimedia signal processing, (IIH-MSP 2007), Nov. 2,… [cited by applicant]
Shen Y et al., “Brain tumor segmentation on MRI with missing modalities”, Information processing in Medical imaging: 26th International Conference, IPMI 2019, Hong Kong, China, Jun. 2-7, 2019, Proceedings 26 2019 (pp. 4… [cited by applicant]
Tu Z. et al.,, “Auto-context and its application to high-level vision tasks and 3D brain image segmentation”, IEEE transactions on pattern analysis and machine intelligence. Dec. 1, 2009;32(10):17 44-57. [cited by applicant]
International Search Report for PCT/KR2020/126488 mailed on Feb. 10, 2021. [cited by applicant]