METHOD AND APPARATUS FOR REAL-TIME DETECTION OF POLYPS IN OPTICAL COLONOSCOPY

20190311474 ยท 2019-10-10

    Inventors

    Cpc classification

    International classification

    Abstract

    A method for performing real-time detection and displaying of polyps in optical colonoscopy, includes a) acquiring and displaying a plurality of real-time images within colon regions to a video stream frame rate, each real-time image comprising a plurality of color channels; b) selecting one single color channel per real-time image for obtaining single color pixels; c) scanning the single color pixels across each the real-time image with a sliding sub-window; d) for each position of the sliding sub-window, extracting a plurality of single color pixels local features of the real-time image; e) passing the extracted single color pixels local features of the real-time image through a classifier to determine if a polyp is present within the sliding sub-window; f) real-time framing on display of colon regions corresponding to positions of the sliding sub-window wherein polyps are detected. A system for carrying out such a method is also provided.

    Claims

    1. A method for performing real-time detection and displaying of polyps in optical video-colonoscopy, wherein the method comprises the steps of: a) acquiring and displaying a plurality of real-time images within colon regions of a video stream frame rate, each real-time image comprising a plurality of color channels; b) selecting only one single color channel for all the real-time images for obtaining single color pixels; c) scanning the single color pixels across each said real-time image with a sliding sub-window; d) for each position of said sliding sub-window, extracting local features from the single color pixels within the sliding sub-window of the real-time image, all the local features being only based on single-color pixels, a local feature being a function of neighboring single color pixels surrounding a given single color pixel; e) passing the extracted local features of single color pixels of each position of the sliding sub-window through a classifier to determine if a Region of Interest, containing a polyp, is detected, the Region Of Interest being delimited by at least one sub-window generated by the sliding sub-window; f) real-time framing on display of colon regions corresponding to Regions Of Interest of said sliding sub-window wherein polyps are detected.

    2. The method of claim 1, wherein, for each image, the step c) of scanning is performed p times with p impair number and greater than one, each time using a different size of the sliding window, the classifier is then applied to all p scans in order to decide whether a polyp is detected or not with a majority vote.

    3. The method of claim 1, wherein the method comprises in the step e): passing the extracted local features of single color pixels of each position of the sliding sub-window through a classifier to determine if a ROI, containing a polyp, is detected, for at least one serie of n successive images which comprises an image I.sub.f destined to display the ROI; for each image of the serie, spatial fusion of the sub-windows in which a same polyp is detected, for the sub-windows overlapping each other spatially on the image with at least x % of their size, to obtain ROI.sub.final in each successive image; for each serie of images, temporal fusion of the ROI.sub.final in only one ROI.sub.displayed, for the ROI.sub.final overlapping each other with at least y % of their size in the fixed referential of the images, real-time framing on display of colon regions corresponding to position of ROI.sub.displayed in the image I.sub.f, x and y being a non-zero number.

    4. The method of the preceding claim 3, wherein x is equal to or superior to 50, and y is equal to and superior to 70.

    5. The method of claim 2, wherein the ROI.sub.displayed is calculated for some series of n successive images, n being impair number superior or equal to 3, and a polyp is considered present in the ROI.sub.final if the polyp is detected at least (n+1)/2 times in the serie.

    6. The method of claim 1, wherein the image I.sub.f is the final image of the serie.

    7. The method of claim 1, wherein the time of the all the steps a), b), c), d), e), f) lasts less than 40 ms.

    8. The method of claim 1, wherein the scanning of the step c) is realized without polyp boundaries detection.

    9. The method of claim 1, wherein said single color channel is blue.

    10. The method of claim 1, wherein local features are chosen from the group comprising local binary patterns and Haar-like features.

    11. The method of claim 1, wherein each local feature is associated to a respective classifier, called weak classifier, the classifier used in step e) of the method comprising a sum of at least one hundred weak classifiers.

    12. The method of claim 1, wherein the classifier is based on a boosting algorithm.

    13. The method of claim 12, wherein said boosting algorithm is cascade Adaboost.

    14. The method of claim 12, further comprising a preliminary step of creating said classifier by active learning.

    15. The method of claim 14, wherein said active learning is carried out using a learning database or video comprising a sequence of images, wherein said images include ground truth images of known polyps, the active learning comprising the steps of: s1) selecting an initial set of sub-images with and without polyps, extracted from a set of said images for training, and another set of said images for testing; and selecting one single color channel from all of said images for obtaining single color pixels for the sub-images used for training and the images for testing; s2) extracting local features for training from the initial set of single-color sub-images used for training and local features for testing from the set of images for testing; s3) computing a classifier based on the boosting algorithm applied on the local features of the initial set of sub-images used for training, and testing the first classifier on the local features of the sub-set of images for testing; s4) for each sliding sub-window considered on the images used for testing, identifying false positive detection cases of polyps by said classifier during said testing of step s4), and creating an additional set of sub-images which present the false positive detection cases; s5) using said false positive detection cases of polyps detected in the additional set of sub-images, to re-compute the classifier based on the boosting algorithm applied on the local features of the initial set of sub-images and on the local features of the additional set of sub-images, steps s4) to s5) being repeated a plurality of times to create a final classifier, the classifier used in step e) of the method being said final classifier.

    16. The method according to claim 1, wherein said real-time images are acquired at a minimum frame rate of 24 images per second.

    17. The method of claim 1, wherein said sub-windows comprises nm pixels, with n and m greater than or equal to 30, and wherein step d) comprises extracting at least 5 local features for each single color pixel of the sliding sub-window.

    18. The method according to claim 1, wherein the plurality of real-time images forms a high-definition or a standard definition video.

    19. A system for real-time image detection and displaying of polyps in optical video-colonoscopy, comprising an input port for receiving a video stream, an image processor for processing images from said video stream and an output port for outputting processed images, wherein the image processor is configured for: a) acquiring and displaying a plurality of real-time images within colon regions to a video stream frame rate, each real-time image comprising a plurality of color channels; b) selecting only one single color channel for all the real-time images for obtaining single color pixels; c) scanning the single color pixels across each said real-time image with a sliding sub-window; d) for each position of said sliding sub-window, extracting local features from the single color pixels within the sliding sub-window of the real-time image, all the local features being based only on single-color pixels from the selected single color channel selected, a local feature being a function of neighbouring single color pixels surrounding a given single color pixel; e) passing the extracted single color pixels local features of each sliding sub-window through a classifier to determine if a polyp is present within a region, called a Region Of Interest, of the sliding sub-windows, the Region Of Interest being delimited by at least one sub-window generated by the sliding sub-window; f) real-time framing on display of colon regions corresponding to regions of interest of said sliding sub-window wherein polyps are detected.

    20. The system of claim 19, wherein the image processor is configured for realizing: for each image, the step c) of scanning p times with p impair and greater than one, each time using a different size of the sliding window, the classifier is then applied to all p scans in order to decide whether a polyp is detected or not with a majority vote.

    21. The system of claim 19, wherein the image processor is configured for realizing in the step e): passing the extracted local features of single color pixels of each position of the sliding sub-window through a classifier to determine if a Region of Interest, containing a polyp, is detected, for at least one serie of n successive images with a image I.sub.f displaying the Region of Interest; for each image of the serie, spatial fusion of the sub-windows in which a same polyp is detected, in each successive image, for the sub-windows overlapping each other spatially on the image with at least x % of their size, to obtain ROI.sub.final in each successive image; for each serie of images, temporal fusion of the ROI.sub.final in only one ROI.sub.displayed, for the ROI.sub.final of the serie overlapping each other with at least y % of their size in the fixed referential of the images, real-time framing on display of colon regions corresponding to position of ROI.sub.displayed in the final image I.sub.f, x and y being non-zero numbers.

    22. The system of claim 21, wherein x is equal to or superior to 50, and y is equal to and superior to 70.

    23. The system of claim 20, wherein the ROI.sub.displayed is calculated for some series of n successive images, n being impair number superior or equal to 3, and a polyp is considered present in the ROI.sub.final if the polyp is detected at least (n+1)/2 times in the serie of n images.

    24. An optical colonoscopy apparatus comprising a system according to claim 18, and an optical colonoscopy probe connected to an input port of said system.

    Description

    [0058] A more complete understanding of the present disclosure thereof may be acquired by referring to the following description taken in conjunction with the accompanying drawings wherein:

    [0059] FIG. 1 is a representation of the apparatus for real-time detection of polyps.

    [0060] FIG. 2 is a flow diagram representing the process of real-time detection of polyps.

    [0061] FIG. 3 is a flow diagram of the process of active learning with a boosting algorithm.

    [0062] FIG. 4 is the representation of screenshots obtained during real-time detection session of polyps.

    [0063] FIG. 5 illustrates spatio-temporal coherence processing according to an embodiment of the invention.

    [0064] While the present invention is susceptible to various modifications and alternative forms, specific example embodiments thereof have been shown in the drawings and are herein described in detail. It should be understood, however, that the description herein of specific example embodiments is not intended to limit the disclosure to the particular forms disclosed herein, but on the contrary, this disclosure is to cover all modifications and equivalents as defined by the appended claims.

    [0065] FIG. 1 is a generic schematic representation of the apparatus used for detecting polyps. The patient 100 on whom the optical colonoscopy is performed is illustrated on FIG. 1. A probe 103 is inserted in the colon of the patient to acquire a plurality of images in real-time, forming a video stream (video-colonoscopy); the invention may also apply to other optical colonoscopy technology, such as wireless capsule endoscopy. Said probe is an optical fiber like camera capable of acquiring said plurality of images in real-time. The probe is connected to the input 104 of the polyps real-time detection system 101. Said input of the real-time detection system receives a video stream of images provided by said probe. Video stream is sent to the image processor 105 configured for real-time processing of said video stream. The image processor comprises a DSP (Digital Signal Processing) pertinently programmed to execute the steps of detecting polyps within said plurality of real-time images. Once processed, said video stream by means of the detection system output 106, is sent to the monitor 102 for real-time display of said plurality of acquired images. The monitor displays in real-time the detection of a polyp 107 wherein the framing 108 is the acknowledgement of such detection.

    [0066] The video may be a High Definition (HD, 14401080 pixels) or a Standard Definition (SD, 720480 pixels) video.

    [0067] In FIG. 2 there is an illustration of the steps of the method for the real-time detection and display of polyps in optical colonoscopy. The method described herein is as follows: [0068] Step a consists in acquiring and displaying a plurality of real-time images from colon regions of the patient. Said plurality of real-time images is in a video stream frame rate with each individual image comprising a plurality of channel colors. In one embodiment of the present invention, said video stream is defined to a frame rate of at least 24 frames per second. The plurality of images are acquired by the probe 103 of FIG. 1 and simultaneously displayed by the monitor 102, also represented in FIG. 1 and performed by step f of the present method. In one embodiment of the present invention, each image of the plurality of real-time images has a dimension of 400300 pixels. [0069] In step b there is a selection of one single color channel among the plurality of color channels. The plurality of color channels is comprised in the full-light spectrum wherein said color channels may be selected to either be visible or non visible. For example they may be comprised in the IR (Infrared) or UV (Ultra-Violet) spectrum. In one embodiment, said single color channel is selected to be visible and comprised in the RGB (Red Green Blue) color space. Limiting the image color channel to only one color whether it is visible or not, contributes towards reducing computational complexity. To further improve detection capabilities, in one embodiment of the invention, the selected single color channel is blue. Blue color helps further improve detection by rejecting parasitic effects due to blood vessels. Other embodiments may include different color spaces and various selections of color channel. [0070] Step c performs a scanning across each real-time image with a sliding sub-window. Scanning is performed to search for polyp candidates. Contrary to many methods or techniques, the attempted detected parameter is not based on polyp boundaries. Each real-time image is thoroughly scanned across its entire area to minimize risks of missing polyps. In one embodiment of the invention, the motion of the sub-window is performed at the step of one pixel at the time. In another embodiment the motion may be performed with larger steps. The sliding window is preferably square, with a size of a few pixels, e.g. 6060 pixels. Other embodiments may include any geometrical shape and dimensions. The sliding sub-window motion is a background process performed by the image processor 105, it is therefore neither visible by the physician performing the detection session nor displayed on the monitor 102. [0071] In step d, for each position taken by the sliding sub-windows a plurality of single pixel color local features of the image is extracted. Said local features are the parameters by which one may distinguish a polyp from for example granulation tissue. In one embodiment, local features are LBPs. Said LPBs are locally describing the properties of polyps. A single LBP is not sufficient to reliably characterise polyps, calculating as many as possible of LBPs is necessary for strong classification decision. In another embodiment, Haar-like features are used for region description. A Haar-like feature is an algorithm based on image intensity. It rather uses a lot of computational power in order to consider adjacent rectangular regions at specific location of a detection window. It first calculates the sum of pixel intensities in said regions and then difference between these sums. This difference is then used to characterise squared regions of an image. LBPs or Haar-like features are associated to a respective classifier, and said classifier is called weak classifier. [0072] In step e local features pass through a classifier for determining if a polyp is present within the sliding sub-windows. The classifier decides whether the extracted features are identified to be the characteristics of polyps. Process by which said classifier is obtained is a boosting algorithm which is detailed in the description of FIG. 3. In one embodiment the boosting algorithm is Adaboost. The principle of Adaboost is the selection of weak classifiers that are moderately accurate in order to create a very accurate classification rule. The result is a linear combination of the selected weak classifiers. Hence, result derived from Adaboost training is a strong classifier corresponding to a linear sum of at least one hundred weak classifiers. More particularly, in a preferred embodiment, the classifier is obtained through a cascade boosting algorithm, such as Cascade Adaboostsee FIG. 3 steps s3-s5. Preferably an active learning step consisting in reinforcing the previously obtained strong classifier by integrating, new false positive detected areas (extracted using the strong classifier) into the learning database, and iterating again steps s3 to s5. [0073] In step f, there is a real-time display of colon regions sensed by the clinician's probe 103. If for a position of the sliding sub-window the extracted local features are identified to present similar features to polyps, then there is real-time framing 108 on monitor 102 of the polyp 107. Real-time display occurs at a video stream frame rate, along with framing if any polyps are detected.

    [0074] FIG. 3 is an illustration of the steps of the active learning process using the boosting algorithm allowing obtaining a strong classifier. The active learning process necessitates a learning database comprising a dataset of training images which may or not contain polyps. The method comprises the steps of: [0075] selecting in s1 a fraction of the dataset of images contained in the learning database for either training or testing purposes. In one embodiment of the invention, the freely available database for training purposes is CVC-ClinicDB comprising 612 images with a resolution 384288. While the testing database, also freely available, is CVC-ColonDB comprising 300 images with a resolution of 574500. [0076] extracting in s2 from selected fraction of dataset images for training purposes a single color channel per image. In one embodiment of the present invention, the single color channel selected per image is blue for both training and testing dataset of images. [0077] applying in s3 a boosting algorithm such as Adaboost (in Cascade configuration) for training a first classifier using a fraction of the dataset of images. Said first classifier is a non-reinforced classifier and tested in s4 with said fraction of images dataset. On the one hand it takes said first classifier about 30 minutes to be computed with LBPs. On the other hand it takes 7 days for Haar-like features to be computed. First classifiers are both computed on a 64-bits operating system with 32 Go of allocated RAM (Random Acces Memory). Even though first classifier based on Haar-like features or LBPs computation might be time and computational power consuming, they are part of the active learning process. Once the active learning is completed, which means that the strong classifier has been reinforced (2 times in a preferred embodiment), contribution to processing time is due to the necessary time to extract local features. In the present invention this processing time is real-time compliant because extraction of local features requires low computational power. [0078] Testing classifier in s4 to identify detection cases of polyps. Based on local features (e.g. LBP) the classifier decides whether or not polyps features are identified within the images. In one embodiment, the detection of a polyp is based on the returned value of the reinforced classifier based on LBPs. If said value is below a threshold there is no polyp detected. A polyp is detected if the value is greater than the threshold. This step is therefore classifying dataset of images according the presence or not of polyps. [0079] identifying in s5 wrongly classified dataset of first classification step s4. Focus here is on the false detections cases of polyps. Ultimately, said false detection cases engage the reliability of first classifier decision rule. In this step the identification of false positive detections is performed through the comparison of classified images during s4 to ground truth images. Active learning boosting algorithm cornerstone consists in iterating the choice of weak classifiers using local feature signatures of ground truth images stored in a database. Said ground truth images are images which are known to effectively contain polyps or not. At this stage, miss-classified local features during first classifications are reinforced by integrating into the learning database, wrongly detected new areas as polyp by the classifier. [0080] repeating steps s3 to s5 a plurality of times until a final classifier is obtained. Said final classifier is used in step e of FIG. 2 and is called reinforced classifier. In one embodiment of the invention, steps s3 to s5 are repeated exactly three times. The process of repeating steps s3 to s5 is used to reinforce the classifier. In one embodiment, LBP based classifier takes respectively for first, second and third reinforcement, 1, 2 and 6 hours. Classification is computed using same computer than in step s3.

    [0081] Table 1 below show the computational time required for obtaining a non-reinforced classifier (1.sup.st line) and a 1.sup.st, 2.sup.nd and 3.sup.rd reinforced classifier (2.sup.nd, 3.sup.rd, 4.sup.th line, respectively). These classifiers were created using a same computer (a 64-bits Windows with 32 Go of RAM). For each image of the training database, the researchers identified and isolated the position of one polyp (positive example) and also isolated 5 negative examples (without polyps, negative example). To test the blue component, classifiers were first trained with 550 positive examples and 3000 negative examples. Then, considering the active learning reinforcement, the three different classifiers were trained using 6000, 7500 and 8500 negative examples, respectively.

    TABLE-US-00001 TABLE 1 Number of positives Number examples of positives Computational Classifier used examples used time Non Reinforced Classifier 550 3000 30 minutes 1.sup.st Reinforced Classifier 550 6000 1 hour 2.sup.nd Reinforced Classifier 550 7500 2 hours 3.sup.rd Reinforced Classifier 550 8500 6 hours

    [0082] Table 2 below is a comparison of the computation results of first classification performed in step s3 according to various embodiments of the present invention, which are for different visible single color channel selections.

    TABLE-US-00002 TABLE 2 Grayscale Red Channel Green Channel Blue Channel Local Binary Pattern Classifier Image Image Image Image True Positive Detections 155 238 241 254 False Positive Detections 117 867 898 1067 False Negative Detections 118 35 32 19 Recall (%) 56.78 87.18 88.24 93.04 Precision (%) 56.99 21.54 21.16 19.23 F.sub.2 Score (%) 56.82 54.16 54.01 52.63 Average Detection Time for 1 Image (s) 0.221 0.092 0.066 0.051

    [0083] From Table 2, one can see that the single color channel blue is not only capable of detecting correctly the highest number of polyps but it is also the one necessitating the shortest time on average to process one single image.

    [0084] FIG. 4 is a screenshot during a session of real-time detection of polyps using the herein presented method. The method is implemented on a 64-bits operating system laptop clocked at 1.6 GHz with 4 Go of RAM. The figure illustrates true positive detections 401, 402, 403, and 404 with frames identical to 400. The dot 405 represents the center of the frame 406 acknowledging a true positive detection.

    [0085] The present invention uses the same database as the previously cited prior art J. Bernal et al., therefore it is easier to compare performances of both techniques. In Table 3, best performances are overall obtained from the present invention. Results of the present invention are after three reinforcement of the classifier while using LBPs. These are shown and compared to the most up-to-date reports at the time of writing.

    TABLE-US-00003 TABLE 3 Authors Performances Database Real-time J. Bernal Sensitivity = 89%, CVC-ColonDB No (19 s/image) et al. F2 = 89% Present Sensitivity = 86%, CVC-ColonDB Yes (35 ms/image) invention F2 = 65%

    [0086] Both methods have approximately the same sensitivity, 89% for prior art of J. Bernal et al. and 86% for the method of the present invention. Even though both methods are on par in terms of sensitivity their F2 score is substantially different in favor of the prior art. But the difference is even greater if one looks at the average processing time per image showing a factor of nearly 550. Prior art is almost 550 times slower than the method of the present invention. Making object of the invention real-time compliant with satisfactory detection results.

    [0087] Table 4 below shows the effect of the active Learning strategy on the performances (recall, precision, F2 score, average detection time) of the inventive method. It can be seen that this strategy significantly improve the is overall performances and particularly recall and F2-score.

    TABLE-US-00004 TABLE 4 Classifyer using Local Without 1st 2nd 3rd Binary active Reinforced Reinforced Reinforced Pattern learning Classifier Classifier Classifier Recall 93.04% 93.77% 88.28% 86.21% Precision 19.23% 23.66% 30.70% 32.83% F2 Score 52.63% 58.88% 64.20% 65.33% Average 51 ms 44 ms 40 ms 39 ms detection time for 1 image

    [0088] The implementation of the real-time detection method is not limited to a computer system. In other embodiments, one can take advantage of the low computational power requirements and use GPUs (Graphics Processing Unit), FPGAs (Field Programmable Gate Array) or even integrated computer systems like RaspberryPis to implement such method.

    [0089] The AdaBoost algorithm of the present invention is developed with OpenCV. Other embodiments may include the use of different means or database to develop the algorithm.

    [0090] Other embodiments may also use a different boosting algorithm such as logitboost.

    [0091] In one embodiment, the scanning is performed p times with p impair and greater than one, each time using a different size of the sliding window. The classifier is then applied to all n scans in order to decide whether a polyp is detected or not, e.g. through a majority vote (in this case, a polyp is considered present if it is detected at least p+1/2 times).

    [0092] When using videos, e.g. at a typical rate of 25 frames/sec., rather than sets of still images, a significant improvement of the performances can be obtained through a spatio-temporal coherence processing stage. The idea is to improve the polyp detection rate and stability by combining present information, provided by the current frame, and past information, provided by previous frames showing a same region of the colon. FIG. 5 illustrates an exemplary spatio-temporal processing stage, based on a majority voting over three successive frames.

    [0093] This approach is a spatial block fusion strategy to reduce the amount of candidates provided by selecting as final candidate ROI only those in which there was a higher degree of overlapping out of all the candidate boxes initially provided by the method. The spatial block fusion is applied to some successive images of a video to confirm or not the detection of a polyp by the method of the invention.

    [0094] More precisely, the final sub-windows identified as polyps are defined as ROIs (Region of Interests). If multiple ROIs are located on the same regions of the image, a fusion strategy is used. This strategy consists in merging of the ROIs sufficiently overlapping (e.g. by 50% or more of their surfaces) and a final ROI.sub.final is generated. These ROIs within the images are defined as final ROI.sub.final.

    [0095] According to this approach, a polyp detection is confirmed at time t.sub.icorresponding to the i.sup.th frameif and only if the polyp has been detected, at a same location, in at least two among the (i2).sup.th, (i1).sup.th and i.sup.th frames. On FIG. 5, squares labeled ROI1.sub.final i-2, ROI1.sub.final i-1, ROI1.sub.final i identify corresponding (i.e. overlapping, e.g. by at least 70% of theirs surfaces) Regions Of Interest (ROI), containing a polyp, on three successive frames. Squares ROI2.sub.final i-1 and ROI3.sub.final i correspond to unconnected ROIs in successive frames, which are not combined by the spatio-temporal coherence processing stage.

    [0096] Majority voting can also be performed on more than three frames, and other spatio-temporal coherence processing method may be applied to the invention.

    [0097] In other terms, the method comprises in the step e): [0098] passing the extracted local features of single color pixels of each position of the sliding sub-window through a classifier to determine if a Region of Interest, containing a polyp, is detected, for at least one serie of n successive images with a image I.sub.f displaying the Region of Interest; the image I.sub.f can be the final image of the serie or not; [0099] for each image of the serie, spatial fusion of the sub-windows in which a same polyp is detected, in each successive image, for the sub-windows overlapping each other spatially on the image with at least x % of their size, to obtain ROI.sub.final in each successive image where there is a polyp detected; thus if there is one polyp on the image one ROI.sub.final is obtained on the image, and if there is two polyps two different ROI.sub.final are obtained on the image; [0100] for each serie of images, temporal fusion of the ROI.sub.final in only one ROI.sub.displayed by polyp detected, [0101] for the ROI.sub.final of successive images overlapping each other with at least y % of their size in the referential of the images; for keeping only one ROI.sub.displayed by polyp detected; [0102] the referential of the images which is common to all the images means that the mask images (having the same size) are superposed (or stacked) and the position of ROI.sub.final of each image is compared to the other position of the other ROI.sub.final of the other images of the considered serie; [0103] real-time framing on display of colon regions corresponding to position of ROI.sub.displayed in the final image I.sub.f,

    [0104] X and y being non-zero numbers.

    [0105] When the image I.sub.f is the final image of the serie, the method still performs completely real-time detection because the calculation realized in the method of the invention takes less than 30 ms allowing the displaying of the Region of Interest ROI.sub.displayed in the same time than the image which takes 40 ms to appear in a video (with 25 images/second).

    [0106] In another embodiment, for instance, the image I.sub.f can be in the middle of the serie of images. For instance if n=5, I.sub.f is preceded by two images and is followed by two images.

    [0107] Advantageously, x is equal to or superior to 50, and y is equal to and superior to 70. These values allows to have ROI that encompasses with some precision the polyp.

    [0108] Advantageously, the ROI.sub.displayed is calculated for some series of n successive images, n being impair a natural integer superior or equal to 3, and a polyp is considered present in the ROI.sub.final if the polyp is detected at least (n+1)/2 times in the serie of the n images.

    [0109] To sum up, the method takes into account three successive majority votes: [0110] one majority vote during the step c) consisting in strengthening the classification of a sub-window using different scales of the same sub-window; for instance the polyp must have been detected on at least two scales of the same sub-window out of three; then the middle size of the polyp sub-window is stored; [0111] one second majority vote during the step e) for spatial coherence, consisting in comparing and merging the polyp sub-windows of step c) when overlapping criteria x is filled to obtain ROI.sub.final for each image of the sequence; for instance a majority vote is realized on the polyp middle sub-windows for obtaining the ROI.sub.final of the image; [0112] one final following majority vote during the step e) for temporal coherence, consisting in comparing ROI.sub.final of at least 3 successive images and merging the ROI.sub.final of step e) when overlapping criteria y is filled to obtain ROI.sub.display for each image of the sequence; for instance a majority vote is realized on the ROI.sub.final for obtaining the ROI.sub.display of the serie of the images.

    [0113] Table 5 below shows the results obtained using two different kind of local features for polyp detectionLBP and Haar-like featureswith (STC) and without spatio-temporal coherence processing. Active learning was not used (N0 suffix).

    [0114] The following metrics were used to measure performances obtained by the inventive method on videos: [0115] Prec: Precision; [0116] Rec: Recall; [0117] F1: combines Precision and Recall; [0118] PDR: polyp detection rate; [0119] MPT: Mean processing time per frame; [0120] MNFP: Mean number of false positive per frame; [0121] RT reaction time (latency between the first detection of a polyp by the algorithm and its actual appearance on the ground truth);

    TABLE-US-00005 TABLE 5 Methods PDR MPT MNFP Prec Rec F1 RT LBPN0 100% 140 ms 3.5 12.42% 54.65% 20.24% 7.2 (0.3 s) HaarN0 100% 24 ms 1.4 23.29% 46.82% 31.10% 17.5 (0.7 s) LBPN0_STC 100% 140 ms 1.9 16.25% 41.25% 23.31% 35.0 (1.4 s) HaarN0_STC 100% 36 ms 0.9 27.02% 39.61% 32.12% 38.3 (1.5 s)

    [0122] In Table 5, it can be noticed that for all the considered videos (18), the polyp was detected in a significant number of frames, leading to a PDR of 100%. The Mean Processing Time per frame is only of 24 ms using Haar-like features without spatio-temporal coherence and of 36 ms with it, which is fully compatible with a real-time use. It is also observable that the spatio temporal coherence leads, for both local features, to an improvement of the global performances in terms of Precision and Recall as well as of F1 score. The Reaction Time also increases using spatio-temporal coherence processing with a mean delay of 1.5 s, which, nevertheless, remains compatible with a clinical use.

    [0123] Table 6 shows the results obtained using both spatio-temporal coherence processing and active learning. It can be seen that the combined use of active learning strategy and spatio-temporal coherence processing leads to a significant improvement of the overall performance in terms of Precision, Recall without altering the 100% Polyp Detection Rate. HaarN1 appears to be the best local features to use with a MPT of only 21 ms and a Reaction Time of only 1.1 s.

    [0124] In table 6:

    [0125] N0 represents no active reinforcement;

    [0126] N1 represents one active reinforcement;

    [0127] N2 represents two active reinforcements;

    TABLE-US-00006 TABLE 6 Method PDR MPT MNFP Prec Rec F1 RT LBPN0_STC 100% 140 ms 1.9 16.25% 41.25% 23.31% 35.0 (1.4 s) LBPN1_STC 100% 160 ms 1.1 27.11% 46.02% 34.12% 43.7 (1.7 s) LBPN2_STC 100% 162 ms 0.7 29.88% 34.96% 32.22% 45.9 (1.8 s) HaarN0_STC 100% 36 ms 0.9 27.02% 39.61% 32.12% 38.3 (1.5 s) HaarN1_STC 100% 21 ms 0.6 39.14% 42.56% 48.78% 27.3 (1.1 s)