# US 2019/0378272 A1 · Systems and methods for identifying optimized ablation targets for treating and preventing arrhythmias sustained by reentrant circuit

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0378272 A1
- Document ID: US20190378272A1
- Status: Published application
- Kind: A1
- Application number: 16/548,880
- Filed: 2019-08-23
- Published: 2019-12-12
- Earliest claimed: 2015-12-03
- Assignees: CardioSolv Ablation Technologies, Inc.
- Applicants: Cardiosolv Ablation Technologies, Inc.
- Inventors: Robert Clayton Blake III
- Web page: https://patentgrep.com/patent/US20190378272A1

## CPC

- G06T 7/0012: {Biomedical image inspection}
- A61B 5/055: involving electronic [EMR] or nuclear [NMR] magnetic resonance, e.g. magnetic resonance imaging
- A61B 5/319: Circuits for simulating ECG signals
- G06T 7/11: Region-based segmentation
- G06T 7/13: Edge detection
- A61B 5/363: Detecting tachycardia or bradycardia
- A61B 18/00: Surgical instruments, devices or methods for transferring non-mechanical forms of energy to or from the body (eye surgery A61F9/007; ear surgery A61F11/00)
- A61B 2576/023: for the heart
- G06T 2207/10088: Magnetic resonance imaging [MRI]
- G06T 2207/30048: Heart; Cardiac
- G16H 30/40: for processing medical images, e.g. editing
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- A61B: DIAGNOSIS; SURGERY; IDENTIFICATION (usefulness limited to only animals A61D)
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

Methods and systems for identifying optimized ablation targets for treating and preventing arrhythmias sustained by reentrant circuits are described. The methods comprise receiving at least one mesh generated from one or more images of a patient's heart, receiving activation data generated from one or more simulations of electrical-signal propagation over the at least one mesh, generating at least one flow graph based on the activation data and the at least one mesh, and applying a max-flow min-cut algorithm to the at least one flow graph to determine at least one of a number, one or more dimensions, and one or more locations of one or more ablation targets. Non-transitory computer-readable media storing a set of instructions for treating and preventing arrhythmias sustained by reentrant circuits are also described.

## Claims

### Claim at position 1

1-23. (canceled)

### Claim 24

A method for identifying optimized regions of interest, the method comprising:
receiving at least one mesh generated from one or more images of a patient's heart;
receiving activation data generated from one or more simulations of electrical-signal propagation over the mesh, the simulations being consistent with one or more heart conditions;
generating at least one flow graph based on the activation data and the mesh, the flow graph comprising one or more nodes associated one or more elements and one or more edges connecting two or more nodes;
designating a first set of one or more nodes as source nodes;
designating a second set of one or more nodes as sink nodes;
determining one or more flow graph segments connecting a source node to a sink node;
determining one or more regions of interest, which correspond to a minimum number of cuts in the flow graph and a maximum flow through the flow graph.

### Claim 25 (depends on 24)

The method of claim 24, wherein the one or more elements correspond to one or more faces of the mesh, and wherein the one or more nodes correspond to one or more vertices of the one or more faces.

### Claim 26 (depends on 24)

The method of claim 24, further comprising determining one or more directions for the edges.

### Claim 27 (depends on 26)

The method of claim 26, wherein the flow graph segments are collections of the edges between the source nodes and a first-encountered sink node in the directions of the edges.

### Claim 28 (depends on 24)

The method of claim 24, wherein the source nodes correspond to one or more nodes that were activated at the beginning of the one or more simulations, and wherein the sink nodes correspond to one or more nodes that were activated at the end of the one or more simulation.

### Claim 29 (depends on 24)

The method of claim 24, further comprising eliminating one or more edges that do not form a part of a path from a source node to a sink node.

### Claim 30 (depends on 24)

The method of claim 24, wherein determining the regions of interest comprises:
determining at least one of a number, one or more dimensions, or one or more locations of the regions of interest.

### Claim 31 (depends on 24)

The method of claim 24, wherein determining the regions of interest comprises:
determining one or more target edges with a smallest sum total of their respective capacities,
wherein removing the target edges reduces a flow through the flow graph to zero.

### Claim 32 (depends on 24)

The method of claim 24, wherein determining the regions of interest comprises:
determining one or more target flow segments based on their respective residual capacities; and
determining one or more common elements that correspond to the target flow segments,
wherein the one or more common elements are identified as the regions of interest.

### Claim 33 (depends on 24)

The method of claim 24, wherein the activation data comprises one or more activation times relative to start and end times of the simulations.

### Claim 34 (depends on 24)

The method of claim 24, further comprising calculating one or more capacities associated with the edges, wherein a capacity represents a largest possible flow between two or more elements connected by an edge.

### Claim 35 (depends on 34)

The method of claim 34, wherein the first set of one or more nodes is designated such that the first set comprises the smallest number of nodes and the sum of the capacities associated with the edges emanating from the nodes in the first set is above a threshold.

### Claim 36 (depends on 34)

The method of claim 34, wherein the second set of one or more nodes is designated such that the second set comprises the smallest number of nodes and the sum of the capacities associated with the edges terminating into the nodes in the second set is above a threshold.

### Claim 37 (depends on 34)

The method of claim 34, wherein the first set of one or more nodes is designated such that the first set comprises the smallest number of nodes and the edges emanating from the nodes in the first set have non-zero residual capacities.

### Claim 38 (depends on 34)

The method of claim 34, wherein the second set of one or more nodes is designated such that the second set comprises the smallest number of nodes and the edges terminating into the nodes in the second set have non-zero residual capacities.

### Claim 39 (depends on 24)

The method of claim 24, further comprising displaying the regions of interest on the one or more images of the patient's heart.

### Claim 40 (depends on 24)

The method of claim 24, wherein determining the flow graph segments comprise creating two or more flow graph segments by removing one or more edges from the flow graph, adding one or more sources to one of the two flow graph segments, and adding one or more sinks to one of the two flow graph segments.

### Claim 41 (depends on 24)

The method of claim 24, wherein the regions of interest include one or more ablation targets.

### Claim 42

A system for identifying optimized regions of interest, the system comprising:
at least one non-transitory computer-readable medium configured to store instructions; and
at least one processor configured to execute the instructions to perform operations comprising:
receiving at least one mesh generated from one or more images of a patient's heart;
receiving activation data generated from one or more simulations of electrical-signal propagation over the mesh, the simulations being consistent with one or more heart conditions;
generating at least one flow graph based on the activation data and the mesh, the flow graph comprising one or more nodes associated one or more elements and one or more edges connecting two or more nodes;
designating a first set of one or more nodes as source nodes;
designating a second set of one or more nodes as sink nodes;
determining one or more flow graph segments connecting a source node to a sink node;
determining one or more regions of interest, which correspond to a minimum number of cuts in the flow graph and a maximum flow through the flow graph.

### Claim 43

A non-transitory computer-readable medium storing a set of instructions that are executable by one or more processors to cause the processors to perform a method for identifying optimized regions of interest, the method comprising:
receiving at least one mesh generated from one or more images of a patient's heart;
receiving activation data generated from one or more simulations of electrical-signal propagation over the mesh, the simulations being consistent with one or more heart conditions;
generating at least one flow graph based on the activation data and the mesh, the flow graph comprising one or more nodes associated one or more elements and one or more edges connecting two or more nodes;
designating a first set of one or more nodes as source nodes;
designating a second set of one or more nodes as sink nodes;
determining one or more flow graph segments connecting a source node to a sink node;
determining one or more regions of interest, which correspond to a minimum number of cuts in the flow graph and a maximum flow through the flow graph.
