Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.astro.spbu.ru/DOP/A-PERC/perceptr.pdf Дата изменения: Fri Nov 19 12:11:49 2010 Дата индексирования: Mon Oct 1 21:48:04 2012 Кодировка: Поисковые слова: viking 2

Database of the optical prop erties of chaotically oriented fractal-like clusters of spherical particles
1
1

Tishkovets V.P., 1 Beletsky S.A, 2 Litvinov P.V.

Astronomical observatory of Kharkov University, Sumskaya str.,35, 61022, Kharkov, Ukraine. e-mail: sbelets@mail.ru. 2 Institute of Radio Astronomy of NASU, Chervonopraporna str.,4, 61002, Kharkov, Ukraine.

1

Intro duction

In many fields of science a remote sensing is very often the only way of scattering ob jects investigation. Commonly it is necessary to determine microphysical properties of scatterers (their size parameters, complex refractive indexes, form etc.) using characteristics of the incident and scattered radiation, which are known from the observations. The solution of this so-called "inverse scattering problem" is conjugated with solving the direct scattering problem, which input parameters are microphysical properties of scatterers whereas output parameters are characteristics of scattered radiation (scattering matrix). Fitting observed results with those obtained from direct problem, some conclusion about scatterer properties can be made. The complexity of the direct problem depends on such its input parameters as shape, size and composition of the scattering particles. Sometimes to reduce number of these parameters and simplify calculation procedures the model of regular shape particle (spherical, spheroidal particles etc.) is used. However, many scattering particles of natural and artificial origin are aggregates (clusters) of smaller particles (for instance, cometary and interplanetary dust [1]) and their shape seems to be fractal-like. The optical properties of such compound particles appreciably differ from those of isolated particles [2]. Calculation of scattered radiation characteristics for such fractal clusters is a time consuming procedure. Moreover for interpretation of remote sensing results such calculation must be carried out in wide range of the size parameters, complex refractive indexes and parameters, characterizing cluster structure. Therefore for solving inverse scattering problem a detailed database of radiation scattering properties of fractal cluster is needed. To generate such database we use artificial neural network. Properly trained for this purpose artificial neural network allows determining desired data from the range of those were used for training.

2

Mo del of dust particles

The most powerful and widely used methods for calculations of scattering matrix of fractal cluster are based on the DDA approximation and the theory of light scattering by cluster of spherical particles [2-4]. The last one was used to obtain the massive of data for neural network training. At present time the procedure of calculation of scattering matrix is well developed both for oriented clusters of spherical particles and for chaotically oriented one [4]. But the observed dependencies of scattered light polarization by cometary and interplanetary dust, in particular, orientation of plane of polarization with respect to the scattering plane, allows one to expect that dust particles are chaotically oriented. More over to reduce number of input parameters the cluster constituent spheres are usually chosen identical to each other. Thus for model of chaotically oriented cluster of identical spherical particles the direct scattering problem have such input parameters: the wave parameter of constituent spheres x = 2 a(a is sphere radius, is the wavelength of incident radiation), real and imaginary part of complex refractive index m, number of particles in the cluster (N ) and the parameters describing the cluster structure. Structure of fractal-like cluster consisting of a great number of particles can be characterized by two parameters only [5]. These are fractal dimension D and a prefactor constant .


3

The multi-layered p erceptron

One of the widely used models of neural network is the multi-layered perceptron [6]. The network has layers of input and output elements called neurons. Several "hidden" layers can be located between these layers. Each neuron in a layer is connected to the neurons in the adjacent layer with a modifiable connection, there are no connections between neurons of the same layer. An input vector is put on the input layer, pass through the hidden layers, and arrives at the output layer. Corresponding output vector is determined by calculation of neuron activity level for each layer using already known values of neuron activity of the previous layers. For perceptron training the algorithm of back error propagation is used, which consist in the following. Small random values are assigned to connections before the start of training. Training is an iterative process. Each of iterations consists of two phases. An input vector is putted to the network during the first phase (input elements are set in the proper condition). Then the signal passes through the network and generates an output vector. Received output vector is compared to the required one. If they coincide, training of the perceptron for this input vector is not carried out. In the other case, difference between the actual and required output values is calculated and sent consecutively from the output layer to the input one. According to this information, modification of connections is being fulfilled using the generalized delta-rule [6]. Weight modification is applied for each input-output pair. Training is being continued until the error decrease to the given value. Perceptron is trained on the limited set of the input-output parameters. In the process of training it builds a surface in the space of these parameters and defines memorized a continuous function, associating the input and output parameters.

4

Database of optical cluster prop erties on the basis of the p erceptron

Perceptron structure, on the basis of which the database is build, is defined by number of input and output parameters and a required accuracy. The number of input neurons corresponds to the number of parameters defining of the cluster properties: x, Re(m), I m(m), D, , N . The output perceptron data are the expansion coefficients of the scattering matrix elements in series of the generalized spherical functions. The data for perceptron training was obtained using D. Mackowsky and M. Mishchenko code [4] [3]. At N = 50 the number of nonzero coefficients is approximately 22-24. So, the number of output neurons is 30, and the number of "hidden" layers is 2 with 30 neurons in each layer. Generation algorithm for fractal-like cluster of particles can be defined by the following formulas: N = where Rg is the gyration radius of the cluster
2 Rg =

Rg 2a

D

,

(1)

1 N

N 2 ri , i

(2)

ri is the distance from particle i to the center of mass of the cluster. Typical cluster structures with the same D, and N but under different initial generation conditions, are given in Figure 1. About two hundred points for the input parameters in range of x = 1.5; 1.4 Re(m) 1.7; 0.001 I m(m) 0.1; D = 3; = 8; N 50 was used for training the perceptron. During training process the perceptron is defining and memorizing a hypersurface in space of input-output parameters that in the best way corresponds to the data set presented for training. The trained


Figure 1: Cluster form for 10 and 20 particles. perceptron allows calculating the approximate values of the expansion coefficients for any input data from the data range that was used for neural network training.

Figure 2: Dependency of a

11

and a

12

coefficients on N . L is coefficient number.

Some examples of calculation of the dependencies of expansion coefficients a 11 and a12 of scattering matrixes elements S11 and S12 are given in Figure 2. Spots are the data obtained directly from the theory of light scattering by cluster of spherical particles. Solid curves correspond to data, calculating by the perceptron. In Fig.3 the linear polarization degrees of scattered light by clusters are given. Note, that the data for such refractive index (Re(m) = 1.7; I m(m) = 0.08) were not used for perceptron training. Advantages of the database are the small size and quick data access. Moreover there is a


Figure 3: Linear polarization degree P vs scattering angle . Solid curve corresponds to the accurate values, dotted line corresponds to values calculated by the perceptron. possibility to extend and make the database more exact without an increasing data time access and size of the database. This research was supported by INTAS grant N 1999-00652.

References
[1] D. E. Brownlee, "Cosmic dust - collection and research," Annu. Rev. Earth Plan. Sci., 13, 147-173, (1985). [2] V. P. Tishkovets, "Light scattering by clusters of spherical particles. Cooperative effects under chaotic orientation," Kinemat. Fiz. Nebesn. Tel. , 10, 58-63, (1994) (in Russian). [3] D. W. Mackowski and M. I. Mishchenko "Calculation of the T-matrix and the scattering matrix for ensembles of spheres," J.Opt.Soc.Amer., A 13, 2266-2278, (1996). [4] M.I. Mishchenko, L.D. Travis and A.A. Lacis, Scattering, Absorbtion and Emission of Light by Smal l Particles. (Cambridge University press, 2002). [5] Feder J., Fractals (Plenum Press. New York and London, 1988). [6] L. Thang, Z. Chen, S. Oh, R. J. Marks, and A. T. C. Chang, "Inversion of snow parameters from passive microwave remote sensing measurements by a neural network trained with a multiple scattering model," IEEE Transaction on Geoscience and Remote Sensing, 30, 1015-1024, (1992).