Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Similar documents
Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

S1 Note. Basis functions.

Edge Detection in Noisy Images Using the Support Vector Machines

3D vector computer graphics

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

Scale Selective Extended Local Binary Pattern For Texture Classification

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Lecture 5: Multilayer Perceptrons

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

Detection of an Object by using Principal Component Analysis

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

15/12/2017. Image segmentation: discontinuities. Image segmentation: discontinuities. Image segmentation: discontinuities

Fitting: Deformable contours April 26 th, 2018

Feature Reduction and Selection

A Binarization Algorithm specialized on Document Images and Photos

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Active Contours/Snakes

Hybrid Non-Blind Color Image Watermarking

Programming in Fortran 90 : 2017/2018

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Novel Fuzzy logic Based Edge Detection Technique

Parallelism for Nested Loops with Non-uniform and Flow Dependences

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

LECTURE : MANIFOLD LEARNING

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

The B-spline Interpolation in Visualization of the Three-dimensional Objects

CLASSIFICATION OF ULTRASONIC SIGNALS

Support Vector Machines

Complex Filtering and Integration via Sampling

Lecture #15 Lecture Notes

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Lesion Area Detection (LAD) using Superpixel Segmentation

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

TN348: Openlab Module - Colocalization

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

ENHANCEMENT OF IMAGES USING MORPHOLOGICAL TRANSFORMATIONS

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Hermite Splines in Lie Groups as Products of Geodesics

Wavefront Reconstructor

Hierarchical clustering for gene expression data analysis

An Image Fusion Approach Based on Segmentation Region

Machine Learning: Algorithms and Applications

Brushlet Features for Texture Image Retrieval

High-Boost Mesh Filtering for 3-D Shape Enhancement

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Object-Based Techniques for Image Retrieval

Implementation of a Dynamic Image-Based Rendering System

Dynamic wetting property investigation of AFM tips in micro/nanoscale

An Improved Image Segmentation Algorithm Based on the Otsu Method

Research and Application of Fingerprint Recognition Based on MATLAB

Local Quaternary Patterns and Feature Local Quaternary Patterns

Comparison Study of Textural Descriptors for Training Neural Network Classifiers

DELAUNAY TRIANGULATION BASED IMAGE ENHANCEMENT FOR ECHOCARDIOGRAPHY IMAGES

Data Mining: Model Evaluation

Efficient Content Representation in MPEG Video Databases

[33]. As we have seen there are different algorithms for compressing the speech. The

Image Processing (Computer Vision) Inverse Photography. Vision in Nature. Image Processing: 2003/2004. See the Big Picture.

A Gradient Difference based Technique for Video Text Detection

Feature Selection for Target Detection in SAR Images

Histogram-Enhanced Principal Component Analysis for Face Recognition

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

A Gradient Difference based Technique for Video Text Detection

Pictures at an Exhibition

Discriminative Dictionary Learning with Pairwise Constraints

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features

CS 534: Computer Vision Model Fitting

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

Using an Adaptive Neuro-Fuzzy Inference System (AnFis) Algorithm for Automatic Diagnosis of Skin Cancer

12. Segmentation. Computer Engineering, i Sejong University. Dongil Han

Color Image Segmentation Using Multispectral Random Field Texture Model & Color Content Features

Lecture 13: High-dimensional Images

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping.

Multi-stable Perception. Necker Cube

REMOTE SENSING REQUIREMENTS DEVELOPMENT: A SIMULATION-BASED APPROACH

ANALYSIS OF ADAPTIF LOCAL REGION IMPLEMENTATION ON LOCAL THRESHOLDING METHOD

THE PULL-PUSH ALGORITHM REVISITED

On the detection of pornographic digital images

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout

Announcements. Supervised Learning

A MINUTIAE-BASED MATCHING ALGORITHMS IN FINGERPRINT RECOGNITION SYSTEMS 1. INTRODUCTION

Novel Pattern-based Fingerprint Recognition Technique Using 2D Wavelet Decomposition

FACIAL FEATURE EXTRACTION TECHNIQUES FOR FACE RECOGNITION

Outline. Seamless Image Stitching in the Gradient Domain. Related Approaches. Image Stitching. Introduction Related Work

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

A ROBUST CHANGE DETECTION METHODOLOGY FOR TOPOGRAPHICAL APPLICATIONS. Booth Str. Ottawa, Ontario K1A 0E9 Canada

Machine Learning 9. week

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris

Enhanced Watermarking Technique for Color Images using Visual Cryptography

Grading Image Retrieval Based on DCT and DWT Compressed Domains Using Low-Level Features

Transcription:

mage Vsualzaton

mage Vsualzaton

mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne

mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne

mage Data Representaton What s an mage? An mage s a well-behaved unform dataset. An mage s a two-dmensonal array, or matrx of pxels, e.g., btmaps, pxmaps, RGB mages A pxel s square-shaped A pxel has a constant value over the entre pxel surface The value s typcally encoded n 8 bts nteger D s ({ p }, {C }, {f },{Φ })

mage Data Representaton Pxel values typcally represent gray levels, colours, heghts, opactes etc Remember dgtzaton mples that a dgtal mage s an approxmaton of a real scene

mage Processng and Vsualzaton mage processng follows the vsualzaton ppelne, e.g., mage contrast enhancement followng the renderng operaton mage processng may also follow every step of the vsualzaton ppelne

mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne

Basc mage Processng mage enhancement operaton s to apply a transfer functon on the pxel lumnance values Transfer functon s usually based on mage hstogram analyss Hgh-slope functon enhance mage contrast Low-slope functon attenuate the contrast.

Basc mage Processng The basc mage processng s the contrast enhancement through applyng a transfer functon Transfer functon The orgnal mage: f(x) = x Lnear normalzaton f(x) = (x l mn ) / ( l max l mn ) Nonlnear transfer

mage Enhancement Lnear Transfer Non-lnear Transfer

Frequences mage Hstograms The hstogram of an mage shows us the dstrbuton of grey levels n the mage Massvely useful n mage processng, especally n segmentaton Grey Levels

Hstogram Equalzaton All lumnance values covers the same number of pxels Hstogram equalzaton method s to compute a transfer functon such as the resulted mage has a near-constant hstogram (sze-1 ) f(x) x 0 h[]

Hstogram Equalzaton Orgnal mage After equalzaton

Nose and mages Nose can be descrbed as rapd varaton of hgh ampltude Or regons where hgh-order dervatves of f have large values Nose s usually the hgh frequency components n the Fourer seres expanson of the nput sgnal

Nose Model We can consder a nosy mage to be modeled as follows: g( x, y) f( x, y) ( x, y) where f(x, y) s the orgnal mage pxel, η(x, y) s the nose term and g(x, y) s the resultng nosy pxel f we can estmate the model the nose n an mage s based on ths wll help us to fgure out how to restore the mage

Nose Model There are many dfferent models for the mage nose term η(x, y): Gaussan Most common model Raylegh Erlang Exponental Unform mpulse Salt and pepper nose Erlang Gaussan Unform Raylegh Exponental mpulse

Flterng to Remove Nose We can use spatal flters of dfferent knds to remove dfferent knds of nose The arthmetc mean flter s a very smple one and s calculated as follows: 1 fˆ( x, y) g( s, t) mn 1 / 9 1 / 9 1 / 9 1 / 9 1 / 9 1 / 9 1 / 9 1 / 9 1 / 9 ( s, t) S xy Ths s mplemented as the smple smoothng flter Blurs the mage to remove nose

Smoothng Nose mage After flterng

Fourer Seres For any contnuous functon f(x) wth perod T (or x=[0,t]), the Fourer seres expanson are: T n n T n n n n n n n n n dt w t t f T b dt w t t f T a T n w x w b x w a a f(x) 0 0 1 1 0 ) )cos( ( 2 ) )sn( ( 2 2 ) cos( ) sn( The hgher the order n or the frequency, the smaller the ampltudes a n and b n

Fourer Seres

Fourer Transform When T, w s contnuous, ampltudes are also contnuous. A(w) B( w) F( w) 0 0 f(t) sn(wt)dt f(t) cos(wt)dtb ( A( w), B( w))

Fourer Transform

Dscrete Fourer Transform (DFT) The Dscrete Fourer Transform of f(x, y), for x = 0, 1, 2 M-1 and y = 0,1,2 N-1, denoted by F(u, v), s gven by the equaton: for u = 0, 1, 2 M-1 and v = 0, 1, 2 N-1. 1 0 1 0 ) / / ( 2 ), ( ), ( M x N y N vy M ux e y x f v u F

Dscrete Fourer Transform (DFT) The DFT of a two dmensonal mage can be vsualzed by showng the spectrum of the mages component frequences DFT Scannng electron mcroscope mage of an ntegrated crcut magnfed ~2500 tmes Fourer spectrum of the mage

Convoluton Theorem Frequency flterng s equvalent to the convoluton wth a flter functon g(x) N k k N k g f g f G F x g x f dt t x g t f x g x f 0 ) ( )) ( ) ( ( ) ( ) ( )) ( ) ( (

Frequency Flterng 1. Compute the Fourer transform F(w x,w y ) of f(x,y) 2. Multply F by the transfer functon Φ to obtan a new functon G, e.g., hgh frequency components are removed or attenuated. 3. Compute the nverse Fourer transform G -1 to get the fltered verson of f f F G F Φ f -1 G

Frequency Flterng Frequency flter functon Φ can be classfed nto three dfferent types: 1. Low-pass flter: ncreasngly damp frequences above some maxmum w max 2. Hgh-pass flter: ncreasngly damp frequences below some mnmal w mn 3. Band-pass flter: damp frequences wth some band [w mn,w max ] To remove nose, low-pass flter s used

Smoothng Frequency Doman Flters Smoothng s acheved n the frequency doman by droppng out the hgh frequency components The basc model for flterng s: G(u,v) = H(u,v)F(u,v) where F(u,v) s the Fourer transform of the mage beng fltered and H(u,v) s the flter transform functon Low pass flters only pass the low frequences, drop the hgh ones

Gaussan smoothng The most-used low-pass flter s the Gaussan functon F(e -ax 2 ) π e π 2 ω 2 /a a

Gaussan Lowpass Flters The transfer functon of a Gaussan lowpass flter s defned as H( u, v) e D 2 ( u, v)/2d 2 0

Edge Detecton Orgnal mage Edge Detecton

Edge Detecton Edges are curves that separate mage regons of dfferent lumnance Edges are locatons that have hgh gradent y x y x (x,y), 1,, 1, 2 2 ), ( ), ( ) ( ) (

Edges detecton usng dervatves Edge Detecton

Edge Detecton Operators 1 1, 1, 1 1, 1 1, 1, 1 1, 1 1, 1, 1 1, 1 1, 1, 1 1, 2 1, 1, 2, 1 1, 2 2 ), ( 2 2 ), ( ) ( ) ( ), ( y x R Roberts Operator Sobel Operator: good on nose These are the frst-order dervatve. Fndng edge s to fnd the hgh value through thresholdng segmentaton

Edge Detecton Operators 1, 1, 1, 1,, 2 2 2 2 4 ), ( ), ( y x y x Laplacan-based operator: good on producng thn edge Second-order dervatve. Fndng edge s to fnd the zerocrossng or mnmum.

Edge Detecton Dervatve based edge detectors are extremely senstve to nose

Laplacan Of Gaussan The Laplacan of Gaussan flter uses the Gaussan for nose removal and the Laplacan for edge detecton

mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne

Shape Representaton and Analyss Shape Analyss Ppelne

Shape Representaton and Analyss Flterng hgh-volume, low level datasets nto low volume dataset contanng hgh amounts of nformaton Shape s defned as a compact subset of a gven mage Shape s characterzed by a boundary and an nteror Shape propertes nclude geometry (form, aspect rato, roundness, or squareness) Topology (genus, number) Texture (lumnance, shadng)

Segmentaton Segment or classfy the mage pxels nto those belongng to the shape of nterest, called foreground pxels, and the remander, also called background pxels. Segmentaton results n a bnary mage Segmentaton s related to the operaton of selecton,.e., thresholdng

Segmentaton Fnd soft tssue Fnd hard tssue

Connected Components Fnd non-local propertes Algorthm: start from a gven foreground pxels, fnd all foreground pxels that are drectly or ndrectly neghbored

Morphologcal Operatons Morphologcal mage processng (or morphology) descrbes a range of mage processng technques that deal wth the shape (or morphology) of features n an mage Morphologcal operatons are typcally appled to remove mperfectons ntroduced durng segmentaton, and so typcally operate on b-level mages

Morphologcal Operatons To close holes and remove slands n segmented mages a: orgnal mage b: segmentaton c: close holes d: remove sland

Morphologcal Operatons Dlaton: translate a structurng element (e.g., dsc, square) over each foreground pxel of the segmented mage Dlaton thckens thn foreground regons, and fll holes and close background gaps that have a sze smaller than the structurng element R Eroson: the opposte operaton of dlaton. Eroson s to thn the foreground components, remove sland smaller than the structurng element R

Morphologcal Operatons Orgnal mage Dlaton by 3*3 square structurng element Dlaton by 5*5 square structurng element Orgnal mage Eroson by 3*3 square structurng element Eroson by 5*5 square structurng element

Morphologcal Operatons Compound Operatons More nterestng morphologcal operatons can be performed by performng combnatons of erosons and dlatons Morphologcal closng dlaton followed by an eroson Morphologcal openng eroson followed by a dlaton operaton

Examples Orgnal mage mage After Openng mage After Closng

Dstance Transform

Dstance Transform The dstance transform DT of a bnary mage s a scalar feld that contans, at every pxel of, the mnmal dstance to the boundary Ω of the foreground of DT(p) mnp q Ω q

Dstance Transform Dstance transform can be used for morphologcal operaton Consder a contour lne C(δ) of DT C( ) { p DT( p) } 2 δ = 0 δ > 0 δ < 0

Dstance Transform The contour lnes of DT are also called level sets Shape Level Sets Elevaton plot

Feature Transform Fnd the closest boundary ponts, so called feature ponts Gven a: Feature pont s b Gven p: Feature ponts are q1 and q2

Skeletonzaton

Skeletonzaton: the Goals Geometrc analyss: aspect rato, eccentrcty, curvature and elongaton Topologcal analyss: genus Retreval: fnd the shape matchng a source shape Classfcaton: partton the shape nto classes Matchng: fnd the smlarty between two shapes

Skeletonzaton Skeletons are the medal axes Or skeleton S( Ω) was the set of ponts that are centers of maxmally nscrbed dsks n Ω Or skeletons are the set of ponts stuated at equal dstance from at least two boundary feature ponts of the gven shape S( ) { p q, r, p q p r

Skeletonzaton

Skeleton Computaton Feature Transform Method: Select those ponts whose feature transform contans more than two boundary ponts. Works well on contnuous data Fals on dscreate data

Skeleton Computaton Usng dstance feld sngulartes: Skeleton ponts are local maxma of dstance transform

Summary Basc magng Algorthms mage Enhancement Hstogram Equalzaton Nose and mages Spatal Flterng Fourer Transform Frequency Flterng Edge Detecton Shape Representaton and Analyss Segmentaton Connected Components Morphologcal Operatons Dstance Transform Feature Transform Skeletonzaton