Accurate point matching based on multi-objective Genetic Algorithm for multi-sensor satellite imagery

This paper investigates a novel approach for point matching of multi-sensor satellite imagery. The feature (corner) points extracted using an improved version of the Harris Corner Detector (HCD) is matched using multi-objective optimization based on a Genetic Algorithm (GA). An objective switching approach to optimization that incorporates an angle criterion, distance condition and point matching condition in the multi-objective fitness function is applied to match corresponding corner-points between the reference image and the sensed image. The matched points obtained in this way are used to align the sensed image with a reference image by applying an affine transformation. From the results obtained, the performance of the image registration is evaluated and compared with existing methods, namely Nearest Neighbor-Random SAmple Consensus (NN-Ran-SAC) and multi-objective Discrete Particle Swarm Optimization (DPSO). From the performed experiments it can be concluded that the proposed approach is an accurate method for registration of multi-sensor satellite imagery. (C) 2014 Elsevier Inc. All rights reserved.

Morphology controlled synthesis of wurtzite ZnS nanostructures through simple hydrothermal method and observation of white light emission from ZnO obtained by annealing the synthesized ZnS nanostructures

A controllable synthesis of phase pure wurtzite (WZ) ZnS nanostructures has been reported in this work at a low temperature of similar to 220 degrees C using ethylenediamine as the soft template and by varying the molar concentration of zinc to sulphur precursors as well as by using different precursors. A significant reduction in the formation temperature required for the synthesis of phase pure WZ ZnS has been observed. A strong correlation has been observed between the morphology of the synthesized ZnS nanostructures and the precursors used during synthesis. It has been found from Scanning Electron Microscope (SEM) and Transmission Electron Microscope (TEM) image analyses that the morphology of the ZnS nanocrystals changes from a block-like to a belt-like structure having an average length of similar to 450 nm when the molar ratio of zinc to sulphur source is increased from 1 : 1 to 1 : 3. An oriented attachment (OA) growth mechanism has been used to explain the observed shape evolution of the synthesized nanostructures. The synthesized nanostructures have been characterized by the X-ray diffraction technique as well as by UV-Vis absorption and photoluminescence (PL) emission spectroscopy. The as-synthesized nanobelts exhibit defect related visible PL emission. On isochronal annealing of the nanobelts in air in the temperature range of 100-600 degrees C, it has been found that white light emission with a Commission Internationale de I'Eclairage 1931 (CIE) chromaticity coordinate of (0.30, 0.34), close to that of white light (0.33, 0.33), can be obtained from the ZnO nanostructures obtained at an annealing temperature of 600 degrees C. UV light driven degradation of methylene blue (MB) dye aqueous solution has also been demonstrated using as-synthesized nanobelts and similar to 98% dye degradation has been observed within only 40 min of light irradiation. The synthesized nanobelts with visible light emission and having dye degradation activity can be used effectively in future optoelectronic devices and in water purification for cleaning of dyes.

Effect of Post-Deposition Annealing on the Al2O3/Si(100) Interface Properties

In the present investigation, Al2O3 thin films were deposited onto Si < 100 > substrates by DC reactive magnetron sputtering. The films were annealed in vacuum for one hour at 623, 823 and 1023 K. The composition of the films was quantitatively estimated using X-ray photoelectron spectroscopy (XPS) and the O/Al ratio was found be in the range 1.19 to 1.43. Grazing incidence X-ray diffraction (GIXRD) results revealed that the annealed films are amorphous in nature. Cross sectional transmission electron microscopy (X-TEM) analysis was carried out to study the microstructure and nature of the Al2O3-Si interface as a function of post-deposition annealing. TEM results revealed the presence of nanocrystalline gamma-Al2O3 in the annealed films and an amorphous interface layer was observed at the Al2O3 Si interface. The thickness of the amorphous interface layer was determined from the TEM analysis and the results are discussed.

Effect of post-deposition annealing on composition and electrical properties of dc reactive magnetron sputtered Al2O3 thin films

We have investigated the effect of post- deposition annealing on the composition and electrical properties of alumina (Al2O3) thin films. Al2O3 were deposited on n-type Si < 100 >. substrates by dc reactive magnetron sputtering. The films were subjected to post- deposition annealing at 623, 823 and 1023 K in vacuum. X-ray photoelectron spectroscopy results revealed that the composition improved with post- deposition annealing, and the film annealed at 1023 K became stoichiometric with an O/Al atomic ratio of 1.49. Al/Al2O3/Si metal-oxide-semiconductor (MOS) structures were then fabricated, and a correlation between the dielectric constant epsilon(r) and interface charge density Q(i) with annealing conditions were studied. The dielectric constant of the Al2O3 thin films increased to 9.8 with post- deposition annealing matching the bulk value, whereas the oxide charge density decreased to 3.11 x 10(11) cm(-2.) Studies on current-voltage IV characteristics indicated ohmic and Schottky type of conduction at lower electric fields (<0.16 MV cm(-1)) and space charge limited conduction at higher electric fields.

Impact of spray flux density and vacuum annealing on the transparent conducting properties of doubly doped (Sn plus F) zinc oxide films deposited using a simplified spray technique

In this investigation transparent conducting properties of as-deposited and annealed ZnO:Sn:F films deposited using different spray flux density by changing the solvent volume (10 mL, 20 mL ... 50 mL) of the starting solutions have been studied and reported. The structural analyses of the films indicate that all the films have hexagonal wurtzite structure of ZnO with preferential orientation along (002) plane irrespective of the solvent volume and annealing treatment whereas, the overall crystalline quality of the films is found to be enhanced with the increase in solvent volume as well as with annealing. This observed enhancement is strongly supported by the optical and surface morphological results. From the measurements of electrical parameters, it is seen that, the annealed films exhibit better electrical properties compared to the as-deposited ones. Annealing has caused agglomeration of grains as confirmed by the surface morphological studies. Also, the annealing process has led to an improvement in the optical transparency as well as band gap. It is found from the analyses of the characteristics of the as- deposited and annealed films that the annealed film deposited from starting solution having solvent volume of 50 mL is optimal in all respects, as it possesses all the desirable characteristics including the quality factor (1.60 x 10(-4) (Omega/sq.)(-1)). (C) 2014 Elsevier Ltd. All rights reserved.

Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography

We address the problem of reconstructing a sparse signal from its DFT magnitude. We refer to this problem as the sparse phase retrieval (SPR) problem, which finds applications in tomography, digital holography, electron microscopy, etc. We develop a Fienup-type iterative algorithm, referred to as the Max-K algorithm, to enforce sparsity and successively refine the estimate of phase. We show that the Max-K algorithm possesses Cauchy convergence properties under certain conditions, that is, the MSE of reconstruction does not increase with iterations. We also formulate the problem of SPR as a feasibility problem, where the goal is to find a signal that is sparse in a known basis and whose Fourier transform magnitude is consistent with the measurement. Subsequently, we interpret the Max-K algorithm as alternating projections onto the object-domain and measurement-domain constraint sets and generalize it to a parameterized relaxation, known as the relaxed averaged alternating reflections (RAAR) algorithm. On the application front, we work with measurements acquired using a frequency-domain optical-coherence tomography (FDOCT) experimental setup. Experimental results on measured data show that the proposed algorithms exhibit good reconstruction performance compared with the direct inversion technique, homomorphic technique, and the classical Fienup algorithm without sparsity constraint; specifically, the autocorrelation artifacts and background noise are suppressed to a significant extent. We also demonstrate that the RAAR algorithm offers a broader framework for FDOCT reconstruction, of which the direct inversion technique and the proposed Max-K algorithm become special instances corresponding to specific values of the relaxation parameter.

A simulation-based algorithm for optimal pricing policy under demand uncertainty

We propose a simulation-based algorithm for computing the optimal pricing policy for a product under uncertain demand dynamics. We consider a parameterized stochastic differential equation (SDE) model for the uncertain demand dynamics of the product over the planning horizon. In particular, we consider a dynamic model that is an extension of the Bass model. The performance of our algorithm is compared to that of a myopic pricing policy and is shown to give better results. Two significant advantages with our algorithm are as follows: (a) it does not require information on the system model parameters if the SDE system state is known via either a simulation device or real data, and (b) as it works efficiently even for high-dimensional parameters, it uses the efficient smoothed functional gradient estimator.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Effect of thermal annealing on dual photoluminescence emission characteristics of chemically synthesized uncapped Mn2+ doped ZnS quantum dots

Dual photoluminescence (PL) emission characteristics of Mn2+ doped ZnS (ZnS:Mn) quantum dots (QDs) have drawn a lot of attention recently. However, here we report the effect of thermal annealing on the PL emission characteristics of uncapped ZnS:Mn QDs of average sizes similar to 2-3 nm, synthesized by simple chemical precipitation method by using de-ionized (DI) water at room temperature. As-synthesized samples show dual PL emissions, having one UV PL band centred at similar to 400 nm and the other in the visible region similar to 610 nm. But when the samples are isochronally annealed for 2 h at 100-600 degrees C temperature range in air, similar to 90% quenching of Mn2+ related visible PL emission intensity takes place at the annealing temperature of 600 degrees C. X-ray diffraction data show that the as-synthesized cubic ZnS has been converted to wurtzite ZnO at 600 degrees C annealing temperature. The nanostructural properties of the samples are also determined by transmission electron micrograph, electron probe micro-analyser and UV-vis spectrophotometry. The photocatalytic property of the annealed ZnS:Mn sample has been demonstrated and photo-degradation efficiency of the as-synthesized and 600 degrees C annealed ZnS:Mn sample has been found out to be similar to 35% and similar to 61%, respectively, for the degradation of methylene blue dye under visible light irradiation. The synthesized QDs may find significant applications in future optoelectronic devices. (C) 2014 Elsevier B.V. All rights reserved.

Effect of film thickness and annealing on optical properties of TiO2 thin films and electrical characterization of MOS capacitors

Titanium dioxide (TiO2) thin films were deposited on glass and silicon (100) substrates by the sol-gel method. The influence of film thickness and annealing temperature on optical transmittance/reflectance of TiO2 films was studied. TiO2 films were used to fabricate metal-oxide-semiconductor capacitors. The capacitance-voltage (C-V), dissipation-voltage (D-V) and current-voltage (I-V) characteristics were studied at different annealing temperatures and the dielectric constant, current density and resistivity were estimated. The loss tangent (dissipation) increased with increase of annealing temperature.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Enhancing the photocatalytic efficiency of sprayed ZnO thin films through double doping (Sn plus F) and annealing under different ambiences

Doubly (Sn + F) doped zinc oxide (ZnO:Sn:F) thin films were deposited onto glass substrates using a simplified spray pyrolysis technique. The deposited films were annealed at 400 degrees C under two different ambiences (air and vacuum) for 2 h. The photocatalytic activity of these films was assessed through photocatalytic decolorization kinetics of Methylene Blue (MB) dye and the decolorization efficiency of the annealed films was compared with that of their as-deposited counterpart. The photocatalytic studies reveal that the ZnO:Sn:F films annealed under vacuum environment exhibits better photocatalytic efficiency when compared with both air annealed and as-deposited films. The SEM and TEM images depict that the surface of each of the films has an overlayer comprising of nanobars formed on a bottom layer, having spherical grains. The studies show that the diameter of the nanobars plays crucial role in enhancing the photocatalytic activity of the ZnO:Sn:F films. The structural, optical and electrical studies substantiate the discussions on the photocatalytic ability of the deposited films. (C) 2014 Elsevier B.V. All rights reserved.

Iterated stochastic filters with additive updates for dynamic system identification: Annealing-type iterations and the filter bank

A nonlinear stochastic filtering scheme based on a Gaussian sum representation of the filtering density and an annealing-type iterative update, which is additive and uses an artificial diffusion parameter, is proposed. The additive nature of the update relieves the problem of weight collapse often encountered with filters employing weighted particle based empirical approximation to the filtering density. The proposed Monte Carlo filter bank conforms in structure to the parent nonlinear filtering (Kushner-Stratonovich) equation and possesses excellent mixing properties enabling adequate exploration of the phase space of the state vector. The performance of the filter bank, presently assessed against a few carefully chosen numerical examples, provide ample evidence of its remarkable performance in terms of filter convergence and estimation accuracy vis-a-vis most other competing filters especially in higher dimensional dynamic system identification problems including cases that may demand estimating relatively minor variations in the parameter values from their reference states. (C) 2014 Elsevier Ltd. All rights reserved.

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).