A Hierarchical Sparse Discriminant Autoencoder for Bearing Fault Diagnosis

Although some traditional autoencoders and their extensions have been widely used in the research of intelligent fault diagnosis of rotating parts, their feature extraction capabilities are limited without label information. In response to this problem, this research proposes a hierarchical sparse discriminant autoencoder (HSDAE) method for fault diagnosis of rotating components, which is a new semi-supervised autoencoder structure. By considering the sparsity of autoencoders, a hierarchical sparsity strategy was proposed to improve the stacked sparsity autoencoders, and the particle swarm optimization algorithm was used to obtain the optimal sparsity parameters to improve network performance. In order to enhance the classification of the autoencoder, a class aggregation and class separability strategy was used, which is an additional discriminative distance that was added as a penalty term in the loss function to enhance the feature extraction ability of the network. Finally, the reliability of the proposed method was verified on the bearing data set of Case Western Reserve University and the bearing data set of the laboratory test platform. The results of comparison with other methods show that the HSDAE method can enhance the feature extraction ability of the network and has reliability and stability for different data sets.

A New Active Contour Medical Image Segmentation Method Based on Fractional Varying-Order Differential

Image segmentation technology is dedicated to the segmentation of intensity inhomogeneous at present. In this paper, we propose a new method that incorporates fractional varying-order differential and local fitting energy to construct a new variational level set active contour model. The energy functions in this paper mainly include three parts: the local term, the regular term and the penalty term. The local term combined with fractional varying-order differential can obtain more details of the image. The regular term is used to regularize the image contour length. The penalty term is used to keep the evolution curve smooth. True positive (TP) rate, false positive (FP) rate, precision (P) rate, Jaccard similarity coefficient (JSC), and Dice similarity coefficient (DSC) are employed as the comparative measures for the segmentation results. Experimental results for both synthetic and real images show that our method has more accurate segmentation results than other models, and it is robust to intensity inhomogeneous or noises.

Provable randomized rounding for minimum-similarity diversification

When searching for information in a data collection, we are often interested not only in finding relevant items, but also in assembling a diverse set, so as to explore different concepts that are present in the data. This problem has been researched extensively. However, finding a set of items with minimal pairwise similarities can be computationally challenging, and most existing works striving for quality guarantees assume that item relatedness is measured by a distance function. Given the widespread use of similarity functions in many domains, we believe this to be an important gap in the literature. In this paper we study the problem of finding a diverse set of items, when item relatedness is measured by a similarity function. We formulate the diversification task using a flexible, broadly applicable minimization objective, consisting of the sum of pairwise similarities of the selected items and a relevance penalty term. To find good solutions we adopt a randomized rounding strategy, which is challenging to analyze because of the cardinality constraint present in our formulation. Even though this obstacle can be overcome using dependent rounding, we show that it is possible to obtain provably good solutions using an independent approach, which is faster, simpler to implement and completely parallelizable. Our analysis relies on a novel bound for the ratio of Poisson-Binomial densities, which is of independent interest and has potential implications for other combinatorial-optimization problems. We leverage this result to design an efficient randomized algorithm that provides a lower-order additive approximation guarantee. We validate our method using several benchmark datasets, and show that it consistently outperforms the greedy approaches that are commonly used in the literature.

Fast Adaptive Temperature-Based Re-Optimization Strategies for On-Line Hot Spot Suppression during Locoregional Hyperthermia

Background: Experience-based adjustments in phase-amplitude settings are applied to suppress treatment limiting hot spots that occur during locoregional hyperthermia for pelvic tumors. Treatment planning could help to further optimize treatments. The aim of this research was to develop temperature-based re-optimization strategies and compare the predicted effectiveness with clinically applied protocol/experience-based steering. Methods: This study evaluated 22 hot spot suppressions in 16 cervical cancer patients (mean age 67 ± 13 year). As a first step, all potential hot spot locations were represented by a spherical region, with a user-specified diameter. For fast and robust calculations, the hot spot temperature was represented by a user-specified percentage of the voxels with the largest heating potential (HPP). Re-optimization maximized tumor T90, with constraints to suppress the hot spot and avoid any significant increase in other regions. Potential hot spot region diameter and HPP were varied and objective functions with and without penalty terms to prevent and minimize temperature increase at other potential hot spot locations were evaluated. Predicted effectiveness was compared with clinically applied steering results. Results: All strategies showed effective hot spot suppression, without affecting tumor temperatures, similar to clinical steering. To avoid the risk of inducing new hot spots, HPP should not exceed 10%. Adding a penalty term to the objective function to minimize the temperature increase at other potential hot spot locations was most effective. Re-optimization times were typically ~10 s. Conclusion: Fast on-line re-optimization to suppress treatment limiting hot spots seems feasible to match effectiveness of ~30 years clinical experience and will be further evaluated in a clinical setting.

Material-separating regularizer for multi-energy X-ray tomography

Dual-energy X-ray tomography is considered in a context where the target under imaging consists of two distinct materials. The materials are assumed to be possibly intertwined in space, but at any given location there is only one material present. Further, two X-ray energies are chosen so that there is a clear difference in the spectral dependence of the attenuation coefficients of the two materials. A novel regularizer is presented for the inverse problem of reconstructing separate tomographic images for the two materials. A combination of two things, (a) non-negativity constraint, and (b) penalty term containing the inner product between the two material images, promotes the presence of at most one material in a given pixel. A preconditioned interior point method is derived for the minimization of the regularization functional. Numerical tests with digital phantoms suggest that the new algorithm outperforms the baseline method, Joint Total Variation regularization, in terms of correctly material-characterized pixels. While the method is tested only in a two-dimensional setting with two materials and two energies, the approach readily generalizes to three dimensions and more materials. The number of materials just needs to match the number of energies used in imaging.

Handling Cellwise Outliers by Sparse Regression and Robust Covariance

We propose a data-analytic method for detecting cellwise outliers. Given a robust covariance matrix, outlying cells (entries) in a row are found by the cellFlagger technique which combines lasso regression with a stepwise application of constructed cutoff values. The penalty term of the lasso has a physical interpretation as the total distance that suspicious cells need to move in order to bring their row into the fold. For estimating a cellwise robust covariance matrix we construct a detection-imputation method which alternates between flagging outlying cells and updating the covariance matrix as in the EM algorithm. The proposed methods are illustrated by simulations and on real data about volatile organic compounds in children.

Structural and thermodynamic properties for the BaMn(Fe=V)F7 Fluoride glass system by using the Hybrid Reverse Monte Carlo simulation

The Hybrid Reverse Monte Carlo (HRMC) simulation has been widely used as a very useful method for displaying the pair partial distribution functions (PDFs) g(r) eliminating as soon as possible the artificial satellite peaks appear by the RMC simulation. The HRMC is an extension of the RMC algorithm, which introduces an energy penalty term (potential) in the acceptance criteria.The glass retains the structure presented by the liquid at the glass transition temperature Tg, and the thermodynamic properties are influenced by these structural modifications. We are interested in this study to apply the structural parameters g(r), obtained from HRMC simulation, to determine some structural and thermodynamic properties for the BaMn(Fe=V)F7 Fluoride glass.The calculated structural properties such as the running coordination number n(r) were in good agreement with coordination constraint. We suggest also that the structural parameters g(r) is a good tool to determine the thermodynamic properties as the energy of the system.

Maximal spaces for approximation rates in $$\ell ^1$$-regularization

We study Tikhonov regularization for possibly nonlinear inverse problems with weighted $$\ell ^1$$ ℓ 1 -penalization. The forward operator, mapping from a sequence space to an arbitrary Banach space, typically an $$L^2$$ L 2 -space, is assumed to satisfy a two-sided Lipschitz condition with respect to a weighted $$\ell ^2$$ ℓ 2 -norm and the norm of the image space. We show that in this setting approximation rates of arbitrarily high Hölder-type order in the regularization parameter can be achieved, and we characterize maximal subspaces of sequences on which these rates are attained. On these subspaces the method also converges with optimal rates in terms of the noise level with the discrepancy principle as parameter choice rule. Our analysis includes the case that the penalty term is not finite at the exact solution (’oversmoothing’). As a standard example we discuss wavelet regularization in Besov spaces $$B^r_{1,1}$$ B 1 , 1 r . In this setting we demonstrate in numerical simulations for a parameter identification problem in a differential equation that our theoretical results correctly predict improved rates of convergence for piecewise smooth unknown coefficients.

A New GAN-Based Approach to Data Augmentation and Image Segmentation for Crack Detection in Thermal Imaging Tests

As a popular nondestructive testing (NDT) technique, thermal imaging test demonstrates competitive performance in crack detection, especially for detecting subsurface cracks. In thermal imaging test, the temperature of the crack area is higher than that of the non-crack area during the NDT process. By extracting the features of the thermal image sequences, the temperature curve of each spatial point is employed for crack detection. Nevertheless, the quality of thermal images is influenced by the noises due to the complex thermal environment in NDT. In this paper, a modified generative adversarial network (GAN) is employed to improve the image segmentation performance. To improve the feature extraction ability and alleviate the influence of noises, a penalty term is put forward in the loss function of the conventional GAN. A data preprocessing method is developed where the principle component analysis algorithm is adopted for feature extraction. The data argumentation technique is utilized to guarantee the quantity of the training samples. To validate its effectiveness in thermal imaging NDT, the modified GAN is applied to detect the cracks on the eddy current pulsed thermography NDT dataset.