Method for observing a sample for identification purposes and associated devices
Patent Information
- Application Number
- FR2023009835
- Authority / Receiving Office
- FR · FR
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-09-18
- Publication Date
- 2025-03-21
Smart Images

Figure 00000000_0000_ABST
Abstract
Description
Title of the invention: Method for observing a sample for identification purposes and associated devices
[0001] The present invention relates to an observation method and associated devices.
[0002] The invention falls within the field of microbiology and, more specifically, that the identification of biological organisms and the study of the interaction of organisms with an environment.
[0003] It is known to culture organisms on specific media. These media are agar nutrient media. These media make it possible to increase the number of organisms sampled, either specifically or by obtaining a spatial separation of the different types of organisms making up the sample. Specific amplification is obtained by the presence of inhibitors promoting the growth of certain organisms to the detriment of others. Spatial isolation of different types of organisms is only obtained in the case of a polymicrobial sample.
[0004] One of the disadvantages of culture on such media is the time involved in obtaining from a single organism a set of organisms that can be observed and sampled by a human operator. This generally requires around twenty generations, or a relatively long time of at least 24 hours.
[0005] There is therefore a need for a method for observing organisms that is quick and robust to implement.
[0006] For this purpose, the description describes a method of observing a sample, the sample comprising:
[0007] - a set of organisms, and
[0008] - a solid substrate supporting the set of organisms,
[0009] the method being implemented by an observation system comprising a lensless imaging unit and the method comprising:
[0010] - a phase of obtaining images of the sample, the obtaining phase comprising, for each image obtained, a step of:
[0011] - acquisition of a set of images of a part of the sample, each image acquired being called an image, each image having an overlapping area with at least one other image and each area of the sample being visible in at least one image,
[0012] - a step of determining a transformation to be applied to each image to correct both translation and rotation offsets using overlap zones, to obtain a transformation specific to each image,
[0013] - a step of applying the transformation to each image to obtain corrected thumbnails, and
[0014] - a step of merging the thumbnails to obtain the image of the sample, and
[0015] - an image analysis phase, the analysis phase comprising:
[0016] - a step of determining at least one characteristic relating to the set of organisms by analysis of at least one of the images obtained.
[0017] According to particular embodiments, the observation method has one or more of the following characteristics, taken in isolation or in all technically possible combinations:
[0018] - the observation system comprises a sample storage space, the unit imaging comprising an optical sensor for which an acquisition zone is defined, the acquisition phase further comprising, for each image obtained, a step of transporting the sample from the storage space to the acquisition zone for the implementation of the acquisition step and a step of transporting the sample to the storage space after the implementation of the acquisition step.
[0019] - the two transport stages are implemented by a robotic arm equipped with gripping pliers.
[0020] - for each pair of neighboring images the determination step includes the determination minimizing the distortion between two neighboring images, determining the translational shift between the two overlapping areas of the neighboring images, determining an affine transformation allowing the transition from the overlapping area of the first image to the second image of the two neighboring images and determining the transformation function to be applied to each image to minimize the distortions between each image.
[0021] - determining the transformation function to be applied to each image to minimize distortions between each image involves solving an overdetermined linear optimization problem.
[0022] - during the merging step, each overlapping area of the image is an average overlapping areas of the corresponding corrected images.
[0023] - during the acquisition step, the images are acquired along successive lines cessives to cover the entire sample.
[0024] - during the acquisition step, the number of acquired images is between 12 and 15.
[0025] - the solid substrate is capable of growing at least part of the assembly of organisms and the sample comprises at least one area in which the substrate comprises an antibiotic, the characteristic determined in the determining step being the sensitivity of an organism to the antibiotic.
[0026] - the sensitivity of the organism to the antibiotic is obtained by determining a characteristic dimension of the inhibition circle associated with the growth of at least part of the set of organisms on the area in which the substrate comprises an antibiotic, the determination comprising a step of extracting the contours of the inhibition circle and estimating the characteristic dimension from the extracted contours.
[0027] - a bacterial carpet is defined for the sample, the analysis phase comprising a step of obtaining the bacterial mat, the determination step using the bacterial mat obtained to determine at least one characteristic relating to the set of organisms.
[0028] - the time interval between each obtaining of an image during the implementation of the obtaining phase is adjustable.
[0029] - the time interval depends on at least one determined characteristic.
[0030] - the value resulting from the probabilities is the maximum value of the calculated probabilities.
[0031] - the organisms are organized into colonies, the observation method comprising, in furthermore, a colony detection phase to detect colonies and locate them, the neural network of the calculation stage also taking as input the location of at least one colony.
[0032] - the analysis phase comprises a step of determining at least one property relating to the detected colonies and a colony selection step to obtain selected colonies, the obtaining step being implemented only for the selected colonies.
[0033] - a plurality of organisms correspond to the same species, the step of determining mination involving the implementation of an aggregation function of the different probabilities found for each of the organisms.
[0034] - the aggregation function gives as species for the plurality of organisms the maximum of all probabilities.
[0035] - the aggregation function gives as species for the plurality of organisms the species for which the sum over each organism of the probabilities that the organism belongs to the species is maximum
[0036] - during the calculation step, the neural network is a classi neural network multi-class affiliation.
[0037] - a phylogenetic tree was defined for the neural network, the phylo tree genetics comprising a set of nodes distributed according to at least two phylogenetic levels, the lowest phylogenetic level being the species, the nodes being linked together when there is a phylogenetic link between them, the verification step comprising the calculation of a probability for each node from the probabilities calculated in the calculation step and the verification of the conformity condition for each node.
[0038] - during the determination step, the information determined is the membership of the lowest phylogenetic level meeting a conformity condition.
[0039] - the phylogenetic levels are chosen from the list consisting of the phyllum, the class, order, family and gender.
[0040] - the number of phylogenetic levels is greater than or equal to 4.
[0041] - the predefined threshold has a value between 0.7 and 0.9.
[0042] The description also describes a method of observing a sample, the sample comprising:
[0043] - a set of organisms,
[0044] - a solid substrate supporting the set of organisms,
[0045] the method being implemented by an observation system comprising a lensless imaging unit and the method comprising:
[0046] - a phase of obtaining images of the sample,
[0047] - an image analysis phase, the analysis phase comprising:
[0048] - a step of calculating the probability that at least one organism belongs to a predefined species, the calculation step comprising applying a neural network to at least one image to obtain the probability that said at least one organism (18) belongs to a predefined species, the predefined species being the set of species that the neural network has been trained to identify in an image,
[0049] - a step of verifying that a reliability condition of the probabilities obtained is filled by comparing at least one value from the probabilities obtained with a predefined threshold, and
[0050] - a step of determining at least one piece of information relating to the identity of the least one organism, the information being membership in a species not included in the predefined species or when the reliability condition is not met.
[0051] According to particular embodiments, the observation method has one or more of the following characteristics, taken in isolation or in all technically possible combinations:
[0052] - the observation system comprises a sample storage space, the unit imaging comprising an optical sensor for which an acquisition zone is defined, the acquisition phase further comprising, for each image obtained, a step of transporting the sample from the storage space to the acquisition zone for the implementation of the acquisition step and a step of transporting the sample to the storage space after the implementation of the acquisition step.
[0053] - the two transport stages are implemented by a robotic arm equipped with gripping pliers.
[0054] - for each pair of neighboring images the determination step includes the determination minimizing the distortion between two neighboring images, determining the translational shift between the two overlapping areas of the neighboring images, determining an affine transformation allowing the transition from the overlapping area of the first image to the second image of the two neighboring images and determining the transformation function to be applied to each image to minimize the distortions between each image.
[0055] - determining the transformation function to be applied to each image to minimize distortions between each image involves solving an overdetermined linear optimization problem.
[0056] - during the merging step, each overlapping area of the image is an average overlapping areas of the corresponding corrected images.
[0057] - during the acquisition step, the images are acquired along successive lines cessives to cover the entire sample.
[0058] - during the acquisition step, the number of acquired images is between 12 and 15.
[0059] - the solid substrate is capable of growing at least part of the assembly of organisms and the sample comprises at least one area in which the substrate comprises an antibiotic, the characteristic determined in the determining step being the sensitivity of an organism to the antibiotic.
[0060] - the sensitivity of the organism to the antibiotic is obtained by determining a characteristic dimension of the inhibition circle associated with the growth of at least part of the set of organisms on the area in which the substrate comprises an antibiotic, the determination comprising a step of extracting the contours of the inhibition circle and estimating the characteristic dimension from the extracted contours.
[0061] - a bacterial carpet is defined for the sample, the analysis phase comprising a step of obtaining the bacterial mat, the determination step using the bacterial mat obtained to determine at least one characteristic relating to the set of organisms.
[0062] - the time interval between each obtaining of an image during the implementation of the obtaining phase is adjustable.
[0063] - the time interval depends on at least one determined characteristic.
[0064] - the value resulting from the probabilities is the maximum value of the calculated probabilities.
[0065] - the organisms are organized into colonies, the observation method comprising, in furthermore, a colony detection phase to detect colonies and locate them, the neural network of the calculation stage also taking as input the location of at least one colony.
[0066] - the analysis phase comprises a step of determining at least one property relating to the detected colonies and a colony selection step to obtain selected colonies, the obtaining step being implemented only for the selected colonies.
[0067] - a plurality of organisms correspond to the same species, the step of determining mination involving the implementation of an aggregation function of the different probabilities found for each of the organisms.
[0068] - the aggregation function gives as species for the plurality of organisms the maximum of all probabilities.
[0069] - the aggregation function gives as species for the plurality of organisms the species for which the sum over each organism of the probabilities that the organism belongs to the species is maximum
[0070] - during the calculation step, the neural network is a classi neural network multi-class affiliation.
[0071] - a phylogenetic tree was defined for the neural network, the phylo tree genetics comprising a set of nodes distributed according to at least two phylogenetic levels, the lowest phylogenetic level being the species, the nodes being linked together when there is a phylogenetic link between them, the verification step comprising the calculation of a probability for each node from the probabilities calculated in the calculation step and the verification of the conformity condition for each node.
[0072] - during the determination step, the information determined is the membership of the lowest phylogenetic level meeting a conformity condition.
[0073] - the phylogenetic levels are chosen from the list consisting of the phyllum, the class, order, family and gender.
[0074] - the number of phylogenetic levels is greater than or equal to 4.
[0075] - the predefined threshold has a value between 0.7 and 0.9.
[0076] The description also relates to a system for observing a sample, the sample comprising:
[0077] - a set of organisms, and
[0078] - a substrate supporting the set of organisms,
[0079] the observation system comprising a lensless imaging unit and the observation system being capable of:
[0080] - obtaining images of the sample, the observation system being suitable for, for each image obtained:
[0081] - acquire a set of images of a portion of the sample, each acquired image being called a thumbnail, each thumbnail having an overlapping area with at least one other thumbnail and each area of the sample being visible in at least a thumbnail image,
[0082] - determine a transformation to apply to each image to correct both translation and rotation offsets using overlap zones, to obtain a transformation specific to each image,
[0083] - apply the transformation to each image to obtain corrected images, And
[0084] - merge the thumbnails to obtain the image of the sample, and
[0085] - analyze the images, the observation system being, during this analysis, suitable for:
[0086] - determine at least one characteristic relating to the set of organisms by analysis of at least one of the images obtained.
[0087] The description also relates to a system for observing a sample, the sample comprising:
[0088] - a set of organisms, and
[0089] - a solid substrate supporting the set of organisms,
[0090] the observation system comprising a lensless imaging unit and suitable for:
[0091] - obtain images of the sample,
[0092] - analyze the images, the analysis comprising:
[0093] - the calculation of the probability that at least one organism belongs to a species predefined, the calculation comprising the application of a neural network to at least one image to obtain the probability that said at least one organism belongs to a predefined species, the predefined species being the set of species that the neural network has been trained to identify in an image,
[0094] - verification that a reliability condition of the probabilities obtained is fulfilled by comparing at least one value from the probabilities obtained with a predefined threshold, and
[0095] - the determination of at least one piece of information relating to the identity of the at least one organism, the information being membership in a species not included in the predefined species when the reliability condition is not met.
[0096] According to particular embodiments, the observation system further comprises an element for regulating the environment of the observation system.
[0097] The description also relates to a sample intended for an observation system as previously described, the sample comprising:
[0098] - a set of organisms, and
[0099] - a solid substrate supporting the set of organisms, the solid substrate being suitable for growing at least part of the set of organisms and comprising at least one zone in which the substrate comprises an antibiotic in the form of a pellet having a characteristic dimension less than or equal to 6 millimeters.
[0100] According to particular embodiments, the sample has one or more of the following characteristics, taken in isolation or in all technically possible combinations:
[0101] - the sample has a wall provided with gripping members.
[0102] - the characteristic dimension of the pellet is greater than or equal to 1 millimeter.
[0103] - the characteristic dimension of the pellet is less than or equal to 2 millimeters.
[0104] In the present description, the expression “suitable for” means indifferently “adapted for”, “adapted to” or “configured for”.
[0105] Furthermore, in all that follows, by the expression "between two values", is meant a framework in the broad sense, that is to say including the values of the limits.
[0106] Characteristics and advantages of the invention will appear on reading the description which follows, given solely by way of non-limiting example, and made with reference to the appended drawings, in which:
[0107] - [Fig.l] [Fig.l] is a schematic representation of an observation system,
[0108] - [Fig.2] [Fig.2] is two top and side views of an example sample,
[0109] - [Fig.3] [Fig.3] is a schematic representation of part of the system observation of [Fig.l],
[0110] - [Fig.4] [Fig.4] is a flowchart of an example of implementation of a part of an observation process,
[0111] - [Fig.5] [Fig.5] schematically illustrates a first acquisition strategy allowing the entire Petri dish to be covered (case with 12 images),
[0112] - [Fig.6] [Fig.6] schematically represents all the images obtained by the implementation of the first acquisition strategy,
[0113] - [Fig.7] [Fig.7] schematically illustrates a first acquisition strategy allowing the entire Petri dish to be covered (case with 15 images),
[0114] - [Fig.8] [Fig.8] illustrates three images schematically illustrating how to use overlapping zones to obtain the translation distortion between two images,
[0115] - [Fig.9] [Fig.9] represents two images, one obtained without implementing a step of the process of [Fig.4] and the other with implementation of this step,
[0116] - [Fig. 10] [Fig. 10] is a flowchart of an example of implementation of a part of an observation process,
[0117] - [Fig. 11] [Fig. 11] is a schematic representation of a sample comprising antibiotic tablets,
[0118] - [Fig. 12] [Fig. 12] is a flowchart of another example implementation of a part of an observation process,
[0119] - [Fig. 13] [Fig. 13] is a representation of an example of a phylogenetic tree, and
[0120] - [Fig. 14] [Fig. 14] is a representation of another example of a phylo tree genetic.
[0121] In the following, the notions of “upstream” and “downstream” are defined with reference to the direction of propagation of the light.
[0122] [Fig.l] illustrates an observation system 10 allowing the observation of a sample 12.
[0123] Such a sample 12 is visible in the two representations of [Fig.2].
[0124] The sample 12 comprises a set of organisms 14 and a solid substrate 16 supporting the set of organisms 14.
[0125] Depending on the case, an organism 18 of the set of organisms 14 is acellular or cellular.
[0126] Among cellular organisms, prokaryotic organisms and eukaryotic organisms are usually distinguished.
[0127] Archaea (also called archaebacteria) and bacteria are examples of prokaryotic organisms.
[0128] Eukaryotic organisms are either unicellular or multicellular. For example, protozoa, amoebas, algae or yeasts are unicellular eukaryotic organisms.
[0129] Multicellular eukaryotic organisms are cells derived from, for example, human and non-human mammals, fungi, plants, protists or chromists.
[0130] For simplification, the terms bacteria or bacterial culture are used in the remainder of the document, but what is described can be transposed without problem to fungi or germs and more generally any organism 18 capable of growing on the substrate 16.
[0131] The substrate 16 is capable of growing at least a portion of the set of organisms 14. Thus, the substrate 16 is itself a culture medium or is placed in contact with a culture medium.
[0132] The substrate 16 is, for example, an agar medium.
[0133] By way of example, the substrate 16 is a Muller-Hinton 2 agar medium (denoted MH2 agar medium in the remainder of the description).
[0134] According to one variant, the substrate 16 serves only as a biological glue.
[0135] For example, substrate 16 comprises polylysine or type I collagen.
[0136] Preferably, the agar medium is chosen to allow the culture of any type of organism 18 while being transparent to allow optical observation of the medium, without diffusing light.
[0137] The agar medium is, for example, a BHI, MH or TSA medium.
[0138] The abbreviation BHI refers to the English term "Brain-Heart Infusion" which literally means heart-brain broth. The BHI medium is a versatile and rich culture medium for growing bacteria.
[0139] The abbreviation MH stands for "Mueller-Hinton". MH medium is a rich agar for bacterial culture. This makes it an ideal candidate for use in performing an antibiogram.
[0140] The abbreviation TSA refers to the English name "Trypticase Soy Agar" which literally means tryptone soy agar. TSA medium is a non-selective and very versatile agar.
[0141] The preceding examples have the advantage of having good optical properties (transparent and non-diffusing) and of being non-selective and therefore suitable for allowing the growth of the most common bacteria.
[0142] The method can also be used with selective agar media, for example if it is desirable to favor the culture of certain species.
[0143] In the example of [Fig.2], the sample 12 is in the form of a Petri dish 20.
[0144] The Petri dish 20 here has a cylindrical shape whose base is a circle.
[0145] This means that the substrate 16 is delimited by the wall of the Petri dish 20 and that This wall forms a cylinder.
[0146] More precisely, the Petri dish 20 has two parts 22 which fit into each other. Each part 22 is a circle extended by side walls 24, one of the parts 22 comprising the substrate 16 and therefore serving as a support while the other serves as a cover making it possible to isolate the substrate 16 and the set of organisms 14 from the external environment.
[0147] The circle of the cylindrical shape has a diameter between 35 millimeters (mm) and 150 mm, most often equal to 90 mm.
[0148] Alternatively, the Petri dish 20 may have a cylindrical shape whose base is a square.
[0149] In such a case, it is common to find squares with a side of 120 mm.
[0150] Furthermore, as seen in [Fig.2] on the right, the Petri dish 20 is inserted into a holding device 25.
[0151] For convenience, the holding device 25 is not shown in the left-hand figure of [Fig.2].
[0152] The holding device 25 has an external cylinder shape and an internal shape having a dimension allowing it to fit onto the Petri dish 20.
[0153] The holding device 25 has gripping members 26.
[0154] The gripping member 26 is, for example, a gripping groove on a projection.
[0155] Without this being limiting, the gripping members 26 are arranged in such a way equally distributed.
[0156] One of the gripping members 26 is provided with a keying device 27.
[0157] The holding device 25 is, for example, manufactured using a 3D printer.
[0158] The presence of these gripping members 26 makes it possible to limit the rotations of the Petri dish 20 during its transport.
[0159] The observation system 10 comprises an incubator 30, a transport unit 32, a lensless imaging unit 34 and an analysis unit 36.
[0160] The incubator 30 is used to store the Petri dishes 20 to be analyzed in a controlled environment. For example, the incubator 30 is suitable for ensuring that the temperature and humidity are within a predefined range.
[0161] The incubator 30 therefore comprises at least one element 37 for regulating an environmental parameter.
[0162] The regulating element 37 is then capable of regulating said environmental parameter (for example, the temperature), in the storage space 38 of the Petri dishes 20.
[0163] Alternatively, the incubator 30 is capable of regulating said environmental parameter throughout the observation system 10.
[0164] According to one example, the parameter is a parameter linked to hygrometry or temperature.
[0165] For illustration, the regulating element 37 is a passive humidity generating unit.
[0166] More particularly, the regulating element 37 is a water container with a paper diffuser, arranged in the incubator 30.
[0167] Such a regulation element 37 makes it possible to maintain a stable and high humidity while the Petri dishes 20 can be opened regularly, for better control (stability) of the morphotype and to avoid drying out of the agar medium.
[0168] Maintaining good humidity thus improves the growth of bacteria and the way in which the bacteria organize themselves within the colony. This also helps to avoid shrinkage of the agar medium, which generates troublesome anisotropic movement of the colonies over time.
[0169] In the schematic example of [Fig.l], the storage space 38 is an open cabinet comprising several housings 39, each housing 39 being suitable for accommodating a Petri dish 20.
[0170] The incubator 30 therefore makes it possible to carry out the simultaneous incubation of a plurality of Petri dishes 20.
[0171] The transport unit 32 is capable of transporting the sample 12 from the incubator 30 to an acquisition zone and of carrying out the transport in the reverse direction.
[0172] In the case where the incubator 30 regulates the entire observation system 10, it will then be understood that the transport unit 32 is capable of transporting the sample 12 from the storage space 38 to an acquisition zone and vice versa.
[0173] The transport unit 32 is here a robotic arm 40 equipped with gripping pliers 41.
[0174] The gripping pliers 41 make it possible to grip the sample 12.
[0175] The robotic arm 40 is capable of performing translations and / or rotations to enable such transport to be carried out and in particular the positioning of the sample 12 in the desired position.
[0176] The lensless imaging unit 34 is capable of obtaining transmission images of the sample 12.
[0177] For this, the lensless imaging unit 34 comprises, from upstream to downstream, a light source 42 and a detector 44.
[0178] However, as a variant or in addition, the lensless imaging unit 34 may include other elements such as a diaphragm or an optical fiber at the output of the light source 42.
[0179] The light source 42 comprises a plurality of light-emitting diodes 46 (often designated by the English acronym LED for “Light Emitting Diode”).
[0180] Each light-emitting diode 46 here provides partially coherent light.
[0181] This means that the light-emitting diode 46 makes it possible to obtain a temporal coherence of the order of 90 nm and a spatial coherence limited by the size of the light-emitting diode 46, typically 200 pm.
[0182] Each light-emitting diode 46 is capable of emitting over a range of wavelengths which is smaller than the size of the organism 18 observed, while allowing the use of conventional detection means. Wavelengths in the visible or near infrared range are then preferred. Alternatively, the wavelength of the laser beam is in a band of different wavelengths. The wavelength depends in particular on the organism 18 to be observed and its sensitivity to illumination by the light source 42.
[0183] As a specific example, the wavelengths used are a wavelength in the red (for example 625 nm), a wavelength in the green (for example 528 nm), a wavelength in the blue (for example 455 nm) and a wavelength in the infrared (for example 940 nm).
[0184] Such wavelengths make it possible to improve the analysis of samples, in particular for the applications described below for obtaining the inhibition circle or identifying organisms 18.
[0185] The wavelengths can be sent simultaneously or sequentially.
[0186] The detector 44 is here formed by a housing 48 protecting a sensor 50.
[0187] According to the example shown, the housing 48 has a parallelepiped shape but other shapes could be envisaged.
[0188] The housing 48 is fixed on an optical table to give it good stability.
[0189] The sensor 50 is here a CMOS type optical sensor.
[0190] The abbreviation CMOS designates a technology for manufacturing electronic components and, by extension, the components manufactured using this technology. The abbreviation comes from the corresponding English name of “Complementary Metal Oxide Semiconductor” literally meaning “Complementary metal oxide semiconductor”.
[0191] The sensor 50 comprises a set of pixels 52. In this sense, the sensor 50 is a matrix photosensor.
[0192] Each pixel 52 has a size between 3 micrometers (pm) and 4 pm, preferably equal to 3.75 pm.
[0193] Furthermore, the sensor 50 has a field of 24 mm by 36 mm.
[0194] Such values correspond to an optical sensor having a large field and good spatial resolution.
[0195] As its name indicates, the lensless imaging unit 34 does not include a magnification optic interposed between the sensor 50 and the light source 42.
[0196] Thus, the images acquired by the sensor 50 are formed by the radiation directly transmitted by the illuminated sample 12.
[0197] The sample 12 is positioned in an acquisition zone defined for the sensor 50 (i.e. in its optical field), at a short distance from the sensor 50, typically at a distance less than a few centimeters, preferably less than 1 centimeter (cm).
[0198] It can be specified that this distance corresponds to the distance between the organisms 14 and the sensor 50. In fact, the Petri dish 20 is placed on the sensor 50 protected by a glass slide.
[0199] The analysis unit 36 is capable of analyzing the images acquired by the imaging unit to obtain information relating to the set of organisms 14.
[0200] The analysis unit 36 is shown more precisely in [Fig.3].
[0201] The analysis unit 36 is capable of interacting with a computer program product to enable the implementation of certain steps of an observation method. The associated steps are therefore steps implemented by computer.
[0202] The analysis unit 36 is here a desktop computer. Alternatively, the analysis unit 36 is a rack-mounted computer, a laptop, a tablet, a personal digital assistant (PDA) or a smartphone.
[0203] In the case of [Fig.3], the analysis unit 36 comprises a calculator 56, a user interface 58 and a communication device 60.
[0204] The calculator 56 is an electronic circuit designed to manipulate and / or transform data represented by electronic or physical quantities in registers of the analysis unit 36 and / or memories into other similar data cor corresponding to physical data in register memories or other types of display devices, transmission devices, or storage devices.
[0205] As specific examples, the computer 56 includes a single-core or multi-core processor (such as a central processing unit (CPU), a graphics processing unit (GPU), a microcontroller, and a digital signal processor (DSP)), a programmable logic circuit (such as an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), a programmable logic device (PLD), and programmable logic arrays (PLAs)), a state machine, a logic gate, and discrete hardware components.
[0206] The computer 56 comprises a data processing unit 62 adapted to process data, in particular by performing calculations, memories 64 adapted to store data and a reader 66 adapted to read a computer-readable medium.
[0207] The user interface 58 comprises an input device 68 and an output device 70.
[0208] The input device 68 is a device allowing the user of the analysis unit 36 to enter information or commands on the analysis unit 36.
[0209] In [Fig. 3], the input device 68 is a keyboard. Alternatively, the input device 68 is a pointing device (such as a mouse, a touchpad and a graphics tablet), a voice recognition device, an eye tracker or a haptic (motion analysis) device.
[0210] The output device 70 is a graphical user interface 58, i.e., a display unit designed to provide information to the user of the analysis unit 36.
[0211] In [Fig. 3], the output device 70 is a display screen for visual presentation of the output. In other embodiments, the output device 70 is a printer, an augmented and / or virtual display unit, a speaker or other sound generating device for presenting the output in sound form, a unit producing vibrations and / or odors, or a unit adapted to produce an electrical signal.
[0212] In a specific embodiment, the input device 68 and the output device 70 are the same component forming human-machine interfaces, such as an interactive screen.
[0213] The communication device 60 allows one-way or two-way communication between the components of the analysis unit 36. For example, the communication device 60 is a bus communication system or an input / output interface.
[0214] The presence of the communication device 60 allows that, in certain modes of realization, the components of the calculator 56 are distant from each other.
[0215] The computer program product comprises a computer-readable medium 72.
[0216] The computer-readable medium 72 is a tangible device readable by the reader 66 of calculator 56.
[0217] Notably, the computer-readable medium 72 is not a transient signal per se, such as radio waves or other freely propagating electromagnetic waves, such as light pulses or electronic signals.
[0218] Such a computer-readable storage medium 72 is, for example, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any combination thereof.
[0219] As a non-exhaustive list of more specific examples, the computer-readable storage medium 72 is a mechanically encoded device, such as punched cards or raised structures in a groove, a floppy disk, a hard disk, a read-only memory (ROM), a random access memory (RAM), an erasable programmable read-only memory (EROM), an electrically erasable readable memory (EEPROM), a magneto-optical disk, a static random access memory (SRAM), a compact disk (CD-ROM), a digital versatile disk (DVD), a USB flash drive, a floppy disk, a flash memory, a solid-state disk (SSD), or a PC card such as a PCMCIA memory card.
[0220] A computer program is stored on the computer-readable storage medium 72. The computer program comprises one or more sequences of stored program instructions.
[0221] Such program instructions, when executed by the data processing unit 62, cause steps of the observation method to be executed.
[0222] For example, the form of the program instructions is a source code form, a computer-executable form, or any intermediate form between source code and a computer-executable form, such as the form resulting from the conversion of the source code via an interpreter, an assembler, a compiler, a linker, or a locator. Alternatively, the program instructions are microcode, firmware instructions, state definition data, integrated circuit configuration data (e.g., VHDL), or object code.
[0223] Program instructions are written in any combination of one or more languages, for example an object-oriented programming language (FORTRAN, C++, JAVA, HTML, Python), a procedural programming language (C language for example).
[0224] Alternatively, the program instructions are downloaded from an external source via a network, as is the case in particular for applications. In this In this case, the computer program product comprises a computer-readable data carrier on which the program instructions are stored or a data carrier signal on which the program instructions are encoded.
[0225] In each case, the computer program product comprises instructions that can be loaded into the data processing unit 62 and adapted to cause execution of the design method when executed by the data processing unit 62.
[0226] Depending on the embodiments, the execution is entirely or partially carried out either on the analysis unit 36, i.e. a single computer, or in a system distributed between several computers (in particular via the use of cloud computing).
[0227] The operation of the observation system 10 will now be described with reference to several implementations of an exemplary observation method.
[0228] The observation method is a method of observing a sample 12 aimed at obtaining information on the sample 12.
[0229] Depending on the applications, the information will differ.
[0230] In what will be described later, according to a first application, the information is the sensitivity of the organism 18 to one or more antibiotic(s). Such a first application corresponds to the production of an antibiogram.
[0231] According to a second application, the information is identification information of the organization 18.
[0232] Each of these applications have in common the acquisition of images of the Petri dish 20 and the analysis of these images to obtain information relating to the phenomena taking place in the Petri dish 20.
[0233] The observation method thus comprises two phases, namely a phase of obtaining PI and a phase of analyzing P2 of the images.
[0234] The following will first describe the PI obtaining phase common to each of the two aforementioned applications before describing the P2 analysis phase specific to each application.
[0235] An example of a flowchart of a PI obtaining phase is presented schematically in [Fig.4].
[0236] In the PI obtaining phase, the observation system 10 seeks to obtain images of the sample 12.
[0237] For this, according to the example described, for each image of the sample 12 obtained, the obtaining phase PI comprises the implementation of several steps, namely an acquisition step El00, a determination step El02, an application step E104 and a fusion step E106.
[0238] During the acquisition step E100, the observation system 10 acquires a set images of part of sample 12.
[0239] This corresponds to the fact that even if the field of the sensor 50 is relatively large, it does not allow an image of the entire Petri dish 20 to be obtained in a single acquisition.
[0240] Before detailing these acquisition strategies, it should be emphasized that before the acquisition step E100, each Petri dish 20 is transported from housings 39 to the acquisition zone defined for the sensor 50.
[0241] Furthermore, an operation of removing the cover of the Petri dish 20 can be carried out using a suction cup in connection with a vacuum pump. This makes it easier to take images.
[0242] After acquiring the images, the sample 12 is then returned to the incubator 30.
[0243] In practice, the arm 40 moves the clamps 41 until they grip the sample 12 and then transports it by placing it on the housing 48.
[0244] Similarly, for the return the arm 40 moves the clamps 41 until they grip the sample 12 and lead it to one of the housings 39.
[0245] Before returning the Petri dish 20 to the incubator 30, the lid is replaced.
[0246] For completeness, it is also possible not to remove the cover for implement the process which will now be described.
[0247] [Fig.5] schematically illustrates a first acquisition strategy making it possible to cover the entire Petri dish 20.
[0248] In this example, the Petri dish 20 has a diameter of 90 mm.
[0249] According to this first example, 12 distinct images are acquired by the sensor 50.
[0250] Each image corresponding to a spatial area smaller than the Petri dish 20, these images will be called thumbnails in the following to avoid any ambiguity with an image of the Petri dish 20 which can be reconstructed from these thumbnails.
[0251] A thumbnail image is thus a transmission image of an area of the sample 12 obtained by acquisition by the sensor 50 of the light emitted by the light source 42.
[0252] Each image corresponds to the same field of vision and therefore has the same dimension.
[0253] Each of these thumbnails corresponds to a rectangle in [Fig.5] and is numbered from 11 to 112 to show the order in which these different thumbnails are acquired.
[0254] The thumbnails are taken in successive lines from the upper left corner to the lower right corner.
[0255] According to the example described, the Petri dish 20 is traversed along four lines, so that each line comprises three thumbnails.
[0256] This corresponds to a scan of the sample 12 by the observation system 10.
[0257] It is the Petri dish 20 which is moved, the light source 42 and the sensor 50 remaining fixed.
[0258] The first image corresponding to rectangle II has a spatial overlap with the second image corresponding to rectangle 12.
[0259] The spatial overlap corresponds to an overlap zone indicated by the reference 120 in [Fig.5].
[0260] In the following, such an overlap zone is referred to as a lateral overlap zone 120.
[0261] According to the example of [Fig.5], the lateral overlap zone 120 is rectangular and corresponds to an area between 10% and 30% of the area of an image.
[0262] Each image of the same line has the same lateral overlap zone with the adjacent image.
[0263] This implies that the second image has two overlapping zones with the images of the same line, a first lateral overlapping zone 120 with the first image (on its left part) and a second lateral overlapping zone 122 with the third image (on its right part).
[0264] The first image also has an overlapping area with the fourth image.
[0265] The overlap area is indicated by reference 124 in [Fig.5].
[0266] In the following, such an overlap zone is referred to as a vertical overlap zone 124.
[0267] The vertical overlap zone 124 is a rectangular zone having a surface area smaller than the surface area of the lateral overlap zone 120 between the first image and the second image.
[0268] However, this could be the top surface, which would be particularly indicated for certain sensor sizes.
[0269] According to the example of [Fig.5], the surface area of the vertical overlap zone 124 is less than 5% of the surface area of a thumbnail.
[0270] As visible in [Fig.5], each vertical overlap zone 124 has a common zone 126 with a lateral overlap zone 120.
[0271] Due to the shape of the overlapping areas, the common area 126 has a rectangular shape.
[0272] The common area 126 is thus a common area with four thumbnails.
[0273] By way of illustration, the common area 126 of the first image is common to the second image, the fourth image and the fifth image.
[0274] An experimental example of the thumbnails obtained by such an acquisition strategy is shown in [Fig.6].
[0275] According to the second example of acquisition strategy corresponding to [Fig.7], it 15 distinct thumbnails are acquired along five lines, so that each line also has three thumbnails like the first example (left figure).
[0276] In this example, similarly to the previous case, each image has a lateral overlap zone 130 and a vertical overlap zone 132.
[0277] Compared to the first example, the lateral overlap zone 130 corresponds to a relative surface area compared to the surface area of a similar image (always between 10% and 30%) while the vertical overlap zone 132 has a relative surface area compared to the surface area of a larger image, typically of the same order of magnitude as the lateral overlap zone 130.
[0278] This leads to a common area 134 having a square shape.
[0279] Such configurations make it possible to obtain a sufficient overlapping surface between the different images to carry out the following steps.
[0280] In particular, it is advantageous that, during the acquisition step E100, the imagettes are acquired along successive lines to cover the entire sample 12.
[0281] Preferably, the number of acquired images is between 12 and 15.
[0282] The following steps, namely the determination, application and fusion steps, aim to carry out an adjustment of the thumbnails.
[0283] Such an adjustment is sometimes referred to by the English term “stitching”.
[0284] As will appear in the following description, the overlapping zones in particular, make it possible to take into account the inaccuracies in the positioning of the Petri dish 20 and to determine the transformations to be applied to replace the images in the same reference frame.
[0285] The determination step E102 aims to obtain a transformation to be applied to each image to correct both the translation and rotation offsets and thus obtain a transformation specific to each image.
[0286] The translational and rotational offsets come from several elements that can be combined.
[0287] Thus, the inaccuracies of the mechanical parts (grippers and movement arms in particular) can generate such offsets.
[0288] Due to the repeated movements of the Petri dish 20, it may undergo rotation relative to what holds it in place.
[0289] Another cause is the intervention of the operator who may have to examine a Petri dish 20 more precisely by eye and who does not exactly put the Petri dish 20 back in its original position.
[0290] According to the example described, the determination step E102 comprises several operations.
[0291] A first operation aims to determine the distortion between two neighboring thumbnails.
[0292] The thumbnails are denoted A and B in the following and it is assumed that they are part of the same line. For example, thumbnail A is the first thumbnail and thumbnail B is the second thumbnail.
[0293] During a first operation, the lateral overlap zone between images A and B is divided into n sub-zones.
[0294] In this case, the sub-zones are identical to facilitate the calculations, but it would be possible to implement the determination step E102 with sub-zones of different surfaces.
[0295] Furthermore, the sub-zones advantageously have a rectangular shape for the same computational reasons.
[0296] The number n is a natural integer strictly greater than 2.
[0297] The number n is determined so that the shifts induced by rotation errors are locally negligible within the sub-zone.
[0298] Rotation errors are considered negligible from the moment they correspond to a maximum shift of one pixel within a sub-zone.
[0299] As an order of magnitude, for a lateral zone of size 1914*6380, a number n of 252 makes it possible to guarantee a negligible rotational shift.
[0300] We thus obtain a division of the overlap zone for the image A leading to a set of n sub-zones of the image noted sub-zones Ai, the index i varying between 1 and n.
[0301] Similarly, we also obtain a set of n sub-zones of the image B denoted sub-zones B;.
[0302] The second operation then consists of determining the translational offset between the two overlapping zones of the images A and B.
[0303] By construction, each sub-zone A; corresponds to a respective sub-zone B;.
[0304] In the absence of the errors, the sub-zones A; and B; would be identical two by two.
[0305] Due to the previous division, sub-zones A; and B; only have a translational shift.
[0306] When the distortions are limited to simple translations, it is sufficient to identify a pair of corresponding points in each of the sub-zones, the translation vector being the offset between the two points when the images are superimposed.
[0307] This situation is schematically illustrated by [Fig.8] for a sub-area Al (image on the left) and a corresponding sub-area B1 (center image) with an illustration pattern. Two corresponding points are indicated by a cross on these images.
[0308] When the patterns are substantially superimposed, the two points are not superimposed and the translational shift then appears.
[0309] From a mathematical point of view, this can be written as follows.
[0310] Noting pt^ £ R2 and pi £ R2 two corresponding points belonging respect-
[0311]
[0312]
[0313]
[0314]
[0315]
[0316]
[0317]
[0318]
[0319]
[0320]
[0321]
[0322]
[0323]
[0324]
[0325]
[0326] tively to sub-zones A; and B;, the translational shift of sub-zone A; relative to sub-zone B; verifies the following relation: For this, it is possible to use a phase correlation method. This gives the set of translational offset values for each point. A third operation is then to determine an affine transformation allowing the transition from the overlap zone of image A to image B. This means that we are trying to determine an affine transformation M which is composed of a rotation of angle 0 and a translation of a vector corresponding to the vector / GA. UJ For this, the following equation is solved: Or: / cos(3) ~sin(3) t x \ M- sin(B) cos(3) t y \ 0 0 17 Any technique that allows converging here towards a solution for this equation can be considered. In some cases, convergence can be facilitated by the use of an outlier removal technique. Such outliers may appear because the thumbnails contain both the interior of Petri dish 20, the periphery of Petri dish 20, and the exterior of Petri dish 20. To eliminate outliers, the RANSAC method can be applied. The RANSAC method is a method for estimating the parameters of certain mathematical models. More precisely, it is an iterative and non-deterministic method used when the observed data set may contain outliers. The abbreviation RANSAC refers to the English term "RANdom SAmple Consensus" which literally means "random sample consensus". A similar approach can be applied for any overlap area.
[0327] Thus, in the example described, for the first image, three matrices M will be obtained, one with the second image, one with the fourth image and one with the fifth image.
[0328] At the end of the third operation, the relative distortions between each image are thus obtained.
[0329] The fourth operation aims to obtain the transformation function to be applied to each image to minimize distortions between each image.
[0330] Such an operation can be carried out according to the methodology which will now be explained.
[0331] Let [ nk ■ nk ) be a set of k pairs of corresponding points in two VAB'1B A / k thumbnails A and B, such as p^B e A and p^BGB where the notations A and B denote res respectively all the points of the images A and B.
[0332] For simplicity, it will be noted p _( nk \ and p — / nk in the following. 1 ^-{Pab^ tsA-yPsA^
[0333] In the absence of rotation and translation errors for imagettes A and B, the points would be superimposed so that it would come to P ab ~Pba ~ 0-
[0334] In the present operation, we therefore seek affine transformations of the plane such that:
[0335] MaP w-MbP = 0
[0336] Where: • Ma is the affine transformation matrix applied to image A, • MB is the affine transformation matrix applied to image B.
[0337] As before, each affine transformation MA or MB which is composed of a rotation of angle 0 and a translation of vector corresponding to the vector / tx\.
[0338] Let M = {M4, AGV} be the set of transformation matrices applied to each of the images in the set of thumbnails denoted V.
[0339] To ensure the uniqueness of the solution, an image L2 e V is chosen as a reference image. By definition, it is such that its transformation matrix is the identity:
[0340] / 1 0 0\ M^=h= A) 1 0 \0 0 1 /
[0341] Where: • is the affine transformation matrix applied to the image Q.
[0342] With this definition, the problem to be solved can be expressed mathematically as :
[0343]
[0344]
[0345]
[0346]
[0347]
[0348]
[0349]
[0350]
[0351]
[0352]
[0353]
[0354]
[0355]
[0356]
[0357]
[0358]
[0359] H ab'^B? BA II Or: • is an indicator function which is equal to 1 if the images A and B have an area common recovery, 0 otherwise. This corresponds to an overdetermined linear optimization problem. Any technique that can solve such a problem can be used here. For example, the technique used may be a least squares technique. At the end of this fourth operation and therefore of the determination step E102, the expression of the set of transformations of the set M is thus obtained. We note the optimal transformation thus obtained for the image A with the notation ■ During the application step El04, the transformations thus obtained are applied to the original image, that is to say mathematically for all the images: Or: • Ij designates the original image, the images being identified by an index j, and * the optimal transformation matrix determined at the operation previous, and • designates the corrected image. By applying the respective optimal transformation for each of the imagettes Ij, all the corrected imagettes are thus obtained During the fusion step E106, the aim is to carry out the fusion of all the recalibrated thumbnails f to obtain the image. To do this, the images are positioned according to the selected acquisition scheme, here that of [Fig.5]. Then, the issue of overlapping areas must be addressed. According to the example described, the overlapping areas are merged. Such fusion can be achieved by averaging the signal from each of the images. Each point in the final overlap area is thus the arithmetic mean of the value of the points in the overlap area in the first image and the points in the overlap area in the second image. Such a fusion mode makes it possible to soften residual discontinuities or shifts. This is visible in [Fig.9] which represents the image obtained by superimposing the images without fusion on the left and the image obtained with the implementation of the fusion mode which has just been described.
[0360] According to another example, the closest image signal is chosen.
[0361] In such a case, the overlapping area is cut into two parts of equal size.
[0362] For the particular case of a lateral overlap zone, the left half of the overlap zone is filled by the left image and the right half of the overlap zone is filled on the right image.
[0363] A similar operation is carried out for the case of a vertical overlap zone.
[0364] Such a fusion mode makes it possible to preserve the background texture for ul analyses exterior, as will be explained later in the description.
[0365] Other fusion methods may be considered depending on the treatment that will be done to the overlapping areas.
[0366] A set of techniques has just been presented which make it possible to obtain an image from thumbnails.
[0367] This is therefore a spatial reconstruction making it possible to manage the positioning problems of sample 12.
[0368] The analysis unit 36 then implements an analysis phase P2 of the images.
[0369] First, with reference to [Fig. 10], an analysis phase P2 carried out for an antibiogram.
[0370] An antibiogram is a test of the sensitivity of bacteria to antibiotics.
[0371] Such a test is often designated by the abbreviation AST corresponding to the English name for “Antibiotic Susceptibility Testing” which literally means “antibiotic susceptibility test”.
[0372] It should be noted here that an antibiogram is also used for other organisms such as fungi. In this sense, an antibiogram is a test of the sensitivity of each organism 18 to antibiotics.
[0373] The analysis phase P2 of the images thus aims to determine from the images obtained by the obtaining phase PI to determine the sensitivity of each organism 18 to at least one antibiotic.
[0374] For this, it is assumed that the substrate 16 is capable of growing at least a portion of the set of organisms 14 and that the sample 12 comprises at least one zone in which the substrate 16 comprises an antibiotic.
[0375] For this, the antibiotic is introduced in the form of a 100 lozenge as shown schematically in [Fig. 11].
[0376] As visible in this [Fig. 11], a pellet 100 corresponds to a cylinder.
[0377] In other embodiments, the antibiotic may be introduced in the form of a strip.
[0378] According to the example of [Fig.10], the analysis phase P2 comprises an obtaining step E150, a detection step E152, and a determination step E154.
[0379] During the obtaining step E150, the analysis unit 36 obtains, for each image, the bacterial mat.
[0380] When the concentration of bacteria is very high on a culture medium, the bacteria develop by forming what is called a bacterial carpet. The bacterial carpet is then a multi-layer film of bacteria covering the surface of the agar medium. This coverage is more or less uniform but does not allow the counting or identification of bacterial colonies.
[0381] By way of illustration, the step of obtaining E150 comprises three operations.
[0382] In a first operation, the computer 56 detects the antibiotic tablets 100.
[0383] To implement such detection, the computer 56 implements thresholding on the gray level in the image. Indeed, on a microscopy image without a lens, the pellets, which are very opaque, appear black. A series of morphological operations makes it possible to complete the detection by using the information that the pellets 100 are black discs on the images, which makes it possible to remove dust and other artifacts detected by the thresholding step.
[0384] Other techniques based on shape recognition could also be used to implement such detection. As an illustration, a CNN neural network could be used by the computer 56.
[0385] During a second operation, the computer 56 detects the edges of the box 20.
[0386] More precisely, the computer 56 detects the holding device 25 which appears in black on the image.
[0387] The holding device 25 is, for example, detected by applying a threshold to the gray level of the image. The holding device 25 delimits the portion outside the Petri dish 20 and the portion inside the Petri dish 20. The outer portion is masked, and the inner portion is retained.
[0388] The third operation consists of removing the detected elements from the image.
[0389] This allows the bacterial mat to be isolated.
[0390] Such isolation is advantageously used here to obtain a gain in robustness for the continuation of the implementation of the analysis phase P2.
[0391] The computer 56 then implements the detection step E152.
[0392] Detection step E152 aims to detect bacterial or fungal growth.
[0393] For this, the fact that an evolution of the texture of the bacterial mat, whether it is a spatial or temporal evolution, is linked to bacterial growth is used.
[0394] A texture is a structured spatial arrangement of pixels.
[0395] In this case, the parts of the image corresponding to the bacterial mat contain a characteristic texture (pattern and spatial frequency) different from parts of the image where bacteria did not grow.
[0396] In other words, the difference in texture makes it possible to differentiate the bacterial mat from the inhibition zone.
[0397] This detection step E152 can be implemented by determining the texture in the current image and then comparing it with a texture obtained previously.
[0398] The calculator 56 can, for example, determine the texture using Haralick criteria.
[0399] Haralick criteria are metrics calculated from the gray level co-occurrence matrix and used to quantify the spatial organization of the different gray levels in the image.
[0400] By calculating these criteria on a sliding window of the image, a local measurement of the criterion is obtained, throughout the image.
[0401] According to another example, the calculator 56 uses histograms.
[0402] More precisely, the calculator 56 produces a gray level histogram which it compares to a reference histogram corresponding to the presence of an inhibition zone, the distance between the two histograms serving as a metric for the texture.
[0403] Alternatively, the reference histogram is that of an image in which no bacteria or fungi have grown.
[0404] According to yet another example, a PSD is used.
[0405] Instead of making a histogram as before, we make a PSD on the image that is compared to a reference PSD.
[0406] The abbreviation "PSD" refers to the corresponding English term "Power Spectrum Density" literally meaning power spectral density. This makes it possible to obtain a representation of the frequency organization of the pixels in the image.
[0407] It can also be considered the use of a wavelet transform to obtain the texture.
[0408] The wavelet transform consists of applying a basic function, called a wavelet, to several scales of the image, thus making it possible to characterize the texture of the image at several levels of resolution. Applying the wavelet transform to a part of the image returns a list of wavelet coefficients that characterize the texture at different levels of resolution. These wavelet coefficients are used as texture indicators and can be compared with reference coefficients, or be put as input to a classifier to classify the texture.
[0409] According to another example, support vector machines are used. Such a tool is more often referred to by the abbreviation SVM, which refers to the corresponding English term "Support-Vector Machine".
[0410] Such an SVM tool can be used as a binary classifier whose two outputs possible would be: Bacterial mat or inhibition zone.
[0411] The input to the SVM could be a list of pixels, or metrics from the methods previously detailed such as the metric from the Haralick criteria.
[0412] The training of such an SVM is carried out on a set of images containing inhibition zones and bacterial mat.
[0413] The different examples can be combined, the different results obtained by implementing the aforementioned techniques then being the subject of an aggregation, for example the calculation of an average of the results or the use of an SVM which takes as input all of the calculated metrics. The texture is thus determined.
[0414] The calculator 56 then performs a comparison between this texture and a texture obtained previously.
[0415] When the difference is greater than the measurement noise, this means the presence of bacterial or fungal growth.
[0416] The calculator 56 thus detects bacterial or fungal growth.
[0417] After such detection, the computer 56 implements the determination step El 54.
[0418] During the determination step E154, the computer 56 determines at least one characteristic relating to the set of organisms 14 by analyzing at least one of the images obtained.
[0419] The analysis consists of measuring the inhibition diameter based on an image which can be either the original image or the texture image.
[0420] When the inhibition zones are not yet sufficiently visible on the image, the texture image will generally be preferred.
[0421] In the proposed implementation example, the characteristic determined in the determination step El54 is the sensitivity of the organism 18 to the antibiotic.
[0422] The sensitivity is obtained here by determining a characteristic dimension of the inhibition circle associated with the growth of the set of organisms 14 on the area in which the substrate 16 comprises an antibiotic.
[0423] The inhibition circle designates the delimitation of the growth zone of organisms 14, growth which is inhibited by the presence of an antibiotic.
[0424] The organism-free zone 14 is usually called the inhibition zone.
[0425] In the most usual case, the delimitation is a circle but sometimes presents a more complex form, especially in the presence of interaction with other antibiotics or near the edge of the Petri dish 20.
[0426] The dimension of the inhibition circle defined as an average dimension of the distance between two opposite points.
[0427] This dimension, which we will call diameter, depends on the sensitivity of the bacterial strain to the antibiotic agent used.
[0428] In the following, a determination of the diameter of the inhibition circle is proposed.
[0429] Estimating the inhibition diameter then makes it possible to estimate the organism's sensitivity to the antibiotic agent, according to the diffusion method in agar medium defined by EUCAST (European reference body), CLSI (American reference body) or CA-SFM (French microbiology body).
[0430] For example, for each species / antibiotic pair, EUCAST defines an inhibition diameter threshold below which the organism is defined as resistant, and above which the organism is defined as sensitive.
[0431] In the case of [Fig.10], the determination step E154 comprises an extraction operation and an estimation operation.
[0432] The first operation is performed by a contour extraction technique.
[0433] In the general case, the inhibition circle is indeed circular.
[0434] In such a case, the contour extraction technique is a logistic adjustment on the radial mean of the inhibition circle.
[0435] Alternatively, it is also possible to use as a contour extraction technique a contour extraction followed by a determination of the circle inscribed in the inhibition zone.
[0436] In such a case, a Canny detector or gradient detectors, such as a Sobel filter and a Prewit filter, can be used.
[0437] In more complex cases where the zone of inhibition is not circular, the previous technique can be used using as an approximation that the zone of inhibition is defined by circular arcs.
[0438] Alternatively, it is possible to use contour extraction to obtain the exact shape of the inhibition zone and possibly estimate its diameter as the diameter of the inscribed circle.
[0439] According to another example, the texture of the bacterial mat is used to obtain these contours.
[0440] The estimation operation consists of carrying out an estimation of the dimension of the contours using an estimation technique.
[0441] According to a first example, the estimation technique consists of calculating the radial average.
[0442] According to a second example, the estimation technique consists of carrying out a logistic adjustment.
[0443] The technique consists of calculating a radial average of the gray level around the center of the patch.
[0444] More specifically, the technique comprises an extraction of the gray level profiles (sections) orthogonally to the contour of the pellet, all around the pellet according to a predefined angular step. The angular step is, for example, one degree.
[0445] The profiles are then averaged.
[0446] The profile is then approximated by a logistic function.
[0447] Alternatively, any other function modeling a gray level transition can be used.
[0448] In addition, a RANSAC technique can also be used to eliminate aberrant points from the extracted contour.
[0449] Implementing both operations makes it possible to obtain a better estimate of the diameter in the case of a non-circular inhibition zone.
[0450] This is particularly useful for detecting interactions between antibiotics since the presence of synergy or antagonism generally leads to non-circular shapes for the inhibition zone.
[0451] Furthermore, regardless of the shape of the inhibition zone, a gain in robustness is observed for the measurement of the diameter of the inhibition zone.
[0452] The method therefore allows rapid detection of characteristics relating to organisms.
[0453] Such a gain in speed and resolution makes it possible to use samples 12 for which the pellet 100 has a reduced characteristic size.
[0454] For example, the characteristic size may be reduced by a factor of 3 to have a size less than or equal to 6 mm, less than or equal to 4 mm, preferably less than or equal to 2 mm.
[0455] A minimum size of 1 mm is nevertheless desirable.
[0456] The acquisition phase P2 which was presented with reference to [Fig.4] can also be advantageously used in an identification method.
[0457] The identification method aims to identify each organism 18 from at least a part of the box 20.
[0458] A species is a taxonomic rank in bacterial nomenclature grouping together all the strains considered to be sufficiently close to the type strain of the species to be assimilated to it.
[0459] According to the example of [Fig.12], the analysis phase P2 comprises a detection sub-phase SP1 followed by an identification sub-phase SP2.
[0460] The objective of the detection sub-phase SP1 is to detect the colonies on the images obtained after the acquisition phase PI and ideally to obtain their location.
[0461] A bacterial colony is a cluster of bacteria resulting from the duplication of a bacterial strain (sometimes several) on an agar medium. It is by dividing that bacteria organize themselves into colonies.
[0462] Such a colony is sometimes referred to by the acronym CFU which refers to the corresponding English term “Colony Forming Unit”.
[0463] In practice, the number of colonies on a Petri dish 20 can be up to a few hundred.
[0464] According to the example described, the identification sub-phase SP2 comprises a calculation step E160, a verification step E162 and a determination step E164.
[0465] During the calculation step E160, the calculator 56 applies a neural network to at least one image.
[0466] Before explaining this calculation step El60 in more detail, it is appropriate to give some general elements concerning the notion of neural network.
[0467] A neural network comprises an ordered succession of layers of neurons, each of which takes its inputs from the outputs of the previous layer.
[0468] More precisely, each layer comprises neurons taking their inputs from the outputs of the neurons of the previous layer, or from the input variables for the first layer.
[0469] Alternatively, more complex neural network structures can be envisaged with a layer that can be connected to a layer further away than the immediately preceding layer.
[0470] Each neuron is also associated with an operation, i.e. a type of processing, to be carried out by said neuron within the corresponding processing layer.
[0471] Each layer is connected to the other layers by a plurality of synapses. A synaptic weight is associated with each synapse, and each synapse forms a connection between two neurons. It is often a real number, which takes both positive and negative values. In some cases, the synaptic weight is a complex number.
[0472] Each neuron is capable of performing a weighted sum of the value(s) received from the neurons of the previous layer, each value then being multiplied by the respective synaptic weight of each synapse, or link, between said neuron and the neurons of the previous layer, then applying an activation function, typically a non-linear function, to said weighted sum, and delivering at the output of said neuron, in particular to the neurons of the following layer which are connected to it, the value resulting from the application of the activation function. The activation function makes it possible to introduce non-linearity into the processing carried out by each neuron. The sigmoid function, the hyperbolic tangent function, the Heaviside function are examples of activation functions.
[0473] As an optional addition, each neuron is also capable of applying, in addition, a multiplicative factor, also called bias, to the output of the activation function, and the value delivered at the output of said neuron is then the product of the bias value and the value from the activation function.
[0474] In certain special cases, the neural network is a convolutional neural network.
[0475] A convolutional neural network is also sometimes called a convolutional neural network or by the acronym CNN which refers to the English term “Convo-lutional Neural Networks”.
[0476] In a convolutional neural network, each neuron in the same layer has exactly the same connection pattern as its neighboring neurons, but at different input positions. The connection pattern is called a convolution kernel or, more often, a "kernel" in reference to the corresponding English term.
[0477] In addition, there are particular neuron layers such as a fully connected neuron layer.
[0478] A fully connected layer of neurons is a layer in which the neurons of said layer are each connected to all the neurons of the previous layer.
[0479] Such a type of layer is more often referred to as “fully connected” and sometimes referred to as a “dense layer”.
[0480] The example of [Fig.12] for the calculation step E160 is first illustrated for a simple example in which the sample 12 observed is mono-microbial, that is to say that only one species of bacteria or fungus is present in the imaged box 20.
[0481] In such a case, the calculation step El60 comprises an application operation and an association operation.
[0482] During the application operation, the calculator 56 applies a classifier here.
[0483] For example, the classifier is a K-class classification neural network (each class is then a species).
[0484] The classifier is, for example, a CNN network followed by a SASE block.
[0485] The abbreviation SASE refers to the corresponding English term for “Spatially-Adaptive Squeeze-Excitation” which literally means spatially adaptive compression excitation.
[0486] The SASE block is used here to improve the abstraction capabilities of the model corresponding to the CNN network.
[0487] The classifier is trained on a set of 278 Petri dishes of 10 bacterial species.
[0488] Such a neural network provides, from an input image and the location of the colony for each colony, a set of scores associated with each of the classes.
[0489] Preferably, the input is an array gathering several frames.
[0490] For example, the input is an array of size 125x125x36 corresponding to 36 frames (acquisition of an image every 30 minutes for 18h) of a 125x125 pixel clip of a previously detected colony.
[0491] Of course, the size of the clip can vary, the number of frames also and it is en-
[0492]
[0493]
[0494]
[0495]
[0496]
[0497]
[0498]
[0499]
[0500]
[0501]
[0502]
[0503]
[0504]
[0505]
[0506]
[0507]
[0508] It is possible that the frames have several types of frames, each type corresponding to a specific wavelength. In other words, for each colony i, the neural network gives a set of K scores where i is an integer varying between 1 and N the number of colonies. Since the scores can be interpreted as probabilities of belonging to the corresponding class, it can be written: Screw N the ksK According to the example considered, the calculator 56 associates the colony considered with a species during the association operation. More specifically, calculator 56 considers that the species associated with the colony considered is the species corresponding to score 5, the highest. This corresponds to the following mathematical relationship: ef = class^argmaxp.^ Or: • eî denotes the species associated with colony i, and • class is a function that gives the species associated with a probability. At the end of the calculation step E160, a set of most probable species-colony associations is thus obtained for each colony. During the verification step E162, the computer 56 verifies the reliability of the prediction result. In other words, the calculator 56 verifies that a reliability condition of the probabilities obtained is met by comparing at least one value from the probabilities obtained with a predefined threshold. This verification step El62 aims to handle the fact that, during their training, neural networks are trained on a predefined set of species. This results in an absence of certain classes. Thus, in inference, the classifier does not have the capacity to give a good answer for a colony corresponding to a class unknown to the classifier. In this example, the maximum value of the scores associated with a colony is compared to a threshold e. When this maximum value is strictly lower than the threshold e, it is considered that it is not possible to make a prediction, i.e. the colony corresponds to an unknown species or that this prediction is not sufficiently reliable. The threshold e is a number between 0 and 1 which is chosen according to the specific case. Preferably, the threshold e is chosen between 0.7 and 0.9.
[0509] In practice, a threshold e of 0.8 allows good performance to be obtained.
[0510] First, it is assumed that the species is known.
[0511] The calculator 56 then implements the determination step E164.
[0512] According to the example of mono-microbial sample 12, aggregation can be implemented.
[0513] During such an operation, the different previous associations are aggregated by using an aggregation function to obtain a single class (a single species) for all the colonies in box 20.
[0514] Several aggregation functions can be considered at this stage.
[0515] A first aggregation function consists of retaining the most frequent species in box 20.
[0516] Mathematically, this amounts to performing the following operation:
[0517] g _ c[asse ( maX£ J
[0518] Where: • E designates the species retained for the whole of box 20, and • I denotes the function such that I is 1 if = k and 0 otherwise.
[0519] A second example of an aggregation function consists of retaining the species whose sum of associated scores is the largest.
[0520] In such an example, the following mathematical function is used:
[0521] _ c]asse ( J ( e. - £ ) j
[0522] Where ~ mkxPik is the maximum of the score associated with the species e>.
[0523] Such an example of implementation of the determination step El64 makes it possible to obtain a considerable gain in robustness for this case of a mono-microbial sample 12.
[0524] This makes it possible, in fact, to remedy the fact that it is very common to have a few poorly identified colonies on a dish, despite high identification precision.
[0525] For example, with 95% accuracy, a box of 400 colonies will statistically have 20 misidentified colonies. Such an implementation thus makes it possible to correct the misidentification of the 20 colonies.
[0526] Ultimately, this technique amounts to a voting technique on a set of 14 organizations (here the whole of box 20).
[0527] Thus, we can generalize what has just been described to a plurality of organisms 18 corresponding to the same species.
[0528] In this case, the determination step El64 comprises the implementation of an aggregation function of the different probabilities found for each of the organisms 18.
[0529] The first example described then corresponds to an aggregation function giving as species for the plurality of organisms 18 the maximum of the set of probabilities while the second example corresponds to an aggregation function giving as species for the plurality of organisms 18 the maximum of the set of probabilities.
[0530] In the event that the species to be identified is not known, by construction, this means that the reliability condition is not met.
[0531] The calculator 56 then provides information that each organism 18 considered belongs to a species not included in the predefined species.
[0532] This therefore allows the computer 56 to be capable of managing new situations including situations not learned during the training of the neural network.
[0533] According to a more elaborate embodiment which will now be described, the calculator 56 is capable of providing additional information on an organism 18 belonging to an unknown species.
[0534] For this, a phylogenetic tree is used.
[0535] By definition, a phylogenetic tree is a tree-like representation of the relationships between different organisms 18 and is constructed from their genetic characteristics and their kinship links.
[0536] Such a tree is shown in [Fig.13].
[0537] The tree has several nodes which are distributed according to phylogenetic levels from a root (highest level) to the leaves (lowest level).
[0538] The phylogenetic level is the depth of the taxon studied in the phylogenetic tree.
[0539] The phylogenetic levels considered are thus based on the taxonomic rank, that is to say the hierarchical level in the classification of living things.
[0540] In some cases, the phylogenetic levels include usual taxonomic ranks, based on genetics and / or groupings of taxa or species advantageously chosen to respond to a problem, in particular a specific identification problem such as identifying gram-positive and gram-negative organisms.
[0541] The groupings of taxa or species are based on criteria chosen for the specific case, the criterion being able to be genetic, phenotypic, clinical (symptom, sensitivity to antibiotics) or material (type of antibiogram available).
[0542] According to the example shown, there are 7 levels which are in successively decreasing order: the domain, the phylum, the class, the order, the family, the genus and the species.
[0543] However, this is only an example since there are lower level philogroups that could explain the differences in morphotypes and resistance within the same species.
[0544] A node of a level is identified by a letter and a number corresponding to the order in which it appears from left to right in [Fig. 13].
[0545] When a phylogenetic link exists between two nodes, a link is visible on this [Fig.13].
[0546] In this view, a higher level node is a parent node of a lower level node and conversely, a lower level node is a child node of a higher level.
[0547] The following table can thus be drawn up:
[0548] [Tables 1] Node name Membership level Full name Link to other nodes DI domain Bacteria PI and P2 PI phyllum Pseudomonadota DI and Cl P2 phyllum Bacillota DI and C2 Cl class Gammaproteobacteria PI, 01 and 02 C2 class Bacilli P2, 03 and 04 01 order Enterobacterales Cl, Fl and F2 02 order Pseudomodanales Cl and F3 03 order Lactobacillales C2 and F4 04 order Bacillales C2 and F5 Fl family Enterobacteriaceae O1,G1,G2 and G3 F2 family Yersiniaceae 01 and G4 F3 family Pseudomonadaceae 02 and G5 F4 family Enterococcaceae 03 and G6 F5 family Staphyloccaceae 04 and G7 G1 genus Enterobacter Fl and El G2 genus Escherichia E2 and Fl G3 genus Klebsiella E3 and Fl G4 genus Serratia E4 and F2 G5 genus Pseudomonas E5 and F3 G6 genus Enterococcus E6, E7 and F4 G7 genus Staphylococcus E8, E9, E10 and F5 El species Enterobacter cloacae c omplex G1 E2 species Escherichia coli G2 E3 species Klebsiella pneumoniae G3 E4 species Serratia marcescens G4 E5 species Pseudomonas aeruginosa G5 E6 species Enterococcus faecalis G6 E7 species Enterococcus faecium G6 E8 species Staphylococcus aureus G7 E9 species Staphylococcus e pi-dermidis G7 E10 species Staphylococcus s apro-phyticus G7
[0549] The phylogenetic tree in [Fig.13] therefore includes 10 species divided into 7 genera belonging respectively to 5 families, themselves divided into 4 orders forming part of 2 classes corresponding to 2 phyla of the domain of bacteria.
[0550] With biological knowledge, it is possible to draw up such a phylogenetic tree knowing the species.
[0551] In other words, it can be considered that from the 10 species El to E10, it is possible to derive the phylogenetic tree of [Fig. 13].
[0552] Of course, the 10 species El to E10 can be associated with a different phylogenetic tree.
[0553] In particular, instead of a 7-level tree, a 3 or 4-level tree could be considered.
[0554] Furthermore, it is not obligatory that the levels be exactly consecutive as is the case for the tree in [Fig. 13].
[0555] For example, we could form a 4-level tree with the nodes Dl, PI, P2, Fl to F5 and El to E10.
[0556] Preferably, however, in practice, levels close to species E1 to E10 will be chosen to obtain the most precise information possible according to one of the techniques which will be described.
[0557] In this embodiment, the verification step E162 is performed for each node.
[0558] For this, during the verification step E162, the calculator 56 calculates a score for each node.
[0559] The score of each node is calculated as the sum of the scores of each of the child nodes.
[0560] We can thus obtain a value for each of the nodes.
[0561] It follows from such a definition that the root of the phylogenetic tree has a score equal to 1.
[0562] The calculation and its results will now be illustrated through three examples.
[0563] The first example corresponds to a prediction of a species Enterococcus faecalis.
[0564] In such a case, the scores resulting from the neural network are as follows:
[0565] [Tables2] Species Prediction score El 0 E2 0 E3 0 E4 0 E5 0 E6 1 E7 0 E8 0 E9 0 E10 0
[0566] As a result, the non-zero values of the other nodes are as follows:
[0567] [Tables3] Node Prediction Score G6 1 F4 1 03 1 C2 1 P2 1 Dl 1
[0568] The set of nodes verifying the reliability condition (threshold here set at 0.7) are therefore the nodes D1, P2, C2, 03, F4, G6 and E6.
[0569] During the determination step E164, the observation system 10 will be able to provide the user with enriched information, namely that not only the species will be known but also the other phylogenetic levels.
[0570] This example shows that the use of the phylogenetic tree does not disturb an exact prediction.
[0571] Typically, the calculator 56 should not identify the correct species and not the correct class.
[0572] In the second example, it is a question of predicting a species Enterobacter cloacae complex while the scores resulting from the neural network are as follows:
[0573] [Tables4] Species Prediction score El 0.21 E2 0.64 E3 0 E4 0 E5 0 E6 0.14 E7 0 E8 0 E9 0 E10 0
[0574] Such a situation can occur when two species are relatively close, which is the case in this example since species El and E2 belong to the same genus.
[0575] It can also be noted that, in this hypothesis, the calculator 56 predicts with the highest score the species E2, i.e. the species Escherichia coli, which is erroneous.
[0576] For a threshold of 0.5, the calculator 56 would output an error or for a higher threshold, typically 0.7, the calculator 56 would not give any prediction.
[0577] By performing the calculation of each of the values for the nodes, the non-zero values of the other nodes are as follows:
[0578] [Tables5] Node Prediction Score G1 0.21 G2 0.64 G6 0.14 Fl 0.86 F4 0.14 01 0.86 03 0.14 Cl 0.86 C2 0.14 PI 0.86 P2 0.14 Dl 1
[0579] With a threshold of 0.7, the nodes Fl, 01, Cl, PI and DI are reliable (respect the reliability condition) and not the others.
[0580] One way to choose the determined information is to traverse the nodes in the descending direction from the initial node (root) to the corresponding nodes in species by following a path of nodes respecting the reliability condition and by selecting the full denomination associated with the last node.
[0581] Here, the path is as follows: node Fl, node 01, node Cl, node PI then node Dl.
[0582] The information determined is that of node D1.
[0583] This corresponds to determining that organism 18 belongs to the family Enterobac-teriaceae.
[0584] It should be noted that the information obtained at the end is correct despite an erroneous prediction at the output.
[0585] For a threshold of 0.7, the observation system 10 thus provides information that the species of the organism 18 is not known or not reliable but that the identified family is the Enterobacteriaceae family.
[0586] Thus, the technique which has just been described with the use of the phylogenetic tree allows good identification at the family level in the absence of identification at the species level.
[0587] In the third example, it is a question of identifying a species Staphylococcus capitis but the neural network was not trained to predict this species.
[0588] The species Staphylococcus capitis corresponds to the same genus G7 as nodes E8 to E10. This is indicated by an additional dotted link in [Fig. 14] which corresponds to the tree in [Fig. 13] enriched with an EX node associated with the species Staphylococcus capitis.
[0589] The implementation of calculation step E160 leads to the following scores:
[0590]
[0591] [Tableauxô] Species Prediction score El 0 E2 0 E3 0 E4 0 E5 0 E6 0 E7 0 E8 0 E9 0.62 E10 0.38
[0592] As expected, the neural network predicts species relatively close to the species sought since species E9 and E10 belong to the same genus as the species to be identified.
[0593] It can also be noted that, in this hypothesis, the calculator 56 predicts with the highest score the species E9, i.e. the species Staphylococcus saprophyticus, which is erroneous.
[0594] For a threshold of 0.5, the calculator 56 would output an error or for a higher threshold, typically 0.7, the calculator 56 would not give any prediction.
[0595] By performing the calculation of each of the values for the nodes, the non-zero values of the other nodes are as follows:
[0596] [Tables?] Node Prediction Score G7 1.00 F5 1.00 04 1.00 C2 1.00 P2 1.00 DI 1.00
[0597] The calculator 56 then performs the same operation of traversing the nodes in the descending direction from the initial node (root) to the corresponding nodes in species by following a path of nodes respecting the reliability condition and by selecting the complete denomination associated with the last node.
[0598] This leads him to determine that the reliable information is that corresponding to node G7.
[0599] This corresponds to determining that the organism 18 to be identified belongs to the genus Staphylococcus.
[0600] It should be noted that the information obtained at the end is correct despite an erroneous prediction at the output.
[0601] For a threshold of 0.7, the observation system 10 thus provides information that the species of the organism 18 is not known or not reliable but that the genus identified is the genus Staphylococcus.
[0602] Furthermore, due to the zero score for species E8, it can be deduced with certainty that the species is not Staphylococcus aureus.
[0603] Thus, the technique which has just been described with the use of the phylogenetic tree allows good identification at a phylogenetic level higher than that of the species even when the neural network does not have the capacity to determine the species to be identified.
[0604] Through the results obtained, it appears that the use of a phylogenetic tree makes it possible to greatly improve identification.
[0605] This approach thus makes it possible to provide information on higher phylogenetic levels when the score obtained at a lower level is not sufficiently high.
[0606] This allows for a gain in robustness by constraining the groupings of species and the path of the tree by genetic links.
[0607] Furthermore, without any retraining of the neural network, the observation system 10 is capable of performing identification at a higher phylogenetic level even for unknown species.
[0608] The described approach thus makes it possible to efficiently manage the problem of training the identification neural network.
[0609] Indeed, to recognize a species of bacteria, the neural network must be trained on a large number of strains of this species. Some species of bacteria are very common in clinical analyses, so it is easy to build a training database for these species. On the other hand, many species are much rarer: it is therefore difficult to build a training database sufficiently large to integrate these species.
[0610] Where classical classification approaches at best provide no information, and at worst are systematically wrong about these species not present in the training space, the approach which has just been described makes it possible to predict relevant information about the organism 18 tested.
[0611] The method which has just been described therefore allows not only good identification of the species of the organisms 18 but also the provision of reliable information in the case of unknown species or species which are difficult to recognize with certainty.
[0612] Other embodiments of the observation methods described above can advantageously be envisaged.
[0613] In particular, according to one embodiment, the time interval between each obtaining of an image during the implementation of the PI obtaining phase is adjustable.
[0614] Advantageously, the time interval depends on at least one determined characteristic.
[0615] For example, for the growth of the Escherichia coli bacterium incubated at 37°, it is known that a lag phase of 2 hours takes place, then an exponential growth of 10 hours and then a slowdown to reach a stationary phase and then a decline phase.
[0616] In such a case, one could consider taking an image every hour during the lag phases and an image every 10 minutes during the growth phase.
[0617] It could even be envisaged that the time interval is determined in real time based on the observed evolution of the growth of the colonies.
[0618] To reduce the computational load, it may also be interesting to limit the part of the image to be analyzed.
[0619] For example, it is possible to determine at least one property relating to the detected colonies and then to select colonies, the calculation steps (in particular application of the neural network) being implemented only for the selected colonies.
Claims
Claims
1. A method for observing a sample (12), the sample (12) comprising: - a set of organisms (14), - a solid substrate (16) supporting the set of organisms (14), the method being implemented by an observation system (10) comprising a lensless imaging unit (34) and the method comprising: - a phase of obtaining images of the sample (12), - a phase of analyzing the images, the analysis phase comprising: - a step of calculating the probability that at least one organism (18) belongs to a predefined species, the calculation step comprising applying a neural network to at least one image to obtain the probability that said at least one organism (18) belongs to a predefined species, the predefined species being the set of species that the neural network has been trained to identify in an image,- a step of verifying that a reliability condition of the probabilities obtained is met by comparing at least one value from the probabilities obtained with a predefined threshold, and - a step of determining at least one piece of information relating to the identity of the at least one organism (18), the information being membership of a species not included in the predefined species when the reliability condition is not met.,
2. An observation method according to claim 1, wherein the value from the probabilities is the maximum value of the calculated probabilities.
3. An observation method according to claim 1 or 2, wherein the organisms (18) are organized into colonies, the observation method further comprising a colony detection phase for detecting the colonies and locating them, the neural network of the calculation step also taking as input the location of at least one colony.
4. Observation method according to claim 3, in which the analysis phase comprises a step of determining at least one property relating to the detected colonies and a step of selecting the colonies to obtain selected colonies, the obtaining step being implemented only for the selected colonies.
5. An observation method according to any one of claims 1 to 4, in which a plurality of organisms (18) correspond to the same species, the determination step comprising the implementation of an aggregation function of the different probabilities found for each of the organisms (18).
6. An observation method according to claim 5, wherein the aggregation function gives as species for the plurality of organisms (18) the maximum of the set of probabilities.
7. An observation method according to claim 5, wherein the aggregation function gives as species for the plurality of organisms (18) the species for which the sum over each organism (18) of the probabilities that the organism (18) belongs to the species is maximum.
8. An observation method according to any one of claims 1 to 7, wherein, in the calculating step, the neural network is a multi-class classification neural network.
9. An observation method according to any one of claims 1 to 8, wherein a phylogenetic tree has been defined for the neural network, the phylogenetic tree comprising a set of nodes distributed according to at least two phylogenetic levels, the lowest phylogenetic level being the species, the nodes being linked together when there is a phylogenetic link between them, the verification step comprising calculating a probability for each node from the probabilities calculated in the calculation step and verifying the conformity condition for each node.
10. Observation method according to claim 9, in which, during the determination step, the information determined is the membership at the lowest phylogenetic level meeting a conformity condition.
11. An observation method according to claim 9 or 10, wherein the phylogenetic levels are selected from the list consisting of phyllum, class, order, family and genus.
12. An observation method according to any one of claims 9 to 11, wherein the number of phylogenetic levels is greater than or equal to A
13. d *T. Observation method according to any one of claims 1 to 12, wherein the predefined threshold has a value between 0.7 and 0 Q
14. A system (10) for observing a sample (12), the sample (12) comprising: - a set of organisms (14), and - a solid substrate (16) supporting the set of organisms (14), the observation system (10) comprising a lensless imaging unit (34) and suitable for: - obtain images of the sample (12), - analyze the images, the analysis including: - calculating the probability that at least one organism (18) belongs to a predefined species, the calculation comprising applying a neural network to at least one image to obtain the probability that said at least one organism (18) belongs to a predefined species, the predefined species being the set of species that the neural network has been trained to identify in an image, - verification that a reliability condition of the probabilities obtained is met by comparison of at least one value from the probabilities obtained with a predefined threshold, and - the determination of at least one piece of information relating to the identity of the at least one organism (18), the information being membership of a species not included in the predefined species when the reliability condition is not met.
15. Observation system according to claim 14, the observation system (10) further comprising a regulating element (37) for the environment of the observation system (10).
Citation Information
Patent Citations
Method for characterizing microorganisms by transmission imaging
FR3108983A1
Systems and methods for the early detection and classification of live microorganisms using time-lapse coherent imaging and deep learning
WO2021154876A1