ELIESER : USER MANUAL

Similar documents
MODE-PP HTML: A GDMO/GRM to HTML translator -Release 1.0- Reference Manual

A Non-Maxima Suppression Method for Edge Detection with Sub-Pixel Accuracy

Interactive Axial Deformations

A Markovian Model For Contour Grouping.

Hamilton Cycle Decomposition of the Butterfly Network

Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.

IP Simulator User Guide

An Integrated 2D Systolic Array for Spelling Correction

Multiplication by an Integer Constant

Camcal v1.0 Manual A Complete Software Solution for Camera Calibration

Improving Goldschmidt Division, Square Root and Square Root Reciprocal

Performance issues with IEEE in ad hoc networking

An Experimental User Level Implementation of TCP.

Computing connected dominated sets with multipoint relays

On the definition of ulp(x)

Distributed termination detection : General model and algorithms

Comparison of SUPG and FVG techniques on KSR-1

SecSip Technical Documentation

SecSIP User Documentation

Elementary transformation analysis for Array-OL

Performance Evaluation of Multicast Trees in Adhoc Networks

Replication and Caching Strategies in Cadmium

Towards Phase Change Memory as a Secure Main Memory

Interactive and Immersive Simulation using the Continuous Sensitivity Equation Method with Application to Thermal Transport

Accelerating Floating-Point Division When the Divisor is Known in Advance

IPv6 Neighbor Discovery Protocol based OS fingerprinting

A New Mechanism for Transmission Notification on SMP

Real-Parameter Black-Box Optimization Benchmarking 2009 Software: User Documentation

A Hierarchical Mobile IPv6 Proposal

MANET Router Configuration Recommendations

A Framework for High Availability Based on a Single System Image

Hash-Based Dynamic Source Routing (HB-DSR)

I/O and Computation Overlap on SIMD Systolic Arrays

NetFlow, RMON and Cisco-NAM deployment

Duplicate Address Detection in Wireless Ad Hoc Networks Using Wireless Nature

Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy

Animated Image Compression in CATSERVER - preliminary description

Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus

On Using Matching Theory to Understand P2P Network Design

Faster Triangle-Triangle Intersection Tests

Robust matching by partial correlation 1

OSCAR on Debian: the EDF Experience

An analysis of the Multi-Point Relays selection in OLSR

Convergence speed of a link-state protocol for IPv6 router autoconfiguration

IPv6 Operation for WAVE - Wireless Access in Vehicular Environments

Ananas : A New Adhoc Network Architectural Scheme

Organization of the Modulopt collection of optimization problems in the Libopt environment Version 1.0

Constructing elimination trees for sparse unsymmetric matrices

Shared Virtual Memory and Message Passing Programming on a Finite Element Application

Extending Mobile IP with Adaptive Individual Paging : A Performance Analysis

Syscall Interception in Xen Hypervisor

The Impact of Branch Prediction on Control Structures for Dynamic Dispatch in Java

Camera Calibration Using Silhouettes

NEWMADELEINE: a Fast Communication Scheduling Engine for High Performance Networks

A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform

Using data analysis to approximate fastest paths on urban networks

List Ranking on PC clusters

Atomic token passing in the context of spontaneous communications

Model-based Cluster and Discriminant Analysis with the MIXMOD software

Tracking Meteorological Structures through Curves Matching Using Geodesic Paths

The Semi-Lagrangian Method for the Numerical Resolution of Vlasov Equations

A Craniofacial Surgery Simulation Testbed

Balancing clusters to reduce response time variability in large scale image search

Extending the entry consistency model to enable efficient visualization for code-coupling grid applications

MPLS label stacking on the line network

A Circuit-based Approach for Routing in Unidirectional Links Networks

Perlin Textures in Real Time using OpenGL

Feature-Based Facial Expression Recognition: Experiments With a Multi-Layer Perceptron

Validation of surface velocity estimated from satellite images

POM: a Virtual Parallel Machine Featuring Observation Mechanisms

A Myrinet Firmware development experience

Improving TCP/IP over Geostationary Satellite Links

Comparison of TCP Reno and TCP Vegas via Fluid Approximation

CRDTs: Consistency without concurrency control

Cortex Unfolding Using Level Set Methods

Implementation of IP Proportional Differentiation with Waiting-Time Priority and Proportional Loss Rate dropper in Linux

Fast Binary Image Processing Using Binary Decision Diagrams

Deployment of Flower-CDN

A MANET Architectural Model

WDM Mesh Networks with Dynamic Traffic

Logoot: a P2P collaborative editing system

Laboratoire de l Informatique du Parallélisme

Wooki: a P2P Wiki-based Collaborative Writing Tool

Hardware/Software Exploration for an Anti-collision Radar System

File Sharing in P2P : Missing Block Paradigmand upload strategies

Integration of Global Information for Roads Detection In Satellite Images

INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE. Algorithm Engineering and VLSI Design. William Marnane and Rumen Andonov N 2058

FPGA Configuration of Intensive Multimedia Processing Tasks Modeled in UML

Accurate emulation of CPU performance

An a contrario approach to hierarchical clustering validity assessment

Lines tangent to four triangles in three-dimensional space

Circuit-Switched Gossiping in the 3-Dimensional Torus Networks

Facial non-repetitive edge-colouring of plane graphs

Visual servoing in computer animation

Heuristics for Network Coding in Wireless Networks

Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks

Routing and Broadcasting in Hybrid Ad Hoc Networks

An efficient unified approach to direct image registration of rigid and deformable surfaces

Experiments with b in ad-hoc configurations

IPv4 to IPv6 Transition Engine

Transcription:

INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE ELIESER : USER MANUAL Nicolas MERLET, Josiane ZERUBIA N 0180 Septembre 1995 PROGRAMME 4 apport technique ISSN 0249-6399

ELIESER : USER MANUAL Nicolas MERLET, Josiane ZERUBIA Programme 4 Robotique, image et vision Projet Pastis Rapport technique n0180 Septembre 1995 19 pages Abstract: ELIESER (Extraction de Lignes sur ImagEs Satellite avec une Energie par Regions) is a software for detecting lines on satellite images. It has been developed jointly at INRIA Sophia-Antipolis and at the Hebrew University of Jerusalem, and implemented using Motif c in a package (iview) developed at INRIA. We present herein its interface. Key-words: ELIESER, Motif, lines detection, satellite images (Resume : tsvp) This work was partially supported by an AFIRST-MOST grant (French-Israeli Scientic Cooperation). Institute of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel, Email : nicolas@cs.huji.ac.il Email : zerubia@bach.inria.fr Unité de recherche INRIA Sophia-Antipolis 2004 route des Lucioles, BP 93, 06902 SOPHIA-ANTIPOLIS Cedex (France) Téléphone : (33) 93 65 77 77 Télécopie : (33) 93 65 77 65

ELIESER : MANUEL UTILISATEUR Resume : ELIESER (Extraction de Lignes sur ImagEs Satellite avec une Energie par Regions) est un programme de detection de lignes sur images satellitaires. Il a ete developpe conjointement a l'inria Sophia-Antipolis (France) et a l'universite Hebraique de Jerusalem (Israel), et integre sous Motif c dans un systeme (iview) developpe a l'inria. Nous en presentons ici l'interface. Mots-cle : ELIESER, Motif, detection de lignes, images satellitaires

ELIESER : User Manual 3 1 Introduction ELIESER (Extraction de Lignes sur ImagEs Satellite avec une Energie par Regions) is a software for detecting lines on satellite images. It is based on dynamic programming, an optimization method which consists of dening a potential depending on the local characteristics of the image, and of performing an iterative summationminimization process. More precisely, ELIESER extends the F* algorithm of Fischler in two directions. First, the potential is dened on several points ([1],[2]). This allows to combine in the same cost the notions of contrast, grey-level and curvature. Second, ELIE- SER uses an automatic method [3] for dening the potentials as the inverse of the conditional probabilities of contrast and grey-level along initial line segments. A deposit of ELIESER has been made at the APP [4]. It has been developed jointly at INRIA Sophia-Antipolis and at the Hebrew University of Jerusalem, and implemented using Motif c in a package (iview) developed at INRIA. RT n0180

4 N. Merlet, J. Zerubia 2 Getting started When running the package, a rst menu appears (Fig. 1). One should click with the mouse on Load. Figure 1: Initial menu Then, a temporary window appears for selecting the input le. It is similar to the one appearing in Fig. 4 and it oers the possibility of navigating through the directories as well. When writing the name of a directory (ended by /*) in the Filter window and pressing the Filter button, the content of this directory appears in the Files window. Alternatively, one may choose a directory by clicking the left button of the mouse on one of the directories in the Directories window and pressing the Filter button. Selecting a le may be obtained by clicking the left button of the mouse on one of the les in the Files window or by writing its path and name in the Load image window. Note : in Fig. 4, the window is used for an other purpose and the Load image window is called there Output image. When a le has been selected, the choice is validated by pressing the Ok button. Scrolling the content of the various windows up and down may be obtained by moving the mouse (with middle button pressed) on the right vertical bar, or by clicking the middle button on the arrows which gure at the top and bottom of the bar. After selecting the input le, a second menu appears, which displays the image as well (Fig. 2). One should click with the mouse on Utilities. A temporary menu appears, where the ELIESER software is activated by clicking on Roads detection. When ELIESER has been selected, its menu is displayed (Fig. 3), and the information needed for running it can be provided by the user, or automatically. INRIA

ELIESER : User Manual 5 Figure 2: Image menu RT n0180

6 N. Merlet, J. Zerubia Figure 3: ELIESER menu INRIA

ELIESER : User Manual 7 3 Selecting the les First, the name of the output le should be provided. One clicks on Output and selects a le in a temporary window (Fig. 4). Please see 2- Getting started for explanations on how to select a le. The output image will contain the initial image, on which the detected lines are shown in white. A mask may be selected similarly, by clicking on Mask, according to the application. No mask may be selected as well. If a mask is used, it should be a binary image where the non-zero values show regions where the roads should not go, such as the sea, or such as regions outside of the camera eld. In the following, the potential should have low values on the roads and for the characteristics of the roads, and high values in regions where the roads should not go through. When a mask is used, an innite value is given to the potential on these regions. Fig. 5 shows the menu of ELIESER after an output image has been selected, and when no mask is used. RT n0180

8 N. Merlet, J. Zerubia Figure 4: Selecting an output le INRIA

ELIESER : User Manual 9 RT n0180 Figure 5: ELIESER menu after selecting the output

10 N. Merlet, J. Zerubia 4 Selecting the extremities The extremities of the lines should then be selected. We partition the extremities in two sets of points S 0 and S 1 where each road or line sought has one extremity in S 0 and the other one in S 1. The number of points in the set S 0 (or S 1 ) appears after Extremity S0 (or Extremity S1). Initially, zero appears at both locations. In the following we present only the part of the menu which we deal with at each step, while Fig. 5 shows the complete menu of ELIESER. For adding an extremity, one should move the mouse on the image, position it on the desired point, and click on the left button of the mouse for adding this point to S 0 and on the right button for adding it to S 1. The coordinates of the selected point, which appear in the small windows x and y of the image menu, are then copied in the windows of S 0 or S 1 of the ELIESER menu. The number appearing after Extremity S0 (or Extremity S1) is automatically updated. Fig. 6 shows the image menu and the part of the ELIESER menu which deals with the line extremities. When many points are selected, one may wish to scroll up and down the array of points, by moving the mouse (with middle button pressed) on the right vertical bar, or by clicking on the arrows which gure at the top and bottom of the bar. Figure 6: Adding a point to S0 For removing an extremity, one should move the mouse on the array of points of S 0 (or S 1 ), position the mouse on the desired point, and click twice on the left button of the mouse. This point is then marked in negative (Fig. 7). Then, one should click on the delete button corresponding to S 0 (or S 1 ) (Fig. 8). The point vanishes from the array, and the number appearing after Extremity S0 (or Extremity S1) is automatically updated. INRIA

ELIESER : User Manual 11 The program may be run only after an output le has been specied, and after at least one point has been selected for S 0 and one point for S 1. RT n0180

12 N. Merlet, J. Zerubia Figure 7: Marking a point of S0 Figure 8: Deletion of the marked point of S0 INRIA

ELIESER : User Manual 13 5 Dening the potential Below the extremities, we should dene the potential in the menu. The general potential is the sum of three components : the curvature potential, the grey-level potential, and the contrast potential. One may write a value for the Curvature constraint (Fig. 9). Initially it is equal to a default value. Figure 9: Manual potential On the same line as the Curvature, there is a button Load output. If it is not pressed, the result of the computation will be displayed on the screen, otherwise it will not be displayed. We will consider only dening the potential of grey-level in the following, since dening the potential of contrast is done in the same way. There are two possibilities : dening the potentials manually. This is the initial conguration : a standard potential is provided, the same for any input image (Fig. 9). dening the potential automatically. It is then computed from statistical information around the extremities (the extremities S 0 and S 1 have to be dened RT n0180

14 N. Merlet, J. Zerubia rst). It is activated by clicking on manual potential and selecting automatic potential in the pop-up menu (Fig. 10). Returning to the manual potential is obtained in the same way, by clicking on automatic potential and selecting manual potential in the pop-up menu. The x-axis represents the grey-levels from 0 to +255 in the left graphic, and the contrast from?255 to +255 in the right graphic. The y-axis represents the values of the potential for these values of grey-level and contrast. Figure 10: Automatic potential In both cases (manual or automatic), the potential functions are approximated as piecewise linear functions, and are perfectly dened by the small number of extremities F i of the corresponding segments. This number of extremities appears after Grey-level (or Contrast), above the graphics. It is possible to add or remove such points F i, to change the shape of the potentials. For adding a point, one should move the mouse on the potential curve and click on the left button. If a point already exists at the same abscissa as the desired point, then the value of the potential is changed, but the number of F i points appearing after Grey-level (or Contrast) remains the same. Otherwise, the potential is changed and the number of points is incremented automatically (Fig. 11). INRIA

ELIESER : User Manual 15 For removing a point, one should move the mouse on the potential curve and click on the right button. It is not necessary to point exactly at the desired F i point, since the point which is removed is the closest F i point to the selected point anyway (Fig. 12). The number of F i points appearing after Grey-level (or Contrast) is updated automatically. It is not possible to remove the points at the extremities of the curves (0 and 255 for the grey-level potential,?255 and +255 for the contrast potential), only to change the value of the potential there, and the number of F i points is always greater or equal to two. RT n0180

16 N. Merlet, J. Zerubia Figure 11: Adding points to the potential Figure 12: Deleting points from the potential INRIA

ELIESER : User Manual 17 6 Controlling the execution When all the necessary data have been provided to the menu, one may click on Run (below the graphics of the potentials), which runs ELIESER (Fig. 13). The resulting information is printed in the State window, while temporary information is printed during the computation in the window below. The temporary information may be scrolled up and down by pressing the middle button of the mouse on the right vertical bar, or by clicking on the arrows which gure at the top and bottom of the bar. If Load output has not been pressed, a new Image menu appears then, showing the image computed by ELIESER. Clicking the Close button closes the ELIESER menu, while clicking the Help button displays a help window. Figure 13: Controlling execution RT n0180

18 N. Merlet, J. Zerubia References [1] N. Merlet, J. Zerubia, \Classical Mechanics and Road Detection in SPOT Images". Joint Research Report 1889, INRIA/Hebrew University, April 1993. [2] N. Merlet, J. Zerubia, \A curvature-dependent energy function for detecting lines in satellite images". 8th SCIA Conference, Tromso, May 25-28th, 1993. [3] N. Merlet, J. Zerubia, \New prospects in line detection for remote sensing images", ICASSP, Adelaide, 22 April 1994. [4] J. Zerubia, N. Merlet, \ELIESER", Deposit 94-38-014-00 at the APP (Agence de Protection des Programmes) by the Hebrew University (Israel) and INRIA (France), Sept. 23th, 1994. INRIA

ELIESER : User Manual 19 Contents 1 Introduction 3 2 Getting started 4 3 Selecting the les 7 4 Selecting the extremities 10 5 Dening the potential 13 6 Controlling the execution 17 RT n0180

Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 46 avenue Félix Viallet, 38031 GRENOBLE Cedex 1 Unité de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unité de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP 93, 06902 SOPHIA-ANTIPOLIS Cedex Éditeur INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex (France) ISSN 0249-6399