Area and perimeter calculation using super resolution algorithms M. P. Cipolletti – C. A. Delrieux – M. C. Piccolo – G. M. E. Perillo IADO – UNS – CONICET.

Slides:



Advertisements
Similar presentations
Goal: a graph representation of the topology of a gray scale image. The graph represents the hierarchy of the lower and upper level sets of the gray level.
Advertisements

Reconstruction from Voxels (GATE-540)
A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
QR Code Recognition Based On Image Processing
電腦視覺 Computer and Robot Vision I
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Tagging of digital historical images Authors: A. N. Talbonen A. A. Rogov Petrozavodsk state university.
Person Re-Identification Application for Android
Computer Vision Lecture 16: Region Representation
Each pixel is 0 or 1, background or foreground Image processing to
Ahmed Awad Atsushi Takahash Satoshi Tanakay Chikaaki Kodamay ICCAD’14
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
IS THERE A MORE COMPUTATIONALLY EFFICIENT TECHNIQUE FOR SEGMENTING THE OBJECTS IN THE IMAGE? Contour tracking/border following identify the pixels that.
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
Data Structures For Image Analysis
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
7. Neighbourhood operations A single pixel considered in isolation conveys information on the intensity and colour at a single location in an image, but.
Regionalized Variables take on values according to spatial location. Given: Where: A “structural” coarse scale forcing or trend A random” Local spatial.
Preprocessing ROI Image Geometry
Highlights Lecture on the image part (10) Automatic Perception 16
1Ellen L. Walker Matching Find a smaller image in a larger image Applications Find object / pattern of interest in a larger picture Identify moving objects.
Introduction to Digital Data and Imagery
Digital Image Processing
By Yevgeny Yusepovsky & Diana Tsamalashvili the supervisor: Arie Nakhmani 08/07/2010 1Control and Robotics Labaratory.
Image Formation. Input - Digital Images Intensity Images – encoding of light intensity Range Images – encoding of shape and distance They are both a 2-D.
October 14, 2014Computer Vision Lecture 11: Image Segmentation I 1Contours How should we represent contours? A good contour representation should meet.
CS654: Digital Image Analysis Lecture 3: Data Structure for Image Analysis.
Digital Image Processing Lecture 20: Representation & Description
CS 6825: Binary Image Processing – binary blob metrics
Image Representation. Objectives  Bitmaps: resolution, colour depth and simple bitmap file calculations.  Vector graphics: drawing list – objects and.
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
September 5, 2013Computer Vision Lecture 2: Digital Images 1 Computer Vision A simple two-stage model of computer vision: Image processing Scene analysis.
Digital Image Processing CCS331 Relationships of Pixel 1.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
Fourier Descriptors For Shape Recognition Applied to Tree Leaf Identification By Tyler Karrels.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Similar Figures, Day 2. Warm Up Two figures are similar if one can be obtained from the other using a sequence of transformations in the plane.
INTRODUCTION TO GIS  Used to describe computer facilities which are used to handle data referenced to the spatial domain.  Has the ability to inter-
FACE DETECTION : AMIT BHAMARE. WHAT IS FACE DETECTION ? Face detection is computer based technology which detect the face in digital image. Trivial task.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
SIFT DESCRIPTOR K Wasif Mrityunjay
Data Models, Pixels, and Satellite Bands. Understand the differences between raster and vector data. What are digital numbers (DNs) and what do they.
MultiModality Registration Using Hilbert-Schmidt Estimators By: Srinivas Peddi Computer Integrated Surgery II April 6 th, 2001.
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
 An image is the new figure, and the preimage is the original figure  Transformations-move or change a figure in some way to produce an image.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Spatial Data Models Geography is concerned with many aspects of our environment. From a GIS perspective, we can identify two aspects which are of particular.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Chapter 11 Representation and.
Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Distortions in imagery:
Image Representation and Description – Representation Schemes
INTRODUCTION TO GEOGRAPHICAL INFORMATION SYSTEM
Digital Image Processing Lecture 20: Representation & Description
Bag-of-Visual-Words Based Feature Extraction
José Manuel Iñesta José Martínez Sotoca Mateo Buendía
Mean Shift Segmentation
Statistical surfaces: DEM’s
Computer Vision Lecture 5: Binary Image Processing
Computer Vision Lecture 16: Texture II
Computer and Robot Vision I
Comparing Images Using Hausdorff Distance
Area and Perimeter Review
Fourier Transform of Boundaries
7th Annual STEMtech conference
UNIT SELF-TEST QUESTIONS
Computed Tomography (C.T)
Presentation transcript:

Area and perimeter calculation using super resolution algorithms M. P. Cipolletti – C. A. Delrieux – M. C. Piccolo – G. M. E. Perillo IADO – UNS – CONICET & Comparison of results with pre-existing methods

PURPOSE OF THIS WORK -Data acquisition by non invasive methods -Development of a robust algorithm for area and perimeter calculation from digital images. -Utilization of standard low resolution satellite images. -Application of the new methods to study geographic features.

PREVIOUS CONSIDERATIONS Band 1Band 2 Band 3Band 4Band 5Band 7 -The original image is of B-band type. -Resolution is measured in L meters per pixel. Images Landsat 7 ® Resolution 30 meters per pixel

PREVIOUS CONSIDERATIONS - Utilization of a rectangular grid of i rows by j columns. -Each pixel has a square surface of LxL m 2 and its luminance value is Y.

PREVIOUS CONSIDERATIONS A threshold chosen from the luminance histogram is used to compute a (binary) black and white mask from the grey scale original picture. Grey scale image Mask 1: Threshold =127 Mask 2: Threshold =160 Histogram

SEGMENTATION -The calculation of a scalar function d(i,j) is then carried out for each pixel, evaluating the distance between that pixel and a reference (or prototype) value. -The value of d(i,j) is associated to a level of grey in the picture. -The ground-truth is chosen in such a way that it provides the luminance data of each band characterizing the object to be segmented. - An auxiliary image is constructed in levels of grey. Distance Image

SEGMENTATION Distance Image Mask Image Clear mask Image

TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION Outside borders of pixels The most simple method for perimeter calculation uses the mask image, computing it as the sum of the outside pixels borders. -All pixels are tested and for each one that belongs to the object (white pixel), the 4 neighboring pixels are also analyzed. -Each neighboring pixel outside the figure adds L to the calculation, giving as a result the total perimeter at the end of the loop.

TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION -The total area is taken as the sum of the square L 2 areas corresponding to the pixels inside the object. Outside borders of pixels

TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION Outside borders of pixels -Advantage: Implementation is fast and simple. Disadvantages: -Strongly affected by the image resolution. -Error increases if shape, orientation and/or size of the object changes. -In general, results for the values of perimeter and area are both over-dimensioned, but the error in the perimeter is much bigger.

TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION Chain code Uses the mask considering the perimeter as a chain that surrounds the object through the center of the inside pixels next to the border. -Analyzes each pixel and its neighbors and, depending on the configuration, it determines the contour of the object moving in right angles or in 45 degrees. - For the area calculation, L 2 is added if the pixel is completely inside the object, and L 2 /2 if the pixel corresponds to a turn in 45 degrees.

TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION Chain code

TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION Chain code

-Advantage: Results are more precise. -Disadvantages: The main source of error is due to objects of small size, although resolution, shape and orientation also alter the result. Solutions usually provide perimeter and area results smaller than real measures. TRADITIONAL METHODS FOR AREA AND PERIMETER CALCULATION

Description SUPER RESOLUTION METHOD - Given two neighboring pixels, p 0 belonging to the object and p 1 outside of it, the coordinates of the frontier point P A are determined by a coefficient alpha. - Alpha relates the values of luminance between p0 and p1 with the threshold value used for segmentation. - P A will be located over the line segment that connects the center of both pixels.

Description SUPER RESOLUTION METHOD There are 4 possible configurations and their rotations. Once the contour points have been determined, the frontier segments are computed as the Euclidean distance between them.

Description SUPER RESOLUTION METHOD The area is calculated as the sum of the areas of the polygons that compose the object.

Results – Analysis for the object size SUPER RESOLUTION METHOD

Results – Analysis for the object size SUPER RESOLUTION METHOD

Results – Analysis for the object size SUPER RESOLUTION METHOD

Results – Analysis for the object rotation SUPER RESOLUTION METHOD

Results – Analysis for the object rotation – 0 degrees SUPER RESOLUTION METHOD

Results – Analysis for the object rotation – 1 degree SUPER RESOLUTION METHOD

Results – Analysis for the object rotation – 25 degrees SUPER RESOLUTION METHOD

Results – Analysis for the object rotation – 45 degrees SUPER RESOLUTION METHOD

Results – Measurement of a field SUPER RESOLUTION METHOD

Results – Measurement of a field SUPER RESOLUTION METHOD

Conclusions -Developed to overcome the disadvantages found in the traditional methods described before. -Uses additional information provided by the luminance which is lost after the threshold is applied to the image for computing the mask. -The resulting method is robust and the results obtained are more precise than those achievable by the other methods for images of the same resolution. -Minimizes errors caused by orientation, shape and size of the object. SUPER RESOLUTION METHOD

END Thank you!