scholarly journals Multiple-Antenna Emitters Identification Based on a Memoryless Power Amplifier Model

Sensors ◽  
2019 ◽  
Vol 19 (23) ◽  
pp. 5233 ◽  
Author(s):  
Jun Lu ◽  
Xiaodong Xu

Power amplifier (PA) nonlinearity is typically unique at the radio frequency (RF) front-end for particular emitters. It can play a crucial role in the application of specific emitter identification (SEI). In this paper, under the Multi-Input Multi-Output (MIMO) multipath communication scenario, two data-aided approaches are proposed to identify multi-antenna emitters using PA nonlinearity. Built upon a memoryless polynomial model, the first approach formulates a linear least square (LLS) problem and presents the closed-form solution of nonlinear coefficients in a MIMO system by means of singular value decomposition (SVD) operation. Another alternative approach estimates nonlinear coefficients of each individual PA through nonlinear least square (NLS) solved by the regularized Gauss–Newton iterative scheme. Moreover, there are some practical discussions of our proposed approaches about the mismatch of the order of PA model and the rank-deficient condition. Finally, the average misclassification rate is derived based on the minimum error probability (MEP) criterion, and the proposed approaches are validated to be effective through extensively numerical simulations.

Author(s):  
A. Stassopoulou ◽  
M. Petrou

We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we can obtain a correspondence between the two networks by deriving a closed-form solution so that the outputs of the two networks are similar in the least square error sense, not only when determining the discriminant function, but for the full range of their outputs. For this purpose we take into consideration the probability density functions of the independent variables of the problem when we compute the least square error approximation. Our methodoloy is demonstrated with the help of some real data concerning the problem of risk of desertification assessment for some burned forests in Attica, Greece where the parameters of the Bayesian network constructed for this task are successfully estimated given a neural network trained with a set of data.


2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Li Chen ◽  
Xiaotong Huang ◽  
Jing Tian

This paper presents a new efficient algorithm for image interpolation based on regularization theory. To render ahigh-resolution(HR) image from alow-resolution(LR) image, classical interpolation techniques estimate the missing pixels from the surrounding pixels based on a pixel-by-pixel basis. In contrast, the proposed approach formulates the interpolation problem into the optimization of a cost function. The proposed cost function consists of a data fidelity term and regularization functional. The closed-form solution to the optimization problem is derived using the framework of constrained least squares minimization, by incorporating Kronecker product andsingular value decomposition(SVD) to reduce the computational cost of the algorithm. The effect of regularization on the interpolation results is analyzed, and an adaptive strategy is proposed for selecting the regularization parameter. Experimental results show that the proposed approach is able to reconstruct high-fidelity HR images, while suppressing artifacts such as edge distortion and blurring, to produce superior interpolation results to that of conventional image interpolation techniques.


2013 ◽  
Vol 5 (3) ◽  
Author(s):  
Mili Shah

This paper constructs a separable closed-form solution to the robot-world/hand-eye calibration problem AX = YB. Qualifications and properties that determine the uniqueness of X and Y as well as error metrics that measure the accuracy of a given X and Y are given. The formulation of the solution involves the Kronecker product and the singular value decomposition. The method is compared with existing solutions on simulated data and real data. It is shown that the Kronecker method that is presented in this paper is a reliable and accurate method for solving the robot-world/hand-eye calibration problem.


Author(s):  
Yunwei Sun ◽  
Charles Carrigan ◽  
William Cassata ◽  
Yue Hao ◽  
Souheil Ezzedine ◽  
...  

AbstractIsotopic ratios of radioactive xenons sampled in the subsurface and atmosphere can be used to detect underground nuclear explosions (UNEs) and civilian nuclear reactors. Disparities in the half-lives of the radioactive decay chains are principally responsible for time-dependent concentrations of xenon isotopes. Contrasting timescales, combined with modern detection capabilities, make the xenon isotopic family a desirable surrogate for UNE detection. However, without including the physical details of post-detonation cavity changes that affect radioxenon evolution and subsurface transport, a UNE is treated as an idealized system that is both closed and well mixed for estimating xenon isotopic ratios and their correlations so that the spatially dependent behavior of xenon production, cavity leakage, and transport are overlooked. In this paper, we developed a multi-compartment model with radioactive decay and interactions between compartments. The model does not require the detailed domain geometry and parameterization that is normally needed by high-fidelity computer simulations, but can represent nuclide evolution within a compartment and migration among compartments under certain conditions. The closed-form solution to all nuclides in the series 131–136 is derived using analytical singular-value decomposition. The solution is further used to express xenon ratios as functions of time and compartment position.


Author(s):  
Abdurrahman Yilmaz ◽  
Hakan Temeltas

AbstractThe problem of matching point clouds is an efficient way of registration, which is significant for many research fields including computer vision, machine learning, and robotics. There may be linear or non-linear transformation between point clouds, but determining the affine relation is more challenging among linear cases. Various methods have been presented to overcome this problem in the literature and one of them is the affine variant of the iterative closest point (ICP) algorithm. However, traditional affine ICP variants are highly sensitive to effects such as noises, deformations, and outliers; the least-square metric is substituted with the correntropy criterion to increase the robustness of ICPs to such effects. Correntropy-based robust affine ICPs available in the literature use point-to-point metric to estimate transformation between point clouds. Conversely, in this study, a line/surface normal that examines point-to-curve or point-to-plane distances is employed together with the correntropy criterion for affine point cloud registration problems. First, the maximum correntropy criterion measure is built for line/surface normal conditions. Then, the closed-form solution that maximizes the similarity between point sets is achieved for 2D registration and extended for 3D registration. Finally, the application procedure of the developed robust affine ICP method is given and its registration performance is examined through extensive experiments on 2D and 3D point sets. The results achieved highlight that our method can align point clouds more robustly and precisely than the state-of-the-art methods in the literature, while the registration time of the process remains at reasonable levels.


2020 ◽  
Vol 9 (1) ◽  
pp. 187
Author(s):  
Narendra VG ◽  
Dasharathraj K Shetty

In this paper, we introduce an algorithm for the fitting of bounding rectangle to a closed region of cashew kernel in a given image. We propose an algorithm to automatically compute the coordinates of the vertices closed form solution. Which is based on coordinate geometry and uses the boundary points of regions. The algorithm also computes directions of major and minor axis using least-square approach to compute the orientation of the given cashew kernel. More promising results were obtained by extracting shape features of a cashew kernel, it is proved that these features may predominantly use to make the better distinction of cashew kernels of different grades. The intelligent model was designed using Artificial Neural Network (ANN). The model was trained and tested using Back-Propagation learning algorithm and obtained classification accuracy of 89.74%. 


Sign in / Sign up

Export Citation Format

Share Document