No abstract

No abstract

An improved single image dehazing method based on dark channel prior and wavelet transform is proposed. This proposed method employs wavelet transform and guided lter instead of the soft matting procedure to estimate and re ne the depth map of haze images. Moreover, a contrast enhancement method based on just noticeable difference (JND) and quadratic function is adopted to enhance the contrast for the dehazed image, since the scene radiance is usually not as bright as the atmospheric light, and the dehazed image looks dim. The experimental results show that the proposed approach can effectively enhance the haze image and is well suitable for implementing on the surveillance and obstacle detection systems.

The matrix enhancement and matrix pencil (MEMP) plays important roles in modern signal processing applications. In this paper, MEMP is applied to attack the problem of two-dimensional sparse array synthesis. Firstly, the desired array radiation pattern, as the original pattern for approximating, is sampled to form an enhanced matrix. After performing the singular value decomposition (SVD) and discarding the insignificant singular values according to the prior approximate error, the minimum number of elements can be obtained. Secondly, in order to obtain the eigenvalues, the generalized eigen-decomposition is employed on the approximate matrix, which is the optimal low-rank approximation of the enhanced matrix corresponding to sparse planar array, and then the ESPRIT algorithm is utilized to pair the eigenvalues related to each dimension of the planar array. Finally, element positions and excitations of the sparse planar array are calculated according to the correct pairing of eigenvalues. Simulation results are presented to illustrate the effectiveness of the proposed approach.

The model of public key encryption with keyword search (PEKS) proposed by Boneh et al. enables one to search encrypted keywords without revealing any information on the data. Baek et al. proposed an enhanced model called secure channel-free PEKS (SCF-PEKS) to removes the costly secure channel. However, most of the presented SCF-PEKS schemes were proved secure in the random oracle model. In 2009, Fang et al. presented a SCF-PEKS scheme without random oracles.But the scheme requires a strong and complicated assumption. In this paper, we propose a SCF-PEKS scheme that is under simple assumption in the standard model.

No abstract

This study proposes a target detection approach based on the target existence probability in complex scenes of a synthetic aperture radar image. Superpixels are the basic unit throughout the approach and are labelled into each classified scene by a texture feature. The original and predicted saliency depth values for each scene are derived through self-information of all the labelled superpixels in each scene. Thereafter, the target existence probability is estimated based on the comparison of two saliency depth values. Lastly, an improved visual attention algorithm, in which the scenes of the saliency map are endowed with different weights related to the existence probabilities, derives the target detection result. This algorithm enhances the attention for the scene that contains the target. Hence, the proposed approach is self-adapting for complex scenes and the algorithm is substantially suitable for different detection missions as well (e.g. vehicle, ship or aircraft detection in the related scenes of road, harbour or airport, respectively). Experimental results on various data show the effectiveness of the proposed method.

To advance the calculation performance of the battle royale optimization algorithm (BRO), a hybrid improved BRO algorithm (HBC) is proposed in this paper. The level mechanism of the chicken swarm optimization algorithm (CSO) is integrated into the BRO algorithm to divide all into elite players and ordinary players, and the level relationship of different players is established. Then, an elite player update method of random exploring and directional update in a small range is proposed to improve the development ability. The update method of ordinary players improved, the update mechanism of elite random guidance is introduced to make full use of the excellent location information in the population. The performance verification experiment of the HBC algorithm is carried out on 20 benchmark functions and a practical project. Comparing with several other algorithms, the computational performance of the HBC algorithm is the best. Furthermore, the HBC algorithm is applied to solve the inverse kinematics of the 7R 6DOF robot. The experimental results show that the HBC algorithm effectively improves the average convergence accuracy and reduces the running time, compared with the BRO algorithm. This fully shows that the HBC algorithm is more competitive in stability, calculation accuracy, and speed.