Graph-theoretic Issues in Remote Sensing and Landscape Ecology
|
|
- Neil Reynolds
- 6 years ago
- Views:
Transcription
1 EnviroInfo 2002 (Wien) Environmental Communication in the Information Society - Proceedings of the 16th Conference Graph-theoretic Issues in Remote Sensing and Landscape Ecology Joachim Steinwendner 1 Abstract The goal of remote sensing applications in landscape ecology have evolved from mere landcover/landuse classification to include also structural information and patterns of landscape elements. The importance of landscape patterns to describe landscape units is also mirrored in a number of current EU projects and initiatives (e.g. Natura 2000, SPIN Spatial Indicators for European Nature Conservation, Envip Nature, and others). Spatial properties of landscape units are closely related to the topology of landscape elements. Topology and topology-related applications make up the core of graph theory. This mathematical branch provides data structures and methods based on a firm mathematical background suitable for remote sensing and landscape ecological applications. 1. Introduction By reason of coverage, high spatial resolution and exact allocation in time, remote sensing data is a vital source of information for mapping and modelling for various applications in landscape ecology. Although recent and future sensors offer better spatial resolution (1-4 m), satellite data with mid-resolution (i.e m resolution, e.g. Landsat ETM+, SPOT, ASTER) play still a major role for areas under investigation on a state or continental scale. Automatic methods for the extraction of landscape elements and landscape units from remote sensing data are an important prerequisite for large area landscape analysis. Computer vision methods such as image segmentation are used to accomplish this task (Baatz (et al.), 2000; Felszenszwalb (et al.), 1998; Gagalowicz (et al.), 1986; Schneider (et al.), 1999). The following papers use also graph-based methods for segmentation (Barr (et al.), 1997; Kropatsch, 1995; Urquhart, 1982; Zahn, 1971). 1 Institute of Surveying, Remote Sensing and Land Information, Univ. of Agricultural Sciences Vienna (BOKU), Peter-Jordan-Str. 82, A-1190 Vienna, Austria steinwendner@boku.ac.at,
2 Basic Definitions in Graph theory This section introduces a few graph theory definitions utilized in the following sections. The definitions are mainly taken from (West, 2000). Definition 1: A graph G(V,E) consists of a set of vertices, V(G)={v i }, and a set of edges, E(G)={e i }. Each edge e=v i v j from the set E(G) is defined by two vertices v i and v j defining the edge. Vertices v i and v j are said to be adjacent. A vertex v is said to be incident to the edges that contain v as a start or end vertex. Definition 2: The number of edges incident to a vertex is termed deg(v) or degree of vertex v, respectively. Fig. 1: A graph with vertex set {x 0,x 1,x 2,x 3,x 4,x 5 } and the edge set {x 0 x 1,x 0 x 5,x 0 x 2,x 1 x 2,x 1 x 3,x 1 x 4,x 2 x 3 } Definition 3: A tree is a graph than contains no cycles, i.e. there exists only one path between a randomly chosen pair of vertices in a tree graph. The graph in fig. 1 is thus no tree, because there are two paths from the vertices x1 to x2 (x1x3x2 and x1x0x2). Definition 4: The subgraph of G(V,E) with a minimum number of edges connecting all vertices is called minimum spanning tree of G, mst(g). If B=msb(G) then the following must be valid: V(B)=V(G) and E(B) E(V). Figure 3 shows a graph and its minimum spanning tree. Definition 5: A planar graph G is a graph that can be embedded in a twodimensional surface so that no edge crossing exists. The graph displayed in figure 1 is a planar graph.
3 548 Definition 6: A planar graph G divides a surface into faces. A new graph can be derived in such a way that each face is represented by a vertex. An edge is included into the edge set if two faces are adjacent. The so-produced graph G d is called dual graph. In figure 2, the gray graph is the dual graph of the black graph and vice versa. Definition 7: A parametrized graph G p contains a vertex set V(G p )={v i (X i )} and an edge set E(G p )={e i (Y i )}, where X i F V (the feature space of vertices) and Y i F E (the feature space of edges). 3. Graph representation of remote sensing data and landscapes In order to use graph theoretic methods for remote sensing data, it is necessary to transform the data into graphs. A straight-forward way is that a vertex represents a pixel. An edge is added to the edge set if pixels are neighboured. In this work, fourneighbourhood of pixels only is considered in order to obtain planar graphs. This restriction does not imply a limitation on the degree of vertices. Fig. 2: Part of a satellite image and its pixel graph (black) and its pixel border graph (gray) In figure 2 the black graph (pixel graph) is the result of this construction. The gray graph is the dual graph of the pixel graph (called pixel border graph).
4 Graphs and Segmentation Image segmentation in general is the process of partitioning an image into segments (i.e. sets of adjacent pixels) having a meaning in the real world. Graph-based segmentation means thus the process of partitioning a graph into connected components (i.e. sets of adjacent vertices) having a meaning in the real world. This definition offers several advantages: - It covers also image segmentation if a graph is constructed as described in the previous section. - One is not restricted with respect to the regular grid of digital images so that vertices can have arbitrarily many neighbors. - When using parameterised graphs vertices as well as edges are attributed with properties. In terms of image segmentation it is straight forward to develop hybrid segmentation methods considering homogeneity of pixels and discontinuities in the image Graph representation of segmentation results A labeled graph is a simple representation of a graph partitioning where vertices grouped according to some criterion are labeled equally. The set of vertices with the same label is called a component C i. Their must be a path in G between any randomly chosen pair of vertices of C i traveling only through vertices of C i. For the whole set of components, the following must be valid V(G)= V(C i ) and i,j i j: V(C i ) V(C j )=. Based on this graph partitioning a new graph G S can be construced where a vertex represents a component and edges are added to E(G S ) if there is at least one edge between vertices of two differently labeled components. Note that this construction is not specific about how many edges are added to the edge set. In terms of landscape ecology a component corresponds to a landscape element as mentioned in (Grillmayer, 2002). The newly created graph G S is consequently termed landscape element graph. So far, only graph-based representations of segmentation results are discussed. In the next section the process of graph-based segmentation is introduced Graph-based segmentation methods There are two groups of graph-based segmentation methods. The one group consists of conventional segmentation methods such as region growing, split-and-merge, watershed methods adapted to be applied on a graph structure the other group of segmentation methods is based on graph-theoretic methods.
5 550 For further discussion let us consider a parameterized pixel graph. The vertex feature space is an n-dimensional space representing the spectral signatures of a pixel. The edge feature space represents the spectral distance between pixels. Conventional segmentation methods can be improved exploiting the properties of the graph structure. In case of region growing, two immediate advantages with respect to computing time are obvious: Firstly, spectral distance computation is performed only once such that pixel comparison is done by simply looking into the edge attribute. Secondly, edges attributed with high spectral distance can be deleted before starting the region growing process reducing thereby the number of pixel comparisons. Fig. 3: Graph G (edge set consists of black and gray edges) and its minimum spanning tree (gray edges only) Some segmentation methods based on graph theory use the minimum spanning tree of a graph. The minimum criteria is again the spectral distance of pixels represented by vertices. In (Zahn, 1971) all edges of the minimum spanning tree are deleted that feature a spectral distance below a certified threshold leading eventually to a set of components (see section 4.1). This approach, however, is problematic with textured objects. Felszenzwalb (Felszenszwalb(et al.), 1998) overcomes this problem by applying a pairwise component comparison taking into account the intercomponent difference and intracomponent differences. In (Kropatsch (et al.), 1996), a graph-based segmentation is described building an image pyramid using dual graph contraction. The step from one level into the next level in the pyramid results from merging of vertices of the pixel graph as well as the pixel border graph using a contraction rule or function, resp. This function can be chosen arbitrarily guiding the segmentation process to match the outcome of any
6 551 segmentation method. For this reason this segmentation algorithm is called universal in (Kropatsch(et al.), 1996). The reviewed segmentation algorithms can be applied to the pixel graph but also to the resulting landscape element graph. However, the step from landscape element graph to the landscape units is more complex since the homogeneity criteria (or discontinuity criteria) are based on a edge and vertex feature set containing more and diverse information than the pixel graph (see also (Grillmayer, 2002)). In order to cope with this complexity an approach can be taken similar to (Schneider(et al.), 1999). This approach is termed knowledge-based breadth-firstsearch and is applied to the landscape element graph. This method starts from a vertex and groups adjacent vertices if these and the component built so far are similar according to the knowledge base. The knowledge base contains a collection of landscape unit prototypes and their properties. Schneider (Schneider, 2002) discusses a general concept on knowledge based image analysis with respect to remote sensing and landscape ecology 5. Conclusion In this work a graph structure is introduced that serves as a basis for low level as well as high level image understanding problems related to landscape ecology. The advantages of using graph theory is twofold: it provides a universal concept for using computer vision methods for landscape ecological problems and it is based on a firm mathematical background. The concept also follows the idea of object-oriented programming, including encapsulation, inheritance, polymorphism, etc. The objects are vertices and edges with their properties, some of the typical functions applied to this objects are contraction, deletion, insertion. The hierarchical concept of graph pyramids suggests inheritance of properties and functions. A good example for an object-oriented programming library realizing combinatoric (graphs) and geometric (points, lines, polygons) data types is the LEDA library (Mehlhorn (et al.), 2000). Acknowledgement This work has been funded by the Austrian Science Foundation (FWF), project Hierarchies of plane graphs for the acquisition, analysis und visualization of geographical information, grant number Grant-Nr. P14662-INF. This project is conducted with the collaboration of the Institute of Pattern Recognition and Image Processing and the Department of Algorithms and Data Structures of the Institute of Computer Graphics, both at the Technical University Vienna.
7 552 Bibliography Baatz, M. and Schäpe, A., (2000): Multiresolution Segmentation: an optimization approach for high quality multi-scale image segmentation, AGIT, Salzburg. Barr, S. and Barnsley, M., (1997): A region-based, graph-theoretic data model for the inference of second-order thematic information from remotely-sensed images. International Journal of Geographical Information Science, 11(6): pp Felszenszwalb, P.F. and Huttenlocher, D.P., (1998): Efficiently computing a good segmentation, DARPA Image Understanding Workshop. Gagalowicz, A. and Monga, O., (1986): A New Approach for Image Segmentation, 8th International Conference on Pattern Recognition, pp Grillmayer, R., (2002): Landscape Structure Model, this publication. Kropatsch, W., (1995): Building Irregulars Pyramids by Dual Graph Contraction. IEEE Proc. Vision, Image und Signal Processing, 142(6): pp Kropatsch, W. and Benyacoub, S., (1996): A revision of pyramid segmentation. In: W.G. Kropatsch (Editor), 13th International Conference on Pattern Recognition, pp Mehlhorn, K. and Näher, S., (2000): LEDA: A platform for combinatorial and geometric computing. Cambridge University Press. Schneider, W., (2002): Knowledge Based Methods of Analysis of Remotely Sensed Images for Landscape Ecology, this publication. Schneider, W. and Steinwendner, J., (1999): Landcover mapping by interrelated segmentation and classification of satellite images. Fusion of Sensor Data, Knowledge Sources and Algorithms for Extraction and Classification of Topographic Objects, International Archives of Photogrammetry and Remote Sensing, 32(7-4-3W6): pp Urquhart, R., (1982): Graph theoretical clustering based on limited neighborhood sets. Pattern Recognition, 15(3): pp West, D., (2000): Introduction to Graph Theory. Prentice Hall. Zahn, C.T., (1971): Graph-theoretic methods for detecting and describing gestalt clusters. IEEE Trans. Comp., 20: pp
Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method
Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method (Why does it always find the lady?) Adrian Ion, Walter G. Kropatsch, and Yll Haxhimusa Vienna University of Technology, Pattern
More informationOBJECT-ORIENTED HIERARCHICAL IMAGE VECTORIZATION
OBJECT-ORIENTED HIERARCHICAL IMAGE VECTORIZATION A. N. Skurikhin a, *, P. L. Volegov b a MS D436, Space and Remote Sensing Group, Los Alamos National Laboratory, Los Alamos, NM, 87545, USA - alexei@lanl.gov
More informationPATCH-BASED IMAGE SEGMENTATION OF SATELLITE IMAGERY USING MINIMUM SPANNING TREE CONSTRUCTION
PATCH-BASED IMAGE SEGMENTATION OF SATELLITE IMAGERY USING MINIMUM SPANNING TREE CONSTRUCTION A. N. Skurikhin MS D436, Space and Remote Sensing Group, Los Alamos National Laboratory, Los Alamos, NM, 87545,
More informationSegmentation of Images
Segmentation of Images SEGMENTATION If an image has been preprocessed appropriately to remove noise and artifacts, segmentation is often the key step in interpreting the image. Image segmentation is a
More informationHIGH RESOLUTION REMOTE SENSING IMAGE SEGMENTATION BASED ON GRAPH THEORY AND FRACTAL NET EVOLUTION APPROACH
HIGH RESOLUTION REMOTE SENSING IMAGE SEGMENTATION BASED ON GRAPH THEORY AND FRACTAL NET EVOLUTION APPROACH Yi Yang, Haitao Li, Yanshun Han, Haiyan Gu Key Laboratory of Geo-informatics of State Bureau of
More informationCS 534: Computer Vision Segmentation and Perceptual Grouping
CS 534: Computer Vision Segmentation and Perceptual Grouping Ahmed Elgammal Dept of Computer Science CS 534 Segmentation - 1 Outlines Mid-level vision What is segmentation Perceptual Grouping Segmentation
More informationEXPLORATIVE ANALYSIS OF GRAPH PYRAMIDS USING INTERACTIVE VISUALIZATION TECHNIQUES
EXPLORATIVE ANALYSIS OF GRAPH PYRAMIDS USING INTERACTIVE VISUALIZATION TECHNIQUES Andreas Kerren Computer Science Department University of Kaiserslautern P.O.Box 3049 D-67653 Kaiserslautern, Germany email:
More informationObject-Based Classification & ecognition. Zutao Ouyang 11/17/2015
Object-Based Classification & ecognition Zutao Ouyang 11/17/2015 What is Object-Based Classification The object based image analysis approach delineates segments of homogeneous image areas (i.e., objects)
More informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
More informationDigital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
More informationIncluding the Size of Regions in Image Segmentation by Region Based Graph
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 4, April 2015, PP 81-85 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Including the Size of Regions in Image Segmentation
More informationStatistical Region Merging Algorithm for Segmenting Very High Resolution Images
Statistical Region Merging Algorithm for Segmenting Very High Resolution Images S.Madhavi PG Scholar, Dept of ECE, G.Pulla Reddy Engineering College (Autonomous), Kurnool, Andhra Pradesh. T.Swathi, M.Tech
More informationHierarchical Interactive Image Segmentation using Irregular Pyramids
Hierarchical Interactive Image Segmentation using Irregular Pyramids Michael Gerstmayer, Yll Haxhimusa, and Walter G. Kropatsch Pattern Recognition and Image Processing Group Vienna University of Technology
More informationImage Segmentation for Image Object Extraction
Image Segmentation for Image Object Extraction Rohit Kamble, Keshav Kaul # Computer Department, Vishwakarma Institute of Information Technology, Pune kamble.rohit@hotmail.com, kaul.keshav@gmail.com ABSTRACT
More informationINCREASING CLASSIFICATION QUALITY BY USING FUZZY LOGIC
JOURNAL OF APPLIED ENGINEERING SCIENCES VOL. 1(14), issue 4_2011 ISSN 2247-3769 ISSN-L 2247-3769 (Print) / e-issn:2284-7197 INCREASING CLASSIFICATION QUALITY BY USING FUZZY LOGIC DROJ Gabriela, University
More informationNoise Robustness of Irregular LBP Pyramids
Noise Robustness of Irregular LBP Pyramids Christoph Körner, Ines Janusch, Walter G. Kropatsch Pattern Recognition and Image Processing (PRIP) Vienna University of Technology, Austria {christoph,ines,krw}@prip.tuwien.ac.at
More informationBUILDINGS CHANGE DETECTION BASED ON SHAPE MATCHING FOR MULTI-RESOLUTION REMOTE SENSING IMAGERY
BUILDINGS CHANGE DETECTION BASED ON SHAPE MATCHING FOR MULTI-RESOLUTION REMOTE SENSING IMAGERY Medbouh Abdessetar, Yanfei Zhong* State Key Laboratory of Information Engineering in Surveying, Mapping and
More informationImage Segmentation Techniques
A Study On Image Segmentation Techniques Palwinder Singh 1, Amarbir Singh 2 1,2 Department of Computer Science, GNDU Amritsar Abstract Image segmentation is very important step of image analysis which
More informationHierarchical Multi level Approach to graph clustering
Hierarchical Multi level Approach to graph clustering by: Neda Shahidi neda@cs.utexas.edu Cesar mantilla, cesar.mantilla@mail.utexas.edu Advisor: Dr. Inderjit Dhillon Introduction Data sets can be presented
More informationGraph-based Modeling of Building Roofs Judith Milde, Claus Brenner Institute of Cartography and Geoinformatics, Leibniz Universität Hannover
12th AGILE International Conference on Geographic Information Science 2009 page 1 of 5 Graph-based Modeling of Building Roofs Judith Milde, Claus Brenner Institute of Cartography and Geoinformatics, Leibniz
More informationAN INTEGRATED APPROACH TO AGRICULTURAL CROP CLASSIFICATION USING SPOT5 HRV IMAGES
AN INTEGRATED APPROACH TO AGRICULTURAL CROP CLASSIFICATION USING SPOT5 HRV IMAGES Chang Yi 1 1,2,*, Yaozhong Pan 1, 2, Jinshui Zhang 1, 2 College of Resources Science and Technology, Beijing Normal University,
More informationSubpixel Corner Detection for Tracking Applications using CMOS Camera Technology
Subpixel Corner Detection for Tracking Applications using CMOS Camera Technology Christoph Stock, Ulrich Mühlmann, Manmohan Krishna Chandraker, Axel Pinz Institute of Electrical Measurement and Measurement
More informationHierarchical Interactive Image Segmentation using Irregular Pyramids
Hierarchical Interactive Image Segmentation using Irregular Pyramids Michael Gerstmayer, Yll Haxhimusa, and Walter G. Kropatsch Pattern Recognition and Image Processing Group Institute of Computer Graphics
More informationFigure 1: An Area Voronoi Diagram of a typical GIS Scene generated from the ISPRS Working group III/3 Avenches data set. 2 ARRANGEMENTS 2.1 Voronoi Di
Qualitative Spatial Relations using Arrangements for Complex Images M. Burge and W. Burger Johannes Kepler University, Department of Systems Science Computer Vision Laboratory, A-4040 Linz, Austria burge@cast.uni-linz.ac.at
More informationImage Segmentation Based on Watershed and Edge Detection Techniques
0 The International Arab Journal of Information Technology, Vol., No., April 00 Image Segmentation Based on Watershed and Edge Detection Techniques Nassir Salman Computer Science Department, Zarqa Private
More informationSLIDING WINDOW FOR RELATIONS MAPPING
SLIDING WINDOW FOR RELATIONS MAPPING Dana Klimesova Institute of Information Theory and Automation, Prague, Czech Republic and Czech University of Agriculture, Prague klimes@utia.cas.c klimesova@pef.czu.cz
More informationCHAPTER 4. ANALYSIS of GRAPH THEORETICAL IMAGE SEGMENTATION METHODS
CHAPTER 4 ANALYSIS of GRAPH THEORETICAL IMAGE SEGMENTATION METHODS 4.1 Introduction In Graph based methods image is represented by undirected weighted graph where the nodes are pixels or pixel regions.
More informationAdvanced visualization techniques for Self-Organizing Maps with graph-based methods
Advanced visualization techniques for Self-Organizing Maps with graph-based methods Georg Pölzlbauer 1, Andreas Rauber 1, and Michael Dittenbach 2 1 Department of Software Technology Vienna University
More informationNetwork Snakes for the Segmentation of Adjacent Cells in Confocal Images
Network Snakes for the Segmentation of Adjacent Cells in Confocal Images Matthias Butenuth 1 and Fritz Jetzek 2 1 Institut für Photogrammetrie und GeoInformation, Leibniz Universität Hannover, 30167 Hannover
More informationGenerating Topology on Graphs by. Operations on Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 57, 2843-2857 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.5154 Generating Topology on Graphs by Operations on Graphs M. Shokry Physics
More informationEstimation of Distribution Algorithm for the Max-Cut Problem
Estimation of Distribution Algorithm for the Max-Cut Problem Samuel de Sousa, Yll Haxhimusa, and Walter G. Kropatsch Vienna University of Technology Pattern Recognition and Image Processing Group Vienna,
More informationTexture Image Segmentation using FCM
Proceedings of 2012 4th International Conference on Machine Learning and Computing IPCSIT vol. 25 (2012) (2012) IACSIT Press, Singapore Texture Image Segmentation using FCM Kanchan S. Deshmukh + M.G.M
More informationInteractive Visualization of Graph Pyramids
Interactive Visualization of Graph Pyramids Andreas Kerren University of Kaiserslautern, Computer Science Department P.O.Box 3049, D-67653 Kaiserslautern, Germany kerren@acm.org Abstract. Graph or image
More informationFinite-Resolution Simplicial Complexes
1 Finite-Resolution Simplicial Complexes Werner Hölbling, Werner Kuhn, Andrew U. Frank Department of Geoinformation Technical University Vienna Gusshausstrasse 27-29, A-1040 Vienna (Austria) frank@geoinfo.tuwien.ac.at
More informationResearch on Construction of Road Network Database Based on Video Retrieval Technology
Research on Construction of Road Network Database Based on Video Retrieval Technology Fengling Wang 1 1 Hezhou University, School of Mathematics and Computer Hezhou Guangxi 542899, China Abstract. Based
More informationDefiniens. Professional 5. Reference Book. Definiens AG.
Definiens Professional 5 Reference Book Definiens AG www.definiens.com 1 Algorithms Reference Imprint and Version Document Version 5.0.6.1 Copyright 2006 Definiens AG. All rights reserved. This document
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationHyperspectral Image Segmentation using Homogeneous Area Limiting and Shortest Path Algorithm
Hyperspectral Image Segmentation using Homogeneous Area Limiting and Shortest Path Algorithm Fatemeh Hajiani Department of Electrical Engineering, College of Engineering, Khormuj Branch, Islamic Azad University,
More informationMSEG: A GENERIC REGION-BASED MULTI-SCALE IMAGE SEGMENTATION ALGORITHM FOR REMOTE SENSING IMAGERY INTRODUCTION
MSEG: A GENERIC REGION-BASED MULTI-SCALE IMAGE SEGMENTATION ALGORITHM FOR REMOTE SENSING IMAGERY Angelos Tzotsos, PhD Student Demetre Argialas, Professor Remote Sensing Laboratory National Technical University
More informationVC 10/11 T9 Region-Based Segmentation
VC 10/11 T9 Region-Based Segmentation Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos Miguel Tavares Coimbra Outline Region-based Segmentation Morphological
More informationORGANIZATION AND REPRESENTATION OF OBJECTS IN MULTI-SOURCE REMOTE SENSING IMAGE CLASSIFICATION
ORGANIZATION AND REPRESENTATION OF OBJECTS IN MULTI-SOURCE REMOTE SENSING IMAGE CLASSIFICATION Guifeng Zhang, Zhaocong Wu, lina Yi School of remote sensing and information engineering, Wuhan University,
More informationROTATION INVARIANT TRANSFORMS IN TEXTURE FEATURE EXTRACTION
ROTATION INVARIANT TRANSFORMS IN TEXTURE FEATURE EXTRACTION GAVLASOVÁ ANDREA, MUDROVÁ MARTINA, PROCHÁZKA ALEŠ Prague Institute of Chemical Technology Department of Computing and Control Engineering Technická
More informationK-Means Clustering Using Localized Histogram Analysis
K-Means Clustering Using Localized Histogram Analysis Michael Bryson University of South Carolina, Department of Computer Science Columbia, SC brysonm@cse.sc.edu Abstract. The first step required for many
More informationConnecting face hitting sets in planar graphs
Connecting face hitting sets in planar graphs Pascal Schweitzer and Patrick Schweitzer Max-Planck-Institute for Computer Science Campus E1 4, D-66123 Saarbrücken, Germany pascal@mpi-inf.mpg.de University
More informationRemote Sensing Image Analysis via a Texture Classification Neural Network
Remote Sensing Image Analysis via a Texture Classification Neural Network Hayit K. Greenspan and Rodney Goodman Department of Electrical Engineering California Institute of Technology, 116-81 Pasadena,
More informationSymbol Detection Using Region Adjacency Graphs and Integer Linear Programming
2009 10th International Conference on Document Analysis and Recognition Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming Pierre Le Bodic LRI UMR 8623 Using Université Paris-Sud
More informationTriangular Mesh Segmentation Based On Surface Normal
ACCV2002: The 5th Asian Conference on Computer Vision, 23--25 January 2002, Melbourne, Australia. Triangular Mesh Segmentation Based On Surface Normal Dong Hwan Kim School of Electrical Eng. Seoul Nat
More informationBUILDING DETECTION AND STRUCTURE LINE EXTRACTION FROM AIRBORNE LIDAR DATA
BUILDING DETECTION AND STRUCTURE LINE EXTRACTION FROM AIRBORNE LIDAR DATA C. K. Wang a,, P.H. Hsu a, * a Dept. of Geomatics, National Cheng Kung University, No.1, University Road, Tainan 701, Taiwan. China-
More informationNearest Clustering Algorithm for Satellite Image Classification in Remote Sensing Applications
Nearest Clustering Algorithm for Satellite Image Classification in Remote Sensing Applications Anil K Goswami 1, Swati Sharma 2, Praveen Kumar 3 1 DRDO, New Delhi, India 2 PDM College of Engineering for
More informationPHYSICAL BARRIER DETECTION FOR UPDATING OF NAVIGATION DATABASES FROM HIGH RESOLUTION SATELLITE IMAGERY
PHYSICAL BARRIER DETECTION FOR UPDATING OF NAVIGATION DATABASES FROM HIGH RESOLUTION SATELLITE IMAGERY Ma Li a,b, *, Anne Grote c, Christian Heipke c, Chen Jun a, Jiang Jie a a National Geomatics Center
More informationAPPLIED GRAPH THEORY IN COMPUTER VISION AND PATTERN RECOGNITION
APPLIED GRAPH THEORY IN COMPUTER VISION AND PATTERN RECOGNITION Abraham Kandel, Horst Bunke, and Mark Last (Eds.) CHAPTER Multiresolution image segmentations in Graph Pyramids Walter G. Kropatsch, Yll
More informationGrid-Based Genetic Algorithm Approach to Colour Image Segmentation
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho Image Segmentation Identifying and extracting distinct, homogeneous regions from
More informationAUTOMATIC ORIENTATION AND MERGING OF LASER SCANNER ACQUISITIONS THROUGH VOLUMETRIC TARGETS: PROCEDURE DESCRIPTION AND TEST RESULTS
AUTOMATIC ORIENTATION AND MERGING OF LASER SCANNER ACQUISITIONS THROUGH VOLUMETRIC TARGETS: PROCEDURE DESCRIPTION AND TEST RESULTS G.Artese a, V.Achilli b, G.Salemi b, A.Trecroci a a Dept. of Land Planning,
More informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
More informationPlanar Graphs with Many Perfect Matchings and Forests
Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that
More informationGENERATION ALGORITHM OF DISCRETE LINE IN MULTI-DIMENSIONAL GRIDS
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Volume XLII-2/W7, 207 ISPRS Geospatial Week 207, 8 22 September 207, Wuhan, China GENERATION ALGORITHM
More informationReal-Time Rendering (Echtzeitgraphik) Dr. Michael Wimmer
Real-Time Rendering (Echtzeitgraphik) Dr. Michael Wimmer wimmer@cg.tuwien.ac.at Visibility Overview Basics about visibility Basics about occlusion culling View-frustum culling / backface culling Occlusion
More informationSpatial Enhancement Definition
Spatial Enhancement Nickolas Faust The Electro- Optics, Environment, and Materials Laboratory Georgia Tech Research Institute Georgia Institute of Technology Definition Spectral enhancement relies on changing
More informationColor Image Segmentation
Color Image Segmentation Yining Deng, B. S. Manjunath and Hyundoo Shin* Department of Electrical and Computer Engineering University of California, Santa Barbara, CA 93106-9560 *Samsung Electronics Inc.
More informationImage Processing, Analysis and Machine Vision
Image Processing, Analysis and Machine Vision Milan Sonka PhD University of Iowa Iowa City, USA Vaclav Hlavac PhD Czech Technical University Prague, Czech Republic and Roger Boyle DPhil, MBCS, CEng University
More informationLine Segment Based Watershed Segmentation
Line Segment Based Watershed Segmentation Johan De Bock 1 and Wilfried Philips Dep. TELIN/TW07, Ghent University Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium jdebock@telin.ugent.be Abstract. In this
More informationContent-based Image and Video Retrieval. Image Segmentation
Content-based Image and Video Retrieval Vorlesung, SS 2011 Image Segmentation 2.5.2011 / 9.5.2011 Image Segmentation One of the key problem in computer vision Identification of homogenous region in the
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A New Method
More informationUniformity and Homogeneity Based Hierachical Clustering
Uniformity and Homogeneity Based Hierachical Clustering Peter Bajcsy and Narendra Ahuja Becman Institute University of Illinois at Urbana-Champaign 45 N. Mathews Ave., Urbana, IL 181 E-mail: peter@stereo.ai.uiuc.edu
More informationResearch on an Adaptive Terrain Reconstruction of Sequence Images in Deep Space Exploration
, pp.33-41 http://dx.doi.org/10.14257/astl.2014.52.07 Research on an Adaptive Terrain Reconstruction of Sequence Images in Deep Space Exploration Wang Wei, Zhao Wenbin, Zhao Zhengxu School of Information
More informationidentified and grouped together.
Segmentation ti of Images SEGMENTATION If an image has been preprocessed appropriately to remove noise and artifacts, segmentation is often the key step in interpreting the image. Image segmentation is
More informationA Graph Theoretic Approach to Image Database Retrieval
A Graph Theoretic Approach to Image Database Retrieval Selim Aksoy and Robert M. Haralick Intelligent Systems Laboratory Department of Electrical Engineering University of Washington, Seattle, WA 98195-2500
More informationGIS based topology for wireless sensor network modeling: Arc-Node topology approach
GIS based topology for wireless sensor network modeling: Arc-Node topology approach S.Amin Hosseini (Author) Zanjan Branch, Islamic Azad University, Zanjan,. Iran Email: s.a.hosseini86@gmail.com Behrooz
More informationImage segmentation via graph cuts with connectivity priors
Image segmentation via graph cuts with connectivity priors Celline Butuem Soares Rochester Institute of Technology cxb6747@rit.edu ABSTRACT Graph cuts can be applied to many different ends and one possible
More informationScene Text Detection Using Machine Learning Classifiers
601 Scene Text Detection Using Machine Learning Classifiers Nafla C.N. 1, Sneha K. 2, Divya K.P. 3 1 (Department of CSE, RCET, Akkikkvu, Thrissur) 2 (Department of CSE, RCET, Akkikkvu, Thrissur) 3 (Department
More informationTexture Analysis of Painted Strokes 1) Martin Lettner, Paul Kammerer, Robert Sablatnig
Texture Analysis of Painted Strokes 1) Martin Lettner, Paul Kammerer, Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image Processing
More informationTwo-step Modified SOM for Parallel Calculation
Two-step Modified SOM for Parallel Calculation Two-step Modified SOM for Parallel Calculation Petr Gajdoš and Pavel Moravec Petr Gajdoš and Pavel Moravec Department of Computer Science, FEECS, VŠB Technical
More informationWATERSHED, HIERARCHICAL SEGMENTATION AND WATERFALL ALGORITHM
WATERSHED, HIERARCHICAL SEGMENTATION AND WATERFALL ALGORITHM Serge Beucher Ecole des Mines de Paris, Centre de Morphologie Math«ematique, 35, rue Saint-Honor«e, F 77305 Fontainebleau Cedex, France Abstract
More informationApproximating TSP Solution by MST based Graph Pyramid
Approximating TSP Solution by MST based Graph Pyramid Y. Haxhimusa 1,2, W. G. Kropatsch 2, Z. Pizlo 1, A. Ion 2 and A. Lehrbaum 2 1 Department of Psychological Sciences, Purdue University 2 PRIP, Vienna
More informationSTUDYING THE FEASIBILITY AND IMPORTANCE OF GRAPH-BASED IMAGE SEGMENTATION TECHNIQUES
25-29 JATIT. All rights reserved. STUDYING THE FEASIBILITY AND IMPORTANCE OF GRAPH-BASED IMAGE SEGMENTATION TECHNIQUES DR.S.V.KASMIR RAJA, 2 A.SHAIK ABDUL KHADIR, 3 DR.S.S.RIAZ AHAMED. Dean (Research),
More informationCar tracking in tunnels
Czech Pattern Recognition Workshop 2000, Tomáš Svoboda (Ed.) Peršlák, Czech Republic, February 2 4, 2000 Czech Pattern Recognition Society Car tracking in tunnels Roman Pflugfelder and Horst Bischof Pattern
More informationSelf-formation, Development and Reproduction of the Artificial System
Solid State Phenomena Vols. 97-98 (4) pp 77-84 (4) Trans Tech Publications, Switzerland Journal doi:.48/www.scientific.net/ssp.97-98.77 Citation (to be inserted by the publisher) Copyright by Trans Tech
More informationColour Segmentation-based Computation of Dense Optical Flow with Application to Video Object Segmentation
ÖGAI Journal 24/1 11 Colour Segmentation-based Computation of Dense Optical Flow with Application to Video Object Segmentation Michael Bleyer, Margrit Gelautz, Christoph Rhemann Vienna University of Technology
More informationA Object Retrieval Based on Fuzzy Flood Fill Method
Volume 1, Issue 3, October 2013 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Aditya Patel Department of Computer Science and Engineering GEC, (M.P.) [INDIA]
More informationHierarchical Watersheds Within the Combinatorial Pyramid Framework
Hierarchical Watersheds Within the Combinatorial Pyramid Framework Luc Brun, Myriam Mokhtari, and Fernand Meyer GreyC CNRS UMR 6072, Équipe Image - Ensicaen, 6, Boulevard du Maréchal Juin, 14050 CAEN Cedex
More informationTHE CONTOUR TREE - A POWERFUL CONCEPTUAL STRUCTURE FOR REPRESENTING THE RELATIONSHIPS AMONG CONTOUR LINES ON A TOPOGRAPHIC MAP
THE CONTOUR TREE - A POWERFUL CONCEPTUAL STRUCTURE FOR REPRESENTING THE RELATIONSHIPS AMONG CONTOUR LINES ON A TOPOGRAPHIC MAP Adrian ALEXEI*, Mariana BARBARESSO* *Military Equipment and Technologies Research
More informationRobotics Programming Laboratory
Chair of Software Engineering Robotics Programming Laboratory Bertrand Meyer Jiwon Shin Lecture 8: Robot Perception Perception http://pascallin.ecs.soton.ac.uk/challenges/voc/databases.html#caltech car
More informationREGISTRATION OF AIRBORNE LASER DATA TO SURFACES GENERATED BY PHOTOGRAMMETRIC MEANS. Y. Postolov, A. Krupnik, K. McIntosh
REGISTRATION OF AIRBORNE LASER DATA TO SURFACES GENERATED BY PHOTOGRAMMETRIC MEANS Y. Postolov, A. Krupnik, K. McIntosh Department of Civil Engineering, Technion Israel Institute of Technology, Haifa,
More informationAlgorithm That Mimics Human Perceptual Grouping of Dot Patterns
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns G. Papari and N. Petkov Institute of Mathematics and Computing Science, University of Groningen, P.O.Box 800, 9700 AV Groningen, The Netherlands
More informationA Novel Approach for Minimum Spanning Tree Based Clustering Algorithm
IJCSES International Journal of Computer Sciences and Engineering Systems, Vol. 5, No. 2, April 2011 CSES International 2011 ISSN 0973-4406 A Novel Approach for Minimum Spanning Tree Based Clustering Algorithm
More informationA free software tool for automatic tuning of segmentation parameters
A free software tool for automatic tuning of segmentation parameters Pedro Achanccaray a, *, Victor Ayma a, Luis Jimenez b, Sergio Garcia b, Patrick Happ a, Raul Feitosa a,c, Antonio Plaza b a Dept. of
More informationDigital Image Processing. Introduction
Digital Image Processing Introduction Digital Image Definition An image can be defined as a twodimensional function f(x,y) x,y: Spatial coordinate F: the amplitude of any pair of coordinate x,y, which
More informationResearch Article Image Segmentation Using Gray-Scale Morphology and Marker-Controlled Watershed Transformation
Discrete Dynamics in Nature and Society Volume 2008, Article ID 384346, 8 pages doi:10.1155/2008/384346 Research Article Image Segmentation Using Gray-Scale Morphology and Marker-Controlled Watershed Transformation
More informationApplying Catastrophe Theory to Image Segmentation
Applying Catastrophe Theory to Image Segmentation Mohamad Raad, Majd Ghareeb, Ali Bazzi Department of computer and communications engineering Lebanese International University Beirut, Lebanon Abstract
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 07/26 Precoloring extension for K4-minorfree graphs Pruchnewski, Anja; Voigt, Margit November 2007 Impressum: Hrsg.: Leiter des Instituts
More informationWiring Edge-Disjoint Layouts*
Wiring Edge-Disjoint Layouts* Ruth Kuchem 1 and Dorothea Wagner 2 1 RWTH Aachen 2 Fakult~t fiir Mathematik und Informatik, Universit~t Konstanz, 78434 Konstanz, Germany Abstract. We consider the wiring
More informationTexture Segmentation and Classification in Biomedical Image Processing
Texture Segmentation and Classification in Biomedical Image Processing Aleš Procházka and Andrea Gavlasová Department of Computing and Control Engineering Institute of Chemical Technology in Prague Technická
More informationA Modified Approach for Image Segmentation in Information Bottleneck Method
A Modified Approach for Image Segmentation in Information Bottleneck Method S.Dhanalakshmi 1 and Dr.T.Ravichandran 2 Associate Professor, Department of Computer Science & Engineering, SNS College of Technology,Coimbatore-641
More informationUnsupervised Change Detection in Remote-Sensing Images using Modified Self-Organizing Feature Map Neural Network
Unsupervised Change Detection in Remote-Sensing Images using Modified Self-Organizing Feature Map Neural Network Swarnajyoti Patra, Susmita Ghosh Department of Computer Science and Engineering Jadavpur
More informationCS 664 Segmentation. Daniel Huttenlocher
CS 664 Segmentation Daniel Huttenlocher Grouping Perceptual Organization Structural relationships between tokens Parallelism, symmetry, alignment Similarity of token properties Often strong psychophysical
More informationDigital Halftoning Algorithm Based o Space-Filling Curve
JAIST Reposi https://dspace.j Title Digital Halftoning Algorithm Based o Space-Filling Curve Author(s)ASANO, Tetsuo Citation IEICE TRANSACTIONS on Fundamentals o Electronics, Communications and Comp Sciences,
More informationImage Segmentation Via Iterative Geodesic Averaging
Image Segmentation Via Iterative Geodesic Averaging Asmaa Hosni, Michael Bleyer and Margrit Gelautz Institute for Software Technology and Interactive Systems, Vienna University of Technology Favoritenstr.
More informationImage Segmentation With Maximum Cuts
Image Segmentation With Maximum Cuts Slav Petrov University of California at Berkeley slav@petrovi.de Spring 2005 Abstract This paper presents an alternative approach to the image segmentation problem.
More informationModel-based segmentation and recognition from range data
Model-based segmentation and recognition from range data Jan Boehm Institute for Photogrammetry Universität Stuttgart Germany Keywords: range image, segmentation, object recognition, CAD ABSTRACT This
More informationRecognition-based Segmentation of Nom Characters from Body Text Regions of Stele Images Using Area Voronoi Diagram
Author manuscript, published in "International Conference on Computer Analysis of Images and Patterns - CAIP'2009 5702 (2009) 205-212" DOI : 10.1007/978-3-642-03767-2 Recognition-based Segmentation of
More information