Search

The ability to predict the occurrence of an epileptic seizure is a safeguard against patient injury and health complications. However, a major challenge in seizure prediction arises from the significant variability observed in patient data. Common patient-specific approaches, which apply to each patient independently, often perform poorly for other patients due to the data variability. The aim of this study is to propose deep learning models which can handle this variability and generalize across various patients. This study addresses this challenge by introducing a novel cross-subject and multi-subject prediction models. Multiple-subject modeling broadens the scope of patient-specific modeling to account for the data from a dedicated ensemble of patients, thereby providing some useful, though relatively modest, level of generalization. The basic neural network architecture of this model is then adapted to cross-subject prediction, thereby providing a broader, more realistic, context of application. For accrued performance, and generalization ability, cross-subject modeling is enhanced by domain adaptation. Experimental evaluation using the publicly available CHB-MIT and SIENA data datasets shows that our multiple-subject model achieved better performance compared to existing works. However, the cross-subject faces challenges when applied to different patients. Finally, through investigating three domain adaptation methods, the model accuracy has been notably improved by 10.30% and 7.4% for the CHB-MIT and SIENA datasets, respectively., Competing Interests: The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest., (Copyright © 2024 Jemal, Abou-Abbas, Henni, Mitiche and Mezghani.)

Human activity recognition (HAR) by wearable sensor devices embedded in the Internet of things (IOT) can play a significant role in remote health monitoring and emergency notification to provide healthcare of higher standards. The purpose of this study is to investigate a human activity recognition method of accrued decision accuracy and speed of execution to be applicable in healthcare. This method classifies wearable sensor acceleration time series data of human movement using an efficient classifier combination of feature engineering-based and feature learning-based data representation. Leave-one-subject-out cross-validation of the method with data acquired from 44 subjects wearing a single waist-worn accelerometer on a smart textile, and engaged in a variety of 10 activities, yielded an average recognition rate of 90%, performing significantly better than individual classifiers. The method easily accommodates functional and computational parallelization to bring execution time significantly down.

In the context of recent deep clustering studies, discriminative models dominate the literature and report the most competitive performances. These models learn a deep discriminative neural network classifier in which the labels are latent. Typically, they use multinomial logistic regression posteriors and parameter regularization, as is very common in supervised learning. It is generally acknowledged that discriminative objective functions (e.g., those based on the mutual information or the KL divergence) are more flexible than generative approaches (e.g., K-means) in the sense that they make fewer assumptions about the data distributions and, typically, yield much better unsupervised deep learning results. On the surface, several recent discriminative models may seem unrelated to K-means. This study shows that these models are, in fact, equivalent to K-means under mild conditions and common posterior models and parameter regularization. We prove that, for the commonly used logistic regression posteriors, maximizing the L 2 regularized mutual information via an approximate alternating direction method (ADM) is equivalent to minimizing a soft and regularized K-means loss. Our theoretical analysis not only connects directly several recent state-of-the-art discriminative models to K-means, but also leads to a new soft and regularized deep K-means algorithm, which yields competitive performance on several image clustering benchmarks.

Background: The purpose of this study is to review the current literature on knee joint biomechanical gait data analysis for knee pathology classification. The review is prefaced by a presentation of the prerequisite knee joint biomechanics background and a description of biomechanical gait pattern recognition as a diagnostic tool. It is postfaced by discussions that highlight the current research findings and future directions., Methods: The review is based on a literature search in PubMed, IEEE Xplore, Science Direct, and Google Scholar on April 2019. Inclusion criteria admitted articles, written in either English or French, on knee joint biomechanical gait data classification in general. We recorded the relevant information pertaining to the investigated knee joint pathologies, the participants' attributes, data acquisition, feature extraction, and selection used to represent the data, as well as the classification algorithms and validation of the results., Results: Thirty-one studies met the inclusion criteria for review., Conclusions: The review reveals that the importance of medical applications of knee joint biomechanical gait data classification and recent progress in data acquisition technology are fostering intense interest in the subject and giving a strong impetus to research. The review also reveals that biomechanical data during locomotion carry essential information on knee joint conditions to infer an early diagnosis. This survey paper can serve as a useful informative reference for research on the subject.

Three-dimensional (3D) knee kinematic data, measuring flexion/extension, abduction/adduction, and internal/external rotation angle variations during locomotion, provide essential information to diagnose, classify, and treat musculoskeletal knee pathologies. However, and so across genders, the curse of dimensionality, intra-class high variability, and inter-class proximity make this data usually difficult to interpret, particularly in tasks such as knee pathology classification. The purpose of this study is to use data complexity analysis to get some insight into this difficulty. Using 3D knee kinematic measurements recorded from osteoarthritis and asymptomatic subjects, we evaluated both single feature complexity, where each feature is taken individually, and global feature complexity, where features are considered simultaneously. These evaluations afford a characterization of data complexity independent of the used classifier and, therefore, provide information as to the level of classification performance one can expect. Comparative results, using reference databases, reveal that knee kinematic data are highly complex, and thus foretell the difficulty of knee pathology classification., Competing Interests: The authors have declared that no competing interests exist.

Objective: To investigate, as a discovery phase, if 3D knee kinematics assessment parameters can serve as mechanical biomarkers, more specifically as diagnostic biomarker and burden of disease biomarkers, as defined in the Burden of Disease, Investigative, Prognostic, Efficacy of Intervention and Diagnostic classification scheme for osteoarthritis (OA) (Altman et al., 1986). These biomarkers consist of a set of biomechanical parameters discerned from 3D knee kinematic patterns, namely, flexion/extension, abduction/adduction, and tibial internal/external rotation measurements, during gait recording., Methods: 100 medial compartment knee OA patients and 40 asymptomatic control subjects participated in this study. OA patients were categorized according to disease severity, by the Kellgren and Lawrence grading system. The proposed biomarkers were identified by incremental parameter selection in a regression tree of cross-sectional data. Biomarker effectiveness was evaluated by receiver operating characteristic curve analysis, namely, the area under the curve (AUC), sensitivity and specificity., Results: Diagnostic biomarkers were defined by a set of 3 abduction/adduction kinematics parameters. The performance of these biomarkers reached 85% for the AUC, 80% for sensitivity and 90% for specificity; the likelihood ratio was 8%. Burden of disease biomarkers were defined by a 3-decision tree, with sets of kinematics parameters selected from all 3 movement planes., Conclusion: The results demonstrate, as part of a discovery phase, that sets of 3D knee kinematic parameters have the potential to serve as diagnostic and burden of disease biomarkers of medial compartment knee OA., (Copyright © 2017 Elsevier Ltd. All rights reserved.)

The purpose of this study is to determine a representative pattern of a set of three dimensional (3D) knee kinematic measurement curves recorded throughout several trials with a patient walking on a treadmill. The measurements are knee angles, (namely joint angles) with respect to the sagittal, frontal, and transverse planes, as a function of time during a gait cycle. Two serious difficulties met while extracting a representative pattern from the trials are that the curves possess phase variability and there are outliers. We propose a scheme which first removes outliers using the modified band depth index method, and follows with phase variability reduction by curve registration. This scheme leads to retaining the mean curve of the corrected set of curves, as the most representative.

This study investigates the recovery of region boundary patterns in an image by a variational level set method which drives an active curve to coincide with boundaries on which a feature distribution matches a reference distribution. We formulate the scheme for both the Kullback-Leibler and the Bhattacharyya similarities, and apply it in two conditions: the simultaneous recovery of all region boundaries consistent with a given outline pattern, and segmentation in the presence of faded boundary segments. The first task uses an image-based geometric feature, and the second a photometric feature. In each case, the corresponding curve evolution equation can be viewed as a geodesic active contour (GAC) flow having a variable stopping function which depends on the feature distribution on the active curve. This affords a potent global representation of the target boundaries, which can effectively drive active curve segmentation in a variety of otherwise adverse conditions. Detailed experimentation shows that the scheme can significantly improve on current region and edge-based formulations.

The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a kernel function so that the piecewise constant model of the graph cut formulation becomes applicable. The objective function contains an original data term to evaluate the deviation of the transformed data, within each segmentation region, from the piecewise constant model, and a smoothness, boundary preserving regularization term. The method affords an effective alternative to complex modeling of the original image data while taking advantage of the computational benefits of graph cuts. Using a common kernel function, energy minimization typically consists of iterating image partitioning by graph cut iterations and evaluations of region parameters via fixed point computation. A quantitative and comparative performance assessment is carried out over a large number of experiments using synthetic grey level data as well as natural images from the Berkeley database. The effectiveness of the method is also demonstrated through a set of experiments with real images of a variety of types such as medical, synthetic aperture radar, and motion maps.

This study investigates level set multiphase image segmentation by kernel mapping and piecewise constant modeling of the image data thereof. A kernel function maps implicitly the original data into data of a higher dimension so that the piecewise constant model becomes applicable. This leads to a flexible and effective alternative to complex modeling of the image data. The method uses an active curve objective functional with two terms: an original term which evaluates the deviation of the mapped image data within each segmentation region from the piecewise constant model and a classic length regularization term for smooth region boundaries. Functional minimization is carried out by iterations of two consecutive steps: 1) minimization with respect to the segmentation by curve evolution via Euler-Lagrange descent equations and 2) minimization with respect to the regions parameters via fixed point iterations. Using a common kernel function, this step amounts to a mean shift parameter update. We verified the effectiveness of the method by a quantitative and comparative performance evaluation over a large number of experiments on synthetic images, as well as experiments with a variety of real images such as medical, satellite, and natural images, as well as motion maps.

In current level set image segmentation methods, the number of regions is assumed to known beforehand. As a result, it remains constant during the optimization of the objective functional. How to allow it to vary is an important question which has been generally avoided. This study investigates a region merging prior related to regions area to allow the number of regions to vary automatically during curve evolution, thereby optimizing the objective functional implicitly with respect to the number of regions. We give a statistical interpretation to the coefficient of this prior to balance its effect systematically against the other functional terms. We demonstrate the validity and efficiency of the method by testing on real images of intensity, color, and motion.

This study investigates Bayes classification of online Arabic characters represented by histograms of tangent differences and Gibbs modeling of the class-conditional probability density functions. The parameters of these Gibbs density functions are estimated following the Zhu, Wu, and Mumford constrained maximum entropy formalism, originally introduced for image and shape synthesis. We investigate two partition function estimation methods: one uses the training sample and the other draws from a reference distribution. The efficiency of the corresponding Bayes decision methods, and of a combination of these, is shown in experiments using a database of 9504 freely written samples by 22 scriptors. Comparisons to the nearest neighbor rule method and Kohonen neural network methods are provided.

This study investigates a variational, active curve evolution method for dense three-dimentional (3D) segmentation and interpretation of optical flow in an image sequence of a scene containing moving rigid objects viewed by a possibly moving camera. This method jointly performs 3D motion segmentation, 3D interpretation (recovery of 3D structure and motion), and optical flow estimation. The objective functional contains two data terms for each segmentation region, one based on the motion-only equation which relates the essential parameters of 3D rigid body motion to optical flow, and the other on the Horn and Schunck optical flow constraint. It also contains two regularization terms for each region, one for optical flow, the other for the region boundary. The necessary conditions for a minimum of the functional result in concurrent 3D-motion segmentation, by active curve evolution via level sets, and linear estimation of each region essential parameters and optical flow. Subsequently, the screw of 3D motion and regularized relative depth are recovered analytically for each region from the estimated essential parameters and optical flow. Examples are provided which verify the method and its implementation.

Studies have shown that the Weibull distribution can model accurately a wide variety of images. Its parameters index a family of distributions which includes the exponential and approximations of the Gaussian and the Raleigh models widely used in image segmentation. This study investigates the Weibull distribution in unsupervised image segmentation and classification by a variational method. The data term of the segmentation functional measures the conformity of the image intensity in each region to a Weibull distribution whose parameters are determined jointly with the segmentation. Minimization of the functional is implemented by active curves via level sets and consists of iterations of two consecutive steps: curve evolution via Euler-Lagrange descent equations and evaluation of the Weibull distribution parameters. Experiments with synthetic and real images are described which verify the validity of method and its implementation.

This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from maximum-likelihood approximation and a complex Wishart/Gaussian image representation and a classical boundary length prior. The minimization is carried out efficiently by a new multiphase method which embeds a simple partition constraint directly in curve evolution to guarantee a partition of the image domain from an arbitrary initial partition. Results are shown on both synthetic and real images. Quantitative performance evaluation and comparisons are also given.

The purpose of this study is to investigate a variational method for joint segmentation and parametric estimation of image motion by basis function representation of motion and level set evolution. The functional contains three terms. One term is of classic regularization to bias the solution toward a segmentation with smooth boundaries. A second term biases the solution toward a segmentation with boundaries which coincide with motion discontinuities, following a description of motion discontinuities by a function of the image spatio-temporal variations. The third term refers to region information and measures conformity of the parametric representation of the motion of each region of segmentation to the image spatio-temporal variations. The components of motion in each region of segmentation are represented as functions in a space generated by a set of basis functions. The coefficients of the motion components considered combinations of the basis functions are the parameters of representation. The necessary conditions for a minimum of the functional, which are derived taking into consideration the dependence of the motion parameters on segmentation, lead to an algorithm which condenses to concurrent curve evolution, implemented via level sets, and estimation of the parameters by least squares within each region of segmentation. The algorithm and its implementation are verified on synthetic and real images using a basis of cosine transforms.

The purpose of this study is to investigate a variational method for joint multiregion three-dimensional (3-D) motion segmentation and 3-D interpretation of temporal sequences of monocular images. Interpretation consists of dense recovery of 3-D structure and motion from the image sequence spatiotemporal variations due to short-range image motion. The method is direct insomuch as it does not require prior computation of image motion. It allows movement of both viewing system and multiple independently moving objects. The problem is formulated following a variational statement with a functional containing three terms. One term measures the conformity of the interpretation within each region of 3-D motion segmentation to the image sequence spatiotemporal variations. The second term is of regularization of depth. The assumption that environmental objects are rigid accounts automatically for the regularity of 3-D motion within each region of segmentation. The third and last term is for the regularity of segmentation boundaries. Minimization of the functional follows the corresponding Euler-Lagrange equations. This results in iterated concurrent computation of 3-D motion segmentation by curve evolution, depth by gradient descent, and 3-D motion by least squares within each region of segmentation. Curve evolution is implemented via level sets for topology independence and numerical stability. This algorithm and its implementation are verified on synthetic and real image sequences. Viewers presented with anaglyphs of stereoscopic images constructed from the algorithm's output reported a strong perception of depth.

The purpose of this study is to investigate Synthetic Aperture Radar (SAR) image segmentation into a given but arbitrary number of gamma homogeneous regions via active contours and level sets. The segmentation of SAR images is a difficult problem due to the presence of speckle which can be modeled as strong, multiplicative noise. The proposed algorithm consists of evolving simple closed planar curves within an explicit correspondence between the interiors of curves and regions of segmentation to minimize a criterion containing a term of conformity of data to a speckle model of noise and a term of regularization. Results are shown on both synthetic and real images.

The purpose of this study is to investigate a method of tracking moving objects with a moving camera. This method estimates simultaneously the motion induced by camera movement. The problem is formulated as a Bayesian motion-based partitioning problem in the spatiotemporal domain of the image quence. An energy functional is derived from the Bayesian formulation. The Euler-Lagrange descent equations determine imultaneously an estimate of the image motion field induced by camera motion and an estimate of the spatiotemporal motion undary surface. The Euler-Lagrange equation corresponding to the surface is expressed as a level-set partial differential equation for topology independence and numerically stable implementation. The method can be initialized simply and can track multiple objects with nonsimultaneous motions. Velocities on motion boundaries can be estimated from geometrical properties of the motion boundary. Several examples of experimental verification are given using synthetic and real-image sequences.

The purpose of this study is to prove convergence results for the Horn and Schunck optical-flow estimation method. Horn and Schunck stated optical-flow estimation as the minimization of a functional. When discretized, the corresponding Euler-Lagrange equations form a linear system of equations We write explicitly this system and order the equations in such a way that its matrix is symmetric positive definite. This property implies the convergence Gauss-Seidel iterative resolution method, but does not afford a conclusion on the convergence of the Jacobi method. However, we prove directly that this method also converges. We also show that the matrix of the linear system is block tridiagonal. The blockwise iterations corresponding to this block tridiagonal structure converge for both the Jacobi and the Gauss-Seidel methods, and the Gauss-Seidel method is faster than the (sequential) Jacobi method.