Search

Study designA magnetic resonance imaging study of human cadaver spines.ObjectiveTo investigate associations between cartilage endplate (CEP) thickness and disc degeneration.Summary of background dataDamage to the CEP is associated with spinal injury and back pain. However, CEP morphology and its association with disc degeneration have not been well characterized.MethodsTen lumbar motion segments with varying degrees of disc degeneration were harvested from six cadaveric spines and scanned with magnetic resonance imaging in the sagittal plane using a T2-weighted two-dimensional (2D) sequence, a three-dimensional (3D) ultrashort echo-time (UTE) imaging sequence, and a 3D T1ρ mapping sequence. CEP thicknesses were calculated from 3D UTE image data using a custom, automated algorithm, and these values were validated against histology measurements. Pfirrmann grades and T1ρ values in the disc were assessed and correlated with CEP thickness.ResultsThe mean CEP thickness calculated from UTE images was 0.74 ± 0.04 mm. Statistical comparisons between histology and UTE-derived measurements of CEP thickness showed significant agreement, with the mean difference not significantly different from zero (P = 0.32). Within-disc variation of T1ρ (standard deviation) was significantly lower for Pfirrmann grade 4 than Pfirrmann grade 3 (P

Fully convolutional networks (FCNs) are widely used for instance segmentation. One important challenge is to sufficiently train these networks to yield good generalizations for hard-to-learn pixels, correct prediction of which may greatly affect the success. A typical group of such hard-to-learn pixels are boundaries between instances. Many studies have developed strategies to pay more attention to learning these boundary pixels. They include designing multi-task networks with an additional task of boundary prediction and increasing the weights of boundary pixels’ predictions in the loss function. Such strategies require defining what to attend beforehand and incorporating this defined attention to the learning model. However, there may exist other groups of hard-to-learn pixels and manually defining and incorporating the appropriate attention for each group may not be feasible. In order to provide an adaptable solution to learn different groups of hard-to-learn pixels, this article proposes AttentionBoost, which is a new multi-attention learning model based on adaptive boosting, for the task of gland instance segmentation in histopathological images. AttentionBoost designs a multi-stage network and introduces a new loss adjustment mechanism for an FCN to adaptively learn what to attend at each stage directly on image data without necessitating any prior definition. This mechanism modulates the attention of each stage to correct the mistakes of previous stages, by adjusting the loss weight of each pixel prediction separately with respect to how accurate the previous stages are on this pixel. Working on histopathological images of colon tissues, our experiments demonstrate that the proposed AttentionBoost model improves the results of gland segmentation compared to its counterparts. [ABSTRACT FROM AUTHOR]

Histopathological examination is today’s gold standard for cancer diagnosis. However, this task is time consuming and prone to errors as it requires a detailed visual inspection and interpretation of a pathologist. Digital pathology aims at alleviating these problems by providing computerized methods that quantitatively analyze digitized histopathological tissue images. The performance of these methods mainly relies on the features that they use, and thus, their success strictly depends on the ability of these features by successfully quantifying the histopathology domain. With this motivation, this paper presents a new unsupervised feature extractor for effective representation and classification of histopathological tissue images. This feature extractor has three main contributions: First, it proposes to identify salient subregions in an image, based on domain-specific prior knowledge, and to quantify the image by employing only the characteristics of these subregions instead of considering the characteristics of all image locations. Second, it introduces a new deep learning-based technique that quantizes the salient subregions by extracting a set of features directly learned on image data and uses the distribution of these quantizations for image representation and classification. To this end, the proposed deep learning-based technique constructs a deep belief network of the restricted Boltzmann machines (RBMs), defines the activation values of the hidden unit nodes in the final RBM as the features, and learns the quantizations by clustering these features in an unsupervised way. Third, this extractor is the first example for successfully using the restricted Boltzmann machines in the domain of histopathological image analysis. Our experiments on microscopic colon tissue images reveal that the proposed feature extractor is effective to obtain more accurate classification results compared to its counterparts. [ABSTRACT FROM AUTHOR]

More rapid and accurate high-throughput screening in molecular cellular biology research has become possible with the development of automated microscopy imaging, for which cell nucleus segmentation commonly constitutes the core step. Although several promising methods exist for segmenting the nuclei of monolayer isolated and less-confluent cells, it still remains an open problem to segment the nuclei of more-confluent cells, which tend to grow in overlayers. To address this problem, we propose a new model-based nucleus segmentation algorithm. This algorithm models how a human locates a nucleus by identifying the nucleus boundaries and piecing them together. In this algorithm, we define four types of primitives to represent nucleus boundaries at different orientations and construct an attributed relational graph on the primitives to represent their spatial relations. Then, we reduce the nucleus identification problem to finding predefined structural patterns in the constructed graph and also use the primitives in region growing to delineate the nucleus borders. Working with fluorescence microscopy images, our experiments demonstrate that the proposed algorithm identifies nuclei better than previous nucleus segmentation algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new approach for unsupervised segmentation of histopathological tissue images. This approach has two main contributions. First, it introduces a new set of high-level texture features to represent the prior knowledge of spatial organization of the tissue components. These texture features are defined on the tissue components, which are approximately represented by tissue objects, and quantify the frequency of two component types being cooccurred in a particular spatial relationship. As they are defined on components, rather than on image pixels, these object cooccurrence features are expected to be less vulnerable to noise and variations that are typically observed at the pixel level of tissue images. Second, it proposes to obtain multiple segmentations by multilevel partitioning of a graph constructed on the tissue objects and combine them by an ensemble function. This multilevel graph partitioning algorithm introduces randomization in graph construction and refinements in its multilevel scheme to increase diversity of individual segmentations, and thus, improve the final result. The experiments on 200 colon tissue images reveal that the proposed approach—the object cooccurrence features together with the multilevel segmentation algorithm—is effective to obtain high-quality results. The experiments also show that it improves the segmentation results compared to the previous approaches. [ABSTRACT FROM PUBLISHER]

The histopathological examination of tissue specimens is essential for cancer diagnosis and grading. However, this examination is subject to a considerable amount of observer variability as it mainly relies on visual interpretation of pathologists. To alleviate this problem, it is very important to develop computational quantitative tools, for which image segmentation constitutes the core step. In this paper, we introduce an effective and robust algorithm for the segmentation of histopathological tissue images. This algorithm incorporates the background knowledge of the tissue organization into segmentation. For this purpose, it quantifies spatial relations of cytological tissue components by constructing a graph and uses this graph to define new texture features for image segmentation. This new texture definition makes use of the idea of gray-level run-length matrices. However, it considers the runs of cytological components on a graph to form a matrix, instead of considering the runs of pixel intensities. Working with colon tissue images, our experiments demonstrate that the texture features extracted from “graph run-length matrices” lead to high segmentation accuracies, also providing a reasonable number of segmented regions. Compared with four other segmentation algorithms, the results show that the proposed algorithm is more effective in histopathological image segmentation. [ABSTRACT FROM AUTHOR]

Abstract: Gland segmentation is an important step to automate the analysis of biopsies that contain glandular structures. However, this remains a challenging problem as the variation in staining, fixation, and sectioning procedures lead to a considerable amount of artifacts and variances in tissue sections, which may result in huge variances in gland appearances. In this work, we report a new approach for gland segmentation. This approach decomposes the tissue image into a set of primitive objects and segments glands making use of the organizational properties of these objects, which are quantified with the definition of object-graphs. As opposed to the previous literature, the proposed approach employs the object-based information for the gland segmentation problem, instead of using the pixel-based information alone. Working with the images of colon tissues, our experiments demonstrate that the proposed object-graph approach yields high segmentation accuracies for the training and test sets and significantly improves the segmentation performance of its pixel-based counterparts. The experiments also show that the object-based structure of the proposed approach provides more tolerance to artifacts and variances in tissues. [Copyright &y& Elsevier]

Multi-task learning proved to be an effective strategy to increase the performance of a dense prediction network on a segmentation task, by defining auxiliary tasks to reflect different aspects of the problem and concurrently learning them with the main task of segmentation. Up to now, previous studies defined their auxiliary tasks in the Euclidean space. However, for some segmentation tasks, the complexity and high variation in the texture of a region of interest may not follow the smoothness constraint in the Euclidean geometry. This paper addresses this issue by introducing a new multi-task network, MTFD-Net , which utilizes the fractal geometry to quantify texture complexity through self-similar patterns in an image. To this end, we propose to transform an image into a map of fractal dimensions and define its learning as an auxiliary task, which will provide auxiliary supervision to the main segmentation task, towards betterment of left atrium (LA) segmentation in computed tomography (CT) images. To the best of our knowledge, this is the first proposal of a dense prediction network that employs the fractal geometry to define an auxiliary task and learns it in parallel to the segmentation task in a multi-task learning framework. Our experiments revealed that the proposed MTFD-Net model led to more accurate LA segmentations compared to its counterparts. • A segmentation network quantifying texture complexity through self-similar patterns. • The model learns fractal dimension map estimation in a multi-task learning framework. • The model led to improved performance for left atrium segmentation in CT images. [ABSTRACT FROM AUTHOR]

Abstract: Staining methods routinely used in pathology lead to similar color distributions in the biologically different regions of histopathological images. This causes problems in image segmentation for the quantitative analysis and detection of cancer. To overcome this problem, unlike previous methods that use pixel distributions, we propose a new homogeneity measure based on the distribution of the objects that we define to represent tissue components. Using this measure, we demonstrate a new object-oriented segmentation algorithm. Working with colon biopsy images, we show that this algorithm segments the cancerous and normal regions with 94.89 percent accuracy on the average and significantly improves the segmentation accuracy compared to its pixel-based counterpart. [Copyright &y& Elsevier]