Gabor Dictionary of Sparse Image Patches Selected in Prior Boundaries for 3D Liver Segmentation in CT Images

The gray contrast between the liver and other soft tissues is low, and the boundary is not obvious. As a result, it is still a challenging task to accurately segment the liver from CT images. In recent years, methods of machine learning have become a research hotspot in the field of medical image segmentation because they can effectively use the “gold standard” personalized features of the liver from different data. However, machine learning usually requires a large number of data samples to train the model and improve the accuracy of medical image segmentation. This paper proposed a method for liver segmentation based on the Gabor dictionary of sparse image blocks with prior boundaries. This method reduced the number of samples by selecting the test sample set within the initial boundary area of the liver. The Gabor feature was extracted and the query dictionary was created, and the sparse coefficient was calculated to obtain the boundary information of the liver. By optimizing the reconstruction error and filling holes, a smooth liver boundary was obtained. The proposed method was tested on the MICCAI 2007 dataset and ISBI2017 dataset, and five measures were used to evaluate the results. The proposed method was compared with methods for liver segmentation proposed in recent years. The experimental results show that this method can improve the accuracy of liver segmentation and effectively repair the discontinuity and local overlap of segmentation results.

Fast Matching Pursuit with Multi-Gabor Dictionaries

Finding the best K -sparse approximation of a signal in a redundant dictionary is an NP-hard problem. Suboptimal greedy matching pursuit algorithms are generally used for this task. In this work, we present an acceleration technique and an implementation of the matching pursuit algorithm acting on a multi-Gabor dictionary, i.e., a concatenation of several Gabor-type time-frequency dictionaries, each of which consists of translations and modulations of a possibly different window and time and frequency shift parameters. The technique is based on pre-computing and thresholding inner products between atoms and on updating the residual directly in the coefficient domain, i.e., without the round-trip to the signal domain. Since the proposed acceleration technique involves an approximate update step, we provide theoretical and experimental results illustrating the convergence of the resulting algorithm. The implementation is written in C (compatible with C99 and C++11), and we also provide Matlab and GNU Octave interfaces. For some settings, the implementation is up to 70 times faster than the standard Matching Pursuit Toolkit.

Guided-wave signal processing by the sparse Bayesian learning approach employing Gabor pulse model

Guided waves have been used for structural health monitoring to detect damage or defects in structures. However, guided wave signals often involve multiple modes and noise. Extracting meaningful damage information from the received guided wave signal becomes very challenging, especially when some of the modes overlap. The aim of this study is to develop an effective way to deal with noisy guided-wave signals for damage detection as well as for de-noising. To achieve this goal, a robust sparse Bayesian learning algorithm is adopted. One of the many merits of this technique is its good performance against noise. First, a Gabor dictionary is designed based on the information of the noisy signal. Each atom of this dictionary is a modulated Gaussian pulse. Then the robust sparse Bayesian learning technique is used to efficiently decompose the guided wave signal. After signal decomposition, a two-step matching scheme is proposed to extract meaningful waveforms for damage detection and localization. Results from numerical simulations and experiments on isotropic aluminum plate structures are presented to verify the effectiveness of the proposed approach in mode identification and signal de-noising for damage detection.

Application of Gabor Dictionary and SL0 Norm in Disguise Face Recognition

A fast sparse representation face recognition algorithm based on Gabor dictionary and SL0 norm is proposed in this paper. The Gabor filters, which could effectively extract local directional features of the image at multiple scales, are less sensitive to variations of illumination, expression and camouflage. SL0 algorithm, with the advantages of calculation speed，require fewer measurement values by continuously differentiable function approximation L0 norm and reconstructed sparse signal by minimizing the approximate L0 norm. The algorithm obtain the local feature face by extracting the Gabor face feature, reduce the dimensions by principal component analysis, fast sparse classify by the SL0 norm. Under camouflage condition, The algorithm block the Gabor facial feature and improve the speed of formation of the Gabor dictionary. The experimental results on AR face database show that the proposed algorithm can improve recognition speed and recognition rate to some extent and can generalize well to the face recognition, even with a few training image per class.