Sparse Density Estimation with Measurement Errors

This paper aims to estimate an unknown density of the data with measurement errors as a linear combination of functions from a dictionary. The main novelty is the proposal and investigation of the corrected sparse density estimator (CSDE). Inspired by the penalization approach, we propose the weighted Elastic-net penalized minimal ℓ2-distance method for sparse coefficients estimation, where the adaptive weights come from sharp concentration inequalities. The first-order conditions holding a high probability obtain the optimal weighted tuning parameters. Under local coherence or minimal eigenvalue assumptions, non-asymptotic oracle inequalities are derived. These theoretical results are transposed to obtain the support recovery with a high probability. Some numerical experiments for discrete and continuous distributions confirm the significant improvement obtained by our procedure when compared with other conventional approaches. Finally, the application is performed in a meteorology dataset. It shows that our method has potency and superiority in detecting multi-mode density shapes compared with other conventional approaches.

Pan-Sharpening for Spectral Details Preservation Via Convolutional Sparse Coding in Non-Subsampled Shearlet Space

The optical satellite sensors encounter certain constraints on producing high-resolution multispectral (HRMS) images. Pan-sharpening (PS) is a remote sensing image fusion technique, which is an effective mechanism to overcome the limitations of available imaging products. The prevalent issue in PS algorithms is the imbalance between spatial quality and spectral details preservation, thereby producing intensity variations in the fused image. In this paper, a PS method is proposed based on convolutional sparse coding (CSC) implemented in the non-subsampled shearlet transform (NSST) domain. The source images, panchromatic (PAN) and multispectral (MS) images, are decomposed using NSST. The resultant high-frequency bands are fused using adaptive weights determined from chaotic grey wolf optimization (CGWO) algorithm. The CSC-based model is employed to fuse the low-frequency bands. Further, an iterative filtering mechanism is developed to enhance the quality of fused image. Four datasets with different geographical content like urban area, vegetation, etc. and eight existing algorithms are used for evaluation of the proposed PS method. The comprehensive visual and quantitative results approve that the proposed method accomplishes considerable improvement in spatial and spectral details equivalence in the pan-sharpened image.

New adaptive lasso approaches for variable selection in automated pharmacovigilance signal detection

Background Adverse effects of drugs are often identified after market introduction. Post-marketing pharmacovigilance aims to detect them as early as possible and relies on spontaneous reporting systems collecting suspicious cases. Signal detection tools have been developed to mine these large databases and counts of reports are analysed with disproportionality methods. To address disproportionality method biases, recent methods apply to individual observations taking into account all exposures for the same patient. In particular, the logistic lasso provides an efficient variable selection framework, yet the choice of the regularization parameter is a challenging issue and the lasso variable selection may give inconsistent results. Methods We propose a new signal detection methodology based on the adaptive lasso. We derived two new adaptive weights from (i) a lasso regression using the Bayesian Information Criterion (BIC), and (ii) the class-imbalanced subsampling lasso (CISL), an extension of stability selection. The BIC is used in the adaptive lasso stage for variable selection. We performed an extensive simulation study and an application to real data, where we compared our methods to the existing adaptive lasso, and recent detection approaches based on lasso regression or propensity scores in high dimension. For both studies, we evaluate the methods in terms of false discoveries and sensitivity. Results In the simulations and the application, both proposed adaptive weights show equivalent or better performances than the other competitors, with an advantage for the CISL-based adaptive weights. CISL and lasso regression using BIC are solid alternatives. Conclusion Our proposed adaptive lasso is an appealing methodology for signal detection in pharmacovigilance. Although we cannot rely on test theory, our approaches show a low and stable False Discovery Rate in all simulation settings. All methods evaluated in this work are implemented in the adapt4pv R package.

Association Loss and Self-Discovery Cross-Camera Anchors Detection for Unsupervised Video-Based Person Re-Identification

With the continuous improvement and development of cameras network, surveillance video has become the data source of the column stream, which greatly promotes the development of cross-camera person re-identification (Re-ID). However, supervised learning requires a lot of effort to manually label cross-cameras pairwise training data, which is lack of scalability and practical in actual video surveillance because there is a lack of well-labeled pairs of positive and negative samples under each camera. For addressing these negative effects, we set judgment conditions by using the association ranking method to self-discover positive and negative track-lets pairs of anchors with none of the pairwise ID labels, thereby defining a triplet loss. In order to optimize association loss for learning effective discriminative feature, the triplet loss adds adaptive weights according to the degree of easy-hard samples to generate an Adaptive Weighted Conditional Triplet Loss. Besides, for increasing the accuracy of self-discovering cross-camera anchors independently, which means successfully mine mutually best-matched track-lets and merge them under cross-camera, we use the top-rank from the intra-camera ranking list as a self-matched query sample which can double verify the matched-degree between top-rank. And eventually, we establish a new Association Loss and Self-Discovery Learning (ALSL) model with a complete end-to-end manner. We use three standard datasets, PRID2011, iLIDS-VID and MARS, to train the model and the experimental results prove that ALSL rank-1 is better than some superior video-based unsupervised person Re-ID methods.

Patch-Wise Infrared and Visible Image Fusion Using Spatial Adaptive Weights

In infrared (IR) and visible image fusion, the significant information is extracted from each source image and integrated into a single image with comprehensive data. We observe that the salient regions in the infrared image contain targets of interests. Therefore, we enforce spatial adaptive weights derived from the infrared images. In this paper, a Generative Adversarial Network (GAN)-based fusion method is proposed for infrared and visible image fusion. Based on the end-to-end network structure with dual discriminators, a patch-wise discrimination is applied to reduce blurry artifact from the previous image-level approaches. A new loss function is also proposed to use constructed weight maps which direct the adversarial training of GAN in a manner such that the informative regions of the infrared images are preserved. Experiments are performed on the two datasets and ablation studies are also conducted. The qualitative and quantitative analysis shows that we achieve competitive results compared to the existing fusion methods.

Efficient and High Path Quality Autonomous Exploration and Trajectory Planning of UAV in an Unknown Environment

The ability of an autonomous Unmanned Aerial Vehicle (UAV) in an unknown environment is a prerequisite for its execution of complex tasks and is the main research direction in related fields. The autonomous navigation of UAVs in unknown environments requires solving the problem of autonomous exploration of the surrounding environment and path planning, which determines whether the drones can complete mission-based flights safely and efficiently. Existing UAV autonomous flight systems hardly perform well in terms of efficient exploration and flight trajectory quality. This paper establishes an integrated solution for autonomous exploration and path planning. In terms of autonomous exploration, frontier-based and sampling-based exploration strategies are integrated to achieve fast and effective exploration performance. In the study of path planning in complex environments, an advanced Rapidly Exploring Random Tree (RRT) algorithm combining the adaptive weights and dynamic step size is proposed, which effectively solves the problem of balancing flight time and trajectory quality. Then, this paper uses the Hermite difference polynomial to optimization the trajectory generated by the RRT algorithm. We named proposed UAV autonomous flight system as Frontier and Sampling-based Exploration and Advanced RRT Planner system (FSEPlanner). Simulation performs in both apartment and maze environment, and results show that the proposed FSEPlanner algorithm achieves greatly improved time consumption and path distances, and the smoothed path is more in line with the actual flight needs of a UAV.

An Improved Equilibrium Optimizer Algorithm and Its Application in LSTM Neural Network

An improved equilibrium optimizer (EO) algorithm is proposed in this paper to address premature and slow convergence. Firstly, a highly stochastic chaotic mechanism is adopted to initialize the population for range expansion. Secondly, the capability to conduct global search to jump out of local optima is enhanced by assigning adaptive weights and setting adaptive convergence factors. In addition 25 classical benchmark functions are used to validate the algorithm. As revealed by the analysis of the accuracy, speed, and stability of convergence, the IEO algorithm proposed in this paper significantly outperforms other meta-heuristic algorithms. In practice, the distribution is asymmetric because most logging data are unlabeled. Traditional classification models have difficulty in accurately predicting the location of oil layer. In this paper, the oil layers related to oil exploration are predicted using long short-term memory (LSTM) networks. Due to the large amount of data used, however, it is difficult to adjust the parameters. For this reason, an improved equilibrium optimizer algorithm (IEO) is applied to optimize the parameters of LSTM for improved performance, while the effective IEO-LSTM is applied for oil layer prediction. As indicated by the results, the proposed model outperforms the current popular optimization algorithms including particle swarm algorithm PSO and genetic algorithm GA in terms of accuracy, absolute error, root mean square error and mean absolute error.