1,688 research outputs found
On the Enhancement of the Reconstruction Accuracy obtained with a Multi-Source/Multi-Illumination Inverse Scattering Technique
This paper explores the possibility of enhancing the available information content of scattered data by means of an innovative Multi-Source strategy. The approach exploits the scattering interactions between scatterer and probing source when the investigation domain is illuminated by different (in terms of radiation patterns) illuminations. The results of a set of representative numerical simulations are shown to point out the potentialities of the inversion strategy
A Reconstruction Procedure for Microwave Nondestructive Evaluation based on a Numerically Computed Green's Function
This paper describes a new microwave diagnostic tool for nondestructive evaluation. The approach, developed in the spatial domain, is based on the numerical computation of the inhomogeneous Green’s function in order to fully exploit all the available a-priori information of the domain under test. The heavy reduction of the computational complexity of the proposed procedure (with respect to standard procedures based on the free-space Green’s function) is also achieved by means of a customized hybrid-coded genetic algorithm. In order to assess the effectiveness of the method, the results of several simulations are presented and discussed
A Hybrid Approach for Modeling Stochastic Ray Propagation in Stratified Random Lattices
The present contribution deals with ray propagation in semi-innite percolation lattices consisting of a succession of uniform density layers. The problem of analytically evaluating the probability that a single ray penetrates up to a prescribed level before being reected back into the above empty half-plane is addressed. A hybrid approach, exploiting the complementarity of two mathematical models in dealing with uniform congurations, is presented and assessed through numerical ray-tracing-based experiments in order to show improvements upon previous predictions techniques. "The definitive version is available at www3.interscience.wiley.com
A Hybrid Approach Based on PSO and Hadamard Difference Sets for the Synthesis of Square Thinned Arrays
A hybrid approach for the synthesis of planar thinned antenna arrays is presented. The proposed solution exploits and combines the most attractive features of a particle swarm algorithm and those of a combinatorial method based on the noncyclic difference sets of Hadamard type. Numerical experiments validate the proposed solution, showing improvements with respect to previous results. (c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works
Detection, Location and Imaging of Multiple Scatterers by means of the Iterative Multiscaling Method
In this paper, a new version of the iterative multiscaling method (IMM) is proposed for reconstructing multiple scatterers in two-dimensional microwave imaging problems. The manuscript describes the new procedure evaluating the effectiveness of the IMM previously assessed for single object detection. Starting from inverse scattering integral equations, the problem is recast in a minimization one by defining iteratively (at each level of the scaling procedure) a suitable cost function allowing firstly a detection of the unknown objects, successively a location of the scatterers and finally a quantitative reconstruction of the scenario under test. Thanks to its properties, the approach allows an effective use of the information achievable from inverse scattering data. Morover, the adopted kind of expansion is able to deal with all possible multiresolution combinations in an easy and computationally inexpensive way. Selected numerical examples concerning dielectric as well as dissipative objects in noisy enviroments or starting from experimantally-acquired data are reported in order to confirm the usefulness of the introduced tool and of the effectiveness of the proposed procedure
Ant Colony Based Hybrid Approach for Optimal Compromise Sum-Difference Patterns Synthesis
Dealing with the synthesis of monopulse array antennas, many stochastic optimization algorithms have been used for the solution of the so-called optimal compromise problem between sum and difference patterns when sub-arrayed feed networks are considered. More recently, hybrid approaches, exploiting the convexity of the functional with respect to a sub-set of the unknowns (i.e., the sub-array excitation coefficients) have demonstrated their effectiveness. In this letter, an hybrid approach based on the Ant Colony Optimization (ACO) is proposed. At the first step, the ACO is used to define the sub-array membership of the array elements, while, at the second step, the sub-array weights are computed by solving a convex programming problem. The definitive version is available at www3.interscience.wiley.co
Percolation-Based Approaches For Ray-Optical Propagation in Inhomogeneous Random Distribution of Discrete Scatterers
We address the problem of optical ray propagation in an inhomogeneous halfďż˝]plane lattice, where each cell can be occupied according to a known oneďż˝]dimensional obstacles density distribution. A monochromatic plane wave impinges on the random grid with a known angle and undergoes specular reflections on the occupied cells. We present two different approaches for evaluating the propagation depth inside the lattice. The former is based on the theory of the Martingale random processes, while in the latter ray propagation is modelled in terms of a Markov chain. A numerical validation assesses the proposed solutions, while validation through experimental data shows that the percolation model, in spite of its simplicity, can be applied to model real propagation problems
An Improved Excitation Matching Method based on an Ant Colony Optimization for Suboptimal-Free Clustering in Sum-Difference Compromise Synthesis
Dealing with an excitation matching method, this paper presents a global optimization strategy for the optimal clustering in sum-difference compromise linear arrays. Starting from a combinatorial formulation of the problem at hand, the proposed technique is aimed at determining the sub-array configuration expressed as the optimal path inside a directed acyclic graph structure modelling the solution space. Towards this end, an ant colony metaheuristic is used to benefit of its hill-climbing properties in dealing with the non-convexity of the sub-arraying as well as in managing graph searches. A selected set of numerical experiments are reported to assess the efficiency and current limitations of the ant-based strategy also in comparison with previous local combinatorial search methods. (c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works
- …