Iterative Relative Fuzzy Connectedness Research Articles

Hybrid PET/MRI co-segmentation based on joint fuzzy connectedness and graph cut

Background and ObjectiveTumor segmentation from hybrid PET/MRI scans may be highly beneficial in radiotherapy treatment planning. Indeed, it gives for both modalities the suitable information that could make the delineation of tumors more accurate than using each one apart. We aim in this work to propose a co-segmentation method that deals with several challenges, notably the lack of one-to-one correspondence between tumors of the two modalities and the boundaries’ smoothing. MethodsThe proposed method is designed to surpass these limits, we propose a segmentation method based on the GCsummax technique. The method takes the advantage of Iterative Relative Fuzzy Connectedness (IRFC) on seeds initialization, and the standard min-cut/max-flow technique for the boundary smoothing. Seed initialization was accurately performed thanks to high uptake regions on PET. Besides, a visibility weighting scheme was adapted to achieve the task of co-segmentation using the IRFC algorithm. Then, given the co-segmented regions, we introduce a morphological-based technique that provides object seeds to standard Graph Cut (GC) allowing it to avoid the shrinking problem. Finally, for each modality, the segmentation task is formulated as an energy minimization problem which is resolved by a min-cut/max-flow technique. ResultsThe overlap ratio (denoted DSC) between our segmentation results and the ground-truth for PET images is 92.63 ± 1.03, while the DSC for MRI images is 90.61 ± 3.70. ConclusionsThe proposed method was tested on different types of diseases and it outperformed the state-of-the-art methods. We show its superiority in terms of assymetric relation between PET and MRI and tumors heterogeneity.

Interactive iterative relative fuzzy connectedness lung segmentation on thoracic 4D dynamic MR images.

Lung delineation via dynamic 4D thoracic magnetic resonance imaging (MRI) is necessary for quantitative image analysis for studying pediatric respiratory diseases such as thoracic insufficiency syndrome (TIS). This task is very challenging because of the often-extreme malformations of the thorax in TIS, lack of signal from bone and connective tissues resulting in inadequate image quality, abnormal thoracic dynamics, and the inability of the patients to cooperate with the protocol needed to get good quality images. We propose an interactive fuzzy connectedness approach as a potential practical solution to this difficult problem. Manual segmentation is too labor intensive especially due to the 4D nature of the data and can lead to low repeatability of the segmentation results. Registration-based approaches are somewhat inefficient and may produce inaccurate results due to accumulated registration errors and inadequate boundary information. The proposed approach works in a manner resembling the Iterative Livewire tool but uses iterative relative fuzzy connectedness (IRFC) as the delineation engine. Seeds needed by IRFC are set manually and are propagated from slice-to-slice, decreasing the needed human labor, and then a fuzzy connectedness map is automatically calculated almost instantaneously. If the segmentation is acceptable, the user selects "next" slice. Otherwise, the seeds are refined and the process continues. Although human interaction is needed, an advantage of the method is the high level of efficient user-control on the process and non-necessity to refine the results. Dynamic MRI sequences from 5 pediatric TIS patients involving 39 3D spatial volumes are used to evaluate the proposed approach. The method is compared to two other IRFC strategies with a higher level of automation. The proposed method yields an overall true positive and false positive volume fraction of 0.91 and 0.03, respectively, and Hausdorff boundary distance of 2 mm.

Defect detection in slab surface: a novel dual Charge-coupled Device imaging-based fuzzy connectedness strategy.

To provide an accurate surface defects inspection system and make the automation of robust image segmentation method a reality in routine production line, a general approach is presented for continuous casting slab (CC-slab) surface defects extraction and delineation. The applicability of the system is not tied to CC-slab exclusively. We combined the line array CCD (Charge-coupled Device) traditional scanning imaging (LS-imaging) and area array CCD laser three-dimensional (3D) scanning imaging (AL-imaging) strategies in designing the system. Its aim is to suppress the respective imaging system's limitations. In the system, the images acquired from the two CCD sensors are carefully aligned in space and in time by maximum mutual information-based full-fledged registration schema. Subsequently, the image information is fused from these two subsystems such as the unbroken 2D information in LS-imaging and 3D depressed information in AL-imaging. Finally, on the basis of the established dual scanning imaging system the region of interest (ROI) localization by seed specification was designed, and the delineation for ROI by iterative relative fuzzy connectedness (IRFC) algorithm was utilized to get a precise inspection result. Our method takes into account the complementary advantages in the two common machine vision (MV) systems and it performs competitively with the state-of-the-art as seen from the comparison of experimental results. For the first time, a joint imaging scanning strategy is proposed for CC-slab surface defect inspection that allows a feasible way of powerful ROI delineation strategies to be applied to the MV inspection field. Multi-ROI delineation by using IRFC in this research field may further improve the results.

Efficient ribcage segmentation from CT scans using shape features.

Rib cage structure and morphology is important for anatomical analysis of chest CT scans. A fundamental challenge in rib cage extraction is varying intensity levels and connection with adjacent bone structures including shoulder blade and sternum. In this study, we present a fully automated 3-D algorithm to segment the rib cage by detection and separation of other bone structures. The proposed approach consists of four steps. First, all high-intensity bone structures are segmented. Second, multi-scale Hessian analysis is performed to capture plateness and vesselness information. Third, with the plate/vessel features, bone structures other than rib cage are detected. Last, the detected bones are separated from rib cage with iterative relative fuzzy connectedness method. The algorithm was evaluated using 400 human CT scans and 100 small animal images with various resolution. The results suggested that the percent accuracy of rib cage extraction is over 95% with the proposed algorithm.

Body-wide hierarchical fuzzy modeling, recognition, and delineation of anatomy in medical images.

To make Quantitative Radiology (QR) a reality in radiological practice, computerized body-wide Automatic Anatomy Recognition (AAR) becomes essential. With the goal of building a general AAR system that is not tied to any specific organ system, body region, or image modality, this paper presents an AAR methodology for localizing and delineating all major organs in different body regions based on fuzzy modeling ideas and a tight integration of fuzzy models with an Iterative Relative Fuzzy Connectedness (IRFC) delineation algorithm. The methodology consists of five main steps: (a) gathering image data for both building models and testing the AAR algorithms from patient image sets existing in our health system; (b) formulating precise definitions of each body region and organ and delineating them following these definitions; (c) building hierarchical fuzzy anatomy models of organs for each body region; (d) recognizing and locating organs in given images by employing the hierarchical models; and (e) delineating the organs following the hierarchy. In Step (c), we explicitly encode object size and positional relationships into the hierarchy and subsequently exploit this information in object recognition in Step (d) and delineation in Step (e). Modality-independent and dependent aspects are carefully separated in model encoding. At the model building stage, a learning process is carried out for rehearsing an optimal threshold-based object recognition method. The recognition process in Step (d) starts from large, well-defined objects and proceeds down the hierarchy in a global to local manner. A fuzzy model-based version of the IRFC algorithm is created by naturally integrating the fuzzy model constraints into the delineation algorithm. The AAR system is tested on three body regions - thorax (on CT), abdomen (on CT and MRI), and neck (on MRI and CT) - involving a total of over 35 organs and 130 data sets (the total used for model building and testing). The training and testing data sets are divided into equal size in all cases except for the neck. Overall the AAR method achieves a mean accuracy of about 2 voxels in localizing non-sparse blob-like objects and most sparse tubular objects. The delineation accuracy in terms of mean false positive and negative volume fractions is 2% and 8%, respectively, for non-sparse objects, and 5% and 15%, respectively, for sparse objects. The two object groups achieve mean boundary distance relative to ground truth of 0.9 and 1.5 voxels, respectively. Some sparse objects - venous system (in the thorax on CT), inferior vena cava (in the abdomen on CT), and mandible and naso-pharynx (in neck on MRI, but not on CT) - pose challenges at all levels, leading to poor recognition and/or delineation results. The AAR method fares quite favorably when compared with methods from the recent literature for liver, kidneys, and spleen on CT images. We conclude that separation of modality-independent from dependent aspects, organization of objects in a hierarchy, encoding of object relationship information explicitly into the hierarchy, optimal threshold-based recognition learning, and fuzzy model-based IRFC are effective concepts which allowed us to demonstrate the feasibility of a general AAR system that works in different body regions on a variety of organs and on different modalities.

GPU‐based relative fuzzy connectedness image segmentation

Recently, clinical radiological research and practice are becoming increasingly quantitative. Further, images continue to increase in size and volume. For quantitative radiology to become practical, it is crucial that image segmentation algorithms and their implementations are rapid and yield practical run time on very large data sets. The purpose of this paper is to present a parallel version of an algorithm that belongs to the family of fuzzy connectedness (FC) algorithms, to achieve an interactive speed for segmenting large medical image data sets. The most common FC segmentations, optimizing an [script-l](∞)-based energy, are known as relative fuzzy connectedness (RFC) and iterative relative fuzzy connectedness (IRFC). Both RFC and IRFC objects (of which IRFC contains RFC) can be found via linear time algorithms, linear with respect to the image size. The new algorithm, P-ORFC (for parallel optimal RFC), which is implemented by using NVIDIA's Compute Unified Device Architecture (CUDA) platform, considerably improves the computational speed of the above mentioned CPU based IRFC algorithm. Experiments based on four data sets of small, medium, large, and super data size, achieved speedup factors of 32.8×, 22.9×, 20.9×, and 17.5×, correspondingly, on the NVIDIA Tesla C1060 platform. Although the output of P-ORFC need not precisely match that of IRFC output, it is very close to it and, as the authors prove, always lies between the RFC and IRFC objects. A parallel version of a top-of-the-line algorithm in the family of FC has been developed on the NVIDIA GPUs. An interactive speed of segmentation has been achieved, even for the largest medical image data set. Such GPU implementations may play a crucial role in automatic anatomy recognition in clinical radiology.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GCmax. The output of GCmax coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GCmax is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GCmax algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GCmax runs in linear time with respect to the image size |C|. We show that the output of GCmax constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the l ∞ norm ∥F P ∥∞ of the map F P that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ∥F P ∥ q for q∈[1,∞]. Of these, the best known minimization problem is for the energy ∥F P ∥1, which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ∥F P ∥ q , q∈[1,∞), is identical to that for ∥F P ∥1, when the original weight function w is replaced by w q . Thus, any algorithm GCsum solving the ∥F P ∥1 minimization problem, solves also one for ∥F P ∥ q with q∈[1,∞), so just two algorithms, GCsum and GCmax, are enough to solve all ∥F P ∥ q -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ∥F P ∥ q -minimization problems converge to a solution of the ∥F P ∥∞-minimization problem (∥F P ∥∞=lim q→∞∥F P ∥ q is not enough to deduce that). An experimental comparison of the performance of GCmax and GCsum algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms’ running time, as well as the influence of the choice of the seeds on the output.

Iterative relative fuzzy connectedness for multiple objects with multiple seeds

In this paper we present a new theory and an algorithm for image segmentation based on a strength of connectedness between every pair of image elements. The object definition used in the segmentation algorithm utilizes the notion of iterative relative fuzzy connectedness, IRFC. In previously published research, the IRFC theory was developed only for the case when the segmentation was involved with just two segments, an object and a background, and each of the segments was indicated by a single seed. (See Udupa et al. [J.K. Udupa, P.K. Saha, R.A. Lotufo, Relative fuzzy connectedness and object definition: theory, algorithms, and applications in image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 24 (2002) 1485–1500] and Saha and Udupa [P.K. Saha, J.K. Udupa, Iterative relative fuzzy connectedness and object definition: theory, algorithms, and applications in image segmentation, in: Proceedings of IEEE Workshop on Mathematical Methods in Biomedical Image Analysis, Hilton Head, South Carolina, 2002, pp. 28–35].) Our theory, which solves a problem of Udupa and Saha from [J.K. Udupa, P.K. Saha, Fuzzy connectedness in image segmentation, Proc. IEEE 91 (10) (2003) 1649–1669], allows simultaneous segmentation involving an arbitrary number of objects. Moreover, each segment can be indicated by more than one seed, which is often more natural and easier than a single seed object identification. The first iteration step of the IRFC algorithm gives a segmentation known as relative fuzzy connectedness, RFC, segmentation. Thus, the IRFC technique is an extension of the RFC method. Although the RFC theory, due to Saha and Udupa [P.K. Saha, J.K. Udupa, Relative fuzzy connectedness among multiple objects: theory, algorithms, and applications in image segmentation, Comput. Vis. Image Understand. 82 (1) (2001) 42–56], is developed in the multi object/multi seed framework, the theoretical results presented here are considerably more delicate in nature and do not use the results from [P.K. Saha, J.K. Udupa, Relative fuzzy connectedness among multiple objects: theory, algorithms, and applications in image segmentation, Comput. Vis. Image Understand. 82 (1) (2001) 42–56]. On the other hand, the theoretical results from [P.K. Saha, J.K. Udupa, Relative fuzzy connectedness among multiple objects: theory, algorithms, and applications in image segmentation, Comput. Vis. Image Understand. 82 (1) (2001) 42–56] are immediate consequences of the results presented here. Moreover, the new framework not only subsumes previous fuzzy connectedness descriptions but also sheds new light on them. Thus, there are fundamental theoretical advances made in this paper. We present examples of segmentations obtained via our IRFC-based algorithm in the multi-object/multi-seed environment, and compare it with the results obtained with the RFC-based algorithm. Our results indicate that, in many situations, IRFC outperforms RFC, but there also exist instances where the gain in performance is negligible.

Artery-vein separation via MRA--an image processing approach.

This paper presents a near-automatic process for separating vessels from background and other clutter as well as for separating arteries and veins in contrast-enhanced magnetic resonance angiographic (CE-MRA) image data, and an optimal method for three-dimensional visualization of vascular structures. The separation process utilizes fuzzy connected object delineation principles and algorithms. The first step of this separation process is the segmentation of the entire vessel structure from the background and other clutter via absolute fuzzy connectedness. The second step is to separate artery from vein within this entire vessel structure via iterative relative fuzzy connectedness. After seed voxels are specified inside artery and vein in the CE-MRA image, the small regions of the bigger aspects of artery and vein are separated in the initial iterations, and further detailed aspects of artery and vein are included in later iterations. At each iteration, the artery and vein compete among themselves to grab membership of each voxel in the vessel structure based on the relative strength of connectedness of the voxel in the artery and vein. This approach has been implemented in a software package for routine use in a clinical setting and tested on 133 CE-MRA studies of the pelvic region and two studies of the carotid system from six different hospitals. In all studies, unified parameter settings produced correct artery-vein separation. When compared with manual segmentation/separation, our algorithms were able to separate higher order branches, and therefore produced vastly more details in the segmented vascular structure. The total operator and computer time taken per study is on the average about 4.5 min. To date, this technique seems to be the only image processing approach that can be routinely applied for artery and vein separation.