Search

In this work we present a methodology able to use harmonized PET/CT imaging in dose painting by number (DPBN) approach by means of a robust and accurate treatment planning system. Image processing and treatment planning were performed by using a Matlab-based platform, called CARMEN, in which a full Monte Carlo simulation is included. Linear programming formulation was developed for a voxel-by-voxel robust optimization and a specific direct aperture optimization was designed for an efficient adaptive radiotherapy implementation. DPBN approach with our methodology was tested to reduce the uncertainties associated with both, the absolute value and the relative value of the information in the functional image. For the same H&N case, a single robust treatment was planned for dose prescription maps corresponding to standardized uptake value distributions from two different image reconstruction protocols: One to fulfill EARL accreditation for harmonization of [18F]FDG PET/CT image, and the other one to use the highest available spatial resolution. Also, a robust treatment was planned to fulfill dose prescription maps corresponding to both approaches, the dose painting by contour based on volumes and our voxel-by-voxel DPBN. Adaptive planning was also carried out to check the suitability of our proposal. Different plans showed robustness to cover a range of scenarios for implementation of harmonizing strategies by using the highest available resolution. Also, robustness associated to discretization level of dose prescription according to the use of contours or numbers was achieved. All plans showed excellent quality index histogram and quality factors below 2%. Efficient solution for adaptive radiotherapy based directly on changes in functional image was obtained. We proved that by using voxel-by-voxel DPBN approach it is possible to overcome typical drawbacks linked to PET/CT images, providing to the clinical specialist confidence enough for routinely implementation of functional imaging for personalized radiotherapy. [ABSTRACT FROM AUTHOR]

The importance of integrating research findings is incontrovertible and procedures for coordinate-based meta-analysis (CBMA) such as Activation Likelihood Estimation (ALE) have become a popular approach to combine results of fMRI studies when only peaks of activation are reported. As meta-analytical findings help building cumulative knowledge and guide future research, not only the quality of such analyses but also the way conclusions are drawn is extremely important. Like classical meta-analyses, coordinate-based meta-analyses can be subject to different forms of publication bias which may impact results and invalidate findings. The file drawer problem refers to the problem where studies fail to get published because they do not obtain anticipated results (e.g. due to lack of statistical significance). To enable assessing the stability of meta-analytical results and determine their robustness against the potential presence of the file drawer problem, we present an algorithm to determine the number of noise studies that can be added to an existing ALE fMRI meta-analysis before spatial convergence of reported activation peaks over studies in specific regions is no longer statistically significant. While methods to gain insight into the validity and limitations of results exist for other coordinate-based meta-analysis toolboxes, such as Galbraith plots for Multilevel Kernel Density Analysis (MKDA) and funnel plots and egger tests for seed-based d mapping, this procedure is the first to assess robustness against potential publication bias for the ALE algorithm. The method assists in interpreting meta-analytical results with the appropriate caution by looking how stable results remain in the presence of unreported information that may differ systematically from the information that is included. At the same time, the procedure provides further insight into the number of studies that drive the meta-analytical results. We illustrate the procedure through an example and test the effect of several parameters through extensive simulations. Code to generate noise studies is made freely available which enables users to easily use the algorithm when interpreting their results. [ABSTRACT FROM AUTHOR]

Proximal remote sensing is being used across a very wide range of research fields and by scientists, who are often without deep theoretical knowledge optical physics; the author of this article falls squarely in that category! This article highlights two optical phenomena, which may greatly influence the quality and robustness of proximal remote sensing: penetration and scattering. Penetration implies that acquired reflectance signals are associated with both physical and chemical properties of target objects from both the surface and internal tissues/structures. Scattering implies that reflectance signals acquired from one point or object are influenced by scattered radiometric energy from neighboring points or objects. Based on a series of laboratory experiments, penetration and scattering were discussed in the context of “robustness” (repeatability) of hyperspectral reflectance data. High robustness implies that it is possible to control imaging conditions and therefore: 1) obtain very similar radiometric signals from inert objects (objects that do not change) over time, and 2) be able to consistently distinguish objects that are otherwise highly similar in appearance (size, shape, and color) and in terms of biochemical composition. It was demonstrated that robustness of hyperspectral reflectance data (40 spectral bands from 385 to 1024 nm) were significantly influenced by penetration and scattering of radiometric energy. In addition, it was demonstrated that the influence of penetration and scattering varied across the examined spectrum. Characterization of how optical phenomena may affect the robustness of reflectance data is important when using proximal remote sensing technologies as tools used to classify engineering and biological objects. [ABSTRACT FROM AUTHOR]

This paper proposes a novel robust control method for the control of a 7-DOF exoskeleton robot. The external disturbances and unknown dynamics in the form of friction forces, different upper-limb’s mass, backlash, and input saturation make robot unstable, which prevents the robot from correctly following the defined path. A new fractional sliding mode controller (NFSMC) is designed, which is robust against unknown dynamic and external disturbances. Fractional PID controller (FPID) has high trajectory tracking, but it is not robust against external disturbances. Therefore, by combining NFSMC and FPID controllers, a new compound fractional PID sliding mode controller (NCFPIDSMC) is proposed, which benefits high trajectory tracking of FPID and robustness of NFSMC. The stability of the proposed control method is verified by Lyapunov theory. A random noise is applied in order to confirm the robustness of the proposed control method. [ABSTRACT FROM AUTHOR]

Background: Wearable sensors offer the potential to bring new knowledge to inform interventions in patients affected by multiple sclerosis (MS) by thoroughly quantifying gait characteristics and gait deficits from prolonged daily living measurements. The aim of this study was to characterise gait in both laboratory and daily life conditions for a group of patients with moderate to severe ambulatory impairment due to MS. To this purpose, algorithms to detect and characterise gait from wearable inertial sensors data were also validated. Methods: Fourteen patients with MS were divided into two groups according to their disability level (EDSS 6.5–6.0 and EDSS 5.5–5.0, respectively). They performed both intermittent and continuous walking bouts (WBs) in a gait laboratory wearing waist and shank mounted inertial sensors. An algorithm (W-CWT) to estimate gait events and temporal parameters (mean and variability values) using data recorded from the waist mounted sensor (Dynaport, Mc Roberts) was tested against a reference algorithm (S-REF) based on the shank-worn sensors (OPAL, APDM). Subsequently, the accuracy of another algorithm (W-PAM) to detect and classify WBs was also tested. The validated algorithms were then used to quantify gait characteristics during short (sWB, 5–50 steps), intermediate (iWB, 51–100 steps) and long (lWB, >100 steps) daily living WBs and laboratory walking. Group means were compared using a two-way ANOVA. Results: W-CWT compared to S-REF showed good gait event accuracy (0.05–0.10 s absolute error) and was not influenced by disability level. It slightly overestimated stride time in intermittent walking (0.012 s) and overestimated highly variability of temporal parameters in both intermittent (17.5%–58.2%) and continuous walking (11.2%–76.7%). The accuracy of W-PAM was speed-dependent and decreased with increasing disability. The ANOVA analysis showed that patients walked at a slower pace in daily living than in the laboratory. In daily living gait, all mean temporal parameters decreased as the WB duration increased. In the sWB, the patients with a lower disability score showed, on average, lower values of the temporal parameters. Variability decreased as the WB duration increased. Conclusions: This study validated a method to quantify walking in real life in people with MS and showed how gait characteristics estimated from short walking bouts during daily living may be the most informative to quantify level of disability and effects of interventions in patients moderately affected by MS. The study provides a robust approach for the quantification of recognised clinically relevant outcomes and an innovative perspective in the study of real life walking. [ABSTRACT FROM AUTHOR]

There are some practical factors, such as arm position change and donning/doffing, which prevent robust myoelectric control. The objective of this study is to precisely characterize the impacts of the two representative factors on myoelectric controllability in practical control situations, thereby providing useful references that can be potentially used to find better solutions for clinically reliable myoelectric control. To this end, a real-time target acquisition task was performed by fourteen subjects including one individual with congenital upper-limb deficiency, where the impacts of arm position change, donning/doffing and a combination of both factors on control performance was systematically evaluated. The changes in online performance were examined with seven different performance metrics to comprehensively evaluate various aspects of myoelectric controllability. As a result, arm position change significantly affects offline prediction accuracy, but not online control performance due to real-time feedback, thereby showing no significant correlation between offline and online performance. Donning/doffing was still problematic in online control conditions. It was further observed that no benefit was attained when using a control model trained with multiple position data in terms of arm position change, and the degree of electrode shift caused by donning/doffing was not severely associated with the degree of performance loss under practical conditions (around 1 cm electrode shift). Since this study is the first to concurrently investigate the impacts of arm position change and donning/doffing in practical myoelectric control situations, all findings of this study provide new insights into robust myoelectric control with respect to arm position change and donning/doffing. [ABSTRACT FROM AUTHOR]

Multidimensional systems coupled via complex networks are widespread in nature and thus frequently invoked for a large plethora of interesting applications. From ecology to physics, individual entities in mutual interactions are grouped in families, homogeneous in kind. These latter interact selectively, through a sequence of self-consistently regulated steps, whose deeply rooted architecture is stored in the assigned matrix of connections. The asymptotic equilibrium eventually attained by the system, and its associated stability, can be assessed by employing standard nonlinear dynamics tools. For many practical applications, it is however important to externally drive the system towards a desired equilibrium, which is resilient, hence stable, to external perturbations. To this end we here consider a system made up of N interacting populations which evolve according to general rate equations, bearing attributes of universality. One species is added to the pool of interacting families and used as a dynamical controller to induce novel stable equilibria. Use can be made of the root locus method to shape the needed control, in terms of intrinsic reactivity and adopted protocol of injection. The proposed method is tested on both synthetic and real data, thus enabling to demonstrate its robustness and versatility. [ABSTRACT FROM AUTHOR]

The automatic detection and recognition of sound events by computers is a requirement for a number of emerging sensing and human computer interaction technologies. Recent advances in this field have been achieved by machine learning classifiers working in conjunction with time-frequency feature representations. This combination has achieved excellent accuracy for classification of discrete sounds. The ability to recognise sounds under real-world noisy conditions, called robust sound event classification, is an especially challenging task that has attracted recent research attention. Another aspect of real-word conditions is the classification of continuous, occluded or overlapping sounds, rather than classification of short isolated sound recordings. This paper addresses the classification of noise-corrupted, occluded, overlapped, continuous sound recordings. It first proposes a standard evaluation task for such sounds based upon a common existing method for evaluating isolated sound classification. It then benchmarks several high performing isolated sound classifiers to operate with continuous sound data by incorporating an energy-based event detection front end. Results are reported for each tested system using the new task, to provide the first analysis of their performance for continuous sound event detection. In addition it proposes and evaluates a novel Bayesian-inspired front end for the segmentation and detection of continuous sound recordings prior to classification. [ABSTRACT FROM AUTHOR]

Background: Visceral adiposity is a risk factor for many chronic diseases. Existing methods to quantify visceral adipose tissue volume using computed tomographic (CT) images often use a single slice, are manual, and are time consuming, making them impractical for large population studies. We developed and validated a method to accurately, rapidly, and robustly measure visceral adipose tissue volume using CT images. Methods: In-house software, Medical Executable for the Efficient and Robust Quantification of Adipose Tissue (MEERQAT), was developed to calculate visceral adipose tissue volume using a series of CT images within a manually identified region of interest. To distinguish visceral and subcutaneous adipose tissue, ellipses are drawn through the rectus abdominis and transverse abdominis using manual and automatic processes. Visceral and subcutaneous adipose tissue volumes are calculated by counting the numbers of voxels corresponding to adipose tissue in the region of interest. MEERQAT’s ellipse interpolation method was validated by comparing visceral adipose volume from 10 patients’ CT scans with corresponding results from manually delineated scans. Accuracy of visceral adipose quantification was tested using a phantom consisting of animal fat and tissues. Robustness of the method was tested by determining intra-observer and inter-observer coefficients of variation (CV). Results: The mean difference in visceral adipose tissue volume between manual and elliptical delineation methods was -0.54 ± 4.81%. In the phantom, our measurement differed from the known adipose volume by ≤ 7.5% for all scanning parameters. Mean inter-observer CV for visceral adipose tissue volume was 0.085, and mean intra-observer CV for visceral adipose tissue volume was 0.059. Conclusions: We have developed and validated a robust method of accurately and quickly determining visceral adipose tissue volume in any defined region of interest using CT imaging. [ABSTRACT FROM AUTHOR]

Background: The point of phase singularity (PS) is considered to represent a spiral wave core or a rotor in cardiac fibrillation. Computational efficiency is important for detection of PS in clinical electrophysiology. We developed a novel algorithm for highly efficient and robust detection of PS. Methods: In contrast to the conventional method, which calculates PS based on the line integral of the phase around a PS point equal to ±2π (the Iyer-Gray method), the proposed algorithm (the location-centric method) looks for the phase discontinuity point at which PS actually occurs. We tested the efficiency and robustness of these two methods in a two-dimensional mathematical model of atrial fibrillation (AF), with and without remodeling of ionic currents. Results: 1. There was a significant association, in terms of the Hausdorff distance (3.30 ± 0.0 mm), between the PS points measured using the Iyer-Gray and location-centric methods, with almost identical PS trajectories generated by the two methods. 2. For the condition of electrical remodeling of AF (0.3 × ICaL), the PS points calculated by the two methods were satisfactorily co-localized (with the Hausdorff distance of 1.64 ± 0.09 mm). 3. The proposed location-centric method was substantially more efficient than the Iyer-Gray method, with a 28.6-fold and 28.2-fold shorter run times for the control and remodeling scenarios, respectively. Conclusion: We propose a new location-centric method for calculating PS, which is robust and more efficient compared with the conventionally used method. [ABSTRACT FROM AUTHOR]

Purpose: To identify the impact of reconstruction algorithms on CT radiomic features of pulmonary tumors and to reveal and compare the intra- and inter-reader and inter-reconstruction algorithm variability of each feature. Methods: Forty-two patients (M:F = 19:23; mean age, 60.43±10.56 years) with 42 pulmonary tumors (22.56±8.51mm) underwent contrast-enhanced CT scans, which were reconstructed with filtered back projection and commercial iterative reconstruction algorithm (level 3 and 5). Two readers independently segmented the whole tumor volume. Fifteen radiomic features were extracted and compared among reconstruction algorithms. Intra- and inter-reader variability and inter-reconstruction algorithm variability were calculated using coefficients of variation (CVs) and then compared. Results: Among the 15 features, 5 first-order tumor intensity features and 4 gray level co-occurrence matrix (GLCM)-based features showed significant differences (p<0.05) among reconstruction algorithms. As for the variability, effective diameter, sphericity, entropy, and GLCM entropy were the most robust features (CV≤5%). Inter-reader variability was larger than intra-reader or inter-reconstruction algorithm variability in 9 features. However, for entropy, homogeneity, and 4 GLCM-based features, inter-reconstruction algorithm variability was significantly greater than inter-reader variability (p<0.013). Conclusions: Most of the radiomic features were significantly affected by the reconstruction algorithms. Inter-reconstruction algorithm variability was greater than inter-reader variability for entropy, homogeneity, and GLCM-based features. [ABSTRACT FROM AUTHOR]

In many real-world applications such as smart card solutions, law enforcement, surveillance and access control, the limited training sample size is the most fundamental problem. By making use of the low-rank structural information of the reconstructed error image, the so-called nuclear norm-based matrix regression has been demonstrated to be effective for robust face recognition with continuous occlusions. However, the recognition performance of nuclear norm-based matrix regression degrades greatly in the face of the small sample size problem. An alternative solution to tackle this problem is performing matrix regression on each patch and then integrating the outputs from all patches. However, it is difficult to set an optimal patch size across different databases. To fully utilize the complementary information from different patch scales for the final decision, we propose a multi-scale patch-based matrix regression scheme based on which the ensemble of multi-scale outputs can be achieved optimally. Extensive experiments on benchmark face databases validate the effectiveness and robustness of our method, which outperforms several state-of-the-art patch-based face recognition algorithms. [ABSTRACT FROM AUTHOR]

Purpose: This study aimed to investigate the variability of textural features (TF) as a function of acquisition and reconstruction parameters within the context of multi-centric trials. Methods: The robustness of 15 selected TFs were studied as a function of the number of iterations, the post-filtering level, input data noise, the reconstruction algorithm and the matrix size. A combination of several reconstruction and acquisition settings was devised to mimic multi-centric conditions. We retrospectively studied data from 26 patients enrolled in a diagnostic study that aimed to evaluate the performance of PET/CT 68Ga-DOTANOC in gastro-entero-pancreatic neuroendocrine tumors. Forty-one tumors were extracted and served as the database. The coefficient of variation (COV) or the absolute deviation (for the noise study) was derived and compared statistically with SUVmax and SUVmean results. Results: The majority of investigated TFs can be used in a multi-centric context when each parameter is considered individually. The impact of voxel size and noise in the input data were predominant as only 4 TFs presented a high/intermediate robustness against SUV-based metrics (Entropy, Homogeneity, RP and ZP). When combining several reconstruction settings to mimic multi-centric conditions, most of the investigated TFs were robust enough against SUVmax except Correlation, Contrast, LGRE, LGZE and LZLGE. Conclusion: Considering previously published results on either reproducibility or sensitivity against delineation approach and our findings, it is feasible to consider Homogeneity, Entropy, Dissimilarity, HGRE, HGZE and ZP as relevant for being used in multi-centric trials. [ABSTRACT FROM AUTHOR]

Image registration is a key component of computer assistance in image guided surgery, and it is a challenging topic in endoscopic environments. In this study, we present a method for image registration named Homographic Patch Feature Transform (HPFT) to match gastroscopic images. HPFT can be used for tracking lesions and augmenting reality applications during gastroscopy. Furthermore, an overall evaluation scheme is proposed to validate the precision, robustness and uniformity of the registration results, which provides a standard for rejection of false matching pairs from corresponding results. Finally, HPFT is applied for processing in vivo gastroscopic data. The experimental results show that HPFT has stable performance in gastroscopic applications. [ABSTRACT FROM AUTHOR]

The purpose of this research is to develop an intuitive and robust realtime QRS detection algorithm based on the physiological characteristics of the electrocardiogram waveform. The proposed algorithm finds the QRS complex based on the dual criteria of the amplitude and duration of QRS complex. It consists of simple operations, such as a finite impulse response filter, differentiation or thresholding without complex and computational operations like a wavelet transformation. The QRS detection performance is evaluated by using both an MIT-BIH arrhythmia database and an AHA ECG database (a total of 435,700 beats). The sensitivity (SE) and positive predictivity value (PPV) were 99.85% and 99.86%, respectively. According to the database, the SE and PPV were 99.90% and 99.91% in the MIT-BIH database and 99.84% and 99.84% in the AHA database, respectively. The result of the noisy environment test using record 119 from the MIT-BIH database indicated that the proposed method was scarcely affected by noise above 5 dB SNR (SE = 100%, PPV > 98%) without the need for an additional de-noising or back searching process. [ABSTRACT FROM AUTHOR]

Classification of datasets with imbalanced sample distributions has always been a challenge. In general, a popular approach for enhancing classification performance is the construction of an ensemble of classifiers. However, the performance of an ensemble is dependent on the choice of constituent base classifiers. Therefore, we propose a genetic algorithm-based search method for finding the optimum combination from a pool of base classifiers to form a heterogeneous ensemble. The algorithm, called GA-EoC, utilises 10 fold-cross validation on training data for evaluating the quality of each candidate ensembles. In order to combine the base classifiers decision into ensemble’s output, we used the simple and widely used majority voting approach. The proposed algorithm, along with the random sub-sampling approach to balance the class distribution, has been used for classifying class-imbalanced datasets. Additionally, if a feature set was not available, we used the (α, β) − k Feature Set method to select a better subset of features for classification. We have tested GA-EoC with three benchmarking datasets from the UCI-Machine Learning repository, one Alzheimer’s disease dataset and a subset of the PubFig database of Columbia University. In general, the performance of the proposed method on the chosen datasets is robust and better than that of the constituent base classifiers and many other well-known ensembles. Based on our empirical study we claim that a genetic algorithm is a superior and reliable approach to heterogeneous ensemble construction and we expect that the proposed GA-EoC would perform consistently in other cases. [ABSTRACT FROM AUTHOR]

Graph analysis is a promising tool to quantify brain connectivity. However, an essential requirement is that the graph measures are reproducible and robust. We have studied the reproducibility and robustness of various graph measures in group based and in individual binary and weighted networks derived from a task fMRI experiment during explicit associative-semantic processing of words and pictures. The nodes of the network were defined using an independent study and the connectivity was based on the partial correlation of the time series between any pair of nodes. The results showed that in case of binary networks, global graph measures exhibit a good reproducibility and robustness for networks which are not too sparse and these figures of merit depend on the graph measure and on the density of the network. Furthermore, group based binary networks should be derived from groups of sufficient size and the lower the density the more subjects are required to obtain robust values. Local graph measures are very variable in terms of reproducibility and should be interpreted with care. For weighted networks, we found good reproducibility (average test-retest variability <5% and ICC values >0.4) when using subject specific networks and this will allow us to relate network properties to individual subject information. [ABSTRACT FROM AUTHOR]

For swine dysentery, which is caused by Brachyspira hyodysenteriae infection and is an economically important disease in intensive pig production systems worldwide, a perfect or error-free diagnostic test (“gold standard”) is not available. In the absence of a gold standard, Bayesian latent class modelling is a well-established methodology for robust diagnostic test evaluation. In contrast to risk factor studies in food animals, where adjustment for within group correlations is both usual and required for good statistical practice, diagnostic test evaluation studies rarely take such clustering aspects into account, which can result in misleading results. The aim of the present study was to estimate test accuracies of a PCR originally designed for use as a confirmatory test, displaying a high diagnostic specificity, and cultural examination for B. hyodysenteriae. This estimation was conducted based on results of 239 samples from 103 herds originating from routine diagnostic sampling. Using Bayesian latent class modelling comprising of a hierarchical beta-binomial approach (which allowed prevalence across individual herds to vary as herd level random effect), robust estimates for the sensitivities of PCR and culture, as well as for the specificity of PCR, were obtained. The estimated diagnostic sensitivity of PCR (95% CI) and culture were 73.2% (62.3; 82.9) and 88.6% (74.9; 99.3), respectively. The estimated specificity of the PCR was 96.2% (90.9; 99.8). For test evaluation studies, a Bayesian latent class approach is well suited for addressing the considerable complexities of population structure in food animals. [ABSTRACT FROM AUTHOR]

Purpose: The aim of this study was to develop a robust post-processing workflow for motion-corrupted datasets in diffusion kurtosis imaging (DKI). Materials and methods: The proposed workflow consisted of brain extraction, rigid registration, distortion correction, artifacts rejection, spatial smoothing and tensor estimation. Rigid registration was utilized to correct misalignments. Motion artifacts were rejected by using local Pearson correlation coefficient (LPCC). The performance of LPCC in characterizing relative differences between artifacts and artifact-free images was compared with that of the conventional correlation coefficient in 10 randomly selected DKI datasets. The influence of rejected artifacts with information of gradient directions and b values for the parameter estimation was investigated by using mean square error (MSE). The variance of noise was used as the criterion for MSEs. The clinical practicality of the proposed workflow was evaluated by the image quality and measurements in regions of interest on 36 DKI datasets, including 18 artifact-free (18 pediatric subjects) and 18 motion-corrupted datasets (15 pediatric subjects and 3 essential tremor patients). Results: The relative difference between artifacts and artifact-free images calculated by LPCC was larger than that of the conventional correlation coefficient (p<0.05). It indicated that LPCC was more sensitive in detecting motion artifacts. MSEs of all derived parameters from the reserved data after the artifacts rejection were smaller than the variance of the noise. It suggested that influence of rejected artifacts was less than influence of noise on the precision of derived parameters. The proposed workflow improved the image quality and reduced the measurement biases significantly on motion-corrupted datasets (p<0.05). Conclusion: The proposed post-processing workflow was reliable to improve the image quality and the measurement precision of the derived parameters on motion-corrupted DKI datasets. The workflow provided an effective post-processing method for clinical applications of DKI in subjects with involuntary movements. [ABSTRACT FROM AUTHOR]

Diffusion kurtosis imaging (DKI) is a promising extension of diffusion tensor imaging, giving new insights into the white matter microstructure and providing new biomarkers. Given the rapidly increasing number of studies, DKI has a potential to establish itself as a valuable tool in brain diagnostics. However, to become a routine procedure, DKI still needs to be improved in terms of robustness, reliability, and reproducibility. As it requires acquisitions at higher diffusion weightings, results are more affected by noise than in diffusion tensor imaging. The lack of standard procedures for post-processing, especially for noise correction, might become a significant obstacle for the use of DKI in clinical routine limiting its application. We considered two noise correction schemes accounting for the noise properties of multichannel phased-array coils, in order to improve the data quality at signal-to-noise ratio (SNR) typical for DKI. The SNR dependence of estimated DKI metrics such as mean kurtosis (MK), mean diffusivity (MD) and fractional anisotropy (FA) is investigated for these noise correction approaches in Monte Carlo simulations and in in vivo human studies. The intra-subject reproducibility is investigated in a single subject study by varying the SNR level and SNR spatial distribution. Then the impact of the noise correction on inter-subject variability is evaluated in a homogeneous sample of 25 healthy volunteers. Results show a strong impact of noise correction on the MK estimate, while the estimation of FA and MD was affected to a lesser extent. Both intra- and inter-subject SNR-related variability of the MK estimate is considerably reduced after correction for the noise bias, providing more accurate and reproducible measures. In this work, we have proposed a straightforward method that improves accuracy of DKI metrics. This should contribute to standardization of DKI applications in clinical studies making valuable inferences in group analysis and longitudinal studies. [ABSTRACT FROM AUTHOR]

We propose an automatic algorithm for the reconstruction of patient-specific cardiac mesh models with 1-to-1 vertex correspondence. In this framework, a series of 3D meshes depicting the endocardial surface of the heart at each time step is constructed, based on a set of border delineated magnetic resonance imaging (MRI) data of the whole cardiac cycle. The key contribution in this work involves a novel reconstruction technique to generate a 4D (i.e., spatial–temporal) model of the heart with 1-to-1 vertex mapping throughout the time frames. The reconstructed 3D model from the first time step is used as a base template model and then deformed to fit the segmented contours from the subsequent time steps. A method to determine a tree-based connectivity relationship is proposed to ensure robust mapping during mesh deformation. The novel feature is the ability to handle intra- and inter-frame 2D topology changes of the contours, which manifests as a series of merging and splitting of contours when the images are viewed either in a spatial or temporal sequence. Our algorithm has been tested on five acquisitions of cardiac MRI and can successfully reconstruct the full 4D heart model in around 30 minutes per subject. The generated 4D heart model conforms very well with the input segmented contours and the mesh element shape is of reasonably good quality. The work is important in the support of downstream computational simulation activities. [ABSTRACT FROM AUTHOR]

High quality segmentation of diffusion tensor images (DTI) is of key interest in biomedical research and clinical application. In previous studies, most efforts have been made to construct predefined metrics for different DTI segmentation tasks. These methods require adequate prior knowledge and tuning parameters. To overcome these disadvantages, we proposed to automatically learn an adaptive distance metric by a graph based semi-supervised learning model for DTI segmentation. An original discriminative distance vector was first formulated by combining both geometry and orientation distances derived from diffusion tensors. The kernel metric over the original distance and labels of all voxels were then simultaneously optimized in a graph based semi-supervised learning approach. Finally, the optimization task was efficiently solved with an iterative gradient descent method to achieve the optimal solution. With our approach, an adaptive distance metric could be available for each specific segmentation task. Experiments on synthetic and real brain DTI datasets were performed to demonstrate the effectiveness and robustness of the proposed distance metric learning approach. The performance of our approach was compared with three classical metrics in the graph based semi-supervised learning framework. [ABSTRACT FROM AUTHOR]