Leaflet-grouping system
A method of using a computer processor for grouping prosthetic valve leaflets of an aggregate of prosthetic valve leaflets is provided. For each leaflet of the aggregate, in response to an image parameter of the leaflet, a leaflet-flexibility value is derived. At least some of the leaflets of the aggregate are designated into leaflet groups, based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate. For each of the designated leaflet groups, the flexibility value of each leaflet in the designated leaflet group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other leaflet in the designated leaflet group. An indication of the designated leaflet groups is outputted. Other embodiments are also described.
Latest CARDIOVALVE LTD. Patents:
This application is a Continuation of U.S. Ser. No. 16/937,216 to Kislev et al., filed on Jul. 23, 2020, entitled “LEAFLET-GROUPING SYSTEM,” which published as US 2020-0405486, and which is a Continuation in Part of:
-
- (i) PCT application IL2020/050315, to Kislev et al., filed on Mar. 17, 2020, and entitled “LEAFLET-GROUPING SYSTEM”, and
- (ii) PCT application IL2019/051031, to Kislev et al., filed on Sep. 16, 2019, and entitled “LEAFLET-TESTING APPARATUS”, which claims priority from, and is a Continuation of, U.S. patent application Ser. No. 16/132,937 filed Sep. 17, 2018, entitled “LEAFLET-TESTING APPARATUS,” and which issued as U.S. Pat. No. 10,779,946.
Each of the above applications is incorporated herein by reference.
FIELD OF THE INVENTIONSome applications of the present invention relate in general to prosthetic heart valves. More specifically, some applications of the present invention relate to techniques for appropriately grouping prosthetic leaflets for use in prosthetic heart valves.
BACKGROUNDProsthetic heart valves may be constructed of a frame to which prosthetic leaflets are attached, the leaflets providing check-valve functionality by opening in response to blood flow in a first direction, and closing in response to blood flow in a second direction. In order to inhibit leakage (“regurgitation”) of blood between the closed leaflets in the second direction, it is important that the leaflets coapt well against each other. One factor facilitating coaptation of leaflets in a prosthetic heart valve is flexibility of leaflets.
SUMMARY OF THE INVENTIONSome applications of the present invention are directed to appropriately grouping prosthetic leaflets, for use in prosthetic heart valves. Leaflet groups may be designated based on flexibility of the leaflets, e.g., such that leaflets are grouped with other leaflets that have similar flexibility. Leaflet groups typically include a fixed number of leaflets, e.g., according to the number of leaflets required for a given heart valve.
Aspects of the present invention include apparatus and methods for computationally assigning leaflet-flexibility values to leaflets, e.g., by digital analysis of one or more images of one or more pluralities of leaflets.
For some applications, an aggregate of leaflets including a first batch of leaflets and a second batch of leaflets is generated, and the groups are designated from leaflets of the aggregate based on similarity between the leaflet-flexibility values of the leaflets of the aggregate. For some such applications, the aggregate of leaflets is generated by testing each batch of leaflets, and storing each batch in a storage array in a manner that retains the individual identity of each leaflet. For some applications, the array is associated with a plurality of indicators that are activated in a manner that indicates the designated groups. For example, the array may define a plurality of cells, one cell for each leaflet of the aggregate, and one indicator for each cell.
There is therefore provided, in accordance with an application of the present invention, a method for grouping prosthetic valve leaflets of an aggregate of prosthetic valve leaflets, the method including, using a computer processor:
for each leaflet of the aggregate, in response to an image parameter of the leaflet, deriving a leaflet-flexibility value;
receiving a group size value;
designating at least some of the leaflets of the aggregate into designated leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, and (ii) such that each of the designated leaflet groups includes a number of leaflets equal to the group size value; and
outputting an indication of the designated leaflet groups.
In an application, the method includes receiving an intra-group tolerance, the intra-group tolerance representing a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group; and
designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating at least some of the leaflets of the aggregate into designated leaflet groups, such that, for each of the designated leaflet groups, the flexibility value of each leaflet in the designated leaflet group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other leaflet in the designated leaflet group.
In an application, outputting the indication of the designated leaflet groups includes, using at least one indicator in communication with the computer processor, indicating the designated leaflet groups.
In an application, the group size value is three, and receiving the group size value includes receiving the group size value that is three.
In an application, group size value is two, and receiving the group size value includes receiving the group size value that is two.
In an application, group size value is four, and receiving the group size value includes receiving the group size value that is four.
In an application, designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating fewer than 80 percent of the leaflets of the aggregate into designated leaflet groups.
In an application, designating fewer than 80 percent of the leaflets of the aggregate into designated leaflet groups includes designating 10-80 percent of the leaflets of the aggregate into designated leaflet groups.
In an application, designating fewer than 80 percent of the leaflets of the aggregate into designated leaflet groups includes designating fewer than 50 percent of the leaflets of the aggregate into designated leaflet groups.
In an application, designating fewer than 50 percent of the leaflets of the aggregate into designated leaflet groups includes designating 10-50 percent of the leaflets of the aggregate into designated leaflet groups.
In an application, designating fewer than 50 percent of the leaflets of the aggregate into designated leaflet groups includes designating fewer than 30 percent of the leaflets of the aggregate into designated leaflet groups.
In an application, the method includes, prior to deriving the leaflet-flexibility value for each leaflet of the aggregate of leaflets, calculating the image parameter for each leaflet of the aggregate by digitally analyzing one or more digital images that include the leaflets of the aggregate.
In an application, the method includes, prior to deriving the leaflet-flexibility value for each leaflet of the aggregate of leaflets, performing an image-quality check routine, and performing the image-quality check routine includes:
comparing, for each leaflet of the aggregate, the image parameter to a predetermined threshold;
and deriving the leaflet-flexibility value for each leaflet of the aggregate of leaflets includes selectively deriving the leaflet-flexibility value for each leaflet, such that:
if the image parameter for a given leaflet is found to fit the predetermined threshold, the leaflet-flexibility value is derived for that leaflet, and
if the image parameter for a given leaflet is found to not fit the predetermined threshold, the leaflet-flexibility value is not derived for that leaflet.
In an application:
calculating the image parameter for each leaflet of the aggregate includes:
-
- calculating, for each leaflet of the aggregate:
- a direct distance between a position of a first leaflet-tip and a position of a second leaflet-tip, and
- an axial distance along a horizontal axis between the position of the first leaflet-tip and the position of the second leaflet-tip, and
- comparing, for each leaflet of the aggregate, the direct distance to the axial distance.
- calculating, for each leaflet of the aggregate:
In an application, calculating the image parameter for each leaflet of the aggregate includes calculating, for each leaflet of the aggregate, a direct distance between a position of a first leaflet-tip and a position of a second leaflet-tip.
In an application, calculating the image parameter for each leaflet of the aggregate includes calculating, for each leaflet of the aggregate, an axial distance along a horizontal axis between a position of a first leaflet-tip and a position of a second leaflet-tip.
In an application, the method includes, prior to calculating the image parameter for each leaflet of the aggregate, using an image sensor to acquire the one or more digital images.
In an application, the aggregate of leaflets includes a first batch of leaflets and a second batch of leaflets, and acquiring the one or more digital images includes:
acquiring a first digital image that includes leaflets of the first batch of leaflets; and
acquiring a second digital image that includes leaflets of the second batch of leaflets.
In an application:
the first digital image includes all of the leaflets of the first batch of leaflets, and acquiring the first digital image includes acquiring the digital image that includes all of the leaflets of the first batch of leaflets; and
the second digital image includes all of the leaflets of the second batch of leaflets, and acquiring the second digital image includes acquiring a digital image that includes all of the leaflets of the second batch of leaflets.
In an application, the method includes, subsequently to acquiring the first digital image, for each leaflet of the first batch of leaflets, indicating a respective portion of a storage array in which to temporarily store the leaflet of the first batch of leaflets.
In an application, outputting the indication of the designated leaflet groups includes indicating the respective portion of the storage array from which to group leaflets of the first batch of leaflets into the designated leaflet groups.
In an application, the method includes, prior to the step of designating:
assigning a respective index to each of the leaflet-flexibility values, each of the indices representing a respective one of the leaflets and having the leaflet-flexibility value of the respective one of the leaflets;
receiving an intra-group tolerance, the intra-group tolerance representing a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group;
subsequently, determining a maximum number of within-tolerance index groups attainable from the indices, a within-tolerance index group being an index group (i) that includes a number of indices that is equal to the group size value, and (ii) for which the flexibility value of each index in the index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the index group; and
subsequently, storing the maximum number,
and designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating at least some of the leaflets of the aggregate into designated leaflet groups, such that:
-
- for each of the designated leaflet groups, the flexibility value of each index in the designated index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the designated index group, and
- a total number of the designated index groups is at least half of the stored maximum number.
In an application:
assigning the respective index to each of the leaflet-flexibility values includes arranging the indices in an ordered series in which the indices are ordered according to an order of magnitude of the respective leaflet-flexibility values; and
determining the maximum number includes iteratively:
-
- counting a number of successive remaining indices, a successive remaining index being defined as an index that (i) has not yet been counted as an index of a within-tolerance index group, and (ii) being positioned later in the ordered series than any index that has already been counted as an index of a within-tolerance index group
- selecting a potential index group from among the successive remaining indices, such that:
- a lowest index of a potential index group is the index of the potential index group that has a lowest leaflet-flexibility value of the indices of the potential index group, and a highest index of the potential index group is the index of the potential index group that has a highest leaflet-flexibility value of the indices of the potential index group,
- the potential index group includes a number of successive indices equal to the group size, and
- the lowest index of the potential index group is the lowest remaining index;
- calculating a group-differential of the potential index group, the group-differential being a difference between (i) the leaflet-flexibility value of the highest index of the potential index group, and (ii) the leaflet-flexibility value of the lowest index of the potential index group;
- determining whether the group-differential of the potential index group is greater than, or no greater than, the intra-group tolerance, and responsively:
- if the group-differential of the potential index group is no greater than the intra-group tolerance, counting the potential index group as a within-tolerance index group, and
- if the group-differential of the potential index group is greater than the intra-group tolerance, not counting the potential index group as a within-tolerance index group;
- responsively to (i) the step of counting the potential index group, and (ii) the identifying the number of successive remaining indices, selectively selecting a successive potential index group including a remaining index, and selectively selecting the successive potential index group includes:
- if a preceding potential index group is counted as a within-tolerance index group, and the number of successive remaining indices is at least equal to the group size value, selecting the successive potential index group, the lowest index of the successive potential index group immediately succeeding the highest index of the preceding potential index group,
- if the preceding potential index group is counted as a within-tolerance index group, and the number of successive remaining indices is less than the group size value, concluding the determining the maximum number,
- if the preceding potential index group is not counted as a within-tolerance index group, and the number of successive remaining indices is at least equal to the group size value, selecting the successive potential index group, the lowest index of the successive potential index group immediately succeeding the lowest index of the preceding potential index group,
- if the preceding potential index group is not counted as a within-tolerance index group, and no remaining index is identified, concluding the determining the maximum number,
until the number of successive remaining indices is less than the group size value.
In an application, organizing the indices according to an order of magnitude of the values includes organizing the indices according to an ascending order of magnitude of the values.
In an application, organizing the indices according to an order of magnitude of the values includes organizing the indices according to a descending order of magnitude of the values.
In an application:
an average differential value, of a given index group, is calculated by averaging differences between leaflet-flexibility values assigned to each pair of indices including that index group,
designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups such that:
-
- a cumulative average differential value of the designated index groups, calculated by averaging the average differential values of each of the designated index groups, is less than:
- the cumulative average differential value of the within-tolerance index groups, calculated by averaging the average differential values of each of the within-tolerance index group.
In an application, designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of the designated index groups is:
at least half of the stored maximum number, and
no greater than the stored maximum number.
In an application, designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of the designated index groups is at least sixty percent of the stored maximum number.
In an application, designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of the designated index groups is at least seventy percent of the stored maximum number.
In an application, designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of the designated index groups is at least eighty percent of the stored maximum number.
In an application, designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of the designated index groups is at least ninety percent of the stored maximum number.
In an application, designating the at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of the designated index groups is equal to the stored maximum number.
In an application, designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that a total number of designated leaflet groups is at least sixty percent of the stored maximum number.
In an application, designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that the total number of designated leaflet groups is at least seventy percent of the stored maximum number.
In an application, designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that the total number of designated leaflet groups is at least eighty percent of the stored maximum number.
In an application, designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that the total number of designated leaflet groups is at least ninety percent of the stored maximum number.
In an application, designating at least some of the leaflets of the aggregate into designated leaflet groups includes designating the at least some of the leaflets of the aggregate into designated leaflet groups, such that the total number of designated leaflet groups is equal to the stored maximum number.
In an application:
assigning the respective index to each of the leaflet-flexibility values includes arranging the indices in an ordered series in which the indices are ordered according to an order of magnitude of the respective leaflet-flexibility values; and
designating at least some of the leaflets of the aggregate into designated leaflet groups includes, starting at the beginning of the ordered series, iteratively:
-
- (a) selecting a preliminary index group from among remaining indices, a remaining index being defined as an index that is positioned later, in the ordered series, than any index that has previously been selected as an index of a preliminary index group, and selecting of the preliminary index group is such that:
- a lowest index of the preliminary index group is the index of the preliminary index group that has a lowest leaflet-flexibility value of the indices of the preliminary index group, and a highest index of the preliminary index group is the index of the preliminary index group that has a highest leaflet-flexibility value of the indices of the preliminary index group,
- the preliminary index group includes a number of successive indices equal to the group size, and
- the lowest index of the preliminary index group is the lowest remaining index;
- (b) determining if the leaflet-flexibility value of each index of the preliminary index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index of the preliminary index group;
- (c) counting a number of remaining indices;
- (d) responsively to the step of the determining, and to the step of the counting, selectively selecting an index group from a cluster of indices, the cluster of indices including the preliminary index group and a predetermined number of successive indices, the lowest index of the preliminary index group is the lowest index of the cluster, and selectively selecting the index group from the cluster of indices includes:
- if the flexibility value of each index of the preliminary index group is determined to be within the intra-group tolerance with respect to the leaflet-flexibility value of each other index of the preliminary index group, iteratively:
- (1) selecting, from the indices of the cluster, an index group that (i) has not previously been selected from the indices of the cluster, and (ii) has a group-differential that is no greater than the group-differential of any other index group that has not previously been selected from the cluster, a group-differential being a value that represents a difference between the leaflet-flexibility values of the indices of the index group,
- (2) determining whether designating the selected index group would reduce a total number of within-tolerance index groups that may be attained from the indices, compared to the maximum number;
- (3) in response to the determining whether designating the selected index group would reduce the total number of within-tolerance index groups attainable from the indices, selectively designating the selected index group, selectively designating the selected index group including:
- if designating the selected index group is determined to not reduce the total number of within-tolerance index groups attainable from the indices, designating the selected index group, and
- if designating the selected index group is determined to reduce the total number of within-tolerance index groups attainable from the indices, not designating the selected index group,
- until the selected index group of a given iteration of step (d) is designated, and
- if the flexibility value of each index of the preliminary index group is determined to not be within the intra-group tolerance with respect to the leaflet-flexibility value of each other index of the preliminary index group, repeating steps a-d;
- if the flexibility value of each index of the preliminary index group is determined to be within the intra-group tolerance with respect to the leaflet-flexibility value of each other index of the preliminary index group, iteratively:
- (a) selecting a preliminary index group from among remaining indices, a remaining index being defined as an index that is positioned later, in the ordered series, than any index that has previously been selected as an index of a preliminary index group, and selecting of the preliminary index group is such that:
until the counted number of remaining indices is less than the group size value.
In an application, determining whether designating the selected index group would reduce the total number of within-tolerance index groups that may be attained from the indices, compared to the maximum number, includes:
calculating a number of within-tolerance index groups that may be attained from the indices, should the selected index group be designated, by:
-
- (a) selecting a first potential index group from among successive indices, such that:
- the first potential index group includes a number of indices equal to the group size, and
- the lowest index of the first potential index group is the lowest remaining index;
- with regard to the first potential index group:
- (b) calculating the group-differential, the group-differential being a difference between (i) the leaflet-flexibility value of the highest index, and (ii) the leaflet-flexibility value of the lowest index;
- (c) determining whether the group-differential is greater than, or no greater than, the intra-group tolerance, and responsively:
- (d) if the group-differential is no greater than the intra-group tolerance, counting the potential index group as a within-tolerance index group that may be attained from the indices, and
- (e) if the group-differential is greater than the intra-group tolerance, not counting the potential index group as a within-tolerance index group that may be attained from the indices;
- (f) responsively to the counting the number of successive remaining indices, iteratively:
- selectively selecting a successive potential index group including a remaining index, such that:
- the successive potential index group includes a number of indices equal to the group size, and
- the lowest index of the successive potential index group is the lowest remaining index,
- selectively selecting the successive potential index group including:
- if a preceding potential index group is counted as a within-tolerance index group that may be attained from the indices should the best-matching index group be designated, and the number of successive remaining indices is at least equal to the group size value:
- selecting the successive potential index group, the lowest index of the successive potential index group immediately succeeding the highest index of the preceding potential index group, and
- repeating, with respect to the successive potential index group, steps b-e,
- if the preceding potential index group is not counted as a within-tolerance index group that may be attained from the indices, should the best-matching index group be designated, and the number of successive remaining indices is at least equal to the group size value:
- selecting the successive potential index group, the lowest index of the successive potential index group immediately succeeding the lowest index of the preceding potential index group, and
- repeating, with respect to the successive potential index group, steps b-e,
- if a preceding potential index group is counted as a within-tolerance index group that may be attained from the indices should the best-matching index group be designated, and the number of successive remaining indices is at least equal to the group size value:
- until the number of successive remaining indices is less than the group size value;
- selectively selecting a successive potential index group including a remaining index, such that:
- comparing the number of within-tolerance index groups that may be attained from the indices, should the best-matching index group be designated, to the maximum number of within-tolerance groups; and
- responsively to the step of comparing:
- if the number of within-tolerance index groups that may be attained from the indices, should the best-matching index group be designated, is no less than the maximum number of within-tolerance groups, determining that the selected index group would not reduce the total number of within-tolerance index groups attainable from the indices, and
- if the number of within-tolerance index groups that may be attained from the indices, should the best-matching index group be designated, is less than the maximum number of within-tolerance groups, determining that the selected index group would reduce the total number of within-tolerance index groups attainable from the indices.
- (a) selecting a first potential index group from among successive indices, such that:
In an application, identifying the best-matching index group from the cluster of indices includes:
calculating, for each index group including a number of indices equal to the group size value, attainable from the cluster of indices, a parameter;
identifying the one index group of the index groups having a lowest parameter value as the best-matching index group.
In an application, calculating, for each index group, the parameter, includes calculating, for each index group, a group-differential, the group-differential being a difference between (i) the leaflet-flexibility value of the highest index of the potential index group, and (ii) the leaflet-flexibility value of the lowest index of the potential index group.
In an application, calculating, for each index group, the parameter, includes calculating, for each index group, an average differential value by averaging differences between leaflet-flexibility values assigned to each pair of indices including that index group.
In an application, calculating, for each index group, the parameter, includes calculating, for each index group, a sum of a square of a difference between leaflet-flexibility values assigned to respective pairs of indices of each of a plurality of pairs of indices including the index group.
There is further provided, in accordance with an application of the present invention, a system for use with a plurality of prosthetic heart valve leaflets, the system including:
a storage array, the storage array including:
-
- a plurality of cells, each cell configured to contain exactly one of the leaflets; and
- a plurality of indicators, each of the indicators associated with a corresponding one of the cells; and
circuitry, in communication with the plurality of indicators, and configured to:
-
- receive a group size value,
- using one or more leaflet-flexibility values that each corresponds to a respective one of the leaflets, designate at least some of the leaflets into leaflet groups, each of the leaflet groups including a number of leaflets equal to the group size value, and
- for each of the leaflet groups, drive the indicators to indicate which of the cells contain leaflets designated the leaflet group.
In an application, the circuitry is configured to, for each respective one of the leaflets:
receive a digital image,
by digitally analyzing the digital image, calculate an image parameter for the leaflet, and
from the image parameter, derive the one or more leaflet-flexibility values that corresponds to the leaflet.
In an application, the apparatus includes an image sensor in communication with the circuitry, the image sensor configured to acquire, for each respective one of the leaflets, the digital image, and to communicate the digital image to the circuitry.
In an application, the plurality of indicators include a user-interface, the user-interface configured to facilitate switching from indicating which of the cells contain leaflets designated to a first leaflet group, to indicating which of the cells contain leaflets designated to a second leaflet group.
In an application, each cell is fillable with a sterile liquid.
In an application, the plurality of indicators include a user-interface, the user-interface configured to facilitate switching from indicating the designation of at least some of the leaflets into a first leaflet group, to indicating the designation of at least some of the leaflets into a second leaflet group.
In an application, the plurality of indicators includes a respective indicator for each cell, each respective indicator an integral component of the storage array.
In an application:
the plurality of indicators include a respective indicator for each cell,
each indicator is configured to provide a respective visual cue, with respect to each leaflet, and
the storage array is configured to be juxtaposed with the plurality of indicators, and the storage array is at least partially transparent, such that the visual cue indicated by each indicator, with respect to each leaflet, is visible through the storage array.
In an application, each cell is labelled with a unique identifier, each unique identifier corresponding to:
a given batch of leaflets, and
a given leaflet of that batch.
In an application, the storage array includes a plurality of zones, each zone:
corresponding to a given batch of leaflets, and
including a number of cells equal to a number of leaflets including that batch.
In an application, the storage array is configured to be placed on the plurality of indicators, such that the visual cue provided by each indicator, with respect to each leaflet, is visible through a floor of the storage array.
In an application, the plurality of indicators and the storage array are complimentarily dimensioned in a manner that facilitates integration of the storage array with the plurality of indicators, such that the visual cue provided by each indicator, with respect to each leaflet, is visible through the cell containing that respective leaflet.
There is further provided, in accordance with an application of the present invention, a method for sorting leaflets for use in prosthetic heart valves, the method including:
positioning, opposite an image sensor, each leaflet of a first batch of multiple leaflets;
subsequently, initiating acquisition, by the image sensor, of a first digital image that includes all of the leaflets of the first batch;
subsequently, positioning, opposite the image sensor, each leaflet of a second batch of multiple leaflets;
subsequently, initiating acquisition, by the image sensor, of a second digital image that includes all of the leaflets of the second batch;
for each leaflet of the first batch and each leaflet of the second batch:
-
- obtaining a leaflet-flexibility value for the leaflet, the leaflet-flexibility value being derived by digital analysis of the first digital image or the second digital image;
- assigning the leaflet to a leaflet-flexibility category such that the leaflet-flexibility value of the leaflet fits within a range defined between an upper flexibility-value threshold of the leaflet-flexibility category, and a lower flexibility-value threshold of the leaflet-flexibility category, the leaflet-flexibility category being one of multiple leaflet-flexibility categories;
- placing the leaflet into a storage unit according to the leaflet-flexibility category of the leaflet, in a manner that facilitates:
- separation of the leaflet from leaflets assigned to other leaflet-flexibility categories, and
- maintenance of one or more attributes selected from the group consisting of:
- moisture content of the leaflet, and
- sterility of the leaflet.
In an application, the method includes:
selecting, from the storage unit, a group of leaflets including a number of leaflets equal to the number of leaflets required for a prosthetic heart valve, each leaflet of the group having been assigned to the same leaflet-flexibility category; and
sewing the group of leaflets into the prosthetic heart valve.
In an application, the method includes:
selecting, from the storage unit, a first categorized batch of multiple categorized leaflets, each categorized leaflet of the first categorized batch having been assigned to the same leaflet-flexibility category as the other categorized leaflets of the first categorized batch;
positioning each categorized leaflet of the first categorized batch opposite the image sensor;
subsequently, initiating acquisition, by the image sensor, of a third digital image that includes all of the categorized leaflets of the first categorized batch;
subsequently, removing each categorized leaflet of the first categorized batch to a storage array in a manner that facilitates tracking of an individual identity of each categorized leaflet of the first categorized batch;
subsequently selecting, from the storage unit, a second categorized batch of multiple categorized leaflets, each categorized leaflet of the second categorized batch being assigned to the same leaflet-flexibility category as the categorized leaflets of the first categorized batch;
positioning each categorized leaflet of the second categorized batch of categorized leaflets opposite the image sensor;
subsequently, initiating acquisition, by the image sensor, of a fourth digital image that includes all of the categorized leaflets of the second categorized batch;
subsequently, removing the categorized leaflets of the second categorized batch to the storage array in a manner that facilitates tracking of the individual identity of each categorized leaflet of the second categorized batch, thereby assembling the categorized leaflets of the first categorized batch and the categorized leaflets of the second categorized batch into an aggregate of categorized leaflets;
subsequently, operating software to:
-
- receive the third digital image and the fourth digital image,
- by digitally analyzing the third digital image and the fourth digital image, for each of the categorized leaflets included in the third digital image and the fourth digital image:
- calculate an image parameter for the categorized leaflet, and
- from the image parameter, derive a leaflet-flexibility value for the categorized leaflet,
- receive a group size value,
- designate at least some of the categorized leaflets of the aggregate of categorized leaflets into one or more designated leaflet groups:
- based on similarity between the respective leaflet-flexibility values of each of the categorized leaflets of the aggregate, and
- such that each of the designated leaflet groups includes a number of categorized leaflets equal to the group size value, and
- output an indication of the one or more designated leaflet groups; and
in response to the indication, grouping the at least some categorized leaflets of the aggregate of categorized leaflets into the one or more designated leaflet groups.
In an application:
positioning each leaflet of a first batch of leaflets opposite an image sensor;
subsequently, initiating acquisition, by the image sensor, of a first digital image that includes all of the leaflets of the first batch;
subsequently, removing each leaflet of the first batch to a storage array in a manner that facilitates tracking of an individual identity of each leaflet of the first batch;
positioning each leaflet of a second batch of leaflets opposite the image sensor;
subsequently, initiating acquisition, by the image sensor, of a second digital image that includes all of the leaflets of the second batch;
subsequently, removing the leaflets of the second batch to the storage array in a manner that facilitates tracking of the individual identity of each leaflet of the second batch, thereby assembling the leaflets of the first batch and the leaflets of the second batch into an aggregate of leaflets;
subsequently, operating software to:
-
- receive the first digital image and the second digital image,
- by digitally analyzing the first digital image and the second digital image, for each of the leaflets included in the first digital image and the second digital image:
- calculate an image parameter for the leaflet, and
- from the image parameter, derive a leaflet-flexibility value for the leaflet, receive a group size value,
- designate at least some of the leaflets of the aggregate of leaflets into one or more designated leaflet groups:
- based on similarity between the respective leaflet-flexibility values of each of the leaflets of the aggregate, and
- such that each of the leaflet groups includes a number of leaflets equal to the group size value, and
- output an indication of the one or more designated leaflet groups; and
in response to the indication, grouping the at least some leaflets of the aggregate of leaflets into the one or more designated leaflet groups.
In an application, the method includes, subsequently to grouping the at least some leaflets of the aggregate of leaflets into the one or more designated leaflet groups, sewing the leaflets of each designated leaflet group into a respective prosthetic heart valve.
In an application, the method includes, prior to positioning each leaflet of the first batch of leaflets opposite the image sensor:
classifying leaflets of a stock of leaflets, according to thickness, into thickness classes; and
selecting the first batch of leaflets and the second batch of leaflets from a single one of the thickness classes.
In an application, the method includes, prior to positioning each leaflet of the first batch of leaflets opposite the image sensor:
assigning leaflets of a stock of leaflets, according to the leaflet-flexibility value of each respective leaflet, to leaflet-flexibility categories; and
selecting the first batch of leaflets and the second batch of leaflets from a single one of the leaflet-flexibility categories.
In an application:
operating the software to designate the at least some of the leaflets of the aggregate of leaflets into one or more designated leaflet groups, based on similarity between the respective leaflet-flexibility values of each of the leaflets of the aggregate, includes operating the software to designate the at least some of the leaflets of the aggregate of leaflets into one or more designated leaflet groups, based on an intra-group tolerance that represents a maximum allowable difference between leaflet-flexibility values of indices of a leaflet group; and
operating the software includes operating the software to, prior to outputting the indication of the one or more designated leaflet groups, display a preview relating to the one or more designated leaflet groups, and
the method includes, prior to grouping the at least some leaflets of the aggregate of leaflets into the one or more designated leaflet groups, adjusting the intra-group tolerance responsively to the preview relating to the one or more designated leaflet groups.
In an application:
operating the software to display the preview relating to the one or more designated leaflet groups includes operating the software to display the preview relating to a yield of preliminary leaflet groups; and
adjusting the intra-group tolerance responsively to the preview relating to the designated leaflet groups includes adjusting the intra-group tolerance responsively to the preview relating to the yield of the preliminary leaflet groups.
In an application:
operating the software to display the preview relating to the one or more designated leaflet groups includes operating the software to display the preview relating to a closeness of fit of preliminary leaflet groups; and
adjusting the intra-group tolerance responsively to the preview relating to the designated leaflet groups includes adjusting the intra-group tolerance responsively to the preview relating to the closeness of fit of the preliminary leaflet groups.
In an application, assembling the leaflets of the first batch and the leaflets of the second batch into the aggregate of leaflets includes temporarily storing each leaflet of the aggregate in the storage array in a manner that facilitates maintenance of one or more attributes selected from the group consisting of: moisture content of the leaflets, and sterility of each leaflet.
In an application, the method includes operating the software to indicate, on at least one indicator, a respective portion of the storage array in which each leaflet of the aggregate is to be temporarily stored; and
temporarily storing each leaflet of the aggregate in the storage array includes temporarily storing the leaflet in the respective portion of the storage array.
In an application:
the storage array includes a plurality of storage cells,
operating the software to indicate, on at least one indicator, the respective portion of the storage array in which each leaflet of the aggregate is to be temporarily stored includes operating the software to indicate a respective storage cell of the plurality of storage cells in which each leaflet of the aggregate is to be temporarily stored; and
temporarily storing each leaflet of the aggregate in the respective portion of the storage array includes temporarily storing each leaflet of the aggregate in the respective storage cell.
In an application, assembling the leaflets of the first batch and the leaflets of the second batch into the aggregate of leaflets includes assembling more than forty leaflets and fewer than four hundred leaflets into the aggregate of leaflets.
In an application, assembling the leaflets of the first batch and the leaflets of the second batch into the aggregate of leaflets includes assembling more than forty leaflets and fewer than one hundred leaflets into the aggregate of leaflets.
In an application, assembling the leaflets of the first batch and the leaflets of the second batch into the aggregate of leaflets includes assembling eighty-one leaflets into the aggregate of leaflets.
In an application, operating software to output the indication of the one or more designated leaflet groups includes operating software to output the indication of the one or more designated leaflet groups on at least one indicator.
In an application, operating software to output the indication of the one or more designated leaflet groups on at least one indicator includes operating software to switch between indicating leaflets designated to a first of the designated leaflet groups, and indicating leaflets designated to a second of the leaflet groups.
In an application, operating software to output the indication of the one or more designated leaflet groups on at least one indicator, includes using a respective indicator for each leaflet of the aggregate of leaflets, operating software to output the indication of the designated leaflet group to which each leaflet of the aggregate of leaflets is designated.
In an application, using the respective indicator for each leaflet of the aggregate of leaflets, operating software to output the indication of the designated leaflet group to which each leaflet of the aggregate of leaflets is designated includes using the respective indicator for each leaflet of the aggregate of leaflets, providing a visual cue indicating the respective designated leaflet group to which each leaflet of the aggregate of leaflets is designated.
In an application, grouping the at least some leaflets of the aggregate of leaflets into the one or more designated leaflet groups, includes grouping the at least some leaflets of the aggregate of leaflets, from the storage array, into the one or more designated leaflet groups, responsively to the indication of the designated leaflet group to which each leaflet of the aggregate of leaflets is designated.
In an application:
positioning each leaflet of the first batch of leaflets opposite the image sensor includes draping each leaflet of the first batch of leaflets over a respective bar of a plurality of bars, opposite the image sensor; and
positioning each leaflet of the second batch of leaflets opposite the image sensor includes draping each leaflet of the second batch of leaflets over a respective bar of the plurality of bars, opposite the image sensor.
In an application:
draping each leaflet of the
batch of leaflets over the respective bar of the plurality of bars includes draping each leaflet of the first batch of leaflets, in a first orientation, over the respective bar of the plurality of bars;
draping each leaflet of the second batch of leaflets over a respective bar of the plurality of bars includes draping each leaflet of the second batch of leaflets, in the first orientation, over the respective bar of the plurality of bars;
operating the software to receive the first digital image and the second digital image includes operating the software to receive a first first-orientation digital image of the first batch of leaflets, in the first orientation, over the respective bar of the plurality of bars and a second first-orientation digital image of the second batch of leaflets, in the first orientation, over the respective bar of the plurality of bars;
operating the software to calculate an image parameter for each leaflet, by digitally analyzing the first digital image and the second digital image, includes operating the software to calculate a first-orientation image parameter for each leaflet by digitally analyzing the first first-orientation digital image and the second first-orientation digital image;
operating the software to derive a leaflet-flexibility value for each leaflet, from the image parameter, includes operating the software to derive a first-orientation leaflet-flexibility value for each leaflet, from the first-orientation image parameter; and
the method includes, subsequently to grouping the at least some leaflets of the aggregate of leaflets into the leaflet groups, validating the leaflets, by:
-
- draping each leaflet of the at least some leaflets, in a second orientation that is inverted with respect to the first orientation, over a respective bar of the plurality of bars;
- operating the software to:
- receive a second-orientation digital image of the at least some leaflets draped, in the second orientation, over the respective bars;
- calculate a second-orientation image parameter for each leaflet of the at least some leaflets by digitally analyzing the second-orientation digital image;
- derive a second-orientation leaflet-flexibility value for each leaflet of the at least some leaflets, from the second-orientation image parameter;
- comparing, for each leaflet of the at least some leaflets, the first-orientation leaflet-flexibility value and the second-orientation leaflet-flexibility value;
- responsively to the comparing, selectively counting a given leaflet of the at least some leaflets as a validated leaflet, the selectively counting including:
- if, for the given leaflet, a difference between the first-orientation leaflet-flexibility value and the second-orientation leaflet-flexibility value is below a predetermined threshold, counting the leaflet as a validated leaflet, and
- if, regarding the given leaflet, the difference between the first-orientation leaflet-flexibility value and the second-orientation leaflet-flexibility value exceeds the predetermined threshold, discarding the leaflet.
In an application:
draping each leaflet of the first batch of leaflets, in the first orientation, over the respective bar of the plurality of bars, includes draping each leaflet of the first batch of leaflets over the respective bar of the plurality of bars with a rough side of the leaflet face-up;
draping each leaflet of the second batch of leaflets, in the first orientation, over the respective bar of the plurality of bars, includes draping each leaflet of the second batch of leaflets over the respective bar of the plurality of bars with the rough side of the leaflet face-up; and
draping each leaflet of the at least some leaflets, in the second orientation that is inverted with respect to the first orientation, over the respective bar of the plurality of bars, includes draping each leaflet of the at least some leaflets over the respective bar of the plurality of bars with a smooth side of the leaflet face-up.
There is further provided, in accordance with an application of the present invention, a method for grouping prosthetic valve leaflets of an aggregate of prosthetic valve leaflets including a first batch of prosthetic valve leaflets and a second batch of prosthetic valve leaflets, the method including:
acquiring a first digital image that includes all of the leaflets of the first batch;
acquiring a second digital image that includes all of the leaflets of the second batch;
calculating an image parameter for each leaflet of the aggregate by digitally analyzing the first digital image and the second digital image;
in response to the image parameter, deriving, for each leaflet of the aggregate, a leaflet-flexibility value;
receiving a group size value;
designating at least some of the leaflets of the aggregate into leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, and (ii) such that each of the leaflet groups includes a number of leaflets equal to the group size value; and
outputting an indication of the designated leaflet groups.
There is further provided, in accordance with an application of the present invention, an apparatus for grouping prosthetic valve leaflets of an aggregate of prosthetic valve leaflets, the apparatus including a computer processor configured to:
receive a plurality of leaflet-flexibility values, each of the leaflet-flexibility values corresponding to a respective leaflet of the aggregate;
receive a group size value;
assign a respective index to each of the leaflet-flexibility values, each index representing a respective one of the leaflets and having the leaflet-flexibility value of the respective one of the leaflets;
receive an intra-group tolerance, the intra-group tolerance representing a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group;
subsequently, determine a maximum number of within-tolerance index groups attainable from the indices, a within-tolerance index group being an index group (i) that includes a number of indices that is equal to the group size value, and (ii) for which the flexibility value of each index in the index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the index group; and
subsequently, store the maximum number,
designate at least some of the leaflets of the aggregate into designated leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, (ii) such that:
-
- each of the designated leaflet groups includes a number of leaflets equal to the group size value, and
- the flexibility value of each index in a given designated index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the designated index group; and output an indication of the designated leaflet groups.
There is further provided, in accordance with an application of the present invention, a computer software product including a non-transitory computer-readable medium in which program instructions are stored, which instructions, when read by a computer cause the computer to:
receive a plurality of leaflet-flexibility values, each leaflet-flexibility value corresponding to a respective leaflet of the aggregate;
receive a group size value;
assign a respective index to each of the leaflet-flexibility values, each index representing a respective one of the leaflets and having the leaflet-flexibility value of the respective one of the leaflets;
receive an intra-group tolerance, the intra-group tolerance representing a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group;
subsequently, determine a maximum number of within-tolerance index groups attainable from the indices, a within-tolerance index group being an index group (i) that includes a number of indices that is equal to the group size value, and (ii) for which the flexibility value of each index in the index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the index group; and
subsequently, store the maximum number,
designate at least some of the leaflets of the aggregate into designated leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, (ii) such that:
-
- each of the designated leaflet groups includes a number of leaflets equal to the group size value, and
- the flexibility value of each index in a given designated index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the designated index group; and output an indication of the designated leaflet groups.
The present invention will be more fully understood from the following detailed description of applications thereof, taken together with the drawings, in which:
Reference is made to
Tester 20 comprises a plurality of horizontal bars 22 movably coupled to a vertical mount 24, in accordance with some applications of the invention. Typically, and as shown, each bar 22 extends away from mount 24 (e.g., perpendicularly from the mount) along a respective bar-axis D26, each bar-axis lying on a respective vertical bar-plane D28.
Tester 20 has a first state (
As shown in
Tester 20 further comprises an image sensor 32, the image sensor positioned opposite mount 24, facing bars 22 and the mount. Orientation of image sensor 32 facing mount 24 and bars 22 facilitates the image sensor acquiring an image that includes leaflets 30 (e.g., all of the leaflets) draped over bars 22. Typically, and as shown, tester 20 further comprises a sensor-bracket 34, the sensor-bracket movably coupling image sensor 32 to the rest of tester 20 (e.g., to mount 24). Typically, sensor-bracket facilitates movement of image sensor 32 along a sensor-axis D38, moving the image sensor toward and away from mount 24. Sensor-bracket 34 typically facilitates movement of image sensor 32 (e.g., along sensor-axis D38) between (i) a position in which the image sensor can acquire an image that includes all of leaflets 30, and (ii) a position in which tester 20 is more compact—e.g., for when the tester is not in use. Typically, tester 20 is operated such that sensor 32 acquires an image that includes the multiple leaflets draped over bars 22. It is hypothesized by the inventors that acquiring and processing an image that includes multiple leaflets increases work throughput and/or improves accuracy of leaflet flexibility testing.
Typically, and as shown, mount 24 is generally flat, and bars 22 are generally parallel with each other. For some applications, mount 24 may be concave toward sensor 32, and bar-tips are arranged correspondingly to the concave surface of the mount, e.g., pointing toward the sensor. It is hypothesized by the inventors that, for some applications, mount 24 being concave may facilitate visualization of all leaflets 30 and bar-tips 68, from a single point of view—i.e., by sensor 32.
Some embodiments of the invention may comprise a plurality of image sensors 32. For example, the number of image sensors 32 may correspond to the number of bars 22.
Reference is made to
Although the Figures referred to herein depict an embodiment of tester 20 with bars 22 arranged in three rows 58 and three columns 60, this depiction is not intended to exclude other possible arrangements with either a smaller or greater number of rows 58 or columns 60 of bars 22. For some applications, and as shown, nine bars 22 may be arranged in rows 58 and columns 60 such that image sensor 32 may acquire an image including nine leaflets 30 tested simultaneously in a batch, each leaflet draped over a respective bar.
For other applications, a greater or lesser number of bars 22 may be arranged with respect to mount 24 of tester 20, facilitating increasing or decreasing the number of leaflets 30 tested simultaneously in the batch, mutatis mutandis. For some applications, the number of bars 22 (i.e. a maximum batch size) is a multiple of 3, e.g., such that all of the leaflets being tested in a single batch may be designated to leaflet groups of 3 matching leaflets, each group being used in a respective tri-leaflet prosthetic valve.
Typically, and as shown, platform 48 has an upper surface 50, the upper surface including a guide 52 that defines a guide-outline 54 corresponding to a leaflet-outline 56 of leaflet 30. In some applications, upper surface 50 at guide 52 may comprise a low-friction material. For example, the low-friction material may comprise polytetrafluoroethylene (e.g., Teflon™). Alternatively or additionally, the texture of upper surface 50 may be modified at guide 52. For example, the texture of upper surface 50 may be made to be more smooth (e.g., polished) at guide 52. The use of low-friction material and/or texture for upper surface 50 of guide 52 is hypothesized by the inventors to facilitate release of leaflet 30 from the surface as bar 22 lifts the leaflet away from the surface, thereby facilitating use of tester 20.
Reference is further made to
For some applications, leaflets 30 are non-isotropically flexible. For example, a leaflet may have a first flexibility when draped over bar 22 with a first side of the leaflet facing up, and a different flexibility when draped over the bar with the opposite side of the leaflet facing up. For such applications, leaflets 30 are typically draped over bars 22 such that they bend in the orientation in which they will bend when in use. Typically, the side of the leaflet that faces up on tester 20 is the side of the leaflet that will face upstream in the functioning prosthetic valve.
For example, leaflets 30 may comprise pericardium that has distinct sides (e.g., a rough side (e.g., a fibrous side) and a smooth side (e.g., a parietal side)). For such applications, the rough side typically faces upstream in the functioning prosthetic valve. Therefore, for such applications, it may be desirable to orient leaflets 30 upon respective guides 52 with the rough side facing upwards, such that, upon actuation of actuator, each leaflet will drape over respective bar 22 with the rough side facing upwards.
Alternatively, it may be desirable to orient leaflets 30 upon respective guides 52 with the smooth side facing upwards, such that, upon actuation of actuator, each leaflet will drape over respective bar 22 with the smooth side facing upwards. It is hypothesized by the inventors that uniform orientation of leaflets 30 upon guide 52 may increase the relevance of leaflet flexibility testing to the performance of the leaflets in the prosthetic valve.
Typically, platform 48 is disposed with respect to bar 22 such that bar-plane D28 bisects guide-outline 54 (
For some applications, mount 24 may have a strong color. For some applications, bar-tip 68 may have a second strong color. For some applications, platform 48 may have a third strong color. For example, a platform face 36 of platform 48 may have the third strong color. It is to be noted that the term “strong color” (including the specification and the claims) relates to color saturation. For example, primary colors may serve as the strong colors. The use of respective strong colors for mount 24, bar-tip 68 and/or platform face 36 is hypothesized to facilitate analysis of the image by facilitating distinction between these components and leaflet 30, and between these components and each other.
Reference is made to
As described hereinabove, image sensor 32 acquires an image that includes the plurality of leaflets 30 draped over their respective bars.
In some applications (e.g., those shown in
For some applications, circuitry 40 is not mounted on tester 20. For such embodiments, tester 20 may include an image output device (e.g., a port or wireless transceiver) 64 (
For some applications, and as described in more detail hereinbelow, circuitry 40 is further configured to assign a category to each of the leaflets, in response to the leaflet-flexibility value. Typically, and as shown in
For some applications, circuitry 40 is pre-programmed with a calibration routine, such that all leaflets 30 included in the image acquired by sensor 32 are correctly analyzed, e.g., despite each leaflet being disposed at a different position with respect to the image sensor. For some applications, the calibration routine includes acquiring an image that includes one or more (e.g., all) bar-tips 68, and analyzing the image in order to determine a position of sensor 32 with respect to the plurality of bars. For some such applications, the calibration routine is performed automatically, e.g., using the same image that includes the plurality of leaflets, which will be analyzed by circuitry 40 to derive the respective leaflet-flexibility values, as described hereinbelow. Alternatively, the calibration routine may be done separately from (e.g., prior to) placing leaflets over bars 22 of tester 20.
For some applications, sensor-bracket 34 comprises an electronic actuator, with which circuitry 40 may interface in order to move image sensor 32 (e.g., along sensor-axis D38). For some such applications, this movement is used to facilitate the calibration routine. The calibration of image sensor 32 may adjust a field of view of image sensor 32 such that the image sensor acquires an image that includes all leaflets 30.
Reference is made to
As described hereinabove, bars 22 are configured to support leaflet 30 along bar-axis D26 such that the leaflet drapes over the bar. As shown, a first-leaflet-tip 70 is disposed below the bar on a first side 72 of the bar, and a second-leaflet-tip 74 is disposed below the bar on a second side 76 of the bar. For example, first-leaflet-tip 70 may be a lowest part of leaflet 30 on first side 72, and second-leaflet-tip 74 may be a lowest part of leaflet 30 on second side 76. In some applications, circuitry 40 is configured to identify, in the acquired image, first-leaflet-tip 70 and second-leaflet tip 74, and to derive the leaflet-flexibility value at least in part responsively to a first-leaflet-tip position D96 of first leaflet tip 70 and a second-leaflet-tip position D98 of second leaflet tip 74.
Image parameters that are calculated by circuitry 40 to derive leaflet-flexibility values may include one or more of the following:
(i) A direct distance D82 between first-leaflet-tip position D96 and second-leaflet-tip position D98. It is to be noted that the term “direct distance” (including the specification and the claims) means the length of a shortest line between two positions (e.g. D82 between D96 and D98, D84 between D96 and bar-tip 68, or D86 between D98 and bar-tip 68).
(ii) An Area Under the Curve (AUC) D80 defined by a leaflet draping-contour line 78 and an AUC closure line D102.
(iii) An axial height D88 or D90 along a vertical axis between (a) first-leaflet-tip position D96 and/or second-leaflet-tip position D98, respectively, and (b) bar-tip 68.
(iv) An axial distance D92 or D94 along a horizontal axis between (a) first-leaflet-tip position D96 or second-leaflet-tip position D98, respectively, and (b) bar-tip 68.
(v) An axial distance D95 along a horizontal axis between first-leaflet-tip position D96 and second-leaflet-tip position D98. While D95 may be equal to the sum of D92 and D94, D95 is nonetheless typically derived independently of D92 and D94, in that D95 is independent of identifying the location of bar-tip 68. In some cases (e.g. for symmetrically draping leaflets), D95 may be equal to direct distance D82 between respective leaflet-tips.
(vi) A length of the leaflet draping-contour line 78 (a) between bar-tip 68 and first-leaflet-tip position 96, and (b) between bar-tip 68 and second-leaflet-tip 98.
The use of a plurality of image parameters to derive leaflet-flexibility values is hypothesized by the inventors to more accurately reflect leaflet flexibility than may be derived from a single parameter. For example, a low AUC may alternatively indicate either a highly flexible or highly inflexible leaflet. The integration of AUC with direct distance D82 between first-leaflet-tip position D96 and second-leaflet-tip position D98 may aid in deriving a leaflet-flexibility value that more accurately reflects the leaflet's flexibility.
In some applications, leaflet-flexibility values may be used to facilitate sorting of the leaflets into categories of leaflet flexibility. For example, high-flexibility leaflet 30a may be assigned by tester 20 (e.g., circuitry 40 thereof) to a flexibility category “1”, moderate-flexibility leaflet 30b may be assigned to a flexibility category “2”, and low-flexibility leaflet 30c may be assigned to a flexibility category “3”—and the operator may sort the leaflets according to the assigned categories. As described hereinabove, the category for each leaflet is typically indicated by indicator 66, e.g., as shown in
Leaflets 30 may also be assigned to a “retest” category, or a “discard” category, e.g., as described hereinbelow. Typically, the process is a batch process, in which multiple leaflets are placed on tester 20, tested, and then sorted.
Leaflets that are assigned to the “retest” category may be resituated within the same or a different guide 52 for retesting (e.g., in the subsequent batch). Alternatively, leaflets 30 assigned to a “retest” category may be collected into a “retest” receptacle for subsequent retesting (e.g., in a dedicated retesting batch).
It is to be noted that, although leaflets 30 in
Circuitry 40 may be configured to categorize non-isotropically-flexible leaflets as described hereinabove, at least up to a threshold degree of asymmetric draping. For example, and as shown in
For some applications, circuitry 40 identifies non-isotropic flexibility of a leaflet 30 by calculating a difference between axial distance D92 and axial distance D94. Alternatively or additionally, circuitry 40 may identify non-isotropic flexibility of a leaflet 30 by calculating a difference between axial distance D88 axial distance D90. It is hypothesized by the inventors that a difference between D92 and D94, and/or a difference between D88 and D90, will be greater for non-isotropically-flexible leaflets than for isotropically-flexible leaflets, thereby facilitating identification of non-isotropically-flexible leaflets.
As described hereinabove, circuitry 40 may be configured to detect asymmetric draping. In that case, the asymmetric draping is asymmetric draping that is caused by, and is indicative of, non-isotropic flexibility of the leaflet. Circuitry 40 may also be configured to detect asymmetric draping that is caused by, and is indicative of, improper positioning of the leaflet being tested, e.g., caused by the operator improperly positioning the leaflet, and/or by slippage of the leaflet during elevation of the bar. In response to detection of such improper positioning, circuitry 40 typically assigns the leaflet to a “retest” category.
An exemplary reason for a leaflet to be assigned to the “retest” category is measurement error. In this context, the term “measurement error” is used to refer to situations in which image parameters and/or leaflet-flexibility values may not enable circuitry 40 to accurately assign leaflet 30 to a leaflet flexibility category. In such cases, indicator 66 may indicate a need to repeat the measurement and/or to adjust leaflet flexibility measurement conditions. For example,
For some applications, measurement error is identified in response to a difference between vertical axial distance d88 and vertical axial distance d90. For some applications, measurement error is identified in response to a difference between horizontal axial distance d92 and horizontal axial distance d94.
For some applications, circuitry 40 may detect instances of measurement error in response to a plurality of image parameters to, e.g., by cross-validation of image parameters. For example, circuitry 40 may compare a difference between D88 and D90, to a difference between D92 and D94. Alternatively or additionally, circuitry 40 may compare a difference between D88 and D92, to a difference between D90 and D94. In addition to one or both of these comparisons, circuitry 40 may also take into account direct distances D84 and D86. It is hypothesized by the inventors that the derivation of leaflet-flexibility values in response to more than one image parameter advantageously facilitates identifying measurement errors, e.g., distinguishing between (i) asymmetric draping caused by measurement error, and (ii) asymmetric draping caused by non-isotropic flexibility.
The use of a plurality of image parameters to derive leaflet-flexibility values is therefore hypothesized by the inventors to increase the validity and clinical utility of the flexibility categories to which leaflets 30 are assigned.
Reference is also made to
Typically, storage unit 110 facilitates storing leaflets 30 while maintaining: (i) moisture content of the leaflets, (ii) sterility of the leaflets, and/or (iii) separation of leaflets assigned to different leaflet-flexibility categories. In the example shown, storage unit 110 is divided into five chambers 108, of which chambers 108b, 108c, 108d are respectively dedicated to store leaflets assigned to one of the leaflet-flexibility categories described herein above (e.g. “3”, “2”, “1”). Chambers 108a and 108e are dedicated to leaflets assigned to discard categories “x” and “y”, respectively. Chamber 108f is dedicated to a “retest” category, which in this particular example is named “0”. Periodically, any leaflets present in chamber 108f may be retested, e.g., when a sufficient number of leaflets are present in the chamber.
Reference is also made to
Reference is also made to
Typically, and as shown, each leaflet flexibility category is defined by threshold leaflet-flexibility values, each threshold leaflet-flexibility value lying at a respective extreme of the category, such that each category includes leaflets with values spanning a range between the upper and lower thresholds of the category. In this way, each leaflet flexibility category spans a range of leaflet-flexibility values, each flexibility category having an upper flexibility-value threshold and a lower flexibility-value threshold. Thus, a given leaflet-flexibility value typically fits within the range defined by the upper flexibility-value threshold and the lower flexibility-value threshold of one of the leaflet-flexibility categories. For example,
For some applications, the same threshold may serve as an upper flexibility-value threshold for a first category, and as a lower flexibility-value threshold for a second category. For example, category “3” spans a range of leaflet-flexibility values between threshold D106 and threshold D112 ranging between 10 and 20, category “2” spans a range of leaflet-flexibility values between threshold D112 and threshold D118 ranging between 20 and 30, and category “1” spans a range of leaflet-flexibility values between threshold D118 and threshold D124 ranging between 30 and 40. In this way, threshold D112 serves as the upper leaflet-flexibility value of category “3”, and serves as the lower leaflet-flexibility value of category “2”. Similarly, threshold D118 serves as the upper leaflet-flexibility value of category “2”, and serves as the lower leaflet-flexibility value of category “1”.
It is to be noted that the leaflet-flexibility values and leaflet-flexibility category thresholds shown in
In
It is hypothesized by the inventors that assigning leaflets 30 to flexibility categories may enable efficient sorting of leaflets by their leaflet-flexibility values. However, for some applications, sorting leaflets purely by such a categorization technique may result in leaflets that do not necessarily have the most similar leaflet-flexibility values, being sorted into the same category. For instance,
For some applications, flexibility-value thresholds (e.g. the upper flexibility-value threshold and/or the lower flexibility-value threshold) may be adjusted responsively to leaflet-flexibility values of a plurality of leaflets. For example, the flexibility-value thresholds may be adjusted by circuitry 40 (e.g., automatically) before the leaflet-flexibility category of each leaflet is indicated. Alternatively, the flexibility-value thresholds may be manually adjusted by the operator. It is hypothesized by the inventors that adjusting flexibility-value thresholds may increase the likelihood of assigning leaflets 30 of similar flexibility to each respective leaflet flexibility category.
For some applications, circuitry 40 is configured to refer certain leaflets 30 for manual assignment (e.g., by a human specialist) to flexibility categories. For some applications, circuitry 40 may designate leaflets 30 with leaflet-flexibility values that are particularly close to the threshold values, to transition categories. For example, circuitry 40 may be configured such that each threshold has a margin, and leaflets whose leaflet-flexibility values fall within a margin of a threshold are assigned to a transition category.
For some applications, and as shown, circuitry 40 is not configured with a lower margin for threshold D106 and/or an upper margin of threshold D124. For some such applications, leaflets whose leaflet-flexibility value falls below threshold D106 or above threshold D124 are referred to a person in order to be manually assessed (e.g., to be manually assigned to a flexibility category). For some such applications, such leaflets are automatically assigned to the corresponding “discard” category “x” or “y”, e.g., to increase efficiency by reducing the likelihood of an unsuitable leaflet being referred to a specialist for manual categorization. For some such applications, leaflets whose leaflet-flexibility value falls below threshold D106 are referred to a person in order to be manually assessed, whereas leaflets whose leaflet-flexibility value falls above threshold D124 are automatically assigned to the corresponding “discard” category. For some such applications, leaflets whose leaflet-flexibility value falls above threshold D124 are referred to a person in order to be manually assessed, whereas leaflets whose leaflet-flexibility value falls below threshold D106 are automatically assigned to the corresponding “discard” category.
Alternatively, circuitry 40 is configured with a lower margin for threshold D106 and/or an upper margin of threshold D124, e.g., similarly to the margins of the other thresholds.
For some applications, tester 20 may simply indicate that a particular leaflet requires manual categorization. For some applications, tester 20 may facilitate manual categorization by indicating the categories between which the leaflet's leaflet-flexibility value falls. For example, indicator 66 of tester 20 may display “2-3” for a leaflet whose leaflet-flexibility value falls within margin 152 of the lower threshold of category 2 or within margin 154 of the upper threshold of category 3.
For some applications, transition category leaflets may be designated to be tested a second time. It is hypothesized by the inventors that: 1) manual assignment of transition category leaflets to flexibility categories, and/or 2) retesting of transition category leaflets, may increase the validity and clinical utility of leaflet flexibility categories to which leaflets 30 are assigned.
For some applications, leaflets may be designated to leaflet groups by circuitry 40 and/or by operator according to similarity of leaflet-flexibility values, e.g., without the use of flexibility categories. Leaflets 30 of the same group may then be included together in an individual prosthetic heart valve. Circuitry 40 may therefore group leaflets 30 into leaflet groups of a desirable size (e.g., leaflet groups of two leaflets for a bileaflet valve, or leaflet groups of three leaflets for a trileaflet valve). For example, in
That is, for some applications of the invention, tester 20 (e.g., circuitry 40 thereof) is configured to designate leaflets 30 (e.g., all of the leaflets that are on tester 20) into leaflet groups, based on similarity between (i) the leaflet-flexibility value of each leaflet of the plurality of leaflets, and (ii) the leaflet-flexibility value of other leaflets of the plurality of leaflets, each of the leaflet groups including a predetermined number of leaflets. For some such applications, the predetermined number of leaflets is received (e.g. as an input from the operator), using circuitry 40.
Oval 168 indicates a group of three leaflets (138, 140 and 142), which would all have been assigned to the same category (category 1) had the categorization technique had been used (e.g., as shown in
In contrast, oval 166 indicates a group of three leaflets (130, 132 and 134), in which two of the leaflets (132 and 134) would have been assigned to one category (category 2), and one of the leaflets (130) would have been assigned to a different category (category 3), had the categorization technique been used (e.g., as shown in
Reference is made to
Typically, the array is labelled to provide each of its cells with a unique identifier. Array 104 of
Array 104 has rows 112 of cells 106 labelled with letters, typically corresponding to different batches of tested leaflets 30. (A first row 112a and a second row 112b are labelled.) Within each row, cells 1-9 correspond to the nine individual leaflets 30 of the particular batch, the number signifying the bar over which each leaflet was draped during testing (e.g., according to labels 18 in
The example labelling regime of array 204 is such that each batch of leaflets is stored in a zone 214 having a number of cells 206 equal to a number of leaflets in the batch. (A first zone 214a and a second zone 214b are labelled.) Each cell of a given zone is labelled with (i) a letter that corresponds to a batch of leaflets, and (ii) a number that corresponds to the individual leaflets of that batch—e.g., signifying the bar over which each leaflet was draped during testing (e.g., according to labels 18 in
It is to be noted that the scope of the invention is not limited to alphanumerical characters, but also includes alternate methods of tracking individual identities of leaflets 30 (e.g. non-alphanumerical characters, symbols, color-coding, etc.).
For some applications, each cell 106 or 206 may be fillable with a sterile liquid (e.g. isotonic saline 16). It is hypothesized by the inventors that storage of leaflets 30 (e.g. an aggregate comprising multiple batches of tested leaflets 30) within respective storage cells 106, 206 of array 104, 204, facilitates maintenance of moisture content of the leaflets and/or sterility of the leaflets.
After multiple batches of leaflets 30 have been placed in storage array 104, 204, the leaflets are typically designated into leaflet groups, and then grouped into the leaflet groups. For some such applications, circuitry 40 designates the aggregate of leaflets into leaflet groups based on similarity between the leaflet-flexibility values of the leaflets (e.g., as described hereinbelow with reference to
For some applications, a leaflet group designation of each leaflet 30 of the aggregate of leaflets to a leaflet group, is indicated (e.g. to an operator), using at least one indicator 120, 220. For some such applications, indicator 120, 220 is configured to provide a visual cue. For example, and as shown in
For some applications, a user-interface connected to circuitry 40 (e.g. computer 100 shown in
For some applications, indicator 120, 220 is an integral component of array 104, 204.
Alternatively, and as shown, the indicator may be a discrete device, and the storage array may be juxtaposed with the indicator (e.g., placed on the indicator) such that the visual cue is visible through the array (e.g. through a floor of the array). For example, array 104, 204 may be: (i) at least partially transparent to the visual cue, and (ii) dimensioned in a manner corresponding to the dimensions of indicator 120, 220 (e.g. the indicator defines a surface upon which the array may be placed). In this way, the operator may receive the visual cue from indicator 120, 220, through array 104, 204, and group leaflets 30 from respective cells 106, 206 without cross-referencing between the storage array and a separate display representing the leaflet group designations.
For some such applications, indicator 120, 220 and array (104, 204) are complimentarily dimensioned (e.g. defining a notch and a groove), in a manner that facilitates integration of the array with the indicator such that the array is in a proper orientation with respect to the indicator. That is, proper orientation of array 104, 204 with respect to indicator 120, 220 assures that the visual cue indicated with respect to each leaflet 30, is visible through cell 106, 206 containing that respective leaflet. It is hypothesized by the inventors that integrating indicators 120, 220 into array 104, 204 reduces a risk of human error when the operator groups leaflets 30 into leaflet groups. At the same time, separability of array 104, 204 from indicator 120, 220 may facilitate successive use of multiple storage arrays (e.g. indicating leaflet group designations of multiple aggregates of leaflets to leaflet groups) with a given indicator. For some applications, the storage arrays are disposable, while the indicator is reusable.
Alternatively or in addition to facilitating step 332 by indicating the leaflets that are designated to the various leaflet groups, indicator 120, 220 may facilitate step 322 by indicating a portion of storage array 104, 204 (e.g. a cell 106, 206) in which to temporarily store leaflet 30 after testing. For example, indicator 120, 220 may be used in conjunction with the unique identifier of each cell 106, 206 described hereinabove in reference to
Reference is made to
For some applications, leaflets 30 are first assigned to categories, and are subsequently designated to leaflet groups. For such applications, (i) leaflets 30 are placed onto tester 20, tested according to the categorization technique, and sorted according to their categories—e.g., into collections, and (ii) subsequently, leaflets from a single category are re-placed onto tester 20 and retested according to the grouping technique. It is hypothesized by the inventors that the grouping of leaflets 30 assigned to the same leaflet flexibility category, according to their leaflet-flexibility values, may enable grouping of leaflets into leaflet groups of highly similar flexibility.
For some applications, leaflets assigned to a leaflet-flexibility category (e.g. a first categorized batch of categorized leaflets and a second categorized batch of categorized leaflets sorted into storage unit 110) undergo a second iteration of flexibility testing. In the second iteration of testing, the categorized leaflets are retested, in order to be designated to leaflet groups, as described hereinabove. In this way, assigning leaflets 30 to categories may serve as a preliminary screening of leaflets of an initial stock (see arrows in
Reference is made to
In order to use tester 20, multiple leaflets 30 are draped over respective bars 22 of the tester (step 310). However, several optional steps may be performed beforehand (indicated by broken boxes).
In optional steps 302 and 304, leaflets of a stock of leaflets 30 are initially classified according to their thickness (step 302), and are then selected according to their thickness (step 304), such that the leaflets that will be tested using tester 20 are of a single thickness class. For such applications, the testing using tester 20 may represent a second, “fine” classification according to flexibility of leaflets 30, subsequent to an initial “coarse” classification according to their thickness. It is hypothesized by the inventors that performing flexibility testing on leaflets that have already been pre-classified to a single thickness may further improve the matching of leaflets for use in a prosthetic valve.
Alternatively or in addition to initially classifying leaflets 30 according to their thickness, method 300 may be performed using leaflets previously assigned to a leaflet-flexibility category, e.g., as described hereinabove in reference to
In optional step 306, image sensor 32 may be (re)positioned prior to testing leaflets 30 on tester 20 (e.g., as described hereinabove).
In optional step 308, circuitry 40 is activated to perform a dedicated calibration routine prior to placing leaflets over bars 22 of tester 20 (e.g., as described hereinabove). (For some applications, a calibration is alternatively or additionally performed as part of the subsequent image analysis of step 318.)
After leaflets 30 have been placed across bars 22 (step 310), the bars are lifted with respect to platform 48, such that leaflets 30 drape over the bars (step 312). The operator then initiates acquisition (step 314) of a digital image by image sensor 32 (step 316), the image including the multiple leaflets draped over bars 22.
Typically, at this stage, circuitry 40 performs analysis of the acquired image (step 318), the analysis typically comprising calculating one or more image parameters and deriving, for each leaflet 30, a leaflet-flexibility value, e.g., as described hereinabove.
For some applications, circuitry 40 performs an image-quality check routine (step 320), which may be part of image analysis (step 318), or may be a distinct step. For some such applications, the image-quality check routine is run prior to deriving the leaflet-flexibility value for each leaflet. For some applications, the image-quality check routine comprises calculating, for each leaflet, an image parameter. For example, the parameter derived in the image-quality check routine may be direct distance D82 between a first-leaflet-tip position and a second-leaflet-tip position (
For some applications, an image passes the image-quality check routine if the image parameter was successfully calculated for all of the leaflets in the image. Examples of why an image might fail the image-quality check routine include an unclear image, an obstacle obscuring one or more of the leaflets, improperly placed leaflets, failure of circuitry 40 to identify both leaflet-tips of a leaflet, and/or an unexpected or illogical image parameter value.
In the case that the image fails the image-quality check, leaflets 30 are placed again across bars 22 (e.g., placement of the leaflets is adjusted), the bars are re-lifted, and the image is re-acquired. In the case that the image passes the image-quality check, the plurality of leaflets 30 are typically stored in a manner that facilitates tracking of the individual identity of the leaflets, e.g., by placing the leaflets in storage array 104, 204 (step 322).
If additional batches of leaflets 30 are to be tested (step 324), steps 310-322 are repeated for the additional leaflets (e.g. until storage array 104, 204 is full, or until all the leaflets have been tested). Thus, an aggregate of leaflets comprising multiple batches of leaflets is assembled on the array. Typically for such applications, the aggregate comprises at least 9 and/or fewer than 400 leaflets, e.g., 9-400 leaflets (e.g., 9-100 leaflets or 40-400 leaflets), such as 40-100 leaflets. For example, and as shown, the aggregate may comprise eighty-one leaflets. For some applications, the entire aggregate of leaflets is tested before circuitry 40 designates the leaflets into leaflet groups. It is hypothesized by the inventors that testing flexibility of the aggregate of leaflets 30, before designating the batches of leaflets into leaflet groups, increases the likelihood of designating closely matched leaflets to each group.
Although method 300 is described hereinabove (and is shown in
Typically, while the aggregate of leaflets 30 is stored in storage array 104 or 204, the leaflets are designated to respective leaflet groups (step 326), based on similarity between the respective leaflet-flexibility values of each leaflet of the aggregate of leaflets.
Typically, grouping is optimized responsively to two criteria: (i) As many leaflets as possible from the aggregate of leaflets should be designated to a leaflet group (i.e., maximizing yield and/or minimizing wastage). (ii) Leaflets designated to a leaflet group should have the most similar leaflet-flexibility values attainable (e.g. the leaflets should be “best-matching” leaflets). Thus, ideally, a maximal number of best-matching leaflets is desired. There is typically a trade-off between these criteria. If an intra-group tolerance is very low (e.g., only the very best matched leaflets are designated to a group), a total number of within-tolerance (i.e. a yield of) leaflet groups may be unacceptably low. Similarly, ensuring a maximal yield of complete leaflet groups may require designating, to the same group, leaflets that are insufficiently similar to each other. Described hereinbelow, with reference to
Typically, designating leaflets 30 to leaflet groups is accomplished without further moving or otherwise manipulating the leaflets (e.g. while the leaflets are stored in storage array 104, as described hereinabove in reference to
In response to this indicating, the operator can then group the leaflets (i.e., physically gather the leaflets) into groups (step 332) and utilize the groups of leaflets (step 336), e.g. by assembling the leaflets together in a prosthetic heart valve.
As described hereinabove with respect to step 326, the intra-group tolerance determines which leaflets may be designated into groups with which other leaflets. Typically, this means that the flexibility value of each leaflet within a group must, at a minimum, be within the intra-group tolerance to the flexibility value of each other leaflet within that group. Intra-group tolerances are typically received (e.g. as input from operator), using circuitry 40, and are described in more detail hereinbelow.
Reference is made to
As described hereinbelow in greater detail with respect to
Typically, and as shown, indices are arranged according to an order (e.g. according to an order of magnitude of their values). For other applications, it may not be necessary to order the indices. Step 402 is therefore indicated as being optional by the broken box in
Next, a maximum number of index groups that conform to the intra-group tolerance (henceforth “within-tolerance” index groups), which may be attained from the series of indices, is determined (step 404). For some applications, an index group conforms to the intra-group tolerance if (i) it includes a predetermined number of indices whose values fit within an intra-group tolerance, and (ii) the flexibility value of each index of the index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index of index group. That is, the intra-group tolerance defines a maximum allowable difference between values of a within-tolerance index group. Step 404 is also described in greater detail with respect to
Subsequently, the indices are designated to index groups (step 406). As described hereinbelow in greater detail with respect to
However, if doing so would reduce the total number of within-tolerance groups, compared to the maximum number determined in step 404, then an iterative process is performed, testing next-best-matching leaflets until the grouping does not reduce the total number of within-tolerance groups.
Leaflet-flexibility values are obtained, e.g. using circuitry 40 (step 502). For example, the leaflet-flexibility values may be retrieved from the memory of circuitry 40, e.g., after having been derived as described hereinabove. Alternatively or in addition, the leaflet-flexibility values may be entered by the operator (e.g. using a user-interface).
The leaflet-flexibility values are then arranged, in order of magnitude, as a series of indices (step 504), which will subsequently be analyzed. Typically, circuitry 40 assigns a respective index number to each of the leaflet-flexibility values. As shown in
For example, and shown in
Together, steps 502 and 504 of method 500 may correspond to step 402 of method 400. That is, step 402 may comprise steps 502 and 504.
Subsequently, the maximum number of index groups that may be attained from the series of indices is determined (step 404). Each index group comprises a predetermined number of indices. In the description hereinbelow, the predetermined number of indices in an index group is three (corresponding to three leaflets of a leaflet group). Therefore, the term “trio” is used henceforth as a specific example in reference to
Each designated index group conforms to a predetermined intra-group tolerance. That is, all of the indices within an index group must have a value that is within the intra-group tolerance of all of the other indices within the index group. Therefore, each index group must, at a minimum, (i) contain the predetermined number of indices, and (ii) contain only indices that are within the intra-group tolerance of each other.
In the example shown, the intra-group tolerance is defined as 2. Thus, indices having values differing by no more than two may be included in a trio.
Determining the maximum number of within-tolerance trios (step 404) begins with selection of a potential trio (step 505), starting at a first trio T1, which includes indices i1, i2, and i3 (
For some applications, an index group-differential (e.g. an index trio-differential), equal to a difference between a highest value of the trio, and a lowest value of the trio, is calculated in order to determine whether the trio conforms to the intra-group tolerance (step 506). If the trio-differential is equal to, or less than the intra-group tolerance, then the trio is considered to conform to the intra-group tolerance, and is therefore counted as a within-tolerance trio. For applications in which the indices are sorted according to ascending order of magnitude, trio-differential “delta_t” value of the trio is calculated by subtracting the first index of the trio from the last index of the trio.
The next step in determining the maximum number of within-tolerance trios is to determine whether sufficient subsequent indices remain in order for a subsequent potential trio to be evaluated (step 508). If the answer is “yes” (as in this case, since at least), analysis continues by advancing one index (step 509) in the series, and potential trio T2 is selected (step 505,
Again, sufficient subsequent indices remain in order for a subsequent potential trio to be evaluated (step 508). That is, at least one index has yet to be selected. The analysis therefore continues by advancing one index in the series (step 509), and potential trio T3 is selected (step 505). As shown in
After within-tolerance trio T3 is counted, sufficient subsequent indices still remain in order for a subsequent potential trio to be evaluated (step 512). The analysis therefore continues by advancing along the indices (step 513).
Since trio T3 was counted as conforming to the intra-group tolerance, the analysis advances by three indices (as opposed to by one index in cases in which the trio did not conform to the intra-group tolerance). That is, because indices i3, i4, and i5 already belong to a within-tolerance trio, no other trios that include any of these three indices are evaluated in step 404. Therefore, method 400 then returns to step 505, as described hereinabove, mutatis mutandis, with the next potential trio to be evaluated being T6. That is, the “current index” of step 505 at this stage will be i6.
In this way, successive iterations are performed, determining the number of within-tolerance trios, until no trios remain to be evaluated.
Each of the trios that would have been evaluated are indicated by a broken rectangle. Those of the trios that conformed to the intra-group tolerance are indicated by the broken rectangle being bolded. As shown, in this exemplary series, the maximum number of trios that conform to the intra-group tolerance that it is possible to obtain from the series is found to be five. At this point, this maximum number is stored, hereafter the “stored maximum number,” e.g. in the memory of circuitry 40 (step 514).
Together, steps 505, 506, 508, 509, 510, 512, 513, and 514 of method 500 may correspond to step 404 of method 400. That is, step 404 may comprise steps 505, 506, 508, 509, 510, 512, 513, and 514.
After the maximum number of trios that conform to the intra-group tolerance, that are attainable from the series is determined and stored (step 404), the indices are designated to index groups (step 406), as elaborated hereinbelow.
Firstly, a preliminary index group (e.g. first trio T1) is selected for evaluation (step 516). Trio T1 is found to not conform to the intra-group tolerance (step 517,
Since there is at least one remaining unevaluated trio (step 519), analysis continues by advancing one index (step 521) to trio T2 (step 516,
The next preliminary index group, trio T2, is also found to not conform to the intra-group tolerance (step 517,
Since there is at least one remaining unevaluated trio (step 519), analysis continues by advancing one index (step 521) to the next preliminary index group, trio T3 (step 516,
Trio T3 is found to conform to the intra-group tolerance, and is therefore found to be a within-tolerance trio (step 517) labelled with a bolded broken rectangle in
The cluster typically comprises the within-tolerance trio (in this case T3) and the subsequent two indices (in this case T4 and T5). This can also be stated as the cluster comprising the within-tolerance trio (in this case T3, which corresponds to index i3), and subsequent trios that correspond to the other indices contained within the within-tolerance trio (in this case T4 and T5). More generally stated (e.g., to encompass group sizes other than 3), the cluster typically comprises the within-tolerance index group (i.e., the index group that was found to conform to the tolerance in step 517) and the index groups that correspond to the other indices contained within the within-tolerance index group. Therefore, the number of index groups in the cluster is equal to the number of indices comprising each index group—e.g., the number of leaflets that will be combined in a prosthetic valve.
For the purposes of selecting the best-matching trio of cluster C3 (step 518), the delta_t value (as described hereinabove in reference to
For example, and as shown in
For some applications, other parameters may be calculated in order to identify the best-matching trio of a cluster by comparing the closeness of fit between the leaflets comprising each trio of the cluster.
For some such applications, an additive differential value may be calculated. The additive differential (“sum_delta_t”) of a particular trio is the sum of the differences between each of the three pairs of indices within that trio. For example, the additive differential of trio T3 (sum_delta_t3) is calculated as (i4−i3)+(i5−i4)+(i5−i3)=(26−25)+(27−26)+(27−25)=1+1+2=4.
For some applications (e.g. if the predetermined index group size is two or three), the sum_delta_t values of index groups may be equal to the delta_t values of those same index groups. For other applications (e.g. if the predetermined index group size is four or greater), the sum_delta_t values of index groups may not equal the delta_t values of those index groups. For some such applications, sum_delta_t values may reflect, more accurately than delta_t values, the degree to which leaflet-flexibility values of leaflets within a given leaflet group match each other. It is therefore hypothesized by the inventors that using sum_delta_t values may be particularly advantageous when identifying the best-matching index group within a of indices, for applications in which the predetermined index group size is four or greater.
Alternatively or in addition, an average differential (“avg_delta_t”) of a particular index group may be calculated to compare the closeness of fit between the indices within each index group of the cluster, by averaging the differences between each of the pairs of indices within that index group. For example, avg_delta_t3 may be calculated as (1+1+2)/3=1.33.
Alternatively or in addition, a sum of the squares of the differences between (sum{circumflex over ( )}_delta_t) each of the pairs of indices within that index group may be calculated to compare the closeness of fit between the index within each index group of the cluster. For example, sum{circumflex over ( )}_delta_t3 may be calculated as 1{circumflex over ( )}2+1{circumflex over ( )}2+2{circumflex over ( )}2=6. It is to be noted that the scope of the present invention also includes the use of other appropriate mathematical functions to represent the respective differentials of the index groups.
Evaluation of cluster C3 continues by determining whether designating the best-matching trio of the cluster (in this case T5) as an index group to be subsequently indicated in step 328 (
Since at least another trio of indices remains to be evaluated (step 526), the analysis continues by advancing three indices—i.e., to the trio that corresponds to the first index after previously-designated trio T5 (step 528). Therefore, in this case, trio T8 (which includes indices i8, i9, and i10) is selected for evaluation (step 516). Trio T8 is found to be a within-tolerance trio, (step 517,
The next step is therefore determining whether designating best-matching trio T10 would reduce the total number of within-tolerance trios to below the maximum number that was determined in step 404 (step 520). Thus, the number of additional within-tolerance trios that may be attained from the remainder of the series is calculated in the same manner described hereinabove, mutatis mutandis, but starting after hypothetically-designated trio T10. As shown in
As shown in
It is worth noting that in this illustrative example using indices i1-i23, the leaflet-flexibility values are integers, which increases the likelihood that two trios of the same cluster may have identical trio-differentials. However, in reality, leaflet-flexibility values typically include decimals or fractions (i.e., leaflet-flexibility values are typically “floats”), reducing the likelihood of two trios having identical trio-differentials.
For some applications in which a next-best-trio must be identified from among two trios having equal trio-differentials, the trio appearing later in the series of indices (e.g. trio T9,
As shown in
As shown in
Since at least another trio of indices remains to be evaluated (step 526), the analysis continues by advancing three indices—i.e., to the trio that corresponds to the first index after previously-designated trio T8 (step 528). Therefore, in this case, trio T11 (which includes indices i11, i12, and i13) is selected for evaluation (step 516).
For some applications, remaining indices are identified by advancing along the indices, such that steps 512 and 513 may be combined. That is, whether sufficient subsequent indices remain in order for a subsequent potential trio to be evaluated, is determined (step 512) by attempting to advance three indices (step 513). For example, successful advancement by three indices demonstrates that sufficient indices remain in order for a subsequent potential trio to be evaluated. In contrast, failure to advance by three indices demonstrates that insufficient indices remain in order to evaluate a subsequent potential trio. However, for the sake of clarity, advancing three indices (step 513) and determining if sufficient indices remain in order to do so (step 512) are described as discrete steps. Similarly, additional pairs of steps (e.g., steps 508 and 509, steps 519 and 521, steps 526 and 528) may each respectively be combined. For the sake of clarity, these pairs of steps are described hereinabove as discrete steps.
As described hereinabove in reference to
Together, steps 516, 517, 518, 519, 520, 521, 522, 524, 526, and 528 of method 500 may correspond to step 406 of method 400. That is, step 406 may comprise steps 516, 517, 518, 519, 520, 521, 522, 524, 526, and 528.
In this way, successive iterations of step 406 are performed, until no trios remain to be evaluated.
It is to be noted that, in some instances (e.g., due to an aggregate of leaflets having leaflets whose leaflet-flexibility values are of a particular similarity and/or order), it may be possible that the cumul_avg_delta_t value of the designated trios is equal to the cumul_avg_delta_t value of the within-tolerance index groups.
The designated index groups are then indicated (step 328 of
In the example shown, of the 23 indices visible in
For some applications, it may be desirable to adjust the intra-group tolerance used as a basis for designating the index groups, e.g., in order to obtain a desirable (e.g., optimal) compromise between yield and closeness of fit within index groups. This is represented in
Reference is now also made to
For some such applications, the operator selects one of the alternate yields, such that the operator has the option of revising the intra-group tolerance by selecting an alternate yield stemming from an intra-group tolerance other than the predetermined tolerance. For example, the intra-group tolerance may be increased responsively to designating an undesirably low yield of within-tolerance leaflet groups stemming from use of the predetermined tolerance with a particular aggregate of leaflets.
For some applications, it may be desirable to include, alongside alternate numbers of within-tolerance leaflet groups, a parameter reflecting the average closeness of fit of each alternate leaflet group yield. In addition to the relationship between intra-group tolerance and the yield of leaflet groups shown in
Responsively to the operator's election whether to revise the tolerance in step 330, the final designation (e.g. identities of trios of leaflets) are then indicated to the operator (step 328), who then groups the leaflets (step 332), responsively to the final leaflet group designations. Further typically for such applications, if the operator selects the leaflet group designation resultant from the predetermined intra-group tolerance, this designation is indicated to the operator, effectively skipping over optional step 330. For some applications, step 330 is skipped entirely, and the leaflet group designation indicated in step 328 is the designation stemming from the predetermine intra-group tolerance in step 326.
For some applications, grouped leaflets 30 undergo a validation step 334, subsequently to being grouped into their leaflet groups. For example, although leaflets 30 would have already been typically tested for flexibility in a first orientation (e.g. with the rough side facing upwards), it may be desirable to validate the leaflets by testing the leaflets of a leaflet group, in a second orientation that is inverted with respect to the first orientation (e.g. with the smooth side facing upwards).
For example, validation may entail repeating steps 310-322, mutatis mutandis, with leaflets 30 draped across bars 22 in the second orientation. For example, after calculating first-orientation image parameters by digitally analyzing a first-orientation digital image of leaflets 30 in the first orientation, resulting in a first leaflet-flexibility value (steps 310-318), second-orientation image parameters may be calculated by digitally analyzing a second-orientation digital image of leaflets 30 in the second orientation, resulting in a second leaflet-flexibility value.
For example, a leaflet 30 may pass validation if the second leaflet-flexibility value is deemed to be sufficiently similar to the first leaflet-flexibility value. This comparison may be made by a human operator or by circuitry 40. For example, a difference between the first leaflet-flexibility value and the second leaflet-flexibility value may be calculated, such that the leaflet may be counted as validated if the difference is below a predetermined threshold. Alternatively or in addition, the comparison may be facilitated by calculating a symmetry index reflective of the degree to which the first leaflet-flexibility value correlates with the second leaflet-flexibility value.
Leaflets 30 that fail validation are typically discarded. For some applications, the user-interface may be used to indicate to the user which leaflets failed the validation, such that those failed leaflets may be discarded.
If a leaflet of a designated trio of leaflets fails the validation, that leaflet is typically discarded. For some applications, step 326 is then repeated on the entire aggregate but excluding the failed leaflet and its flexibility value. Alternatively, the validated leaflets of the failed leaflet's group (and which are now “orphaned”) may be stored for future use (e.g., to be evaluated in another aggregate).
Step 336 represents the utilization of the groups of leaflets, e.g. by assembling the leaflets together in a prosthetic heart valve, or by storing the group of leaflets in a separate container for later use. This step may be performed by the individual who evaluated the leaflets. Alternatively or in addition, step 336 comprises sending the groups of leaflets to a distinct individual, e.g. who assembles the leaflets together in a prosthetic heart valve.
Hereinabove, the group size is described in general as being equal to the number of leaflets that are to be used in (e.g., sewn into) a given prosthetic heart valve (e.g., a group size of three for a trileaflet valve). For some applications, the group size may be larger than the number of leaflets that are to be used in a given prosthetic heart valve, e.g., so as to provide a spare leaflet in case a problem (e.g., damage) occurs to one of the leaflets of a given group, e.g., so that it is not necessary to discard all the leaflets of a group in response to a problem with only one of the leaflets of the group. For example, a group size of four may be used when grouping leaflets for trileaflet valves.
Applications of the invention described herein can take the form of a computer program product accessible from a computer-usable or computer-readable medium (e.g., a non-transitory computer-readable medium) providing program code for use by or in connection with a computer or any instruction execution system, such as circuitry 40.
For some applications, the designating of leaflets 30 to groups is facilitated by an artificial neural network, e.g., with the artificial neural network performing step 326 and/or method 400. For some such applications, training data (e.g. digital images, image parameters, and/or leaflet-flexibility values) are used in conjunction with leaflet group designations described hereinabove.
For some applications in which leaflets 30 are designated to leaflet groups using an artificial neural network, steps 326 and 330 may be performed by the artificial neural network, after which final results are indicated (step 328) to the operator. For some such applications, the trade-off described hereinabove between achieving a maximal number of within-tolerance leaflet groups and each leaflet group including “best-matching” leaflets, is considered by the artificial neural network. It is hypothesized by the inventors that using the artificial neural network to consider the aforementioned trade-off may assist the operator in deciding whether or not to adjust intra-group tolerances (step 330). It is further hypothesized by the inventors that performance of step 330 by the artificial neural network may at least partially obviate specialized medical or technical training of the operator.
For the purpose of this description, a computer-usable or computer readable medium can be any apparatus that can comprise, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Typically, the computer-usable or computer readable medium is a non-transitory computer-usable or computer readable medium.
Examples of a computer-readable medium include a semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random-access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk-read only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD. For some applications, cloud storage, and/or storage in a remote server is used.
A data processing system suitable for storing and/or executing program code will include at least one processor (e.g., circuitry 40) coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. The system can read the inventive instructions on the program storage devices and follow these instructions to execute the methodology of the embodiments of the invention.
Network adapters may be coupled to the processor to enable the processor to become coupled to other processors or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.
Computer program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object-oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the C programming language or similar programming languages.
It will be understood that the methods described herein can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer (e.g., circuitry 40) or other programmable data processing apparatus, create means for implementing the functions/acts specified in the methods described in the present application.
These computer program instructions may also be stored in a computer-readable medium (e.g., a non-transitory computer-readable medium) that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means which implement the function/act specified in the methods described in the present application. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the methods described in the present application.
Circuitry 40 typically comprises a hardware device programmed with computer program instructions to produce a computer processor. For example, when programmed to perform the methods described herein, the computer processor typically acts as a special purpose computer processor. Typically, the operations described herein that are performed by computer processors transform the physical state of a memory, which is a real physical article, to have a different magnetic polarity, electrical charge, or the like depending on the technology of the memory that is used.
It will be appreciated by persons skilled in the art that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof that are not in the prior art, which would occur to persons skilled in the art upon reading the foregoing description.
Claims
1. A method for grouping prosthetic valve leaflets of an aggregate of prosthetic valve leaflets, the method comprising, using a computer processor:
- for each leaflet of the aggregate, in response to an image parameter of the leaflet, deriving a leaflet-flexibility value;
- receiving an intra-group tolerance;
- designating at least some of the leaflets of the aggregate into designated leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, and (ii) such that, for each of the designated leaflet groups, the flexibility value of each leaflet in the designated leaflet group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other leaflet in the designated leaflet group; and
- outputting an indication of the designated leaflet groups.
2. The method according to claim 1, wherein outputting the indication of the designated leaflet groups comprises, using at least one indicator in communication with the computer processor, indicating the designated leaflet groups.
3. The method according to claim 1, wherein designating at least some of the leaflets of the aggregate into designated leaflet groups comprises designating fewer than 80 percent of the leaflets of the aggregate into designated leaflet groups.
4. The method according to claim 3, wherein designating fewer than 80 percent of the leaflets of the aggregate into designated leaflet groups comprises designating 10-80 percent of the leaflets of the aggregate into designated leaflet groups.
5. The method according to claim 3, wherein designating fewer than 80 percent of the leaflets of the aggregate into designated leaflet groups comprises designating fewer than 50 percent of the leaflets of the aggregate into designated leaflet groups.
6. The method according to claim 5, wherein designating fewer than 50 percent of the leaflets of the aggregate into designated leaflet groups comprises designating 10-50 percent of the leaflets of the aggregate into designated leaflet groups.
7. The method according to claim 5, wherein designating fewer than 50 percent of the leaflets of the aggregate into designated leaflet groups comprises designating fewer than 30 percent of the leaflets of the aggregate into designated leaflet groups.
8. The method according to claim 1, further comprising, prior to deriving the leaflet-flexibility value for each leaflet of the aggregate of leaflets, calculating the image parameter for each leaflet of the aggregate by digitally analyzing one or more digital images that include the leaflets of the aggregate.
9. The method according to claim 8, further comprising, prior to deriving the leaflet-flexibility value for each leaflet of the aggregate of leaflets, performing an image-quality check routine, wherein performing the image-quality check routine comprises: wherein deriving the leaflet-flexibility value for each leaflet of the aggregate of leaflets comprises selectively deriving the leaflet-flexibility value for each leaflet, such that:
- comparing, for each leaflet of the aggregate, the image parameter to a predetermined threshold;
- if the image parameter for a given leaflet is found to fit the predetermined threshold, the leaflet-flexibility value is derived for that leaflet, and
- if the image parameter for a given leaflet is found to not fit the predetermined threshold, the leaflet-flexibility value is not derived for that leaflet.
10. The method according to claim 9, wherein:
- calculating the image parameter for each leaflet of the aggregate comprises: calculating, for each leaflet of the aggregate: a direct distance between a position of a first leaflet-tip and a position of a second leaflet-tip, and an axial distance along a horizontal axis between the position of the first leaflet-tip and the position of the second leaflet-tip, and comparing, for each leaflet of the aggregate, the direct distance to the axial distance.
11. The method according to claim 8, wherein calculating the image parameter for each leaflet of the aggregate comprises calculating, for each leaflet of the aggregate, a direct distance between a position of a first leaflet-tip and a position of a second leaflet-tip.
12. The method according to claim 8, wherein calculating the image parameter for each leaflet of the aggregate comprises calculating, for each leaflet of the aggregate, an axial distance along a horizontal axis between a position of a first leaflet-tip and a position of a second leaflet-tip.
13. The method according to claim 8, further comprising, prior to calculating the image parameter for each leaflet of the aggregate, using an image sensor to acquire the one or more digital images.
14. The method according to claim 13, wherein the aggregate of leaflets includes a first batch of leaflets and a second batch of leaflets, and acquiring the one or more digital images comprises:
- acquiring a first digital image that includes leaflets of the first batch of leaflets; and
- acquiring a second digital image that includes leaflets of the second batch of leaflets.
15. The method according to claim 13, wherein:
- the first digital image includes all of the leaflets of the first batch of leaflets, and acquiring the first digital image comprises acquiring the digital image that includes all of the leaflets of the first batch of leaflets; and
- the second digital image includes all of the leaflets of the second batch of leaflets, and acquiring the second digital image comprises acquiring a digital image that includes all of the leaflets of the second batch of leaflets.
16. The method according to claim 15, further comprising, subsequently to acquiring the first digital image, for each leaflet of the first batch of leaflets, indicating a respective portion of a storage array in which to temporarily store the leaflet of the first batch of leaflets.
17. The method according to claim 16, wherein outputting the indication of the designated leaflet groups comprises indicating the respective portion of the storage array from which to group leaflets of the first batch of leaflets into the designated leaflet groups.
18. A method for sorting leaflets for use in prosthetic heart valves, the method comprising:
- positioning, opposite an image sensor, each leaflet of a first batch of multiple leaflets;
- subsequently, initiating acquisition, by the image sensor, of a first digital image that includes all of the leaflets of the first batch;
- subsequently, positioning, opposite the image sensor, each leaflet of a second batch of multiple leaflets;
- subsequently, initiating acquisition, by the image sensor, of a second digital image that includes all of the leaflets of the second batch;
- for each leaflet of the first batch and each leaflet of the second batch: obtaining a leaflet-flexibility value for the leaflet, the leaflet-flexibility value being derived by digital analysis of the first digital image or the second digital image; assigning the leaflet to a leaflet-flexibility category such that the leaflet-flexibility value of the leaflet fits within a range defined between an upper flexibility-value threshold of the leaflet-flexibility category, and a lower flexibility-value threshold of the leaflet-flexibility category, the leaflet-flexibility category being one of multiple leaflet-flexibility categories; placing the leaflet into a storage unit according to the leaflet-flexibility category of the leaflet, in a manner that facilitates: separation of the leaflet from leaflets assigned to other leaflet-flexibility categories, and maintenance of one or more attributes selected from the group consisting of: moisture content of the leaflet, and sterility of the leaflet.
19. The method according to claim 18, further comprising:
- selecting, from the storage unit, a group of leaflets comprising a number of leaflets equal to the number of leaflets required for a prosthetic heart valve, each leaflet of the group having been assigned to the same leaflet-flexibility category; and
- sewing the group of leaflets into the prosthetic heart valve.
20. The method according to claim 18, further comprising:
- selecting, from the storage unit, a first categorized batch of multiple categorized leaflets, each categorized leaflet of the first categorized batch having been assigned to the same leaflet-flexibility category as the other categorized leaflets of the first categorized batch;
- positioning each categorized leaflet of the first categorized batch opposite the image sensor;
- subsequently, initiating acquisition, by the image sensor, of a third digital image that includes all of the categorized leaflets of the first categorized batch;
- subsequently, removing each categorized leaflet of the first categorized batch to a storage array in a manner that facilitates tracking of an individual identity of each categorized leaflet of the first categorized batch;
- subsequently selecting, from the storage unit, a second categorized batch of multiple categorized leaflets, each categorized leaflet of the second categorized batch being assigned to the same leaflet-flexibility category as the categorized leaflets of the first categorized batch;
- positioning each categorized leaflet of the second categorized batch of categorized leaflets opposite the image sensor;
- subsequently, initiating acquisition, by the image sensor, of a fourth digital image that includes all of the categorized leaflets of the second categorized batch;
- subsequently, removing the categorized leaflets of the second categorized batch to the storage array in a manner that facilitates tracking of the individual identity of each categorized leaflet of the second categorized batch, thereby assembling the categorized leaflets of the first categorized batch and the categorized leaflets of the second categorized batch into an aggregate of categorized leaflets;
- subsequently, operating software to: receive the third digital image and the fourth digital image, by digitally analyzing the third digital image and the fourth digital image, for each of the categorized leaflets included in the third digital image and the fourth digital image: calculate an image parameter for the categorized leaflet, and from the image parameter, derive a leaflet-flexibility value for the categorized leaflet, receive a group size value, designate at least some of the categorized leaflets of the aggregate of categorized leaflets into one or more designated leaflet groups: based on similarity between the respective leaflet-flexibility values of each of the categorized leaflets of the aggregate, and such that each of the designated leaflet groups includes a number of categorized leaflets equal to the group size value, and output an indication of the one or more designated leaflet groups; and
- in response to the indication, grouping the at least some categorized leaflets of the aggregate of categorized leaflets into the one or more designated leaflet groups.
21. Apparatus for grouping prosthetic valve leaflets of an aggregate of prosthetic valve leaflets, the apparatus comprising a computer processor configured to:
- receive a plurality of leaflet-flexibility values, each of the leaflet-flexibility values corresponding to a respective leaflet of the aggregate;
- receive a group size value;
- assign a respective index to each of the leaflet-flexibility values, each index representing a respective one of the leaflets and having the leaflet-flexibility value of the respective one of the leaflets;
- receive an intra-group tolerance, the intra-group tolerance representing a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group;
- subsequently, determine a maximum number of within-tolerance index groups attainable from the indices, a within-tolerance index group being an index group (i) that includes a number of indices that is equal to the group size value, and (ii) for which the flexibility value of each index in the index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the index group; and
- subsequently, store the maximum number,
- designate at least some of the leaflets of the aggregate into designated leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, (ii) such that: each of the designated leaflet groups includes a number of leaflets equal to the group size value, and the flexibility value of each index in a given designated index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the designated index group; and
- output an indication of the designated leaflet groups.
22. A computer software product comprising a non-transitory computer-readable medium in which program instructions are stored, which instructions, when read by a computer cause the computer to:
- receive a plurality of leaflet-flexibility values, each leaflet-flexibility value corresponding to a respective leaflet of the aggregate;
- receive a group size value;
- assign a respective index to each of the leaflet-flexibility values, each index representing a respective one of the leaflets and having the leaflet-flexibility value of the respective one of the leaflets;
- receive an intra-group tolerance, the intra-group tolerance representing a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group;
- subsequently, determine a maximum number of within-tolerance index groups attainable from the indices, a within-tolerance index group being an index group (i) that includes a number of indices that is equal to the group size value, and (ii) for which the flexibility value of each index in the index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the index group; and
- subsequently, store the maximum number,
- designate at least some of the leaflets of the aggregate into designated leaflet groups, (i) based on similarity between the respective leaflet-flexibility value of each leaflet of the aggregate, (ii) such that: each of the designated leaflet groups includes a number of leaflets equal to the group size value, and the flexibility value of each index in a given designated index group is within the intra-group tolerance with respect to the leaflet-flexibility value of each other index in the designated index group; and
- output an indication of the designated leaflet groups.
23. The method according to claim 1, wherein the intra-group tolerance represents a maximum allowable difference between the leaflet-flexibility values of any two leaflets in a given leaflet group.
4972494 | November 20, 1990 | White |
5201757 | April 13, 1993 | Heyn et al. |
5713948 | February 3, 1998 | Uflacker |
5776140 | July 7, 1998 | Cottone |
5957949 | September 28, 1999 | Leonhardt et al. |
5961549 | October 5, 1999 | Nguyen et al. |
6010530 | January 4, 2000 | Goicoechea |
6245105 | June 12, 2001 | Nguyen et al. |
6254609 | July 3, 2001 | Vrba et al. |
6402780 | June 11, 2002 | Williamson, IV et al. |
6413275 | July 2, 2002 | Nguyen et al. |
6454799 | September 24, 2002 | Schreck |
6733525 | May 11, 2004 | Yang et al. |
6837902 | January 4, 2005 | Nguyen et al. |
7018406 | March 28, 2006 | Seguin et al. |
7074236 | July 11, 2006 | Rabkin et al. |
7261686 | August 28, 2007 | Couvillon, Jr. |
7585321 | September 8, 2009 | Cribier |
7753949 | July 13, 2010 | Lamphere |
7811296 | October 12, 2010 | Goldfarb |
8070802 | December 6, 2011 | Lamphere |
8361144 | January 29, 2013 | Fish et al. |
8449599 | May 28, 2013 | Chau et al. |
8568475 | October 29, 2013 | Nguyen et al. |
8585755 | November 19, 2013 | Chau et al. |
8628571 | January 14, 2014 | Hacohen et al. |
8728155 | May 20, 2014 | Montorfano et al. |
8850898 | October 7, 2014 | Johnsen |
8852272 | October 7, 2014 | Gross et al. |
8870948 | October 28, 2014 | Erzberger et al. |
8870950 | October 28, 2014 | Hacohen |
8992604 | March 31, 2015 | Gross |
8998982 | April 7, 2015 | Richter et al. |
9011468 | April 21, 2015 | Ketai |
9017399 | April 28, 2015 | Gross et al. |
9023100 | May 5, 2015 | Quadri et al. |
9095434 | August 4, 2015 | Rowe |
9097620 | August 4, 2015 | Caron et al. |
9119719 | September 1, 2015 | Zipory |
9132009 | September 15, 2015 | Hacohen |
9180009 | November 10, 2015 | Majkrzak et al. |
9232995 | January 12, 2016 | Kovalsky et al. |
9241791 | January 26, 2016 | Braido et al. |
9241792 | January 26, 2016 | Benichou et al. |
9248014 | February 2, 2016 | Lane et al. |
9277994 | March 8, 2016 | Miller |
9295551 | March 29, 2016 | Straubinger et al. |
9320591 | April 26, 2016 | Bolduc |
9358107 | June 7, 2016 | Nguyen et al. |
9387078 | July 12, 2016 | Gross et al. |
9393110 | July 19, 2016 | Levi et al. |
9439757 | September 13, 2016 | Wallace et al. |
9492273 | November 15, 2016 | Wallace et al. |
9554899 | January 31, 2017 | Granada et al. |
9561103 | February 7, 2017 | Granada et al. |
9597182 | March 21, 2017 | Straubinger et al. |
9662203 | May 30, 2017 | Sheahan et al. |
9681952 | June 20, 2017 | Hacohen et al. |
9763657 | September 19, 2017 | Hacohen et al. |
D800908 | October 24, 2017 | Hariton et al. |
9788941 | October 17, 2017 | Hacohen |
9895226 | February 20, 2018 | Harari et al. |
9987132 | June 5, 2018 | Hariton et al. |
10010414 | July 3, 2018 | Cooper et al. |
10143552 | December 4, 2018 | Wallace et al. |
10149761 | December 11, 2018 | Granada et al. |
10154906 | December 18, 2018 | Granada et al. |
10182908 | January 22, 2019 | Tubishevitz et al. |
10226341 | March 12, 2019 | Gross et al. |
10245143 | April 2, 2019 | Gross et al. |
10258471 | April 16, 2019 | Lutter et al. |
10292816 | May 21, 2019 | Raanani |
10299927 | May 28, 2019 | McLean et al. |
10321995 | June 18, 2019 | Christianson et al. |
10327895 | June 25, 2019 | Lozonschi et al. |
10335278 | July 2, 2019 | McLean et al. |
10376361 | August 13, 2019 | Gross et al. |
10512456 | December 24, 2019 | Hacohen |
10517719 | December 31, 2019 | Miller |
10531866 | January 14, 2020 | Hariton et al. |
10531872 | January 14, 2020 | Hacohen et al. |
10548731 | February 4, 2020 | Lashinski et al. |
10575948 | March 3, 2020 | Lamberger et al. |
10610358 | April 7, 2020 | Vidlund |
10702385 | July 7, 2020 | Hacohen |
10758342 | September 1, 2020 | Chau et al. |
10779946 | September 22, 2020 | Kislev et al. |
10842627 | November 24, 2020 | Delgado |
10856975 | December 8, 2020 | Hariton et al. |
10856978 | December 8, 2020 | Straubinger et al. |
10874514 | December 29, 2020 | Dixon |
10888425 | January 12, 2021 | Delgado |
10888644 | January 12, 2021 | Ratz |
10905552 | February 2, 2021 | Dixon |
10905554 | February 2, 2021 | Cao |
10918483 | February 16, 2021 | Metchik |
10925732 | February 23, 2021 | Delgado |
10945843 | March 16, 2021 | Delgado |
10945844 | March 16, 2021 | McCann |
10993809 | May 4, 2021 | McCann |
11065114 | July 20, 2021 | Raanani |
11083582 | August 10, 2021 | McCann |
11147672 | October 19, 2021 | McCann |
11179240 | November 23, 2021 | Delgado |
11291545 | April 5, 2022 | Hacohen |
11291546 | April 5, 2022 | Gross |
11291547 | April 5, 2022 | Gross |
20010005787 | June 28, 2001 | Oz |
20020032481 | March 14, 2002 | Gabbay et al. |
20020151970 | October 17, 2002 | Garrison et al. |
20030050694 | March 13, 2003 | Yang et al. |
20030074059 | April 17, 2003 | Nguyen et al. |
20040082991 | April 29, 2004 | Nguyen et al. |
20040186558 | September 23, 2004 | Pavcnik et al. |
20040249433 | December 9, 2004 | Freitag |
20050080474 | April 14, 2005 | Andreas et al. |
20050137690 | June 23, 2005 | Salahieh et al. |
20050137691 | June 23, 2005 | Salahieh |
20050240200 | October 27, 2005 | Bergheim |
20050251251 | November 10, 2005 | Cribier |
20050256566 | November 17, 2005 | Gabbay |
20060004469 | January 5, 2006 | Sokel |
20060020275 | January 26, 2006 | Goldfarb |
20060020327 | January 26, 2006 | Lashinski et al. |
20060052867 | March 9, 2006 | Revuelta et al. |
20060195183 | August 31, 2006 | Navia et al. |
20060216404 | September 28, 2006 | Seyler et al. |
20060259137 | November 16, 2006 | Artof et al. |
20060282150 | December 14, 2006 | Olson et al. |
20070016286 | January 18, 2007 | Herrmann |
20070056346 | March 15, 2007 | Spenser et al. |
20070197858 | August 23, 2007 | Goldfarb |
20070198077 | August 23, 2007 | Cully et al. |
20070213810 | September 13, 2007 | Newhauser et al. |
20070219630 | September 20, 2007 | Chu |
20080065204 | March 13, 2008 | Macoviak |
20080071361 | March 20, 2008 | Tuval et al. |
20080071369 | March 20, 2008 | Tuval et al. |
20080147182 | June 19, 2008 | Righini et al. |
20080200980 | August 21, 2008 | Robin et al. |
20080208328 | August 28, 2008 | Antocci |
20080208332 | August 28, 2008 | Lamphere |
20080221672 | September 11, 2008 | Lamphere |
20080234814 | September 25, 2008 | Salahieh et al. |
20080281411 | November 13, 2008 | Berreklouw |
20090005863 | January 1, 2009 | Goetz et al. |
20090082844 | March 26, 2009 | Zacharias |
20090125098 | May 14, 2009 | Chuter |
20090157175 | June 18, 2009 | Benichou |
20090163934 | June 25, 2009 | Raschdorf, Jr. |
20090259306 | October 15, 2009 | Rowe |
20100022823 | January 28, 2010 | Goldfarb |
20100023120 | January 28, 2010 | Holecek et al. |
20100100167 | April 22, 2010 | Bortlein et al. |
20100161036 | June 24, 2010 | Pintor et al. |
20100324595 | December 23, 2010 | Linder |
20100331971 | December 30, 2010 | Keränen et al. |
20110004299 | January 6, 2011 | Navia et al. |
20110021985 | January 27, 2011 | Spargias |
20110029072 | February 3, 2011 | Gabbay |
20110082538 | April 7, 2011 | Dahlgren |
20110112632 | May 12, 2011 | Chau et al. |
20110137397 | June 9, 2011 | Chau et al. |
20110144742 | June 16, 2011 | Madrid et al. |
20110208283 | August 25, 2011 | Rust |
20110208298 | August 25, 2011 | Tuval et al. |
20110218620 | September 8, 2011 | Meiri et al. |
20110224785 | September 15, 2011 | Hacohen |
20110282439 | November 17, 2011 | Thill et al. |
20110307049 | December 15, 2011 | Kao |
20110319989 | December 29, 2011 | Lane et al. |
20120016468 | January 19, 2012 | Robin et al. |
20120022629 | January 26, 2012 | Perera et al. |
20120022639 | January 26, 2012 | Hacohen et al. |
20120022640 | January 26, 2012 | Gross et al. |
20120059458 | March 8, 2012 | Buchbinder et al. |
20120065464 | March 15, 2012 | Ellis et al. |
20120078237 | March 29, 2012 | Wang et al. |
20120089223 | April 12, 2012 | Nguyen et al. |
20120165930 | June 28, 2012 | Gifford, III |
20120300063 | November 29, 2012 | Majkrzak |
20120310328 | December 6, 2012 | Olson et al. |
20130018458 | January 17, 2013 | Yohanan et al. |
20130030519 | January 31, 2013 | Tran |
20130035759 | February 7, 2013 | Gross et al. |
20130066341 | March 14, 2013 | Ketai |
20130066342 | March 14, 2013 | Dell |
20130150956 | June 13, 2013 | Yohanan et al. |
20130178930 | July 11, 2013 | Straubinger et al. |
20130253643 | September 26, 2013 | Rolando |
20130261738 | October 3, 2013 | Clague et al. |
20130304200 | November 14, 2013 | Mclean et al. |
20140000112 | January 2, 2014 | Braido et al. |
20140005778 | January 2, 2014 | Buchbinder et al. |
20140018915 | January 16, 2014 | Biadillah et al. |
20140142688 | May 22, 2014 | Duffy et al. |
20140172077 | June 19, 2014 | Bruchman et al. |
20140207231 | July 24, 2014 | Hacohen et al. |
20140214157 | July 31, 2014 | Börtlein |
20140222136 | August 7, 2014 | Geist |
20140222142 | August 7, 2014 | Kovalsky et al. |
20140236287 | August 21, 2014 | Clague et al. |
20140236289 | August 21, 2014 | Alkhatib |
20140249622 | September 4, 2014 | Carmi et al. |
20140257467 | September 11, 2014 | Lane et al. |
20140277409 | September 18, 2014 | Börtlein et al. |
20140277411 | September 18, 2014 | Börtlein et al. |
20140277418 | September 18, 2014 | Miller |
20140331475 | November 13, 2014 | Duffy |
20140358222 | December 4, 2014 | Gorman, III et al. |
20140358224 | December 4, 2014 | Tegels et al. |
20150142100 | May 21, 2015 | Morriss et al. |
20150157458 | June 11, 2015 | Thambar et al. |
20150173896 | June 25, 2015 | Richter et al. |
20150173897 | June 25, 2015 | Raanani et al. |
20150196390 | July 16, 2015 | Ma |
20150250588 | September 10, 2015 | Yang et al. |
20150272730 | October 1, 2015 | Melnick |
20150272734 | October 1, 2015 | Sheps et al. |
20150320556 | November 12, 2015 | Levi et al. |
20150327994 | November 19, 2015 | Morriss et al. |
20150351903 | December 10, 2015 | Morriss et al. |
20150351904 | December 10, 2015 | Cooper et al. |
20160030169 | February 4, 2016 | Shahriari |
20160030171 | February 4, 2016 | Quijano |
20160220367 | August 4, 2016 | Barrett |
20160310268 | October 27, 2016 | Oba |
20160317305 | November 3, 2016 | Pelled et al. |
20160324635 | November 10, 2016 | Vidlund et al. |
20160374801 | December 29, 2016 | Jimenez et al. |
20160374802 | December 29, 2016 | Levi et al. |
20170049435 | February 23, 2017 | Sauer |
20170056166 | March 2, 2017 | Ratz et al. |
20170100236 | April 13, 2017 | Robertson |
20170135816 | May 18, 2017 | Lashinski et al. |
20170189174 | July 6, 2017 | Braido et al. |
20170333187 | November 23, 2017 | Hariton et al. |
20180000580 | January 4, 2018 | Wallace et al. |
20180014930 | January 18, 2018 | Hariton |
20180021129 | January 25, 2018 | Peterson et al. |
20180098850 | April 12, 2018 | Rafiee |
20180116790 | May 3, 2018 | Ratz |
20180116843 | May 3, 2018 | Schreck et al. |
20180125644 | May 10, 2018 | Conklin |
20180132999 | May 17, 2018 | Perouse |
20180153687 | June 7, 2018 | Hariton et al. |
20180161159 | June 14, 2018 | Lee |
20180206983 | July 26, 2018 | Noe et al. |
20180243086 | August 30, 2018 | Barbarino |
20180250126 | September 6, 2018 | O'connor et al. |
20180250147 | September 6, 2018 | Syed |
20180296333 | October 18, 2018 | Dixon |
20180296336 | October 18, 2018 | Cooper et al. |
20180344457 | December 6, 2018 | Gross et al. |
20180353294 | December 13, 2018 | Calomeni et al. |
20190000613 | January 3, 2019 | Delgado |
20190015200 | January 17, 2019 | Delgado |
20190021852 | January 24, 2019 | Delgado |
20190053896 | February 21, 2019 | Adamek-Bowers et al. |
20190060060 | February 28, 2019 | Chau et al. |
20190060068 | February 28, 2019 | Cope et al. |
20190060070 | February 28, 2019 | Groothuis et al. |
20190069997 | March 7, 2019 | Ratz et al. |
20190083261 | March 21, 2019 | Perszyk |
20190105153 | April 11, 2019 | Barash et al. |
20190117391 | April 25, 2019 | Humair |
20190167423 | June 6, 2019 | Hariton et al. |
20190175339 | June 13, 2019 | Vidlund |
20190183639 | June 20, 2019 | Moore |
20190192295 | June 27, 2019 | Spence |
20190216602 | July 18, 2019 | Lozonschi |
20190350701 | November 21, 2019 | Adamek-Bowers et al. |
20190365530 | December 5, 2019 | Hoang et al. |
20190388218 | December 26, 2019 | Vidlund et al. |
20190388220 | December 26, 2019 | Vidlund et al. |
20200000579 | January 2, 2020 | Manash et al. |
20200015964 | January 16, 2020 | Noe et al. |
20200060818 | February 27, 2020 | Geist et al. |
20200085578 | March 19, 2020 | Kislev et al. |
20200281723 | September 10, 2020 | Harari et al. |
20200405486 | December 31, 2020 | Kislev et al. |
20210113331 | April 22, 2021 | Quadri |
20210137680 | May 13, 2021 | Kizuka |
20210259835 | August 26, 2021 | Tyler, II |
103974674 | August 2014 | CN |
0170262 | February 1986 | EP |
1264582 | December 2002 | EP |
1637092 | March 2006 | EP |
2349124 | October 2018 | EP |
3583922 | December 2019 | EP |
3270825 | April 2020 | EP |
2485795 | September 2020 | EP |
844190 | August 1960 | GB |
S53152790 | December 1978 | JP |
20010046894 | June 2001 | KR |
1998/043557 | October 1998 | WO |
01/82832 | November 2001 | WO |
2004028399 | April 2004 | WO |
2006007389 | January 2006 | WO |
2006128193 | November 2006 | WO |
2007047488 | April 2007 | WO |
2010/006627 | January 2010 | WO |
2010027485 | March 2010 | WO |
2010/057262 | May 2010 | WO |
2011144351 | November 2011 | WO |
2012/048035 | April 2012 | WO |
2013/021374 | February 2013 | WO |
2013/021375 | February 2013 | WO |
2013/059747 | April 2013 | WO |
2013/072496 | May 2013 | WO |
2013/078497 | June 2013 | WO |
2013114214 | August 2013 | WO |
2013/175468 | November 2013 | WO |
2014076696 | May 2014 | WO |
2014/115149 | July 2014 | WO |
2014144937 | September 2014 | WO |
2014/164364 | October 2014 | WO |
2016/016899 | February 2016 | WO |
2016/125160 | August 2016 | WO |
2018/025263 | February 2018 | WO |
2018/029680 | February 2018 | WO |
2018/039631 | March 2018 | WO |
2019/026059 | February 2019 | WO |
2019/030753 | February 2019 | WO |
2019027507 | February 2019 | WO |
2019/077595 | April 2019 | WO |
2019/116369 | June 2019 | WO |
2019/138400 | July 2019 | WO |
2019/195860 | October 2019 | WO |
2019/202579 | October 2019 | WO |
2020/058972 | March 2020 | WO |
2020/165889 | August 2020 | WO |
- An International Preliminary Report on Patentability dated Oct. 20, 2020, which issued during the prosecution of Applicant's PCT/IL2019/050142.
- An Office Action summarized English translation and Search Report dated Nov. 25, 2020, which issued during the prosecution of Chinese Patent Application No. 201910449820.1.
- An International Search Report and a Written Opinion both dated Jan. 28, 2020, which issued during the prosecution of Applicant's PCT/IL2019/051031.
- An Office Action dated Sep. 9, 2021, which issued during the prosecution of U.S. Appl. No. 16/768,909.
- Notice of Allowance dated May 26, 2021, which issued during the prosecution of U.S. Appl. No. 16/135,599.
- Office Action dated Oct. 14, 2021, which issued during the prosecution of U.S. Appl. No. 16/680,739.
- An Office Action dated Oct. 21, 2021, which issued during the prosecution of U.S. Appl. No. 17/335,845.
- European Search Report dated Oct. 11, 2021 which issued during the prosecution of Applicant's European App No. 21176010.3.
- Fann, James I., et al. “Beating heart catheter-based edge-to-edge mitral valve procedure in a porcine model: efficacy and healing response.” Circulation 110.8 (2004): 988-993.
- Feldman, Ted, et al. “Percutaneous mitral repair with the MitraClip system: safety and midterm durability in the initial EVEREST (Endovascular Valve Edge-to-Edge Repair Study) cohort.” Journal of the American College of Cardiology 54.8 (2009): 686-694.
- IPR2021-00383 Patent Owner's Contingent Motion to Amend Under 37 C.F.R. 42.121 dated Oct. 13, 2021.
- IPR2021-00383 Patent Owner's Response Pursuant to 37 C.F.R. 42.120 dated Oct. 13, 2021.
- IPR2021-00383 Second Declaration of Dr. Michael Sacks dated Oct. 13, 2021.
- An Office Action dated Oct. 21, 2021, which issued during the prosecution of U.S. Appl. No. 17/306,231.
- Maisano, Francesco, et al. “The evolution from surgery to percutaneous mitral valve interventions: the role of the edge-to-edge technique.” Journal of the American College of Cardiology 58.21 (2011): 2174-2182.
- IPR2021-00383 Deposition of Dr. Ivan Vesely, dated Sep. 22, 2021.
- Cardiovalve Exhibit 2009—Percutaneous Mitral Leaflet Repair: MitraClip® Therapy for Mitral Regurgitation (2012).
- Feldman, Ted, et al. “Percutaneous mitral valve repair using the edge-to-edge technique: six-month results of the EVEREST Phase I Clinical Trial.” Journal of the American College of Cardiology 46.11 (2005): 2134-2140.
- An Office Action summarized English translation and Search Report dated Oct. 8, 2021, which issued during the prosecution of Chinese Patent Application No. 201780061210.3.
- An Office Action dated Nov. 4, 2021, which issued during the prosecution of U.S. Appl. No. 17/366,711.
- An Office Action summarized English translation and Search Report dated Aug. 12, 2021, which issued during the prosecution of Chinese Patent Application No. 201880058940.2.
- Maisano, F., et al. “The edge-to-edge technique: a simplified method to correct mitral insufficiency.” European journal of cardio-thoracic surgery 13.3 (1998): 240-246.
- Fucci, C., et al. “Improved results with mitral valve repair using new surgical techniques.” European journal of cardio-thoracic surgery 9.11 (1995): 621-627.
- Notice of Allowance dated Dec. 22, 2017, which issued during the prosecution of U.S. Appl. No. 15/788,407.
- An International Search Report and a Written Opinion both dated Jun. 20, 2018, which issued during the prosecution of Applicant's PCT/IL2018/050024.
- An International Preliminary Report on Patentability dated Apr. 21, 2020, which issued during the prosecution of Applicant's PCT/IL2018/050024.
- An International Search Report and a Written Opinion both dated Nov. 9, 2018, which issued during the prosecution of Applicant's PCT/IL2018/050869.
- An International Search Report and a Written Opinion both dated May 13, 2019, which issued during the prosecution of Applicant's PCT/IL2018/051350.
- An International Search Report and a Written Opinion both dated Apr. 25, 2019, which issued during the prosecution of Applicant's PC7T/IL2019/050142.
- An International Search Report and a Written Opinion both dated Jan. 25, 2019, which issued during the prosecution of Applicant's PCT/IL2018/051122.
- An International Search Report and a Written Opinion both dated Dec. 5, 2018, which issued during the prosecution of Applicant's PCT/IL2018/050725.
- An International Preliminary Report on Patentability dated Feb. 12, 2019, which issued during the prosecution of Applicant's PCT/IL2017/050873.
- An International Preliminary Report on Patentability dated Feb. 5, 2019, which issued during the prosecution of Applicant's PCT/IL2017/050849.
- An Office Action dated Mar. 25, 2019, which issued during the prosecution of European Patent Application No. 14710060.6.
- An Office Action dated Oct. 25. 2018, which issued during the prosecution of U.S. Appl. No. 14/763,004.
- An Office Action dated Mar. 4, 2019, which issued during the prosecution of U.S. Appl. No. 14/763,004.
- An Office Action dated Jan. 9, 2019, which issued during the prosecution of U.S. Appl. No. 15/329,920.
- An Office Action dated Jan. 30, 2019, which issued during the prosecution of U.S. Appl. No. 15/872,501.
- An Office Action dated May 14, 2020, which issued during the prosecution of U.S. Appl. No. 16/132,937.
- An Office Action dated Feb. 5, 2019, which issued during the prosecution of U.S. Appl. No. 15/899,858.
- An Office Action dated May 23, 2019, which issued during the prosecution of U.S. Appl. No. 15/668,659.
- An Office Action dated May 1, 2019, which issued during the prosecution of U.S. Appl. No. 15/691,032.
- An Office Action dated Mar. 16, 2019, which issued during the prosecution of U.S. Appl. No. 15/433,547.
- An Office Action dated Aug. 1, 2019, which issued during the prosecution of U.S. Appl. No. 15/668,559.
- An Office Action dated Jun. 25, 2019, which issued during the prosecution of U.S. Appl. No. 15/329,920.
- An Office Action dated Nov. 1, 2019, which issued during the prosecution of U.S. Appl. No. 15/872,501.
- An Office Action dated Aug. 16, 2019, which issued during the prosecution of U.S. Appl. No. 15/668,659.
- An Office Action dated Jun. 19, 2019 which issued during the prosecution of U.S. Appl. No. 15/682,789.
- An Office Action dated Jun. 14, 2019, which issued during the prosecution of U.S. Appl. No. 15/703,385.
- An Office Action dated Oct. 4, 2019, which issued during the prosecution of U.S. Appl. No. 16/183,140.
- An Office Action dated Sep. 13, 2019, which issued during the prosecution of U.S. Appl. No. 16/460,313.
- An Office Action dated Nov. 26, 2019, which issued during the prosecution of U.S. Appl. No. 16/532,945.
- An Office Action dated Jun. 13, 2019, which issued during the prosecution of U.S. Appl. No. 16/388,038.
- An Office Action dated Jan. 6, 2020, which issued during the prosecution of U.S. Appl. No. 16/660,231.
- Notice of Allowance dated Oct. 19, 2020, which issued during prosecution of U.S. Appl. No. 16/937,216.
- An Office Action dated Aug. 13, 2019, which issued during the prosecution of UK Patent Application No. 1901887.8.
- An Office Action dated Dec. 31, 2019, which issued during the prosecution of U.S. Appl. No. 16/183,140.
- An Office Action dated Jan. 14, 2020, which issued during the prosecution of U.S. Appl. No. 16/284,331.
- Notice of Allowance dated Jan. 13, 2020, which issued during the prosecution of U.S. Appl. No. 15/956,956.
- European Search Report dated Mar. 5, 2020 which issued during the prosecution of Applicant's European App No. 17752184.6.
- European Search Report dated Mar. 4, 2020 which issued during the prosecution of Applicant's European App No. 167069137.7.
- Notice of Allowance dated Mar. 12, 2020, which issued during the prosecution of U.S. Appl. No. 16/460,313.
- An Office Action dated Jan. 9, 2020, which issued during the prosecution of U.S. Appl. No. 15/600,190.
- An Office Action dated Jan. 3, 2020, which issued during the prosecution of U.S. Appl. No. 16/678,355.
- An Office Action dated Feb. 6, 2020, which issued during the prosecution of U.S. Appl. No. 15/668,659.
- An Office Action dated Sep. 24, 2020, which issued during the prosecution of U.S. Appl. No. 16/811,732.
- Symetis S.A.: “ACURATE neo™ Aortic Bioprosthesis for Implantation using the ACURATE neo™ TA Transapical Delivery System in Patients with Severe Aortic Stenosis,” Clinical Investigation Plan, Protocol No. 2015-01, Vs. No. 2, 2015:1-76.
- An Office Action dated Nov. 30, 2020, which issued during the prosecution of U.S. Appl. No. 16/138,129.
- Notice of Allowance dated Nov. 19, 2020, which issued during the prosecution of U.S. Appl. No. 16/318,025.
- An Office Action dated Oct. 5, 2020, which issued during the prosecution of Canadian Patent Application No. 2,973,940.
- European Search Report dated May 7, 2021 which issued during the prosecution of Applicant's European App No. 18700954.3.
- Sündermann, Simon H., et al. “Feasibility of the Engager™ aortic transcatheter valve system using a flexible over-the-wire design.” European Journal of Cardio-Thoracic Surgery 42.4 (2012): e48-e52.
- Serruys, P. W., Piazza, N., Cribier, A., Webb, J., Laborde, J. C., & de Jaegere, P. (Eds.). (2009). Transcatheter aortic valve implantation: tips and tricks to avoid failure. CRC Press.—Screenshots from Google Books downloaded from: https://books.google.co.il/books?id=FLzLBQAAQBAJ&1pg=PA198&ots=soqWrDH-y_&dq=%20%22Edwards%20SAPIEN%22&1r&pg=PA20#v=onepage&q=%22Edwards%20SAPIEN%22&f=false ; Downloaded on Jun. 18, 2020.
- Notice of Allowance dated May 7, 2020, which issued during the prosecution of U.S. Appl. No. 16/637,166.
- An Office Action dated Aug. 7, 2020, which issued during the prosecution of U.S. Appl. No. 15/668,659.
- Notice of Allowance dated Jul. 29, 2020, which issued during the prosecution of U.S. Appl. No. 16/132,937.
- Notice of Allowance dated Sep. 10, 2020, which issued during the prosecution of U.S. Appl. No. 15/600,190.
- An Office Action dated Jul. 29, 2020, which issued during the prosecution of U.S. Appl. No. 16/269,328.
- Notice of Allowance dated Aug. 26, 2020, which issued during the prosecution of U.S. Appl. No. 16/269,328.
- An Office Action dated Jul. 14, 2020, which issued during the prosecution of U.S. Appl. No. 16/324,339.
- Notice of Allowance dated Aug. 28, 2020, which issued during the prosecution of U.S. Appl. No. 16/324,339.
- An Office Action summarized English translation and Search Report dated Jul. 3, 2020, which issued during the prosecution of Chinese Patent Application No. 201780061210.3.
- Tchetche, D. and Nicolas M. Van Mieghem: “New-generation TAVI devices: description and specifications” EuroIntervention, 2014, No. 10:U90-U100.
- An International Search Report and a Written Opinion both dated Jun. 24, 2020, which issued during the prosecution of Applicant's PCT/IL2019/051398.
- Notice of Allowance dated Feb. 9, 2021, which issued during the prosecution of U.S. Appl. No. 16/937,216.
- Notice of Allowance dated Dec. 23, 2020 which issued during the prosecution of U.S. Appl. No. 16/937,216.
- Notice of Allowance dated Mar. 31, 2021, which issued during the prosecution of U.S. Appl. No. 16/756,235.
- Notice of Allowance dated Mar. 22, 2021, which issued during the prosecution of U.S. Appl. No. 16/756,235.
- An International Search Report and a Written Opinion both dated Feb. 23, 2021, which issued during the prosecution of Applicant's PCT/IL2020/050315.
- An International Preliminary Report on Patentability dated Mar. 9, 2021, which issued during the prosecution of Applicant's PCT/IL2019/051031.
- European Search Report dated Jun. 10, 2021 which issued during the prosecution of Applicant's European App No. 21157988.3.
- An Invitation to pay additional fees dated May 19, 2021, which issued during the prosecution of Applicant's PCT/IL2021/050132.
- An International Search Report and a Written Opinion both dated Jul. 12, 2021, which issued during the prosecution of Applicant's PCT/IL2021/050132.
- IPR2021-00383 Petitioners' Authorized Reply to Patent Owner's Preliminary Response dated May 27, 2021.
- Exhibit 1014—Transcript of proceedings held May 20, 2021 (Edwards Lifesciences vs. Cardiovalve).
- Exhibit 1015—Facilitate, Meriam-Webster.com, https://www.merriamwebster.com/dictionary/facilitate (visited May 26, 2021).
- Patent Owner's Authorized Surreply to Petitioner's Reply to Patent Owner's Preliminary Response dated Jun. 4, 2021 (Edwards Lifesciences vs. Cardiovalve).
- An Office Action dated Aug. 18, 2021, which issued during the prosecution of U.S. Appl. No. 17/210,183.
- Institution decision dated Jul. 20, 2021 (Edwards Lifesciences vs. Cardiovalve).
- Petitioners' Opposition to Patent Owner's Contingent Motion to Amend, Filed Jan. 5, 2022, Edwards Lifesciences Corporation and Edwards Lifesciences LLC v. Cardiovalve Ltd., IPR2021-00383, 32 pages.
- Petitioners' Reply to Patent Owner's Reponse, Filed Jan. 5, 2022, Edwards Lifesciences Corporation and Edwards Lifesciences LLC v. Cardiovalve Ltd., IPR2021-00383, 41 pages.
- Notice of Allowance dated Dec. 6, 2021, issued for U.S. Appl. No. 16/738,516, 30 pages.
- Notice of Allowance dated Dec. 29, 2021, issued for U.S. Appl. No. 17/210,183, 13 pages.
- Notice of Allowance dated Dec. 7, 2021, issued for U.S. Appl. No. 17/394,807, 115 pages.
- Non-Final Office Action dated Jan. 12, 2022, issued for U.S. Appl. No. 17/101,787, 17 pages.
- European Patent Office Communication pursuant to Rule 164(2)(b) and Article 94(3) EPC for App. No. EP18826823.9, dated Nov. 25, 2021, 14 pages.
- European Patent Office Communication pursuant to Article 94(3) EPC for App. No. EP20714289.4, dated Sep. 22, 2021, 5 pages.
- Decision Granting Institution of Inter Partes Review 35 USC 314, dated Dec. 10, 2021, Edwards Lifesciences Corporation and Edwards Lifesciences LLC v. Cardiovalve Ltd., IPR2021-00383, 42 pages.
- English translation of Chinese Office Action issued for CN201880064313.X, dated Jan. 6, 2022, 3 pages.
- Office Action (Notice of Allowance and Fees Due (PTOL-85)) dated Mar. 4, 2022 for U.S. Appl. No. 16/768,909 (pp. 1-29).
- Office Action (Notice of Allowance and Fees Due (PTOL-85)) dated Mar. 22, 2022 for U.S. Appl. No. 17/366,711 (pp. 1-10).
- Office Action (Notice of Allowance and Fees Due (PTOL-85)) dated Jan. 31, 2022 for U.S. Appl. No. 17/479,418 (pp. 1-194).
- Office Action (Non-Final Rejection) dated Jan. 24, 2022 for U.S. Appl. No. 16/135,466 (pp. 1-8).
- Office Action (Non-Final Rejection) dated Dec. 9, 2021 for U.S. Appl. No. 16/135,969 (pp. 1-11).
- Office Action (Non-Final Rejection) dated Mar. 18, 2022 for U.S. Appl. No. 16/746,489 (pp. 1-9).
- Office Action (Non-Final Rejection) dated Jan. 26, 2022 for U.S. Appl. No. 16/888,210 (pp. 1-7).
- Office Action (Non-Final Rejection) dated Apr. 11, 2022 for U.S. Appl. No. 17/473,472 (pp. 1-7).
- USPTO Before the Patent Trial and Appeal Board Edwards Lifesciences Corporation and Edwards Lifesciences LLC, Petitioner, v. Cardiovalve Ltd., Patent Owner. IPR2021-00383 U.S. Pat. No. 10,226,341 B2, Preliminary Guidance Patent Owner's Motion to Amend, Entered: Jan. 31, 2022, (pp. 1-10).
Type: Grant
Filed: May 4, 2021
Date of Patent: Nov 8, 2022
Patent Publication Number: 20210251759
Assignee: CARDIOVALVE LTD. (Or Yehuda)
Inventors: Yonatan Kislev (Rosh Ha'ayin), Or Cohen (Tel Aviv), Meni Iamberger (Kfar Saba)
Primary Examiner: Joshua L Schwartz
Application Number: 17/307,176
International Classification: A61F 2/24 (20060101);