Structured adaptive boosting trees for detection of multicellular aggregates in fluorescence intravital microscopy

Fluorescence intravital microscopy captures large data sets of dynamic multicellular interactions within various organs such as the lungs, liver, and brain of living subjects. In medical imaging, edge detection is used to accurately identify and delineate important structures and boundaries inside the images. To improve edge sharpness, edge detection frequently requires the inclusion of low-level features. Herein, a machine learning approach is needed to automate the edge detection of multicellular aggregates of distinctly labeled blood cells within the microcirculation. In this work, the Structured Adaptive Boosting Trees algorithm (AdaBoost.S) is proposed as a contribution to overcome some of the edge detection challenges related to medical images. Algorithm design is based on the observation that edges over an image mask often exhibit special structures and are interdependent. Such structures can be predicted using the features extracted from a bigger image patch that covers the image edge mask. The proposed AdaBoost.S is applied to detect multicellular aggregates within blood vessels from the fluorescence lung intravital images of mice exposed to e-cigarette vapor. The predictive capabilities of this approach for detecting platelet-neutrophil aggregates within the lung blood vessels are evaluated against three conventional machine learning algorithms: Random Forest, XGBoost and Decision Tree. AdaBoost.S exhibits a mean recall, F-score, and precision of 0.81, 0.79, and 0.78, respectively. Compared to all three existing algorithms, AdaBoost.S has statistically better performance for recall and F-score. Although AdaBoost.S does not outperform Random Forest in precision, it remains superior to the XGBoost and Decision Tree algorithms. The proposed AdaBoost.S is widely applicable to analysis of other fluorescence intravital microscopy applications including cancer, infection, and cardiovascular disease.