Hierarchical Clustering Algorithm for Land Cover Mapping Using Satellite Images

This paper presents hierarchical clustering algorithms for land cover mapping problem using multi-spectral satellite images. In unsupervised techniques, the automatic generation of number of clusters and its centers for a huge database is not exploited to their full potential. Hence, a hierarchical clustering algorithm that uses splitting and merging techniques is proposed. Initially, the splitting method is used to search for the best possible number of clusters and its centers using Mean Shift Clustering (MSC), Niche Particle Swarm Optimization (NPSO) and Glowworm Swarm Optimization (GSO). Using these clusters and its centers, the merging method is used to group the data points based on a parametric method (k-means algorithm). A performance comparison of the proposed hierarchical clustering algorithms (MSC, NPSO and GSO) is presented using two typical multi-spectral satellite images - Landsat 7 thematic mapper and QuickBird. From the results obtained, we conclude that the proposed GSO based hierarchical clustering algorithm is more accurate and robust.

Quasi-based hierarchical clustering for land cover mapping using satellite images

This paper presents an improved hierarchical clustering algorithm for land cover mapping problem using quasi-random distribution. Initially, Niche Particle Swarm Optimization (NPSO) with pseudo/quasi-random distribution is used for splitting the data into number of cluster centers by satisfying Bayesian Information Criteria (BIC). Themain objective is to search and locate the best possible number of cluster and its centers. NPSO which highly depends on the initial distribution of particles in search space is not been exploited to its full potential. In this study, we have compared more uniformly distributed quasi-random with pseudo-random distribution with NPSO for splitting data set. Here to generate quasi-random distribution, Faure method has been used. Performance of previously proposed methods namely K-means, Mean Shift Clustering (MSC) and NPSO with pseudo-random is compared with the proposed approach - NPSO with quasi distribution(Faure). These algorithms are used on synthetic data set and multi-spectral satellite image (Landsat 7 thematic mapper). From the result obtained we conclude that use of quasi-random sequence with NPSO for hierarchical clustering algorithm results in a more accurate data classification.

Solving MIN ONES 2-SAT as fast as VERTEX COVER

The problem of finding a satisfying assignment that minimizes the number of variables that are set to 1 is NP-complete even for a satisfiable 2-SAT formula. We call this problem MIN ONES 2-SAT. It generalizes the well-studied problem of finding the smallest vertex cover of a graph, which can be modeled using a 2-SAT formula with no negative literals. The natural parameterized version of the problem asks for a satisfying assignment of weight at most k. In this paper, we present a polynomial-time reduction from MIN ONES 2-SAT to VERTEX COVER without increasing the parameter and ensuring that the number of vertices in the reduced instance is equal to the number of variables of the input formula. Consequently, we conclude that this problem also has a simple 2-approximation algorithm and a 2k - c logk-variable kernel subsuming (or, in the case of kernels, improving) the results known earlier. Further, the problem admits algorithms for the parameterized and optimization versions whose runtimes will always match the runtimes of the best-known algorithms for the corresponding versions of vertex cover. Finally we show that the optimum value of the LP relaxation of the MIN ONES 2-SAT and that of the corresponding VERTEX COVER are the same. This implies that the (recent) results of VERTEX COVER version parameterized above the optimum value of the LP relaxation of VERTEX COVER carry over to the MIN ONES 2-SAT version parameterized above the optimum of the LP relaxation of MIN ONES 2-SAT. (C) 2013 Elsevier B.V. All rights reserved.

Assimilation of endmember variability in spectral for urban land cover extraction mixture analysis

Variable Endmember Constrained Least Square (VECLS) technique is proposed to account endmember variability in the linear mixture model by incorporating the variance for each class, the signals of which varies from pixel to pixel due to change in urban land cover (LC) structures. VECLS is first tested with a computer simulated three class endmember considering four bands having small, medium and large variability with three different spatial resolutions. The technique is next validated with real datasets of IKONOS, Landsat ETM+ and MODIS. The results show that correlation between actual and estimated proportion is higher by an average of 0.25 for the artificial datasets compared to a situation where variability is not considered. With IKONOS, Landsat ETM+ and MODIS data, the average correlation increased by 0.15 for 2 and 3 classes and by 0.19 for 4 classes, when compared to single endmember per class. (C) 2013 COSPAR. Published by Elsevier Ltd. All rights reserved.

The influence of debris cover and glacial lakes on the recession of glaciers in Sikkim Himalaya, India

We investigated area changes in glaciers covering an area of similar to 200 km(2) in the Tista basin, Sikkim, Eastern Indian Himalaya, between similar to 1990 and 2010 using Landsat Thematic Mapper (TM) and Indian Remote-sensing Satellite (IRS) images and related the changes to debris cover, supraglacial lakes and moraine-dam lakes. The glaciers lost an area of 3.3 +/- 0.8% between 1989/90 and 2010. More detailed analysis revealed an area loss of 2.00 +/- 0.82, 2.56 +/- 0.61 and 2.28 +/- 2.01 km(2) for the periods 1989-97, 1997-2004/05 and 2004-2009/10, respectively. This indicates an accelerated retreat of glaciers after 1997. On further analysis, we observed (1) the formation and expansion of supraglacial lakes on many debris-covered glaciers and (2) the merging of these lakes over time, leading to the development of large moraine-dam lakes. We also observed that debris-covered glaciers with lakes lose a greater area than debris-covered glaciers without lakes and debris-free glaciers. The climatic data for 24 years (1987-2011), measured at the Gangtok meteorological station (1812 m a.s.l.), showed that the region experienced a 1.0 degrees C rise in the summer minimum temperature and a 2.0 degrees C rise in the winter minimum temperature, indicating hotter summers and warmer winters. There was no significant trend in the total annual precipitation. We find that glacier retreat is caused mainly by a temperature increase and that debris-covered glaciers can retreat at a faster rate than debris-free glaciers, if associated with lakes.

Missing (in-situ) snow cover data hampers climate change and runoff studies in the Greater Himalayas

The Himalayas are presently holding the largest ice masses outside the polar regions and thus (temporarily) store important freshwater resources. In contrast to the contemplation of glaciers, the role of runoff from snow cover has received comparably little attention in the past, although (i) its contribution is thought to be at least equally or even more important than that of ice melt in many Himalayan catchments and (ii) climate change is expected to have widespread and significant consequences on snowmelt runoff. Here, we show that change assessment of snowmelt runoff and its timing is not as straightforward as often postulated, mainly as larger partial pressure of H2O, CO2, CH4, and other greenhouse gases might increase net long-wave input for snowmelt quite significantly in a future atmosphere. In addition, changes in the short-wave energy balance such as the pollution of the snow cover through black carbon or the sensible or latent heat contribution to snowmelt are likely to alter future snowmelt and runoff characteristics as well. For the assessment of snow cover extent and depletion, but also for its monitoring over the extremely large areas of the Himalayas, remote sensing has been used in the past and is likely to become even more important in the future. However, for the calibration and validation of remotely-sensed data, and even-more so in light of possible changes in snow-cover energy balance, we strongly call for more in-situ measurements across the Himalayas, in particular for daily data on new snow and snow cover water equivalent, or the respective energy balance components. Moreover, data should be made accessible to the scientific community, so that the latter can more accurately estimate climate change impacts on Himalayan snow cover and possible consequences thereof on runoff. (C) 2013 Elsevier B.V. All rights reserved.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

Effect of Microtopography, Slope Length and Gradient, and Vegetative Cover on Overland Flow Through Simulation

Overland flow on a hillslope is significantly influenced by its microtopography, slope length and gradient, and vegetative cover. A 1D kinematic wave model in conjunction with a revised form of the Green-Ampt infiltration equation was employed to evaluate the effect of these surface conditions. The effect of these conditions was treated through the resistance parameter in the kinematic wave model. The resistance in this paper was considered to be made up of grain resistance, form resistance, and wave resistance. It was found that irregular slopes with microtopography eroded more easily than did regular slopes. The effect of the slope gradient on flow velocity and flow shear stress could be negative or positive. With increasing slope gradient, the flow velocity and shear stress first increased to a peak value, then decreased again, suggesting that there exists a critical slope gradient for flow velocity and shear stress. The vegetative cover was found to protect soil from erosion primarily by enhancing erosion-resisting capacity rather than by decreasing the eroding capability of overland flow.

Uplift resistance of buried pipelines at low cover-diameter ratios

Reliable estimates for the maximum available uplift resistance from the backfill soil are essential to prevent upheaval buckling of buried pipelines. The current design code DNV RP F110 does not offer guidance on how to predict the uplift resistance when the cover:pipe diameter (H/D) ratio is less than 2. Hence the current industry practice is to discount the shear contribution from uplift resitance for design scenarios with H/D ratios less than 1. The necessity of this extra conservatism is assessed through a series of full-scale and centrifuge tests, 21 in total, at the Schofield Centre, University of Cambridge. Backfill types include saturated loose sand, saturated dense sand and dry gravel. Data revealed that the Vertical Slip Surface Model remains applicable for design scenarios in loose sand, dense sand and gravel with H/D ratios less than 1, and that there is no evidence that the contribution from shear should be ignored at these low H/D ratios. For uplift events in gravel, the shear component seems reliable if the cover is more than 1-2 times the average particle size (D50), and more research effort is currenty being carried out to verify this conclusion. Strain analysis from the Particle Image Velocimetry (PIV) technique proves that the Vertical Slip Surface Model is a good representation of the true uplift deformation mechanism in loose sand at H/D ratios between 0.5 and 3.5. At very low H/D ratios (H/D < 0.5), the deformation mechanism is more wedge-like, but the increased contribution from soil weight is likely to be compensated by the reduced shear contributions. Hence the design equation based on the Vertical Slip Surface Model still produces good estimates for the maximum available uplift resistance. The evolution of shear strain field from PIV analysis provides useful insight into how uplift resistance is mobilized as the uplift event progresses. Copyright 2010, Offshore Technology Conference.

Influence of suspended particles and particle cover over the density interface

The effect of the particle cover over the density interface between two layers of fluids and of the suspended solid particles in the upper turbulcnt layer on the turbulent entrainment has been studied experimentally. The entrainment distance D is a function of the time of power: D=kt, where =0.200-0.130p. For suspended particles in the upper layer and pure 2-layer fluid is equal to 0.200, but the value of k for the suspended particles is smaller than that for the pure 2-layer fluid. The non-dimensional entrainment velocity is E=KRiln, where n=1.50+0.93 p. It is shown that the particle cover over the interface changes the power of Ril in the entrainment and hinders the turbulent entrainment. The variation rule of E for the suspended particles is the same as that for the pure 2-layer fluid, but the K value of the former is smaller than that of the latter. The turbulent mixing mechanism has been discussed.

Álbum do Amazonas / photographias de F. A. Fidanza. --Album do Amazonas, 1901-1902 : no Governo de Sua Exª. Snr. Dr. Silvério Nery

Com dedicatória à Camara dos Deputados do Senador Joaquim José Pais da Silva Sarmento, 1900-1902(na página de rosto)

Ordinary mod p representations of the metaplectic cover of p-adic SL_2

We classify the genuine ordinary mod p representations of the metaplectic group SL(2,F)-tilde, where F is a p-adic field, and compute its genuine mod p spherical and Iwahori Hecke algebras. The motivation is an interest in a possible correspondence between genuine mod p representations of SL(2,F)-tilde and mod p representations of the dual group PGL(2,F), so we also compare the two Hecke algebras to the mod p spherical and Iwahori Hecke algebras of PGL(2,F). We show that the genuine mod p spherical Hecke algebra of SL(2,F)-tilde is isomorphic to the mod p spherical Hecke algebra of PGL(2,F), and that one can choose an isomorphism which is compatible with a natural, though partial, correspondence of unramified ordinary representations via the Hecke action on their spherical vectors. We then show that the genuine mod p Iwahori Hecke algebra of SL(2,F)-tilde is a subquotient of the mod p Iwahori Hecke algebra of PGL(2,F), but that the two algebras are not isomorphic. This is in contrast to the situation in characteristic 0, where by work of Savin one can recover the local Shimura correspondence for representations generated by their Iwahori fixed vectors from an isomorphism of Iwahori Hecke algebras.