Narrow Results

Classification of remote sensing spatial information from multi spectral satellite imagery can be used to obtain multiple representation of the image and capture different structure lineaments. Pixels are grouped using clustering and morphology based segmentation for region based spatial information. This is used to calculate the spatial features of the contiguous regions by classifying the region into the statistics of the pixel properties. In the proposed work, analysis of Google Earth images for identification of morphological patterns of the river flow is done for remote sensing image using graph-cuts. Multi-temporal satellite images acquired from Google Earth to identify the digital elevation is used to formulate the energy function from images to compare the displacement in pixel value using similarity measure. A method is proposed to solve non-rigid image transformation via graph-cuts algorithm by modeling the registration process as a discrete labeling problem. A displacement vector associated to each pixel in the source image indicates the corresponding position in the moving image. The transformation matrix produced from change in the intensity of the pixels for a region is then optimized for energy minimization by using the graph-cuts algorithm and demon registration technique. The proposed study enhances the advantages of regional segmentation in order to know homogeneous areas for optimal image segmentation and digital footprints for change in the river bed patterns by identifying the change in LANDSAT data from temporal satellite images. By applying the proposed multi-level registration method, the number of labels used in each level is greatly reduced due to lower image resolution being used in coarser levels. The results demonstrate that the lineament detection for better accuracy compared to traditional sources of lineament identification methods. It has provided better geotectonic understanding of Cudappah rock in Ahobhilam with Quartzite. The imprints of Eastern Ghat orogeny are seen in upper stream section through a graph cut based segmentation approach.

A new algorithm named dynamic graph merging (DGM) for automatic image segmentation is explored. Firstly a novel variational model for multi-section cut is introduced by decomposing the traditional cut into two parts, the harmonic cut and the elastic energy of the boundary. The new energy is called the continuous combined cut. Secondly a new algorithm that removes those edges with higher energy and synchronously merges their starting and ending vertices in an ordered manner is proposed. The continual merging process would iteratively contract the graph, merge those homogeneous vertices into bigger and bigger super-pixels, and fuse the remainder edges into longer and longer boundaries. So we call this algorithm dynamic graph merging. Merging criterions based on the continuous combined cut model are also discussed, which will be used to determine whether a given edge should collapse. Since the merging condition should be highly related to the image content, we present different predicates for structure images and texture images respectively. This algorithm whose efficiency is showed by experiments has a linear time/space complexity, and can efficiently segment gray/color and 2D/3D images.

Hyperspectral unmixing is one of the most important techniques in the remote sensing image analysis tasks. In recent decades, nonnegative matrix factorization (NMF) has been shown to be effective for hyperspectral unmixing due to the strong discovery of the latent structure. Most NMFs put emphasize on the spectral information, but ignore the spatial information, which is very crucial for analyzing hyperspectral data. In this paper, we propose an improved NMF method, namely NMF with region sparsity learning (RSLNMF), to simultaneously consider both spectral and spatial information. RSLNMF defines a new sparsity learning model based on a small homogeneous region that is obtained via the graph cut algorithm. Thus RSLNMF is able to explore the relationship of spatial neighbor pixels within each region. An efficient optimization scheme is developed for the proposed RSLNMF, and its convergence is theoretically guaranteed. Experiments on both synthetic and real hyperspectral data validate the superiority of the proposed method over several state-of-the-art unmixing approaches.

In this paper, we investigate the problem of how to distribute vaccines, which will be supplied over time, so that the number of the infected can be minimized during a given mission period. The concept of temporal graph is adopted to abstract the constantly changing social relations over time. Then, we formally introduce the social-relation-based vaccine distribution planning problem (SVDP²) on the temporal graph. To solve the problem, we first introduce a new graph induction technique to combine the subgraphs in the temporal graph into a single directed acyclic graph. Then, we design a new technique based on a maximum flow algorithm to evaluate the quality of any feasible solution of the problem. Finally, we propose an enumeration algorithm which will search the solution space using the evaluation technique and find the best possible solution within polynomial time. Our simulation result shows the proposed algorithm is more efficient than a simple strategy which randomly distributes vaccines.

Moving objects segmentation accurately is one of the most challenging problems in computer vision. This paper present a novel approach to segment moving objects with edge information and temporal information using graph cuts model. To improve this problem, motion segmentation problem is considered as an image-labeling process in which every pixel in the image will be assigned a label describing its motion between consecutive frames. And a graph cuts based energy minimization method is used by define a measure function of smoothness and accuracy of motion vectors to achieve this goal. And to improve the accurate of the motion edge map, an improved ME (Moving Edge) map acquiring method is proposed. Experiments and results show that our algorithm is efficient and noise robot.