Intensity transformations



Similar documents
Sharpening through spatial filtering

Introduction. Stefano Ferrari. Università degli Studi di Milano Elaborazione delle immagini (Image processing I)

Lectures 6&7: Image Enhancement

Chapter 2. Point transformation. Look up Table (LUT) Fundamentals of Image processing

Lesson 15 - Fill Cells Plugin

Physical Self-Calibration of X-ray and SZ Surveys

F.IF.7e Analyze functions using different representations. Graph exponential and logarithmic functions, showing intercept and end behavior.

Grade 6 Mathematics Performance Level Descriptors

Euler Vector: A Combinatorial Signature for Gray-Tone Images

Digital Image Fundamentals. Selim Aksoy Department of Computer Engineering Bilkent University

REAL TIME TRAFFIC LIGHT CONTROL USING IMAGE PROCESSING

Arithmetic Coding: Introduction

Data Mining and Neural Networks in Stata

FRANCESCO BELLOCCHIO S CURRICULUM VITAE ET STUDIORUM

South Carolina College- and Career-Ready (SCCCR) Algebra 1

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

C. elegans motility analysis in ImageJ - A practical approach

Basic Image Processing (using ImageJ)

How To Model Surfaces With Rp

Data Storage 3.1. Foundations of Computer Science Cengage Learning

DYNAMIC RANGE IMPROVEMENT THROUGH MULTIPLE EXPOSURES. Mark A. Robertson, Sean Borman, and Robert L. Stevenson

CHAPTER 3: DIGITAL IMAGING IN DIAGNOSTIC RADIOLOGY. 3.1 Basic Concepts of Digital Imaging

Color image processing: pseudocolor processing

A RAPID METHOD FOR WATER TARGET EXTRACTION IN SAR IMAGE

Anamorphic imaging with three mirrors: a survey

Equations. #1-10 Solve for the variable. Inequalities. 1. Solve the inequality: Solve the inequality: 4 0

Visualization of 2D Domains

Robust Real-Time Face Detection

Course Structure 2015/2016

FACTORING SPARSE POLYNOMIALS

Data Mining. Cluster Analysis: Advanced Concepts and Algorithms

Simultaneous Gamma Correction and Registration in the Frequency Domain

Administrative - Master Syllabus COVER SHEET

CHAPTER 6 TEXTURE ANIMATION

DATA LAYOUT AND LEVEL-OF-DETAIL CONTROL FOR FLOOD DATA VISUALIZATION

FINAL EXAM SECTIONS AND OBJECTIVES FOR COLLEGE ALGEBRA

Taking Inverse Graphics Seriously

Audio Hashing for Spam Detection Using the Redundant Discrete Wavelet Transform

Vision based Vehicle Tracking using a high angle camera

Raster Operations. Local, Neighborhood, and Zonal Approaches. Rebecca McLain Geography 575 Fall Raster Operations Overview

Reading.. IMAGE COMPRESSION- I IMAGE COMPRESSION. Image compression. Data Redundancy. Lossy vs Lossless Compression. Chapter 8.

Simplify the rational expression. Find all numbers that must be excluded from the domain of the simplified rational expression.

Processing Data with rsmap3d Software Services Group Advanced Photon Source Argonne National Laboratory

Multiscale Object-Based Classification of Satellite Images Merging Multispectral Information with Panchromatic Textural Features

Object Recognition and Template Matching

An Experimental Study of the Performance of Histogram Equalization for Image Enhancement

HSI BASED COLOUR IMAGE EQUALIZATION USING ITERATIVE n th ROOT AND n th POWER

CONCEPT-II. Overview of demo examples

RUN-LENGTH ENCODING FOR VOLUMETRIC TEXTURE

Image Segmentation and Registration

Theory and Methods of Lightfield Photography SIGGRAPH 2009

Water Flow in. Alex Vlachos, Valve July 28, 2010

Screen Capture A Vector Quantisation Approach

The zcorrectorgui. Daniel J. Graham PhD NESAC/BIO

Introduction. Chapter 1

Cluster Analysis: Advanced Concepts

Graphic Designing with Transformed Functions

Full-field kinematic measurements by Digital Image Correlation for material characterization at different scales

A Load Balancing Algorithm against DDoS Attacks in Beyond 3G Wireless Networks

NEW MEXICO Grade 6 MATHEMATICS STANDARDS

South Carolina College- and Career-Ready (SCCCR) Pre-Calculus

WHITE PAPER. Methods for Measuring Flat Panel Display Defects and Mura as Correlated to Human Visual Perception

2.1 Increasing, Decreasing, and Piecewise Functions; Applications

is in plane V. However, it may be more convenient to introduce a plane coordinate system in V.

An Introduction to the MTG-IRS Mission

Data Storage. Chapter 3. Objectives. 3-1 Data Types. Data Inside the Computer. After studying this chapter, students should be able to:

Oracle Primavera P6 Reporting & Analytics. Stefano Lentini Oracle Primavera Senior Sales Consultant

Comparative Analysis of EM Clustering Algorithm and Density Based Clustering Algorithm Using WEKA tool.

The Spatiotemporal Visualization of Historical Earthquake Data in Yellowstone National Park Using ArcGIS

A Fast Algorithm for Multilevel Thresholding

Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks

WHAT IS GIS - AN INRODUCTION

High-resolution Imaging System for Omnidirectional Illuminant Estimation

Georgia Standards of Excellence Mathematics

Novelty Detection in image recognition using IRF Neural Networks properties

JPEG A Short Tutorial

Fast and Robust Normal Estimation for Point Clouds with Sharp Features

OBJECT TRACKING USING LOG-POLAR TRANSFORMATION

Socio-semantic network data visualization

J. P. Oakley and R. T. Shann. Department of Electrical Engineering University of Manchester Manchester M13 9PL U.K. Abstract

1. Introduction to image processing

Image Compression through DCT and Huffman Coding Technique

Remote Sensing, GPS and GIS Technique to Produce a Bathymetric Map

Clustering Digital Data by Compression: Applications to Biology and Medical Images

The STC for Event Analysis: Scalability Issues

Business Intelligence for The Internet of Things

Hexadecimal and Numeric Indicators. Technical Data

Static Program Transformations for Efficient Software Model Checking

Calibration Best Practices

An Energy-Based Vehicle Tracking System using Principal Component Analysis and Unsupervised ART Network

LIST OF CONTENTS CHAPTER CONTENT PAGE DECLARATION DEDICATION ACKNOWLEDGEMENTS ABSTRACT ABSTRAK

To define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions

Implementation and Comparison of Various Digital Signature Algorithms. -Nazia Sarang Boise State University

DEVELOPMENT OF AN IMAGING SYSTEM FOR THE CHARACTERIZATION OF THE THORACIC AORTA.

6.1 Add & Subtract Polynomial Expression & Functions

Chapter 3 Graphics and Image Data Representations

An Introduction to the Use of Bayesian Network to Analyze Gene Expression Data

Introduction to image coding

Unit 3 - Lesson 3. MM3A2 - Logarithmic Functions and Inverses of exponential functions

Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities

Transcription:

Intensity transformations Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Elaborazione delle immagini (Image processing I) academic year 2011 2012 Spatial domain The spatial domain of an image is the plane that contains the image pixels. The techniques that operates on the spatial domain make direct use of the information contained into the matricial representation of the image; in contrast to other techniques that operate onto representation of the image in other domains (which is computed through a suitable transform). This kind of techniques can be formalized as: g(x, y) = T [f (x, y)] Generally, spatial domain techniques are less computationally demanding. Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 1

Transformations in the spatial domain The operator, T, is usually defined on a suitable neighborhood of (x, y). A rectangular neighborhood is usually preferred. When the neighborhood fall outside the image, some exestending criteria have to be used: (background-padding, zero-padding, symmetry). If the radius of the neighborhood is 0, the transformation involves only the considered pixel and depends (only) by its intensity: s = T (r) intensity transformation or gray-level mapping. Intensity transformations Intensity transformation techniques are also called point-processing, as opposed to the neighborhood processing techniques. Simple to implement (algorithm, table map). They are used for enhancing images that are devoted to visual processing: no general rule for stating the optimality; application-dependent; user-dependent. Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 2

Image negative Sometimes, the details are more detectable when the pixels intensity is reversed. For instance, when the details are white or light gray and the background is dark and covers the most of the image. s = L 1 r Logarithmic transformations s = c log(1 + r), c = L 1 log L Useful for representing bidimensional functions that are defined on large intervals and have high and small peaks. e.g.: f : [0, 1] 2 [0, 10 6 ] Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 3

Gamma transformations Also called power-law transformations. s = c r γ (sometimes s = c (r + ɛ) γ ) Used for correcting the visualization devices output. Useful for contrast correction (or improvement). A too large or too small value for γ can compromise the results. Gamma transformations (2) If the gamma correction factor of the average visualization device is known in advace, a suitable image intensity correction can applied before the visualization. Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 4

. Gamma transformations (3) a c b d (a) Original image. Gamma transformed images with c = 1, γ = 0.6 (b), c = 1, γ = 0.4 (c), and c = 1, γ = 0.3 (d). Which is the best? Gamma transformations (4) a c b d Gamma correction can be applied also for darkening images. (a) Original image. Gamma transformed images with c = 1, γ = 3.0 (b), c = 1, γ = 4.0 (c), and c = 1, γ = 5.0 (d). Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 5

Contrast stretching transformations a c b d (a) General shape of the contrast stretching transformations. (b) Low-contrast image. (c) A processed image. (r 1, s 1 ) = (r min, 0) (r 2, s 2 ) = (r max, L 1) (d) Thresholding can be view as the limit of the contrast stretching. (r 1, s 1 ) = (r thr, 0) (r 2, s 2 ) = (r thr, L 1) Intensity level slicing transformations a b Intensity level slicing transformations highlight an intensity range. The transformation in (a) sets all the intensity that are not in [A, B] to 0. The transformation in (b) conserves the intensity that are not in [A, B]. Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 6

Intensity level slicing transformations (2) a b c (a) Original image. (b) Vessels are highlighted by setting to L 1 the intensity levels that are in the range of interest and to 0 all the others. (c) Vessels intensities are conserved, while the other are darkened. Bit-plane transformation Instead of considering it as a matrix of integer, the image can be seen as composed of layers of bits. Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 7

Bit-plane transformation (2) Each layer contributes to the final appearance of the image, but most of the information is in the higher layers. Bit-plane transformation (3) a b c Images obtained using: (a) bitplanes 8 and 7; (b) bitplanes 8, 7, and 6; (c) bitplanes 8, 7, 6, and 5; Stefano Ferrari Elaborazione di immagini (Image processing) a.a. 2011/12 8