An improved sparse identification of nonlinear dynamics with Akaike information criterion and group sparsity.

A crucial challenge encountered in diverse areas of engineering applications involves speculating the governing equations based upon partial observations. On this basis, a variant of the sparse identification of nonlinear dynamics (SINDy) algorithm is developed. First, the Akaike information criterion (AIC) is integrated to enforce model selection by hierarchically ranking the most informative model from several manageable candidate models. This integration avoids restricting the number of candidate models, which is a disadvantage of the traditional methods for model selection. The subsequent procedure expands the structure of dynamics from ordinary differential equations (ODEs) to partial differential equations (PDEs), while group sparsity is employed to identify the nonconstant coefficients of partial differential equations. Of practical consideration within an integrated frame is data processing, which tends to treat noise separate from signals and tends to parametrize the noise probability distribution. In particular, the coefficients of a species of canonical ODEs and PDEs, such as the Van der Pol, Rössler, Burgers' and Kuramoto-Sivashinsky equations, can be identified correctly with the introduction of noise. Furthermore, except for normal noise, the proposed approach is able to capture the distribution of uniform noise. In accordance with the results of the experiments, the computational speed is markedly advanced and possesses robustness.

Feature-space selection with banded ridge regression.

Encoding models provide a powerful framework to identify the information represented in brain recordings. In this framework, a stimulus representation is expressed within a feature space and is used in a regularized linear regression to predict brain activity. To account for a potential complementarity of different feature spaces, a joint model is fit on multiple feature spaces simultaneously. To adapt regularization strength to each feature space, ridge regression is extended to banded ridge regression, which optimizes a different regularization hyperparameter per feature space. The present paper proposes a method to decompose over feature spaces the variance explained by a banded ridge regression model. It also describes how banded ridge regression performs a feature-space selection, effectively ignoring non-predictive and redundant feature spaces. This feature-space selection leads to better prediction accuracy and to better interpretability. Banded ridge regression is then mathematically linked to a number of other regression methods with similar feature-space selection mechanisms. Finally, several methods are proposed to address the computational challenge of fitting banded ridge regressions on large numbers of voxels and feature spaces. All implementations are released in an open-source Python package called Himalaya.

Occluded Pedestrian-Attribute Recognition for Video Sensors Using Group Sparsity.

Pedestrians are often obstructed by other objects or people in real-world vision sensors. These obstacles make pedestrian-attribute recognition (PAR) difficult; hence, occlusion processing for visual sensing is a key issue in PAR. To address this problem, we first formulate the identification of non-occluded frames as temporal attention based on the sparsity of a crowded video. In other words, a model for PAR is guided to prevent paying attention to the occluded frame. However, we deduced that this approach cannot include a correlation between attributes when occlusion occurs. For example, "boots" and "shoe color" cannot be recognized simultaneously when the foot is invisible. To address the uncorrelated attention issue, we propose a novel temporal-attention module based on group sparsity. Group sparsity is applied across attention weights in correlated attributes. Accordingly, physically-adjacent pedestrian attributes are grouped, and the attention weights of a group are forced to focus on the same frames. Experimental results indicate that the proposed method achieved 1.18% and 6.21% higher F1-scores than the advanced baseline method on the occlusion samples in DukeMTMC-VideoReID and MARS video-based PAR datasets, respectively.

Clustering-Driven DGS-Based Micro-Doppler Feature Extraction for Automatic Dynamic Hand Gesture Recognition.

We propose in this work a dynamic group sparsity (DGS) based time-frequency feature extraction method for dynamic hand gesture recognition (HGR) using millimeter-wave radar sensors. Micro-Doppler signatures of hand gestures show both sparse and structured characteristics in time-frequency domain, but previous study only focus on sparsity. We firstly introduce the structured prior when modeling the micro-Doppler signatures in this work to further enhance the features of hand gestures. The time-frequency distributions of dynamic hand gestures are first modeled using a dynamic group sparse model. A DGS-Subspace Pursuit (DGS-SP) algorithm is then utilized to extract the corresponding features. Finally, the support vector machine (SVM) classifier is employed to realize the dynamic HGR based on the extracted group sparse micro-Doppler features. The experiment shows that the proposed method achieved 3.3% recognition accuracy improvement over the sparsity-based method and has a better recognition accuracy than CNN based method in small dataset.

Sparse angle CT reconstruction with weighted dictionary learning algorithm based on adaptive group-sparsity regularization.

OBJECTIVE: In order to solve the blurred structural details and over-smoothing effects in sparse representation dictionary learning reconstruction algorithm, this study aims to test sparse angle CT reconstruction with weighted dictionary learning algorithm based on adaptive Group-Sparsity Regularization (AGSR-SART). METHODS: First, a new similarity measure is defined in which Covariance is introduced into Euclidean distance, Non-local image patches are adaptively divided into groups of different sizes as the basic unit of sparse representation. Second, the weight factor of the regular constraint terms is designed through the residuals represented by the dictionary, so that the algorithm takes different smoothing effects on different regions of the image during the iterative process. The sparse reconstructed image is modified according to the difference between the estimated value and the intermediate image. Last, The SBI (Split Bregman Iteration) iterative algorithm is used to solve the objective function. An abdominal image, a pelvic image and a thoracic image are employed to evaluate performance of the proposed method. RESULTS: In terms of quantitative evaluations, experimental results show that new algorithm yields PSNR of 48.20, the maximum SSIM of 99.06% and the minimum MAE of 0.0028. CONCLUSIONS: This study demonstrates that new algorithm can better preserve structural details in reconstructed CT images. It eliminates the effect of excessive smoothing in sparse angle reconstruction, enhances the sparseness and non-local self-similarity of the image, and thus it is superior to several existing reconstruction algorithms.

Total variation with modified group sparsity for CT reconstruction under low SNR.

BACKGROUND AND OBJECTIVE: Since the stair artifacts may affect non-destructive testing (NDT) and diagnosis in the later stage, an applicable model is desperately needed, which can deal with the stair artifacts and preserve the edges. However, the classical total variation (TV) algorithm only considers the sparsity of the gradient transformed image. The objective of this study is to introduce and test a new method based on group sparsity to address the low signal-to-noise ratio (SNR) problem. METHODS: This study proposes a weighted total variation with overlapping group sparsity model. This model combines the Gaussian kernel and overlapping group sparsity into TV model denoted as GOGS-TV, which considers the structure sparsity of the image to be reconstructed to deal with the stair artifacts. On one hand, TV is the accepted commercial algorithm, and it can work well in many situations. On the other hand, the Gaussian kernel can associate the points around each pixel. Quantitative assessments are implemented to verify this merit. RESULTS: Numerical simulations are performed to validate the presented method, compared with the classical simultaneous algebraic reconstruction technique (SART) and the state-of-the-art TV algorithm. It confirms the significantly improved SNR of the reconstruction images both in suppressing the noise and preserving the edges using new GOGS-TV model. CONCLUSIONS: The proposed GOGS-TV model demonstrates its advantages to reduce stair artifacts especially in low SNR reconstruction because this new model considers both the sparsity of the gradient image and the structured sparsity. Meanwhile, the Gaussian kernel is utilized as a weighted factor that can be adapted to the global distribution.

Low-Rank and Sparse Recovery of Human Gait Data.

Due to occlusion or detached markers, information can often be lost while capturing human motion with optical tracking systems. Based on three natural properties of human gait movement, this study presents two different approaches to recover corrupted motion data. These properties are used to define a reconstruction model combining low-rank matrix completion of the measured data with a group-sparsity prior on the marker trajectories mapped in the frequency domain. Unlike most existing approaches, the proposed methodology is fully unsupervised and does not need training data or kinematic information of the user. We evaluated our methods on four different gait datasets with various gap lengths and compared their performance with a state-of-the-art approach using principal component analysis (PCA). Our results showed recovering missing data more precisely, with a reduction of at least 2 mm in mean reconstruction error compared to the literature method. When a small number of marker trajectories is available, our findings showed a reduction of more than 14 mm for the mean reconstruction error compared to the literature approach.

Building a Compact Convolutional Neural Network for Embedded Intelligent Sensor Systems Using Group Sparsity and Knowledge Distillation.

As artificial intelligence (AI)- or deep-learning-based technologies become more popular,the main research interest in the field is not only on their accuracy, but also their efficiency, e.g., theability to give immediate results on the users' inputs. To achieve this, there have been many attemptsto embed deep learning technology on intelligent sensors. However, there are still many obstacles inembedding a deep network in sensors with limited resources. Most importantly, there is an apparenttrade-off between the complexity of a network and its processing time, and finding a structure witha better trade-off curve is vital for successful applications in intelligent sensors. In this paper, wepropose two strategies for designing a compact deep network that maintains the required level ofperformance even after minimizing the computations. The first strategy is to automatically determinethe number of parameters of a network by utilizing group sparsity and knowledge distillation (KD)in the training process. By doing so, KD can compensate for the possible losses in accuracy causedby enforcing sparsity. Nevertheless, a problem in applying the first strategy is the unclarity indetermining the balance between the accuracy improvement due to KD and the parameter reductionby sparse regularization. To handle this balancing problem, we propose a second strategy: a feedbackcontrol mechanism based on the proportional control theory. The feedback control logic determinesthe amount of emphasis to be put on network sparsity during training and is controlled based onthe comparative accuracy losses of the teacher and student models in the training. A surprising facthere is that this control scheme not only determines an appropriate trade-off point, but also improvesthe trade-off curve itself. The results of experiments on CIFAR-10, CIFAR-100, and ImageNet32 X 32datasets show that the proposed method is effective in building a compact network while preventingperformance degradation due to sparsity regularization much better than other baselines.

Chained regularization for identifying brain patterns specific to HIV infection.

Human Immunodeficiency Virus (HIV) infection continues to have major adverse public health and clinical consequences despite the effectiveness of combination Antiretroviral Therapy (cART) in reducing HIV viral load and improving immune function. As successfully treated individuals with HIV infection age, their cognition declines faster than reported for normal aging. This phenomenon underlines the importance of improving long-term care, which requires a better understanding of the impact of HIV on the brain. In this paper, automated identification of patients and brain regions affected by HIV infection are modeled as a classification problem, whose solution is determined in two steps within our proposed Chained-Regularization framework. The first step focuses on selecting the HIV pattern (i.e., the most informative constellation of brain region measurements for distinguishing HIV infected subjects from healthy controls) by constraining the search for the optimal parameter setting of the classifier via group sparsity (ℓ2,1-norm). The second step improves classification accuracy by constraining the parameterization with respect to the selected measurements and the Euclidean regularization (ℓ2-norm). When applied to the cortical and subcortical structural Magnetic Resonance Images (MRI) measurements of 65 controls and 65 HIV infected individuals, this approach is more accurate in distinguishing the two cohorts than more common models. Finally, the brain regions of the identified HIV pattern concur with the HIV literature that uses traditional group analysis models.

Group Sparse Precoding for Cloud-RAN with Multiple User Antennas.

Cloud radio access network (C-RAN) has become a promising network architecture to support the massive data traffic in the next generation cellular networks. In a C-RAN, a massive number of low-cost remote antenna ports (RAPs) are connected to a single baseband unit (BBU) pool via high-speed low-latency fronthaul links, which enables efficient resource allocation and interference management. As the RAPs are geographically distributed, group sparse beamforming schemes attract extensive studies, where a subset of RAPs is assigned to be active and a high spectral efficiency can be achieved. However, most studies assume that each user is equipped with a single antenna. How to design the group sparse precoder for the multiple antenna users remains little understood, as it requires the joint optimization of the mutual coupling transmit and receive beamformers. This paper formulates an optimal joint RAP selection and precoding design problem in a C-RAN with multiple antennas at each user. Specifically, we assume a fixed transmit power constraint for each RAP, and investigate the optimal tradeoff between the sum rate and the number of active RAPs. Motivated by the compressive sensing theory, this paper formulates the group sparse precoding problem by inducing the ℓ 0 -norm as a penalty and then uses the reweighted ℓ 1 heuristic to find a solution. By adopting the idea of block diagonalization precoding, the problem can be formulated as a convex optimization, and an efficient algorithm is proposed based on its Lagrangian dual. Simulation results verify that our proposed algorithm can achieve almost the same sum rate as that obtained from an exhaustive search.

Sparse meta-analysis with high-dimensional data.

Meta-analysis plays an important role in summarizing and synthesizing scientific evidence derived from multiple studies. With high-dimensional data, the incorporation of variable selection into meta-analysis improves model interpretation and prediction. Existing variable selection methods require direct access to raw data, which may not be available in practical situations. We propose a new approach, sparse meta-analysis (SMA), in which variable selection for meta-analysis is based solely on summary statistics and the effect sizes of each covariate are allowed to vary among studies. We show that the SMA enjoys the oracle property if the estimated covariance matrix of the parameter estimators from each study is available. We also show that our approach achieves selection consistency and estimation consistency even when summary statistics include only the variance estimators or no variance/covariance information at all. Simulation studies and applications to high-throughput genomics studies demonstrate the usefulness of our approach.

Manifold regularized multitask feature learning for multimodality disease classification.

Multimodality based methods have shown great advantages in classification of Alzheimer's disease (AD) and its prodromal stage, that is, mild cognitive impairment (MCI). Recently, multitask feature selection methods are typically used for joint selection of common features across multiple modalities. However, one disadvantage of existing multimodality based methods is that they ignore the useful data distribution information in each modality, which is essential for subsequent classification. Accordingly, in this paper we propose a manifold regularized multitask feature learning method to preserve both the intrinsic relatedness among multiple modalities of data and the data distribution information in each modality. Specifically, we denote the feature learning on each modality as a single task, and use group-sparsity regularizer to capture the intrinsic relatedness among multiple tasks (i.e., modalities) and jointly select the common features from multiple tasks. Furthermore, we introduce a new manifold-based Laplacian regularizer to preserve the data distribution information from each task. Finally, we use the multikernel support vector machine method to fuse multimodality data for eventual classification. Conversely, we also extend our method to the semisupervised setting, where only partial data are labeled. We evaluate our method using the baseline magnetic resonance imaging (MRI), fluorodeoxyglucose positron emission tomography (FDG-PET), and cerebrospinal fluid (CSF) data of subjects from AD neuroimaging initiative database. The experimental results demonstrate that our proposed method can not only achieve improved classification performance, but also help to discover the disease-related brain regions useful for disease diagnosis.

Correlated spectroscopic imaging of calf muscle in three spatial dimensions using group sparse reconstruction of undersampled single and multichannel data.

PURPOSE: To implement a 5D (three spatial + two spectral) correlated spectroscopic imaging sequence for application to human calf. THEORY AND METHODS: Nonuniform sampling was applied across the two phase encoded dimensions and the indirect spectral dimension of an echo planar-correlated spectroscopic imaging sequence. Reconstruction was applied that minimized the group sparse mixed ℓ2,1-norm of the data. Multichannel data were compressed using a sensitivity map-based approach with a spatially dependent transform matrix and utilized the self-sparsity of the individual coil images to simplify the reconstruction. RESULTS: Single channel data with 8× and 16× undersampling are shown in the calf of a diabetic patient. A 15-channel scan with 12× undersampling of a healthy volunteer was reconstructed using 5 virtual channels and compared to a fully sampled single slice scan. Group sparse reconstruction faithfully reconstructs the lipid cross peaks much better than ℓ1 minimization. CONCLUSION: COSY spectra can be acquired over a 3D spatial volume with scan time under 15 min using echo planar readout with highly undersampled data and group sparse reconstruction.

Group sparse-based Taylor expansion method for liver pharmacokinetic parameters imaging of dynamic fluorescence molecular tomography.

Objective.Pharmacokinetic parametric images obtained through dynamic fluorescence molecular tomography (DFMT) has ability of capturing dynamic changes in fluorescence concentration, thereby providing three-dimensional metabolic information for applications in biological research and drug development. However, data processing of DFMT is time-consuming, involves a vast amount of data, and the problem itself is ill-posed, which significantly limits the application of pharmacokinetic parametric images reconstruction. In this study, group sparse-based Taylor expansion method is proposed to address these problems.Approach.Firstly, Taylor expansion framework is introduced to reduce time and computational cost. Secondly, group sparsity based on structural prior is introduced to improve reconstruction accuracy. Thirdly, alternating iterative solution based on accelerated gradient descent algorithm is introduced to solve the problem.Main results.Numerical simulation andin vivoexperimental results demonstrate that, in comparison to existing methods, the proposed approach significantly enhances reconstruction speed without a degradation of quality, particularly when confronted with background fluorescence interference from other organs.Significance.Our research greatly reduces time and computational cost, providing strong support for real-time monitoring of liver metabolism.

Sparse-view CT reconstruction based on group-based sparse representation using weighted guided image filtering.

OBJECTIVES: In the past, guided image filtering (GIF)-based methods often utilized total variation (TV)-based methods to reconstruct guidance images. And they failed to reconstruct the intricate details of complex clinical images accurately. To address these problems, we propose a new sparse-view CT reconstruction method based on group-based sparse representation using weighted guided image filtering. METHODS: In each iteration of the proposed algorithm, the result constrained by the group-based sparse representation (GSR) is used as the guidance image. Then, the weighted guided image filtering (WGIF) was used to transfer the important features from the guidance image to the reconstruction of the SART method. RESULTS: Three representative slices were tested under 64 projection views, and the proposed method yielded the best visual effect. For the shoulder case, the PSNR can achieve 48.82, which is far superior to other methods. CONCLUSIONS: The experimental results demonstrate that our method is more effective in preserving structures, suppressing noise, and reducing artifacts compared to other methods.

Beam angle optimization for proton therapy via group-sparsity based angle generation method.

BACKGROUND: In treatment planning, beam angle optimization (BAO) refers to the selection of a subset with a given number of beam angles from all available angles that provides the best plan quality. BAO is a NP-hard combinatorial problem. Although exhaustive search (ES) can exactly solve BAO by exploring all possible combinations, ES is very time-consuming and practically infeasible. PURPOSE: To the best of our knowledge, (1) no optimization method has been demonstrated that can provide the exact solution to BAO, and (2) no study has validated an optimization method for solving BAO by benchmarking with the optimal BAO solution (e.g., via ES), both of which will be addressed by this work. METHODS: This work considers BAO for proton therapy, for example, the selection of 2-4 beam angles for IMPT. The optimal BAO solution is obtained via ES and serves as the ground truth. A new BAO algorithm, namely angle generation (AG) method, is proposed, and demonstrated to provide nearly-exact solutions for BAO in reference to the ES solution. AG iteratively optimizes the angular set via group-sparsity (GS) regularization, until the planning objective does not decrease further. RESULTS: Since GS alone can also solve BAO, AG was validated and compared with GS for 2-angle brain, 3-angle lung, and 4-angle brain cases, in reference to the optimal BAO solutions obtained by ES: the AG solution had the rank (1/276, 1/2024, 4/10 626), while the GS solution had the rank (42/276, 279/2024, 4328/10 626). CONCLUSIONS: A new BAO algorithm called AG is proposed and shown to provide substantially improved accuracy for BAO from current methods with nearly-exact solutions to BAO, in reference to the ground truth of optimal BAO solution via ES.

Analytical HDR prostate brachytherapy planning with automatic catheter and isotope selection.

BACKGROUND: High dose rate (HDR) brachytherapy is commonly used to treat prostate cancer. Existing HDR planning systems solve the dwell time problem for predetermined catheters and a single energy source. PURPOSE: Additional degrees of freedom can be obtained by relaxing the catheters' pre-designation and introducing more source types, and may have a dosimetric benefit, particularly in improving conformality to spare the urethra. This study presents a novel analytical approach to solving the corresponding HDR planning problem. METHODS: The catheter and dual-energy source selection problem was formulated as a constrained optimization problem with a non-convex group sparsity regularization. The optimization problem was solved using the fast-iterative shrinkage-thresholding algorithm (FISTA). Two isotopes were considered. The dose rates for the HDR 4140 Ytterbium (Yb-169) source and the Elekta Iridium (Ir-192) HDR Flexisource were modeled according to the TG-43U1 formalism and benchmarked accordingly. Twenty-two retrospective HDR prostate brachytherapy patients treated with Ir-192 were considered. An Ir-192 only (IRO), Yb-169 only (YBO), and dual-source (DS) plan with optimized catheter location was created for each patient with N catheters, where N is the number of catheters used in the clinically delivered plans. The DS plans jointly optimized Yb-169 and Ir-192 dwell times. All plans and the clinical plans were normalized to deliver a 15 Gy prescription (Rx) dose to 95% of the clinical treatment volume (CTV) and evaluated for the CTV D90%, V150%, and V200%, urethra D0.1cc and D1cc, bladder V75%, and rectum V75%. Dose-volume histograms (DVHs) were generated for each structure. RESULTS: The DS plans ubiquitously selected Ir-192 as the only treatment source. IRO outperformed YBO in organ at risk (OARs) OAR sparing, reducing the urethra D0.1cc and D1cc by 0.98% ( p = 2.22 ∗ 10 - 9 $p\ = \ 2.22*{10^{ - 9}}$ ) and 1.09% ( p = 1.22 ∗ 10 - 10 $p\ = \ 1.22*{10^{ - 10}}$ ) of the Rx dose, respectively, and reducing the bladder and rectum V75% by 0.09 ( p = 0.0023 $p\ = \ 0.0023$ ) and 0.13 cubic centimeters (cc) ( p = 0.033 $p\ = \ 0.033$ ), respectively. The YBO plans delivered a more homogenous dose to the CTV, with a smaller V150% and V200% by 3.20 ( p = 4.67 ∗ 10 - 10 $p\ = \ 4.67*{10^{ - 10}}$ ) and 1.91 cc ( p = 5.79 ∗ 10 - 10 $p\ = \ 5.79*{10^{ - 10}}$ ), respectively, and a lower CTV D90% by 0.49% ( p = 0.0056 $p\ = \ 0.0056$ ) of the prescription dose. The IRO plans reduce the urethral D1cc by 2.82% ( p = 1.38 ∗ 10 - 4 $p\ = \ 1.38*{10^{ - 4}}$ ) of the Rx dose compared to the clinical plans, at the cost of increased bladder and rectal V75% by 0.57 ( p = 0.0022 $p\ = \ 0.0022$ ) and 0.21 cc ( p = 0.019 $p\ = \ 0.019$ ), respectively, and increased CTV V150% by a mean of 1.46 cc ( p = 0.010 $p\ = \ 0.010$ ) and CTV D90% by an average of 1.40% of the Rx dose ( p = 8.80 ∗ 10 - 8 $p\ = \ 8.80*{10^{ - 8}}$ ). While these differences are statistically significant, the clinical differences between the plans are minimal. CONCLUSIONS: The proposed analytical HDR planning algorithm integrates catheter and isotope selection with dwell time optimization for varying clinical goals, including urethra sparing. The planning method can guide HDR implants and identify promising isotopes for specific HDR clinical goals, such as target conformality or OAR sparing.

Natural image restoration based on multi-scale group sparsity residual constraints.

The Group Sparse Representation (GSR) model shows excellent potential in various image restoration tasks. In this study, we propose a novel Multi-Scale Group Sparse Residual Constraint Model (MS-GSRC) which can be applied to various inverse problems, including denoising, inpainting, and compressed sensing (CS). Our new method involves the following three steps: (1) finding similar patches with an overlapping scheme for the input degraded image using a multi-scale strategy, (2) performing a group sparse coding on these patches with low-rank constraints to get an initial representation vector, and (3) under the Bayesian maximum a posteriori (MAP) restoration framework, we adopt an alternating minimization scheme to solve the corresponding equation and reconstruct the target image finally. Simulation experiments demonstrate that our proposed model outperforms in terms of both objective image quality and subjective visual quality compared to several state-of-the-art methods.

Fast Terahertz Imaging Model Based on Group Sparsity and Nonlocal Self-Similarity.

In order to solve the problems of long-term image acquisition time and massive data processing in a terahertz time domain spectroscopy imaging system, a novel fast terahertz imaging model, combined with group sparsity and nonlocal self-similarity (GSNS), is proposed in this paper. In GSNS, the structure similarity and sparsity of image patches in both two-dimensional and three-dimensional space are utilized to obtain high-quality terahertz images. It has the advantages of detail clarity and edge preservation. Furthermore, to overcome the high computational costs of matrix inversion in traditional split Bregman iteration, an acceleration scheme based on conjugate gradient method is proposed to solve the terahertz imaging model more efficiently. Experiments results demonstrate that the proposed approach can lead to better terahertz image reconstruction performance at low sampling rates.

Sparse representation and dictionary learning model incorporating group sparsity and incoherence to extract abnormal brain regions associated with schizophrenia.

Schizophrenia is a complex mental illness, the mechanism of which is currently unclear. Using sparse representation and dictionary learning (SDL) model to analyze functional magnetic resonance imaging (fMRI) dataset of schizophrenia is currently a popular method for exploring the mechanism of the disease. The SDL method decomposed the fMRI data into a sparse coding matrix X and a dictionary matrix D. However, these traditional methods overlooked group structure information in X and the coherence between the atoms in D. To address this problem, we propose a new SDL model incorporating group sparsity and incoherence, namely GS2ISDL to detect abnormal brain regions. Specifically, GS2ISDL uses the group structure information that defined by AAL anatomical template from fMRI dataset as priori to achieve inter-group sparsity in X. At the same time, L 1 - norm is enforced on X to achieve intra-group sparsity. In addition, our algorithm also imposes incoherent constraint on the dictionary matrix D to reduce the coherence between the atoms in D, which can ensure the uniqueness of X and the discriminability of the atoms. To validate our proposed model GS2ISDL, we compared it with both IK-SVD and SDL algorithm for analyzing fMRI dataset collected by Mind Clinical Imaging Consortium (MCIC). The results show that the accuracy, sensitivity, recall and MCC values of GS2ISDL are 93.75%, 95.23%, 80.50% and 88.19%, respectively, which outperforms both IK-SVD and SDL. The ROIs extracted by GS2ISDL model (such as Precentral gyrus, Hippocampus and Caudate nucleus, etc.) are further verified by the literature review on schizophrenia studies, which have significant biological significance.