Vertebra segmentation from biplanar whole-spine radiographs is highly demanded in the quantitative assessment of scoliosis and resultant sagittal deformities. However, vertebra segmentation is challenging due to the low contrast, blended boundaries, and superimposition of many layers, especially in the sagittal plane. To alleviate these problems, we propose a lightweight pyramid attention quick refinement network (LPAQR-Net) for efficient and accurate vertebra segmentation from biplanar whole-spine radiographs.
 
  The LPAQR-Net consists of three components (1) a lightweight backbone network (LB-Net) to prune network parameters and memory footprints, (2) a series of global attention refinement (GAR) to selectively reuse low-level features to facilitate the feature refinement, and (3) an attention-based atrous spatial pyramid pooling (A-ASPP) to extract weighted pyramid contexts to improve the segmentation of blurred vertebrae. A multi-class training strategy is employed to alleviate the over-segmentation of ar accurate vertebra localization to improve the segmentation of blurred vertebrae. Significant The method provides efficient and accurate vertebra segmentation from frontal and lateral whole-spine radiographs in which can help clinicians with a fast and reproducible evaluation of spinal deformity.This paper proposes a two-way multi-ringed forest (TMR-Forest) to estimating the malignancy of the pulmonary nodules for false positive reduction (FPR). Based on our previous work of deep decision framework, named MR-Forest, we generate a growing path mode on predefined pseudo-timeline of L time slots to build pseudo-spatiotemporal features. It synchronously works with FPR based on MR-Forest to help predict the labels from a dynamic perspective. Concretely, Mask R-CNN is first used to recommend the bounding boxes of ROIs and classify their pathological features.  https://www.selleckchem.com/products/go-6983.html  Afterward, hierarchical attribute matching is introduced to obtain the input ROIs' attribute layouts and select the candidates for their growing path generation. The selected ROIs can replace the fixed-sized ROIs' fitting results at different time slots for data augmentation. A two-stage counterfactual path elimination is used to screen out the input paths of the cascade forest. Finally, a simple label selection strategy is executed to output the predicted label to point out the input nodule's malignancy. On 1034 scans of the merged dataset, the framework can report more accurate malignancy labels to achieve a better CPM score of 0.912, which exceeds those of MR-Forest and 3DDCNNs about 2.8% and 4.7%, respectively.Learning the gene coexpression pattern is a central challenge for high-dimensional gene expression analysis. Recently, sparse singular value decomposition (SVD) has been used to achieve this goal. However, this model ignores the structural information between variables (e.g., a gene network). The typical graph-regularized penalty can be used to incorporate such prior graph information to achieve more accurate discovery and better interpretability. However, the existing approach fails to consider the opposite effect of variables with negative correlations. In this article, we propose a novel sparse graph-regularized SVD model with absolute operator (AGSVD) for high-dimensional gene expression pattern discovery. The key of AGSVD is to impose a novel graph-regularized penalty (|u|TL|u|). However, such a penalty is a nonconvex and nonsmooth function, so it brings new challenges to model solving. We show that the nonconvex problem can be efficiently handled in a convex fashion by adopting an alternating optimization strategy. The simulation results on synthetic data show that our method is more effective than the existing SVD-based ones. In addition, the results on several real gene expression data sets show that the proposed methods can discover more biologically interpretable expression patterns by incorporating the prior gene network.Deep convolutional neural networks (CNNs) have demonstrated promising performance on image classification tasks, but the manual design process becomes more and more complex due to the fast depth growth and the increasingly complex topologies of CNNs. As a result, neural architecture search (NAS) has emerged to automatically design CNNs that outperform handcrafted counterparts. However, the computational cost is immense, e.g., 22,400 GPU-days and 2000 GPU-days for two outstanding NAS works named NAS and NASNet, respectively, which motivates this work. A new effective and efficient surrogate-assisted particle swarm optimization (PSO) algorithm is proposed to automatically evolve CNNs. This is achieved by proposing a novel surrogate model, a new method of creating a surrogate data set, and a new encoding strategy to encode variable-length blocks of CNNs, all of which are integrated into a PSO algorithm to form the proposed method. The proposed method shows its effectiveness by achieving the competitive error rates of 3.49% on the CIFAR-10 data set, 18.49% on the CIFAR-100 data set, and 1.82% on the SVHN data set. The CNN blocks are efficiently learned by the proposed method from CIFAR-10 within 3 GPU-days due to the acceleration achieved by the surrogate model and the surrogate data set to avoid the training of 80.1% of CNN blocks represented by the particles. Without any further search, the evolved blocks from CIFAR-10 can be successfully transferred to CIFAR-100, SVHN, and ImageNet, which exhibits the transferability of the block learned by the proposed method.This article first investigates the issue on dynamic learning from adaptive neural network (NN) control of discrete-time strict-feedback nonlinear systems. To verify the exponential convergence of estimated NN weights, an extended stability result is presented for a class of discrete-time linear time-varying systems with time delays. Subsequently, by combining the n-step-ahead predictor technology and backstepping, an adaptive NN controller is constructed, which integrates the novel weight updating laws with time delays and without the σ modification. After ensuring the convergence of system output to a recurrent reference signal, the radial basis function (RBF) NN is verified to satisfy the partial persistent excitation condition. By the combination of the extended stability result, the estimated NN weights can be verified to exponentially converge to their ideal values. The convergent weight sequences are comprehensively represented and stored by constructing some elegant learning rules with some novel sequences and the mod function.