Search

Deep Self-Attention Network (Transformer) is an encoder-decoder architectural model that excels in establishing long-distance dependencies and is first applied in natural language processing. Due to its complementary nature with the inductive bias of convolutional neural network (CNN), Transformer has been gradually applied to medical image processing, including kidney image processing. It has become a hot research topic in recent years. To further explore new ideas and directions in the field of renal image processing, this paper outlines the characteristics of the Transformer network model and summarizes the application of the Transformer-based model in renal image segmentation, classification, detection, electronic medical records, and decision-making systems, and compared with CNN-based renal image processing algorithm, analyzing the advantages and disadvantages of this technique in renal image processing. In addition, this paper gives an outlook on the development trend of Transformer in renal image processing, which provides a valuable reference for a lot of renal image analysis., (© 2024. The Author(s).)

Background: This systematic review and meta-analysis were conducted to objectively evaluate the evidence of machine learning (ML) in the patient diagnosis of Intracranial Hemorrhage (ICH) on computed tomography (CT) scans., Methods: Until May 2023, systematic searches were conducted in ISI Web of Science, PubMed, Scopus, Cochrane Library, IEEE Xplore Digital Library, CINAHL, Science Direct, PROSPERO, and EMBASE for studies that evaluated the diagnostic precision of ML model-assisted ICH detection. Patients with and without ICH as the target condition who were receiving CT-Scan were eligible for the research, which used ML algorithms based on radiologists' reports as the gold reference standard. For meta-analysis, pooled sensitivities, specificities, and a summary receiver operating characteristics curve (SROC) were used., Results: At last, after screening the title, abstract, and full paper, twenty-six retrospective and three prospective, and two retrospective/prospective studies were included. The overall (Diagnostic Test Accuracy) DTA of retrospective studies with a pooled sensitivity was 0.917 (95% CI 0.88-0.943, I 2  = 99%). The pooled specificity was 0.945 (95% CI 0.918-0.964, I 2  = 100%). The pooled diagnostic odds ratio (DOR) was 219.47 (95% CI 104.78-459.66, I 2  = 100%). These results were significant for the specificity of the different network architecture models (p-value = 0.0289). However, the results for sensitivity (p-value = 0.6417) and DOR (p-value = 0.2187) were not significant. The ResNet algorithm has higher pooled specificity than other algorithms with 0.935 (95% CI 0.854-0.973, I 2  = 93%)., Conclusion: This meta-analysis on DTA of ML algorithms for detecting ICH by assessing non-contrast CT-Scans shows the ML has an acceptable performance in diagnosing ICH. Using ResNet in ICH detection remains promising prediction was improved via training in an Architecture Learning Network (ALN)., (© 2023. The Author(s).)

Tracking points in ultrasound (US) videos can be especially useful to characterize tissues in motion. Tracking algorithms that analyze successive video frames, such as variations of Optical Flow and Lucas-Kanade (LK), exploit frame-to-frame temporal information to track regions of interest. In contrast, convolutional neural-network (CNN) models process each video frame independently of neighboring frames. In this paper, we show that frame-to-frame trackers accumulate error over time. We propose three interpolation-like methods to combat error accumulation and show that all three methods reduce tracking errors in frame-to-frame trackers. On the neural-network end, we show that a CNN-based tracker, DeepLabCut (DLC), outperforms all four frame-to-frame trackers when tracking tissues in motion. DLC is more accurate than the frame-to-frame trackers and less sensitive to variations in types of tissue movement. The only caveat found with DLC comes from its non-temporal tracking strategy, leading to jitter between consecutive frames. Overall, when tracking points in videos of moving tissue, we recommend using DLC when prioritizing accuracy and robustness across movements in videos, and using LK with the proposed error-correction methods for small movements when tracking jitter is unacceptable., (© 2023. The Author(s).)

Signal analysis is a domain which is an amalgamation of different processes coming together to form robust pipelines for the automation of data analysis. When applied to the medical world, physiological signals are used. It is becoming increasingly common in today's day and age to be working with very large datasets, on the scale of having thousands of features. This is largely due to the fact that the acquisition of biomedical signals can be taken over multi-hour timeframes, which is another challenge to solve in and of itself. This paper will focus on the electrocardiogram (ECG) signal specifically, and common feature extraction techniques used for digital health and artificial intelligence (AI) applications. Feature extraction is a vital step of biomedical signal analysis. The basic goal of feature extraction is for signal dimensionality reduction and data compaction. In simple terms, this would allow one to represent data with a smaller subset of features; these features could then later be leveraged to be used more efficiently for machine learning and deep learning models for applications, such as classification, detection, and automated applications. In addition, the redundant data in the overall dataset is filtered out as the data is reduced during feature extraction. In this review, we cover ECG signal processing and feature extraction in the time domain, frequency domain, time-frequency domain, decomposition, and sparse domain. We also provide pseudocode for the methods discussed so that they can be replicated by practitioners and researchers in their specific areas of biomedical work. Furthermore, we discuss deep features, and machine learning integration, to complete the overall pipeline design for signal analysis. Finally, we discuss future work that can be innovated upon in the feature extraction domain for ECG signal analysis., (© 2023. The Author(s).)

Background: The minimum variance (MV) beamformer can significantly improve the image resolution in ultrasound imaging, but it has limited performance in noise reduction. We recently proposed the covariance matrix-based statistical beamforming (CMSB) for medical ultrasound imaging to reduce sidelobes and incoherent clutter., Methods: In this paper, we aim to improve the imaging performance of the MV beamformer by introducing a new pixel-based adaptive weighting approach based on CMSB, which is named as covariance matrix-based adaptive weighting (CMSAW). The proposed CMSAW estimates the mean-to-standard-deviation ratio (MSR) of a modified covariance matrix reconstructed by adaptive spatial smoothing, rotary averaging, and diagonal reducing. Moreover, adaptive diagonal reducing based on the aperture coherence is introduced in CMSAW to enhance the performance in speckle preservation., Results: The proposed CMSAW-weighted MV (CMSAW-MV) was validated through simulation, phantom experiments, and in vivo studies. The phantom experimental results show that CMSAW-MV obtains resolution improvement of 21.3% and simultaneously achieves average improvements of 96.4% and 71.8% in average contrast and generalized contrast-to-noise ratio (gCNR) for anechoic cyst, respectively, compared with MV. in vivo studies indicate that CMSAW-MV improves the noise reduction performance of MV beamformer., Conclusion: Simulation, experimental, and in vivo results all show that CMSAW-MV can improve resolution and suppress sidelobes and incoherent clutter and noise. These results demonstrate the effectiveness of CMSAW in improving the imaging performance of MV beamformer. Moreover, the proposed CMSAW with a computational complexity of [Formula: see text] has the potential to be implemented in real time using the graphics processing unit., (© 2022. The Author(s).)

Shock advice algorithm plays a vital role in the detection of sudden cardiac arrests on electrocardiogram signals and hence, brings about survival improvement by delivering prompt defibrillation. The last decade has witnessed a surge of research efforts in racing for efficient shock advice algorithms, in this context. On one hand, it has been reported that the classification performance of traditional threshold-based methods has not complied with the American Heart Association recommendations. On the other hand, the rise of machine learning and deep learning-based counterparts is paving the new ways for the development of intelligent shock advice algorithms. In this paper, we firstly provide a comprehensive survey on the development of shock advice algorithms for rhythm analysis in automated external defibrillators. Shock advice algorithms are categorized into three groups based on the classification methods in which the detection performance is significantly improved by the use of machine learning and/or deep learning techniques instead of threshold-based approaches. Indeed, in threshold-based shock advice algorithms, a parameter is calculated as a threshold to distinguish shockable rhythms from non-shockable ones. In contrast, machine learning-based methods combine multiple parameters of conventional threshold-based approaches as a set of features to recognize sudden cardiac arrest. Noticeably, those features are possibly extracted from stand-alone ECGs, alternative signals using various decomposition techniques, or fully augmented ECG segments. Moreover, these signals can be also used directly as the input channels of deep learning-based shock advice algorithm designs. Then, we propose an advanced shock advice algorithm using a support vector machine classifier and a feature set extracted from a fully augmented ECG segment with its shockable and non-shockable signals. The relatively high detection performance of the proposed shock advice algorithm implies a potential application for the automated external defibrillator in the practical clinic environment. Finally, we outline several interesting yet challenging research problems for further investigation., (© 2022. The Author(s).)

Facial paralysis (FP) is an inability to move facial muscles voluntarily, affecting daily activities. There is a need for quantitative assessment and severity level classification of FP to evaluate the condition. None of the available tools are widely accepted. A comprehensive FP evaluation system has been developed by the authors. The system extracts real-time facial animation units (FAUs) using the Kinect V2 sensor and includes both FP assessment and classification. This paper describes the development and testing of the FP classification phase. A dataset of 375 records from 13 unilateral FP patients and 1650 records from 50 control subjects was compiled. Artificial Intelligence and Machine Learning methods are used to classify seven FP categories: the normal case and three severity levels: mild, moderate, and severe for the left and right sides. For better prediction results (Accuracy = 96.8%, Sensitivity = 88.9% and Specificity = 99%), an ensemble learning classifier was developed rather than one weak classifier. The ensemble approach based on SVMs was proposed for the high-dimensional data to gather the advantages of stacking and bagging. To address the problem of an imbalanced dataset, a hybrid strategy combining three separate techniques was used. Model robustness and stability was evaluated using fivefold cross-validation. The results showed that the classifier is robust, stable and performs well for different train and test samples. The study demonstrates that FAUs acquired by the Kinect sensor can be used in classifying FP. The developed FP assessment and classification system provides a detailed quantitative report and has significant advantages over existing grading scales. [ABSTRACT FROM AUTHOR]

Background: The available scientific literature contains descriptions of manual, semiautomated and automated methods for analysing angiographic images. The presented algorithms segment vessels calculating their tortuosity or number in a given area. We describe a statistical analysis of the inclination of the vessels in the fundus as related to their distance from the center of the optic disc. Methods: The paper presents an automated method for analysing vessels which are found in angiographic images of the eye using a Matlab implemented algorithm. It performs filtration and convolution operations with suggested masks. The result is an image containing information on the location of vessels and their inclination angle in relation to the center of the optic disc. This is a new approach to the analysis of vessels whose usefulness has been confirmed in the diagnosis of hypertension.Results: The proposed algorithm analyzed and processed the images of the eye fundus using a classifier in the form of decision trees. It enabled the proper classification of healthy patients and those with hypertension. The result is a very good separation of healthy subjects from the hypertensive ones: sensitivity - 83%, specificity - 100%, accuracy - 96%. This confirms a practical usefulness of the proposed method. Conclusions: This paper presents an algorithm for the automatic analysis of morphological parameters of the fundus vessels. Such an analysis is performed during fluorescein angiography of the eye. The presented algorithm automatically calculates the global statistical features connected with both tortuosity of vessels and their total area or their number. [ABSTRACT FROM AUTHOR]

Background: The human gleno-humeral joint is normally represented as a spherical hinge and its center of rotation is used to construct humerus anatomical axes and as reduction point for the computation of the internal joint moments. The position of the gleno-humeral joint center (GHJC) can be estimated by recording ad hoc shoulder joint movement following a functional approach. In the last years, extensive research has been conducted to improve GHJC estimate as obtained from positioning systems such as stereo-photogrammetry or electromagnetic tracking. Conversely, despite the growing interest for wearable technologies in the field of human movement analysis, no studies investigated the problem of GHJC estimation using miniaturized magneto-inertial measurement units (MIMUs). The aim of this study was to evaluate both accuracy and precision of the GHJC estimation as obtained using a MIMU-based methodology and a functional approach.Methods: Five different functional methods were implemented and comparatively assessed under different experimental conditions (two types of shoulder motions: cross and star type motion; two joint velocities: ωmax = 90°/s, 180°/s; two ranges of motion: Ɵ = 45°, 90°). Validation was conducted on five healthy subjects and true GHJC locations were obtained using magnetic resonance imaging.Results: The best performing methods (NAP and SAC) showed an accuracy in the estimate of the GHJC between 20.6 and 21.9 mm and repeatability values between 9.4 and 10.4 mm. Methods performance did not show significant differences for the type of arm motion analyzed or a reduction of the arm angular velocity (180°/s and 90°/s). In addition, a reduction of the joint range of motion (90° and 45°) did not seem to influence significantly the GHJC position estimate except in a few subject-method combinations.Conclusions: MIMU-based functional methods can be used to estimate the GHJC position in vivo with errors of the same order of magnitude than those obtained using traditionally stereo-photogrammetric techniques. The methodology proposed seemed to be robust under different experimental conditions. The present paper was awarded as "SIAMOC Best Methodological Paper 2016". [ABSTRACT FROM AUTHOR]

Background: Electrical impedance tomography (EIT) is a noninvasive, radiation-free, and low-cost imaging modality for monitoring the conductivity distribution inside a patient. Nowadays, time-difference EIT (tdEIT) is used extensively as it has fast imaging speed and can reflect the dynamic changes of diseases, which make it attractive for a number of medical applications. Moreover, modeling errors are compensated to some extent by subtraction of voltage measurements collected before and after the change. However, tissue conductivity varies with frequency and tdEIT does not efficiently exploit multi-frequency information as it only uses measurements associated with a single frequency., Methods: This paper proposes a tdEIT algorithm that imposes spectral constraints on the framework of the linear least squares problem. Simulation and phantom experiments are conducted to compare the proposed spectral constraints algorithm (SC) with the damped least squares algorithm (DLS), which is a stable tdEIT algorithm used in clinical practice. The condition number and rank of the matrices needing inverses are analyzed, and image quality is evaluated using four indexes. The possibility of multi-tissue imaging and the influence of spectral errors are also explored., Results: Significant performance improvement is achieved by combining multi-frequency and time-difference information. The simulation results show that, in one-step iteration, both algorithms have the same condition number and rank, but SC effectively reduces image noise by 20.25% compared to DLS. In addition, deformation error and position error are reduced by 8.37% and 7.86%, respectively. In two-step iteration, the rank of SC is greatly increased, which suggests that more information is employed in image reconstruction. Image noise is further reduced by an average of 32.58%, and deformation error and position error are also reduced by 20.20% and 31.36%, respectively. The phantom results also indicate that SC has stronger noise suppression and target identification abilities, and this advantage is more obvious with iteration. The results of multi-tissue imaging show that SC has the unique advantage of automatically extracting a single tissue to image., Conclusions: SC enables tdEIT to utilize multi-frequency information in cases where the spectral constraints are known and then provides higher quality images for applications.

Surface registration is a one of the crucial and actual problems of computer aided surgery. This paper presents the modification of the non-rigid Iterative Closest Point Algorithm which takes into account an anisotropic noise model and landmarks as guided correspondence at the transformation step in every iteration. The presented approach was validated on human abdominal briefing surface data from a time-of-flight camera. We took the median of the resulting measures and the outcome is presented: the median of means of surfaces distance was at the same level for both variants of the ICP algorithm and is comparable with the isotropic variant, the median of mean landmark position errors decreased by 0.93 units (over 20% improvement) and the median of percentage of single correspondences in target point cloud increased by 11.96%. The results showed that the introduction of the anisotropic model of noise for the ToF camera allows for the improvement the percentage of target cloud points which had only one correspondent over 10% impartment and additional weighting of markers also improves the measure of the quality of finding real correspondents over 20% improvement. In the examined dataset, where the average initial distance between the clouds of points in the inspiratory and expiration is equal to approx. 7.5 mm, a more than 10% improvement in the quality of the correspondence improves the accuracy of matching the surface within 1 mm which is a significant value in application of minimally invasive image guided interventions.

Background: Cardiac elastances are highly invasive to measure directly, but are clinically useful due to the amount of information embedded in them. Information about the cardiac elastance, which can be used to estimate it, can be found in the downstream pressure waveforms of the aortic pressure (Pao) and the pulmonary artery (Ppa). However these pressure waveforms are typically noisy and biased, and require processing in order to locate the specific information required for cardiac elastance estimations. This paper presents the method to algorithmically process the pressure waveforms. Methods: A shear transform is developed in order to help locate information in the pressure waveforms. This transform turns difficult to locate corners into easy to locate maximum or minimum points as well as providing error correction. Results: The method located all points on 87 out of 88 waveforms for Ppa, to within the sampling frequency. For Pao, out of 616 total points, 605 were found within 1%, 5 within 5%, 4 within 10% and 2 within 20%. Conclusions: The presented method provides a robust, accurate and dysfunctionindependent way to locate points on the aortic and pulmonary artery pressure waveforms, allowing the non-invasive estimation of the left and right cardiac elastance. [ABSTRACT FROM AUTHOR]

Background: Long-term electrocardiogram (ECG) is one of the important diagnostic assistant approaches in capturing intermittent cardiac arrhythmias. Combination of miniaturized wearable holters and healthcare platforms enable people to have their cardiac condition monitored at home. The high computational burden created by concurrent processing of numerous holter data poses a serious challenge to the healthcare platform. An alternative solution is to shift the analysis tasks from healthcare platforms to the mobile computing devices. However, long-term ECG data processing is quite time consuming due to the limited computation power of the mobile central unit processor (CPU)., Methods: This paper aimed to propose a novel parallel automatic ECG analysis algorithm which exploited the mobile graphics processing unit (GPU) to reduce the response time for processing long-term ECG data. By studying the architecture of the sequential automatic ECG analysis algorithm, we parallelized the time-consuming parts and reorganized the entire pipeline in the parallel algorithm to fully utilize the heterogeneous computing resources of CPU and GPU., Results: The experimental results showed that the average executing time of the proposed algorithm on a clinical long-term ECG dataset (duration 23.0 ± 1.0 h per signal) is 1.215 ± 0.140 s, which achieved an average speedup of 5.81 ± 0.39× without compromising analysis accuracy, comparing with the sequential algorithm. Meanwhile, the battery energy consumption of the automatic ECG analysis algorithm was reduced by 64.16%. Excluding energy consumption from data loading, 79.44% of the energy consumption could be saved, which alleviated the problem of limited battery working hours for mobile devices., Conclusion: The reduction of response time and battery energy consumption in ECG analysis not only bring better quality of experience to holter users, but also make it possible to use mobile devices as ECG terminals for healthcare professions such as physicians and health advisers, enabling them to inspect patient ECG recordings onsite efficiently without the need of a high-quality wide-area network environment.

Background: Various kinds of data mining algorithms are continuously raised with the development of related disciplines. The applicable scopes and their performances of these algorithms are different. Hence, finding a suitable algorithm for a dataset is becoming an important emphasis for biomedical researchers to solve practical problems promptly., Methods: In this paper, seven kinds of sophisticated active algorithms, namely, C4.5, support vector machine, AdaBoost, k-nearest neighbor, naïve Bayes, random forest, and logistic regression, were selected as the research objects. The seven algorithms were applied to the 12 top-click UCI public datasets with the task of classification, and their performances were compared through induction and analysis. The sample size, number of attributes, number of missing values, and the sample size of each class, correlation coefficients between variables, class entropy of task variable, and the ratio of the sample size of the largest class to the least class were calculated to character the 12 research datasets., Results: The two ensemble algorithms reach high accuracy of classification on most datasets. Moreover, random forest performs better than AdaBoost on the unbalanced dataset of the multi-class task. Simple algorithms, such as the naïve Bayes and logistic regression model are suitable for a small dataset with high correlation between the task and other non-task attribute variables. K-nearest neighbor and C4.5 decision tree algorithms perform well on binary- and multi-class task datasets. Support vector machine is more adept on the balanced small dataset of the binary-class task., Conclusions: No algorithm can maintain the best performance in all datasets. The applicability of the seven data mining algorithms on the datasets with different characteristics was summarized to provide a reference for biomedical researchers or beginners in different fields.

Background: 3D ultrasound volume reconstruction from B-model ultrasound slices can provide more clearly and intuitive structure of tissue and lesion for the clinician., Methods: This paper proposes a novel Global Path Matching method for the 3D reconstruction of freehand ultrasound images. The proposed method composes of two main steps: bin-filling scheme and hole-filling strategy. For the bin-filling scheme, this study introduces two operators, including the median absolute deviation and the inter-quartile range absolute deviation, to calculate the invariant features of each voxel in the 3D ultrasound volume. And the best contribution range for each voxel is obtained by calculating the Euclidian distance between current voxel and the voxel with the minimum invariant features. Hence, the intensity of the filling vacant voxel can be obtained by weighted combination of the intensity distribution of pixels in the best contribution range. For the hole-filling strategy, three conditions, including the confidence term, the data term and the gradient term, are designed to calculate the weighting coefficient of the matching patch of the vacant voxel. While the matching patch is obtained by finding patches with the best similarity measure that defined by the three conditions in the whole 3D volume data., Results: Compared with VNN, PNN, DW, FMM, BI and KR methods, the proposed Global Path Matching method can restore the 3D ultrasound volume with minimum difference., Conclusions: Experimental results on phantom and clinical data sets demonstrate the effectiveness and robustness of the proposed method for the reconstruction of ultrasound volume.

Background: Ultrasound computed tomography (USCT) is usually realized with a ring array. It can provide better imaging performance and more tissue information by emitting and receiving the ultrasound signal in different directions simultaneously. However, USCT imaging is usually applied with the synthetic aperture (SA) emission method, which leads to a long scanning time with a large number of elements on the ring array. The echo image can provide the structural information, and has a higher resolution than maps of other parameters in USCT. Hence, we proposed plane wave (PW) imaging for ring array to acquire the echo wave and reduce the scanning time considerably.Results: In this paper, an emitting and receiving process was proposed to realize plane wave imaging with a ring array. With the proposed scanning method, the number of emission events can be reduced greatly. A beamforming method based on the eigenspace-based minimum variance (ESBMV) was also combined with the scanning method. With ESBMV beamformer, the resolution and contrast ratio of reconstruction result can be maintained or even improved under a fewer-emissions condition. We validated the method using both computer simulations with Field II and phantom experiments with a ring array of 512 elements. The Verasonics® system was used to transmit and receive the ultrasound signal in the phantom experiments.Conclusions: According to the results of the experiments, the imaging results will have a better contrast ratio with a higher emitting energy. Additionally, the scanning time with the proposed method can be only one-tenth of that with the SA emission method, while the echo imaging performance still remains at a similar level or even better. [ABSTRACT FROM AUTHOR]

Background: The challenge of reconstructing a sparse medical magnetic resonance image based on compressed sensing from undersampled k-space data has been investigated within recent years. As total variation (TV) performs well in preserving edge, one type of approach considers TV-regularization as a sparse structure to solve a convex optimization problem. Nevertheless, this convex optimization problem is both nonlinear and nonsmooth, and thus difficult to handle, especially for a large-scale problem. Therefore, it is essential to develop efficient algorithms to solve a very broad class of TV-regularized problems., Methods: In this paper, we propose an efficient algorithm referred to as the fast linearized preconditioned alternating direction method of multipliers (FLPADMM), to solve an augmented TV-regularized model that adds a quadratic term to enforce image smoothness. Because of the separable structure of this model, FLPADMM decomposes the convex problem into two subproblems. Each subproblem can be alternatively minimized by augmented Lagrangian function. Furthermore, a linearized strategy and multistep weighted scheme can be easily combined for more effective image recovery., Results: The method of the present study showed improved accuracy and efficiency, in comparison to other methods. Furthermore, the experiments conducted on in vivo data showed that our algorithm achieved a higher signal-to-noise ratio (SNR), lower relative error (Rel.Err), and better structural similarity (SSIM) index in comparison to other state-of-the-art algorithms., Conclusions: Extensive experiments demonstrate that the proposed algorithm exhibits superior performance in accuracy and efficiency than conventional compressed sensing MRI algorithms.

Background: The sequence of Q, R, and S peaks (QRS) complex detection is a crucial procedure in electrocardiogram (ECG) processing and analysis. We propose a novel approach for QRS complex detection based on the deterministic finite automata with the addition of some constraints. This paper confirms that regular grammar is useful for extracting QRS complexes and interpreting normalized ECG signals. A QRS is assimilated to a pair of adjacent peaks which meet certain criteria of standard deviation and duration., Results: The proposed method was applied on several kinds of ECG signals issued from the standard MIT-BIH arrhythmia database. A total of 48 signals were used. For an input signal, several parameters were determined, such as QRS durations, RR distances, and the peaks' amplitudes. σRR and σQRS parameters were added to quantify the regularity of RR distances and QRS durations, respectively. The sensitivity rate of the suggested method was 99.74% and the specificity rate was 99.86%. Moreover, the sensitivity and the specificity rates variations according to the Signal-to-Noise Ratio were performed., Conclusions: Regular grammar with the addition of some constraints and deterministic automata proved functional for ECG signals diagnosis. Compared to statistical methods, the use of grammar provides satisfactory and competitive results and indices that are comparable to or even better than those cited in the literature.

Background: The paper presents a method of linear time-varying filtering, with extremely low computational costs, for the suppression of baseline drift in electrocardiographic (ECG) signals. An ECG signal is not periodic as the length of its heart cycles vary. In order to optimally suppress baseline drift by the use of a linear filter, we need a high-pass filter with time-varying cut-off frequency controlled by instant heart rate., Methods: Realization of the high-pass (HP) filter is based on a narrow-band low-pass (LP) filter of which output is subtracted from the delayed input. The base of an LP filter is an extremely low computational cost Lynn's filter with rectangular impulse response. The optimal cut-off frequency of an HP filter for baseline wander suppression is identical to an instantaneous heart rate. Instantaneous length of heart cycles (e.g. RR intervals) are interpolated between QRS complexes to smoothly control cut-off frequency of the HP filter that has been used., Results and Conclusions: We proved that a 0.5 dB decrease in transfer function, at a time-varying cut-off frequency of HP filter controlled by an instant heart rate, is acceptable when related to maximum error due to filtering. Presented in the article are the algorithms that enable the realization of time-variable filters with very low computational costs. We propose fast linear HP filters for the suppression of baseline wander with time-varying cut-off frequencies controlled by instant heart rate. The filters fulfil accepted professional standards and increase the efficiency of the noise suppression.

Background: Various kinds of data mining algorithms are continuously raised with the development of related disciplines. The applicable scopes and their performances of these algorithms are different. Hence, finding a suitable algorithm for a dataset is becoming an important emphasis for biomedical researchers to solve practical problems promptly.Methods: In this paper, seven kinds of sophisticated active algorithms, namely, C4.5, support vector machine, AdaBoost, k-nearest neighbor, naïve Bayes, random forest, and logistic regression, were selected as the research objects. The seven algorithms were applied to the 12 top-click UCI public datasets with the task of classification, and their performances were compared through induction and analysis. The sample size, number of attributes, number of missing values, and the sample size of each class, correlation coefficients between variables, class entropy of task variable, and the ratio of the sample size of the largest class to the least class were calculated to character the 12 research datasets.Results: The two ensemble algorithms reach high accuracy of classification on most datasets. Moreover, random forest performs better than AdaBoost on the unbalanced dataset of the multi-class task. Simple algorithms, such as the naïve Bayes and logistic regression model are suitable for a small dataset with high correlation between the task and other non-task attribute variables. K-nearest neighbor and C4.5 decision tree algorithms perform well on binary- and multi-class task datasets. Support vector machine is more adept on the balanced small dataset of the binary-class task.Conclusions: No algorithm can maintain the best performance in all datasets. The applicability of the seven data mining algorithms on the datasets with different characteristics was summarized to provide a reference for biomedical researchers or beginners in different fields. [ABSTRACT FROM AUTHOR]

Background: 3D ultrasound volume reconstruction from B-model ultrasound slices can provide more clearly and intuitive structure of tissue and lesion for the clinician.Methods: This paper proposes a novel Global Path Matching method for the 3D reconstruction of freehand ultrasound images. The proposed method composes of two main steps: bin-filling scheme and hole-filling strategy. For the bin-filling scheme, this study introduces two operators, including the median absolute deviation and the inter-quartile range absolute deviation, to calculate the invariant features of each voxel in the 3D ultrasound volume. And the best contribution range for each voxel is obtained by calculating the Euclidian distance between current voxel and the voxel with the minimum invariant features. Hence, the intensity of the filling vacant voxel can be obtained by weighted combination of the intensity distribution of pixels in the best contribution range. For the hole-filling strategy, three conditions, including the confidence term, the data term and the gradient term, are designed to calculate the weighting coefficient of the matching patch of the vacant voxel. While the matching patch is obtained by finding patches with the best similarity measure that defined by the three conditions in the whole 3D volume data.Results: Compared with VNN, PNN, DW, FMM, BI and KR methods, the proposed Global Path Matching method can restore the 3D ultrasound volume with minimum difference.Conclusions: Experimental results on phantom and clinical data sets demonstrate the effectiveness and robustness of the proposed method for the reconstruction of ultrasound volume. [ABSTRACT FROM AUTHOR]

Introduction: This paper shows the influence of a measurement method of features in the diagnosis of Hashimoto’s disease. Sensitivity of the algorithm to changes in the parameters of the ROI, namely shift, resizing and rotation, has been presented. The obtained results were also compared to the methods known from the literature in which decision trees or average gray level thresholding are used. Material: In the study, 288 images obtained from patients with Hashimoto’s disease and 236 images from healthy subjects have been analyzed. For each person, an ultrasound examination of the left and right thyroid lobe in transverse and longitudinal sections has been performed. Method: With the use of the developed algorithm, a discriminant analysis has been conducted for the following five options: linear, diaglinear, quadratic, diagquadratic and mahalanobis. The left and right thyroid lobes have been analyzed both together and separately in transverse and longitudinal sections. In addition, the algorithmenabled to analyze specificity and sensitivity as well as the impact of sensitivity of ROI shift, repositioning and rotation on the measured features. Results and summary: The analysis has shown that the highest accuracy was obtained for the longitudinal section (LD) with the method of linear, yielding sensitivity = 76%, specificity = 95% and accuracy ACC = 84%. The conducted sensitivity assessment confirms that changes in the position and size of the ROI have little effect on sensitivity and specificity. The analysis of all cases, that is, images of the left and right thyroid lobes in transverse and longitudinal sections, has shown specificity ranging from 60% to 95% and sensitivity from 62% to 89%. Additionally, it was shown that the value of ACC for the method using decision trees as a classifier is equal to 84% for the analyzed data. Thresholding of average brightness of the ROI gave ACC equal to 76%. [ABSTRACT FROM AUTHOR]

Background: The recent developments in microarray technology has allowed for the simultaneous measurement of gene expression levels. The large amount of captured data challenges conventional statistical tools for analysing and finding inherent correlations between genes and samples. The unsupervised clustering approach is often used, resulting in the development of a wide variety of algorithms. Typical clustering algorithms require selecting certain parameters to operate, for instance the number of expected clusters, as well as defining a similarity measure to quantify the distance between data points. The diffraction-based clustering algorithm however is designed to overcome this necessity for user-defined parameters, as it is able to automatically search the data for any underlying structure. Methods: The diffraction-based clustering algorithm presented in this paper is tested using five well-known expression datasets pertaining to cancerous tissue samples. The clustering results are then compared to those results obtained from conventional algorithms such as the k-means, fuzzy c-means, self-organising map, hierarchical clustering algorithm, Gaussian mixture model and density-based spatial clustering of applications with noise (DBSCAN). The performance of each algorithm is measured using an average external criterion and an average validity index. Results: The diffraction-based clustering algorithm is shown to be independent of the number of clusters as the algorithm searches the feature space and requires no form of parameter selection. The results show that the diffraction-based clustering algorithm performs significantly better on the real biological datasets compared to the other existing algorithms. Conclusion: The results of the diffraction-based clustering algorithm presented in this paper suggest that the method can provide researchers with a new tool for successfully analysing microarray data. [ABSTRACT FROM AUTHOR]

The article presents a research paper which proposes a new method to improve the algorithm of ossification site localization technique and to improve the adaptive segmentation result and the region-of interest (ROI) localization accuracy in automated bone age assessment (BAA). It uses anisotropic diffusion as pre-processing and a novel Bounded Area Elimination (BAE) post-processing algorithm.

The literature dealing with mathematical modelling for diabetes is abundant. During the last decades, a variety of models have been devoted to different aspects of diabetes, including glucose and insulin dynamics, management and complications prevention, cost and cost-effectiveness of strategies and epidemiology of diabetes in general. Several reviews are published regularly on mathematical models used for specific aspects of diabetes. In the present paper we propose a global overview of mathematical models dealing with many aspects of diabetes and using various tools. The review includes, side by side, models which are simple and/or comprehensive; deterministic and/or stochastic; continuous and/or discrete; using ordinary differential equations, partial differential equations, optimal control theory, integral equations, matrix analysis and computer algorithms. [ABSTRACT FROM AUTHOR]

Background: Pulmonary nodules in computerized tomography (CT) images are potential manifestations of lung cancer. Segmentation of potential nodule objects is the first necessary and crucial step in computer-aided detection system of pulmonary nodules. The segmentation of various types of nodules, especially for ground-glass opacity (GGO) nodules and juxta-vascular nodules, present various challenges. The nodule with GGO characteristic possesses typical intensity inhomogeneity and weak edges, which is difficult to define the boundary; the juxta-vascular nodule is connected to a vessel, and they have very similar intensities. Traditional segmentation methods may result in the problems of boundary leakage and a small volume over-segmentation. This paper deals with the above mentioned problems., Methods: A novel segmentation method for pulmonary nodules is proposed, which uses an adaptive local region energy model with probability density function (PDF)-based similarity distance and multi-features dynamic clustering refinement method. Our approach has several novel aspects: (1) in the proposed adaptive local region energy model, the local domain for local energy model is selected adaptively based on k-nearest-neighbour (KNN) estimate method, and measurable distances between probability density functions of multi-dimension features with high class separability are used to build the cost function. (2) A multi-features dynamic clustering method is used for the segmentation refinement of juxta-vascular nodules, which is based on the nodule segmentation using active contour model (ACM) with adaptive local region energy and vessel segmentation using flow direction feature (FDF)-based region growing method. (3) it handles various types of nodules under a united framework., Results: The proposed method has been validated on a clinical dataset of 113 chest CT scans that contain 157 nodules determined by a ground truth reading process, and evaluating the algorithm on the provided data leads to an average Tanimoto/Jaccard error of 0.17, 0.20 and 0.24 for GGO, juxta-vascular and GGO juxta-vascular nodules, respectively., Conclusions: Experimental results show desirable performances of the proposed method. The proposed segmentation method outperforms the traditional methods.

Background: Spine magnetic resonance image (MRI) plays a very important role in the diagnosis of various spinal diseases, such as disc degeneration, scoliosis, and osteoporosis. Accurate localization and segmentation of the intervertebral disc (IVD) in spine MRI can help accelerate the diagnosis time and assist in the treatment by providing quantitative parameters. In this paper, a method based on Gabor filter bank is proposed for IVD localization and segmentation., Methods: First, the structural features of IVDs are extracted using a Gabor filter bank. Second, the Gabor features of spine are calculated and spinal curves are detected. Third, the Gabor feature images (GFI) of IVDs are calculated and adjusted according to the spinal curves. Fourth, the IVDs are localized by clustering analysis with GFI. Finally, an optimum grayscale-based algorithm with self-adaptive threshold, combined with the localization results and Gabor features of the spine, is performed for IVDs segmentation., Results: The proposed method is verified by an MRI dataset consisting of 278 IVDs from 37 patients. The accuracy of localization is 98.23 % and the dice similarity index for segmentation evaluation is 0.9237., Conclusions: The proposed Gabor filter based method is effective for IVD localization and segmentation. It would be useful in computer-aided diagnosis of IVD diseases and computer-assisted spine surgery.

Background: Ensemble Empirical Mode Decomposition (EEMD) has been popularised for single-channel Electromyography (EMG) signal processing as it can effectively extract the temporal information of the EMG time series. However, few papers examine the temporal and spatial characteristics across multiple muscle groups in relation to multichannel EMG signals.Experiment: The experimental data was obtained from the Center for Machine Learning and Intelligent Systems, University of California Irvine (UCI). The data was donated by the Nueva Granada Military University and the Technopark node Manizales in Colombia. The databases of 11 male subjects from the healthy group were taken into the study. The subjects undergo three exercise programs, leg extension from a sitting position (sitting), flexion of the leg up (standing), and gait (walking), while four electrodes were placed on biceps femoris (BF), vastus medialis (VM), rectus femoris (RF), and semitendinosus (ST).Methods: Based on the experimental data, a comparative study is provided by assessing the Empirical Mode Decomposition (EMD)-based approaches, EEMD, Multivariate EMD (MEMD), and Noise-Assisted MEMD (NA-MEMD). The outcomes from these approaches are then quantitatively estimated on the basis of three criterions, the number of Intrinsic Mode Functions (IMFs), mode-alignment and mode-mixing.Results: Both MEMD and NA-MEMD methods (except EEMD) can guarantee equal numbers of IMFs. For mode-alignment and mode-mixing, NA-MEMD is optimal compared with MEMD and EEMD, and MEMD is merely better than EEMD.Conclusions: This study proposes the NA-MEMD approach for multichannel EMG signal processing. This finding implies that NA-MEMD is effective for simultaneously analysing IMFs based frequency bands. It has a vital clinical implication in exploring the neuromuscular patterns that enable the multiple muscle groups to coordinate while performing the functional activities of daily living. [ABSTRACT FROM AUTHOR]

Background: In this paper we propose the use of global Kalman filters (KFs) to estimate absolute angles of lower limb segments. Standard approaches adopt KFs to improve the performance of inertial sensors based on individual link configurations. In consequence, for a multi-body system like a lower limb exoskeleton, the inertial measurements of one link (e.g., the shank) are not taken into account in other link angle estimations (e.g., foot). Global KF approaches, on the other hand, correlate the collective contribution of all signals from lower limb segments observed in the state-space model through the filtering process. We present a novel global KF (matricial global KF) relying only on inertial sensor data, and validate both this KF and a previously presented global KF (Markov Jump Linear Systems, MJLS-based KF), which fuses data from inertial sensors and encoders from an exoskeleton. We furthermore compare both methods to the commonly used local KF.Results: The results indicate that the global KFs performed significantly better than the local KF, with an average root mean square error (RMSE) of respectively 0.942° for the MJLS-based KF, 1.167° for the matrical global KF, and 1.202° for the local KFs. Including the data from the exoskeleton encoders also resulted in a significant increase in performance.Conclusion: The results indicate that the current practice of using KFs based on local models is suboptimal. Both the presented KF based on inertial sensor data, as well our previously presented global approach fusing inertial sensor data with data from exoskeleton encoders, were superior to local KFs. We therefore recommend to use global KFs for gait analysis and exoskeleton control. [ABSTRACT FROM AUTHOR]

Background: In diffuse optical tomography (DOT), the image reconstruction is often an ill-posed inverse problem, which is even more severe for breast DOT since there are considerably increasing unknowns to reconstruct with regard to the achievable number of measurements. One common way to address this ill-posedness is to introduce various regularization methods. There has been extensive research regarding constructing and optimizing objective functions. However, although these algorithms dramatically improved reconstruction images, few of them have designed an essentially differentiable objective function whose full gradient is easy to obtain to accelerate the optimization process.Methods: This paper introduces a new kind of non-negative prior information, designing differentiable objective functions for cases of L1-norm, Lp (0 < p < 1)-norm and L0-norm. Incorporating this non-negative prior information, it is easy to obtain the gradient of these differentiable objective functions, which is useful to guide the optimization process.Results: Performance analyses are conducted using both numerical and phantom experiments. In terms of spatial resolution, quantitativeness, gray resolution and execution time, the proposed methods perform better than the conventional regularization methods without this non-negative prior information.Conclusions: The proposed methods improves the reconstruction images using the introduced non-negative prior information. Furthermore, the non-negative constraint facilitates the gradient computation, accelerating the minimization of the objective functions. [ABSTRACT FROM AUTHOR]

Background: Diffusion Tensor Magnetic Resonance Imaging (DT-MRI, also known as DTI) measures the diffusion properties of water molecules in tissues and to date is one of the main techniques that can effectively study the microstructures of the brain in vivo. Presently, evaluation of DTI registration techniques is still in an initial stage of development.Methods and Results: In this paper, six well-known open source DTI registration algorithms: Elastic, Rigid, Affine, DTI-TK, FSL and SyN were applied on 11 subjects from an open-access dataset, among which one was randomly chosen as the template. Eight different fiber bundles of 10 subjects and the template were obtained by drawing regions of interest (ROIs) around various structures using deterministic streamline tractography. The performances of the registration algorithms were evaluated by computing the distances and intersection angles between fiber tracts, as well as the fractional anisotropy (FA) profiles along the fiber tracts. Also, the mean squared error (MSE) and the residual MSE (RMSE) of fibers originating from the registered subjects and the template were calculated to assess the registration algorithm. Twenty-seven different fiber bundles of the 10 subjects and template were obtained by drawing ROIs around various structures using probabilistic tractography. The performances of registration algorithms on this second tractography method were evaluated by computing the spatial correlation similarity of the fibers between subjects as well as between each subject and the template.Conclusion: All experimental results indicated that DTI-TK performed the best under the study conditions, and SyN ranked just behind it. [ABSTRACT FROM AUTHOR]

Background: One of the key challenges of the biomedical cyber-physical system is to combine cognitive neuroscience with the integration of physical systems to assist people with disabilities. Electroencephalography (EEG) has been explored as a non-invasive method of providing assistive technology by using brain electrical signals.Methods: This paper presents a unique prototype of a hybrid brain computer interface (BCI) which senses a combination classification of mental task, steady state visual evoked potential (SSVEP) and eyes closed detection using only two EEG channels. In addition, a microcontroller based head-mounted battery-operated wireless EEG sensor combined with a separate embedded system is used to enhance portability, convenience and cost effectiveness. This experiment has been conducted with five healthy participants and five patients with tetraplegia.Results: Generally, the results show comparable classification accuracies between healthy subjects and tetraplegia patients. For the offline artificial neural network classification for the target group of patients with tetraplegia, the hybrid BCI system combines three mental tasks, three SSVEP frequencies and eyes closed, with average classification accuracy at 74% and average information transfer rate (ITR) of the system of 27 bits/min. For the real-time testing of the intentional signal on patients with tetraplegia, the average success rate of detection is 70% and the speed of detection varies from 2 to 4 s. [ABSTRACT FROM AUTHOR]

Background: Plaster casts of individual patients are important for orthodontic specialists during the treatment process and their analysis is still a standard diagnostical tool. But the growing capabilities of information technology enable their replacement by digital models obtained by complex scanning systems., Method: This paper presents the possibility of using a digital camera as a simple instrument to obtain the set of digital images for analysis and evaluation of the treatment using appropriate mathematical tools of image processing. The methods studied in this paper include the segmentation of overlapping dental bodies and the use of different illumination sources to increase the reliability of the separation process. The circular Hough transform, region growing with multiple seed points, and the convex hull detection method are applied to the segmentation of orthodontic plaster cast images to identify dental arch objects and their sizes., Results: The proposed algorithm presents the methodology of improving the accuracy of segmentation of dental arch components using combined illumination sources. Dental arch parameters and distances between the canines and premolars for different segmentation methods were used as a measure to compare the results obtained., Conclusion: A new method of segmentation of overlapping dental arch components using digital records of illuminated plaster casts provides information with the precision required for orthodontic treatment. The distance between corresponding teeth was evaluated with a mean error of 1.38% and the Dice similarity coefficient of the evaluated dental bodies boundaries reached 0.9436 with a false positive rate [Formula: see text] and false negative rate [Formula: see text].

Background: Human body communication (HBC) using the human body as the transmission medium, which has been regarded as one of the most promising short-range communications in wireless body area networks (WBAN). Compared to the traditional wireless networks, two challenges are existed in HBC based WBAN. (1) Its sensor nodes should be energy saving since it is inconvenient to replace or recharge the battery on these sensor nodes; (2) the coordinator should be able to react dynamically and rapidly to the burst traffic triggered by sensing events. Those burst traffic conditions include vital physical signal (electrocardiogram, electroencephalogram etc.) monitoring, human motion detection (fall detection, activity monitoring, gesture recognition, motion sensing etc.) and so on. To cope with aforementioned challenges, a statistical frame based TDMA (S-TDMA) protocol with multi-constrained (energy, delay, transmission efficiency and emergency management) service is proposed in this paper., Methods: The scenarios where burst traffic is often triggered rapidly with low power consumption and low delay is handled in our proposed S-TDMA. A beacon frame with the contained synchronous and poll information is designed to reduce the possibility of collisions of request frames. A statistical frame which broadcasts the unified scheduling information is adopted to avoid packet collisions, idle listening and overhearing. Dynamic time slot allocation mechanism is presented to manage the burst traffic and reduce the active period in each beacon period. An emergency mechanism is proposed for vital signals to be transmitted. The theory analysis is proceed and the result is evaluated in the hardware platform., Results: To verify its feasibility, S-TDMA was fully implemented on our independently-developed HBC platform where four sensor nodes and a coordinator are fastened on a human body. Experiment results show that S-TDMA costs 89.397 mJ every 20 s when the payload size is 122 bytes, 9.51% lower than Lightweight MAC (LMAC); the average data latency of S-TDMA is 6.3 ms, 7.02% lower than Preamble-based TDMA (PB-TDMA); the transmission efficiency of S-TDMA is 93.67%, 4.83% higher than IEEE 802.15.6 carrier sense multiple access/collision avoidance (CSMA/CA) protocol., Conclusions: With respect to the challenges of HBC based WBANs, a novel S-TDMA protocol was proposed in this paper. Compared to the traditional protocols, the results demonstrate that S-TDMA successfully meets the delay and transmission efficiency requirements of HBC while keeping a low energy consumption. We also believe that our S-TDMA protocol will promote development of HBC in wearable applications.

Background: Blood smear microscopic images are routinely investigated by haematologists to diagnose most blood diseases. However, the task is quite tedious and time consuming. An automatic detection and classification of white blood cells within such images can accelerate the process tremendously. In this paper we propose a system to locate white blood cells within microscopic blood smear images, segment them into nucleus and cytoplasm regions, extract suitable features and finally, classify them into five types: basophil, eosinophil, neutrophil, lymphocyte and monocyte., Dataset: Two sets of blood smear images were used in this study's experiments. Dataset 1, collected from Rangsit University, were normal peripheral blood slides under light microscope with 100× magnification; 555 images with 601 white blood cells were captured by a Nikon DS-Fi2 high-definition color camera and saved in JPG format of size 960 × 1,280 pixels at 15 pixels per 1 μm resolution. In dataset 2, 477 cropped white blood cell images were downloaded from CellaVision.com. They are in JPG format of size 360 × 363 pixels. The resolution is estimated to be 10 pixels per 1 μm., Methods: The proposed system comprises a pre-processing step, nucleus segmentation, cell segmentation, feature extraction, feature selection and classification. The main concept of the segmentation algorithm employed uses white blood cell's morphological properties and the calibrated size of a real cell relative to image resolution. The segmentation process combined thresholding, morphological operation and ellipse curve fitting. Consequently, several features were extracted from the segmented nucleus and cytoplasm regions. Prominent features were then chosen by a greedy search algorithm called sequential forward selection. Finally, with a set of selected prominent features, both linear and naïve Bayes classifiers were applied for performance comparison. This system was tested on normal peripheral blood smear slide images from two datasets., Results: Two sets of comparison were performed: segmentation and classification. The automatically segmented results were compared to the ones obtained manually by a haematologist. It was found that the proposed method is consistent and coherent in both datasets, with dice similarity of 98.9 and 91.6% for average segmented nucleus and cell regions, respectively. Furthermore, the overall correction rate in the classification phase is about 98 and 94% for linear and naïve Bayes models, respectively., Conclusions: The proposed system, based on normal white blood cell morphology and its characteristics, was applied to two different datasets. The results of the calibrated segmentation process on both datasets are fast, robust, efficient and coherent. Meanwhile, the classification of normal white blood cells into five types shows high sensitivity in both linear and naïve Bayes models, with slightly better results in the linear classifier.

Background: Computed tomography (CT) helps physicians locate and diagnose pathological conditions. In some conditions, having an airway segmentation method which facilitates reconstruction of the airway from chest CT images can help hugely in the assessment of lung diseases. Many efforts have been made to develop airway segmentation algorithms, but methods are usually not optimized to be reliable across different CT scan parameters., Methods: In this paper, we present a simple and reliable semi-automatic algorithm which can segment tracheal and bronchial anatomy using the open-source 3D Slicer platform. The method is based on a region growing approach where trachea, right and left bronchi are cropped and segmented independently using three different thresholds. The algorithm and its parameters have been optimized to be efficient across different CT scan acquisition parameters. The performance of the proposed method has been evaluated on EXACT'09 cases and local clinical cases as well as on a breathing pig lung phantom using multiple scans and changing parameters. In particular, to investigate multiple scan parameters reconstruction kernel, radiation dose and slice thickness have been considered. Volume, branch count, branch length and leakage presence have been evaluated. A new method for leakage evaluation has been developed and correlation between segmentation metrics and CT acquisition parameters has been considered., Results: All the considered cases have been segmented successfully with good results in terms of leakage presence. Results on clinical data are comparable to other teams' methods, as obtained by evaluation against the EXACT09 challenge, whereas results obtained from the phantom prove the reliability of the method across multiple CT platforms and acquisition parameters. As expected, slice thickness is the parameter affecting the results the most, whereas reconstruction kernel and radiation dose seem not to particularly affect airway segmentation., Conclusion: The system represents the first open-source airway segmentation platform. The quantitative evaluation approach presented represents the first repeatable system evaluation tool for like-for-like comparison between different airway segmentation platforms. Results suggest that the algorithm can be considered stable across multiple CT platforms and acquisition parameters and can be considered as a starting point for the development of a complete airway segmentation algorithm.

Electrogastrographic examination (EGG) is a noninvasive method for an investigation of a stomach slow wave propagation. The typical range of frequency for EGG signal is from 0.015 to 0.15 Hz or (0.015-0.3 Hz) and the signal usually is captured with sampling frequency not exceeding 4 Hz. In this paper a new approach of method for recording the EGG signals with high sampling frequency (200 Hz) is proposed. High sampling frequency allows collection of signal, which includes not only EGG component but also signal from other organs of the digestive system such as the duodenum, colon as well as signal connected with respiratory movements and finally electrocardiographic signal (ECG). The presented method allows improve the quality of analysis of EGG signals by better suppress respiratory disturbance and extract new components from high sampling electrogastrographic signals (HSEGG) obtained from abdomen surface. The source of the required new signal components can be inner organs such as the duodenum and colon. One of the main problems that appear during analysis the EGG signals and extracting signal components from inner organs is how to suppress the respiratory components. In this work an adaptive filtering method that requires a reference signal is proposed. In the present research, the respiratory component is obtained from non standard ECG (NSECG) signal. For purposes of this paper non standard ECG (namely NSECG) is used, because ECG signal was recorded by other than the standard electrodes placement on the surface of the abdomen. The electrocardiographic derived respiration signal (EDR) is extracted using the phenomena of QRS complexes amplitude modulation by respiratory movements. The main idea of extracting the EDR signal from electrocardiographic signal is to obtain the modulating signal. Adaptive filtering is done in the discrete cosine transform domain. Next the resampled HSEGG signal with attenuated respiratory components is low pass filtered and as a result the extended electrogastrographic signals, included EGG signal and components from other inner organs of digestive system is obtained. One of additional features of the proposed method is a possibility to obtain simultaneously recorded signals, such as: non-standard derivation of ECG, heart rate variability signal, respiratory signal, and EGG signal that allow investigating mutual interferences among internal human systems.

Background: Fast and accurate quality estimation of the electrocardiogram (ECG) signal is a relevant research topic that has attracted considerable interest in the scientific community, particularly due to its impact on tele-medicine monitoring systems, where the ECG is collected by untrained technicians. In recent years, a number of studies have addressed this topic, showing poor performance in discriminating between clinically acceptable and unacceptable ECG records., Methods: This paper presents a novel, simple and accurate algorithm to estimate the quality of the 12-lead ECG by exploiting the structure of the cross-covariance matrix among different leads. Ideally, ECG signals from different leads should be highly correlated since they capture the same electrical activation process of the heart. However, in the presence of noise or artifacts the covariance among these signals will be affected. Eigenvalues of the ECG signals covariance matrix are fed into three different supervised binary classifiers., Results and Conclusion: The performance of these classifiers were evaluated using PhysioNet/CinC Challenge 2011 data. Our best quality classifier achieved an accuracy of 0.898 in the test set, while having a complexity well below the results of contestants who participated in the Challenge, thus making it suitable for implementation in current cellular devices.

Background: Fuzzy connectedness method has shown its effectiveness for fuzzy object extraction in recent years. However, two problems may occur when applying it to hepatic vessel segmentation task. One is the excessive computational cost, and the other is the difficulty of choosing a proper threshold value for final segmentation., Methods: In this paper, an accelerated strategy based on a lookup table was presented first which can reduce the connectivity scene calculation time and achieve a speed-up factor of above 2. When the computing of the fuzzy connectedness relations is finished, a threshold is needed to generate the final result. Currently the threshold is preset by users. Since different thresholds may produce different outcomes, how to determine a proper threshold is crucial. According to our analysis of the hepatic vessel structure, a watershed-like method was used to find the optimal threshold. Meanwhile, by using Ostu algorithm to calculate the parameters for affinity relations and assigning the seed with the mean value, it is able to reduce the influence on the segmentation result caused by the location of the seed and enhance the robustness of fuzzy connectedness method., Results: Experiments based on four different datasets demonstrate the efficiency of the lookup table strategy. These experiments also show that an adaptive threshold found by watershed-like method can always generate correct segmentation results of hepatic vessels. Comparing to a refined region-growing algorithm that has been widely used for hepatic vessel segmentation, fuzzy connectedness method has advantages in detecting vascular edge and generating more than one vessel system through the weak connectivity of the vessel ends., Conclusions: An improved algorithm based on fuzzy connectedness method is proposed. This algorithm has improved the performance of fuzzy connectedness method in hepatic vessel segmentation.

Background: Activities of daily living (ADL) are important for quality of life. They are indicators of cognitive health status and their assessment is a measure of independence in everyday living. ADL are difficult to reliably assess using questionnaires due to self-reporting biases. Various sensor-based (wearable, in-home, intrusive) systems have been proposed to successfully recognize and quantify ADL without relying on self-reporting. New classifiers required to classify sensor data are on the rise. We propose two ad-hoc classifiers that are based only on non-intrusive sensor data., Methods: A wireless sensor system with ten sensor boxes was installed in the home of ten healthy subjects to collect ambient data over a duration of 20 consecutive days. A handheld protocol device and a paper logbook were also provided to the subjects. Eight ADL were selected for recognition. We developed two ad-hoc ADL classifiers, namely the rule based forward chaining inference engine (RBI) classifier and the circadian activity rhythm (CAR) classifier. The RBI classifier finds facts in data and matches them against the rules. The CAR classifier works within a framework to automatically rate routine activities to detect regular repeating patterns of behavior. For comparison, two state-of-the-art [Naïves Bayes (NB), Random Forest (RF)] classifiers have also been used. All classifiers were validated with the collected data sets for classification and recognition of the eight specific ADL., Results: Out of a total of 1,373 ADL, the RBI classifier correctly determined 1,264, while missing 109 and the CAR determined 1,305 while missing 68 ADL. The RBI and CAR classifier recognized activities with an average sensitivity of 91.27 and 94.36%, respectively, outperforming both RF and NB., Conclusions: The performance of the classifiers varied significantly and shows that the classifier plays an important role in ADL recognition. Both RBI and CAR classifier performed better than existing state-of-the-art (NB, RF) on all ADL. Of the two ad-hoc classifiers, the CAR classifier was more accurate and is likely to be better suited than the RBI for distinguishing and recognizing complex ADL.

Background: This paper proposes a semantic segmentation algorithm that provides the spatial distribution patterns of pulmonary ground-glass nodules with solid portions in computed tomography (CT) images., Methods: The proposed segmentation algorithm, anatomy packing with hierarchical segments (APHS), performs pulmonary nodule segmentation and quantification in CT images. In particular, the APHS algorithm consists of two essential processes: hierarchical segmentation tree construction and anatomy packing. It constructs the hierarchical segmentation tree based on region attributes and local contour cues along the region boundaries. Each node of the tree corresponds to the soft boundary associated with a family of nested segmentations through different scales applied by a hierarchical segmentation operator that is used to decompose the image in a structurally coherent manner. The anatomy packing process detects and localizes individual object instances by optimizing a hierarchical conditional random field model. Ninety-two histopathologically confirmed pulmonary nodules were used to evaluate the performance of the proposed APHS algorithm. Further, a comparative study was conducted with two conventional multi-label image segmentation algorithms based on four assessment metrics: the modified Williams index, percentage statistic, overlapping ratio, and difference ratio., Results: Under the same framework, the proposed APHS algorithm was applied to two clinical applications: multi-label segmentation of nodules with a solid portion and surrounding tissues and pulmonary nodule segmentation. The results obtained indicate that the APHS-generated boundaries are comparable to manual delineations with a modified Williams index of 1.013. Further, the resulting segmentation of the APHS algorithm is also better than that achieved by two conventional multi-label image segmentation algorithms., Conclusions: The proposed two-level hierarchical segmentation algorithm effectively labelled the pulmonary nodule and its surrounding anatomic structures in lung CT images. This suggests that the generated multi-label structures can potentially serve as the basis for developing related clinical applications.

Background: Colour image segmentation is fundamental and critical for quantitative histological image analysis. The complexity of the microstructure and the approach to make histological images results in variable staining and illumination variations. And ultra-high resolution of histological images makes it is hard for image segmentation methods to achieve high-quality segmentation results and low computation cost at the same time., Methods: Mean Shift clustering approach is employed for histological image segmentation. Colour histological image is transformed from RGB to CIE L*a*b* colour space, and then a* and b* components are extracted as features. To speed up Mean Shift algorithm, the probability density distribution is estimated in feature space in advance and then the Mean Shift scheme is used to separate the feature space into different regions by finding the density peaks quickly. And an integral scheme is employed to reduce the computation cost of mean shift vector significantly. Finally image pixels are classified into clusters according to which region their features fall into in feature space., Results: Numerical experiments are carried on liver fibrosis histological images. Experimental results demonstrate that Mean Shift clustering achieves more accurate results than k-means but is computational expensive, and the speed of the improved Mean Shift method is comparable to that of k-means while the accuracy of segmentation results is the same as that achieved using standard Mean Shift method., Conclusions: An effective and reliable histological image segmentation approach is proposed in this paper. It employs improved Mean Shift clustering, which is speed up by using probability density distribution estimation and the integral scheme.

Background: Segmentation of the magnetic resonance (MR) images is fundamentally important in medical image analysis. Intensity inhomogeneity due to the unknown noise and weak boundary makes it a difficult problem., Method: The paper presents a novel level set geodesic model which integrates the local and the global intensity information in the signed pressure force (SPF) function to suppress the intensity inhomogeneity and implement the segmentation. First, a new local and global region based SPF function is proposed to extract the local and global image information in order to ensure a flexible initialization of the object contours. Second, the global SPF is adaptively balanced by the weight calculated by using the local image contrast. Third, two-phase level set formulation is extended to a multi-phase formulation to successfully segment brain MR images., Results: Experimental results on the synthetic images and MR images demonstrate that the proposed method is very robust and efficient. Compared with the related methods, our method is much more computationally efficient and much less sensitive to the initial contour. Furthermore, the validation on 18 T1-weighted brain MR images (International Brain Segmentation Repository) shows that our method can produce very promising results., Conclusions: A novel segmentation model by incorporating the local and global information into the original GAC model is proposed. The proposed model is suitable for the segmentation of the inhomogeneous MR images and allows flexible initialization.

Background: This paper presents a Tracer Liquid Image Velocimetry (TLIV) for multi-layer radial flow in bioreactors used for cells cultivation of tissue engineering. The goal of this approach is to use simple devices to get good measuring precision, specialized for the case in which the uniform level of fluid shear stress was required while fluid velocity varied smoothly., Methods: Compared to the widely used Particles Image Velocimetry (PIV), this method adopted a bit of liquid as tracer, without the need of laser source. Sub-pixel positioning algorithm was used to overcome the adverse effects of the tracer liquid deformation. In addition, a neighborhood smoothing algorithm was used to restrict the measurement perturbation caused by diffusion. Experiments were carried out in a parallel plates flow chamber. And mathematical models of the flow chamber and Computational Fluid Dynamics (CFD) simulation were separately employed to validate the measurement precision of TLIV., Results: The mean relative error between the simulated and measured data can be less than 2%, while in similar validations using PIV, the error was around 8.8%., Conclusions: TLIV avoided the contradiction between the particles' visibility and following performance with tested fluid, which is difficult to overcome in PIV. And TLIV is easier to popularize for its simple experimental condition and low cost.

Background: Positron emission tomography (PET) always suffers from high levels of noise due to the constraints of the injected dose and acquisition time, especially in the studies of dynamic PET imaging. To improve the quality of PET image, several approaches have been introduced to suppress noise. However, traditional filters often blur the image edges, or erase small detail, or rely on multiple parameters. In order to solve such problems, nonlocal denoising methods have been adapted to denoise PET images.Methods: In this paper, we propose to use the weighted higher-order singular value decomposition for PET image denoising. We first modeled the noise in the PET image as Poisson distribution. Then, we transformed the noise to an additive Gaussian noise by use of the anscombe root transformation. Finally, we denoised the transformed image using the proposed higher-order singular value decomposition (HOSVD)-based algorithms. The denoised results were compared with results from some general filters by performing physical phantom and mice studies.Results: Compared to other commonly used filters, HOSVD-based denoising algorithms can preserve boundaries and quantitative accuracy better. The spatial resolution and the low activity features in PET image also can be preserved by use of HOSVD-based methods. Comparing with the standard HOSVD-based algorithm, the proposed weighted HOSVD algorithm can suppress the stair-step artifact, and the time-consumption is about half of that needed by the Wiener-augmented HOSVD algorithm.Conclusions: The proposed weighted HOSVD denoising algorithm can suppress noise while better preserving of boundary and quantity in PET images. [ABSTRACT FROM AUTHOR]

Background: In order to reduce the radiation dose of CT (computed tomography), compressed sensing theory has been a hot topic since it provides the possibility of a high quality recovery from the sparse sampling data. Recently, the algorithm based on DL (dictionary learning) was developed to deal with the sparse CT reconstruction problem. However, the existing DL algorithm focuses on the minimization problem with the L2-norm regularization term, which leads to reconstruction quality deteriorating while the sampling rate declines further. Therefore, it is essential to improve the DL method to meet the demand of more dose reduction.Methods: In this paper, we replaced the L2-norm regularization term with the L1-norm one. It is expected that the proposed L1-DL method could alleviate the over-smoothing effect of the L2-minimization and reserve more image details. The proposed algorithm solves the L1-minimization problem by a weighting strategy, solving the new weighted L2-minimization problem based on IRLS (iteratively reweighted least squares).Results: Through the numerical simulation, the proposed algorithm is compared with the existing DL method (adaptive dictionary based statistical iterative reconstruction, ADSIR) and other two typical compressed sensing algorithms. It is revealed that the proposed algorithm is more accurate than the other algorithms especially when further reducing the sampling rate or increasing the noise.Conclusion: The proposed L1-DL algorithm can utilize more prior information of image sparsity than ADSIR. By transforming the L2-norm regularization term of ADSIR with the L1-norm one and solving the L1-minimization problem by IRLS strategy, L1-DL could reconstruct the image more exactly. [ABSTRACT FROM AUTHOR]

Pre-impact fall detection has been proposed to be an effective fall prevention strategy. In particular, it can help activate on-demand fall injury prevention systems (e.g. inflatable hip protectors) prior to fall impacts, and thus directly prevent the fall-related physical injuries. This paper gave a systematical review on pre-impact fall detection, and focused on the following aspects of the existing pre-impact fall detection research: fall detection apparatus, fall detection indicators, fall detection algorithms, and types of falls for fall detection evaluation. In addition, the performance of the existing pre-impact fall detection solutions were also reviewed and reported in terms of their sensitivity, specificity, and detection/lead time. This review also summarized the limitations in the existing pre-impact fall detection research, and proposed future research directions in this field. [ABSTRACT FROM AUTHOR]

Purpose: Fuzzy connectedness method (FC) is an effective method for extracting fuzzy objects from medical images. However, when FC is applied to large medical image datasets, its running time will be greatly expensive. Therefore, a parallel CUDA version of FC (CUDA-kFOE) was proposed by Ying et al. to accelerate the original FC. Unfortunately, CUDA-kFOE does not consider the edges between GPU blocks, which causes miscalculation of edge points. In this paper, an improved algorithm is proposed by adding a correction step on the edge points. The improved algorithm can greatly enhance the calculation accuracy. Methods: In the improved method, an iterative manner is applied. In the first iteration, the affinity computation strategy is changed and a look up table is employed for memory reduction. In the second iteration, the error voxels because of asynchronism are updated again. Results: Three different CT sequences of hepatic vascular with different sizes were used in the experiments with three different seeds. NVIDIA Tesla C2075 is used to evaluate our improved method over these three data sets. Experimental results show that the improved algorithm can achieve a faster segmentation compared to the CPU version and higher accuracy than CUDA-kFOE. Conclusions: The calculation results were consistent with the CPU version, which demonstrates that it corrects the edge point calculation error of the original CUDA-kFOE. The proposed method has a comparable time cost and has less errors compared to the original CUDA-kFOE as demonstrated in the experimental results. In the future, we will focus on automatic acquisition method and automatic processing. [ABSTRACT FROM AUTHOR]

Background: Recently, two-dimensional techniques have been successfully employed for compressing surface electromyographic (SEMG) records as images, through the use of image and video encoders. Such schemes usually provide specific compressors, which are tuned for SEMG data, or employ preprocessing techniques, before the two-dimensional encoding procedure, in order to provide a suitable data organization, whose correlations can be better exploited by off-the-shelf encoders. Besides preprocessing input matrices, one may also depart from those approaches and employ an adaptive framework, which is able to directly tackle SEMG signals reassembled as images.Methods: This paper proposes a new two-dimensional approach for SEMG signal compression, which is based on a recurrent pattern matching algorithm called multidimensional multiscale parser (MMP). The mentioned encoder was modified, in order to efficiently work with SEMG signals and exploit their inherent redundancies. Moreover, a new preprocessing technique, named as segmentation by similarity (SbS), which has the potential to enhance the exploitation of intra- and intersegment correlations, is introduced, the percentage difference sorting (PDS) algorithm is employed, with different image compressors, and results with the high efficiency video coding (HEVC), H.264/AVC, and JPEG2000 encoders are presented.Results: Experiments were carried out with real isometric and dynamic records, acquired in laboratory. Dynamic signals compressed with H.264/AVC and HEVC, when combined with preprocessing techniques, resulted in good percent root-mean-square difference [Formula: see text] compression factor figures, for low and high compression factors, respectively. Besides, regarding isometric signals, the modified two-dimensional MMP algorithm outperformed state-of-the-art schemes, for low compression factors, the combination between SbS and HEVC proved to be competitive, for high compression factors, and JPEG2000, combined with PDS, provided good performance allied to low computational complexity, all in terms of percent root-mean-square difference [Formula: see text] compression factor.Conclusion: The proposed schemes are effective and, specifically, the modified MMP algorithm can be considered as an interesting alternative for isometric signals, regarding traditional SEMG encoders. Besides, the approach based on off-the-shelf image encoders has the potential of fast implementation and dissemination, given that many embedded systems may already have such encoders available, in the underlying hardware/software architecture. [ABSTRACT FROM AUTHOR]

Background: Spine magnetic resonance image (MRI) plays a very important role in the diagnosis of various spinal diseases, such as disc degeneration, scoliosis, and osteoporosis. Accurate localization and segmentation of the intervertebral disc (IVD) in spine MRI can help accelerate the diagnosis time and assist in the treatment by providing quantitative parameters. In this paper, a method based on Gabor filter bank is proposed for IVD localization and segmentation.Methods: First, the structural features of IVDs are extracted using a Gabor filter bank. Second, the Gabor features of spine are calculated and spinal curves are detected. Third, the Gabor feature images (GFI) of IVDs are calculated and adjusted according to the spinal curves. Fourth, the IVDs are localized by clustering analysis with GFI. Finally, an optimum grayscale-based algorithm with self-adaptive threshold, combined with the localization results and Gabor features of the spine, is performed for IVDs segmentation.Results: The proposed method is verified by an MRI dataset consisting of 278 IVDs from 37 patients. The accuracy of localization is 98.23 % and the dice similarity index for segmentation evaluation is 0.9237.Conclusions: The proposed Gabor filter based method is effective for IVD localization and segmentation. It would be useful in computer-aided diagnosis of IVD diseases and computer-assisted spine surgery. [ABSTRACT FROM AUTHOR]