CIS Dept. Temple Univ., Philadelphia

Slides:



Advertisements
Similar presentations
EigenFaces and EigenPatches Useful model of variation in a region –Region must be fixed shape (eg rectangle) Developed for face recognition Generalised.
Advertisements

Image Segmentation Longin Jan Latecki CIS 601. Image Segmentation Segmentation divides an image into its constituent regions or objects. Segmentation.
1 RTL Example: Video Compression – Sum of Absolute Differences Video is a series of frames (e.g., 30 per second) Most frames similar to previous frame.
[Image Similarity Based on Histogram] Wang wan 581 Project Prof. Longin Jan Latecki.
Digital Image Processing Lecture11: Histogram Processing.
Raster Data. The Raster Data Model The Raster Data Model is used to model spatial phenomena that vary continuously over a surface and that do not have.
CS 376b Introduction to Computer Vision 03 / 26 / 2008 Instructor: Michael Eckmann.
Face Recognition Jeremy Wyatt.
CS430 © 2006 Ray S. Babcock CS430 – Image Processing Image Representation.
Dorin Comaniciu Visvanathan Ramesh (Imaging & Visualization Dept., Siemens Corp. Res. Inc.) Peter Meer (Rutgers University) Real-Time Tracking of Non-Rigid.
Introduction to Digital Data and Imagery
Context-dependent Detection of Unusual Events in Videos by Geometric Analysis of Video Trajectories Longin Jan Latecki
ICS 61 - Graphics. Light Color Wheel Color Perception.
Linear Algebra and Image Processing
Co mputer Graphics Researched via: Student Name: Nathalie Gresseau Date:12/O7/1O.
Image and Video Retrieval INST 734 Doug Oard Module 13.
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
Chapter 1 INTRODUCTION TO IMAGE PROCESSING Section – 1.2.
Color and Resolution Introduction to Digital Imaging.
Image Similarity Longin Jan Latecki CIS Dept. Temple Univ., Philadelphia
3D transformations Dr Nicolas Holzschuch University of Cape Town Modified by Longin Jan Latecki
A Simple Image Model Image: a 2-D light-intensity function f(x,y)
CSC1401. Learning Goals Understand at a conceptual level What is media computation? How does color vision work? How can you make colors with red, green,
Computer Vision Introduction to Digital Images.
CIS 601 – 04 Image ENHANCEMENT in the SPATIAL DOMAIN Longin Jan Latecki Based on Slides by Dr. Rolf Lakaemper.
DIGITAL IMAGE. Basic Image Concepts An image is a spatial representation of an object An image can be thought of as a function with resulting values of.
November 30, PATTERN RECOGNITION. November 30, TEXTURE CLASSIFICATION PROJECT Characterize each texture so as to differentiate it from one.
Chapter 12 Object Recognition Chapter 12 Object Recognition 12.1 Patterns and pattern classes Definition of a pattern class:a family of patterns that share.
1 Motion Analysis using Optical flow CIS601 Longin Jan Latecki Fall 2003 CIS Dept of Temple University.
Discrete Approach to Curve and Surface Evolution
Computer Science 121 Scientific Computing Winter 2014 Chapter 14 Images.
Data Models, Pixels, and Satellite Bands. Understand the differences between raster and vector data. What are digital numbers (DNs) and what do they.
Image Similarity Presented By: Ronak Patel Guided By: Dr. Longin Jan Latecki.
Chapter 3: Data Representation Chapter 3 Data Representation Page 17 Computers use bits to represent all types of data, including text, numerical values,
3.5 Perform Basic Matrix Operations Add Matrices Subtract Matrices Solve Matric equations for x and y.
More Digital Representation Discrete information is represented in binary (PandA), and “continuous” information is made discrete.
Digital Image: Rendering of a continuously varying scene with a finite array of picture elements, where each one has a discrete intensity or color 39.
Unit 2.6 Data Representation Lesson 3 ‒ Images
Color Image Processing
Miguel Tavares Coimbra
Digital Data Format and Storage
Digital 2D Image Basic Masaki Hayashi
Image Segmentation Classify pixels into groups having similar characteristics.
Chapter I Digital Imaging Fundamentals
Digital Image Processing
Histogram—Representation of Color Feature in Image Processing Yang, Li
Images Presentation Name Course Name Unit # – Lesson #.# – Lesson Name
CS 1674: Intro to Computer Vision Linear Algebra Review
Two-Dimensional Signal and Image Processing Chapter 8 - pictures
REMOTE SENSING Multispectral Image Classification
REMOTE SENSING Multispectral Image Classification
Computer Vision Lecture 16: Texture II
Fall 2012 Longin Jan Latecki
Ch2: Data Representation
CIS Dept. Temple Univ., Philadelphia
CSC 381/481 Quarter: Fall 03/04 Daniela Stan Raicu
Lecture 2 Photographs and digital mages
Images Presentation Name Course Name Unit # – Lesson #.# – Lesson Name
CIS 2033 Base on text book: A Modern Introduction to
Matrices.
Digital Image Processing Lecture 26: Color Processing
Digital Image Processing
Multimedia System Image
Evaluating Reliability of Motion Features in Surveillance Videos
Non-numeric Data Representation
3D transformations Dr Nicolas Holzschuch University of Cape Town
Intensity Transform Contrast Stretching Y ← u0+γ*(Y-u)/s
Miguel Tavares Coimbra
MATH 3033 based on Dekking et al
CIS Dept. Temple Univ., Philadelphia
Presentation transcript:

CIS Dept. Temple Univ., Philadelphia Image Similarity Longin Jan Latecki CIS Dept. Temple Univ., Philadelphia latecki@temple.edu

Image Similarity Image based, e.g., difference of values of corresponding pixels Histogram based Based on similarity of objects contained in images, requires image segmentation

Mathematical Representation of Images An image is a 2D signal (light intensity) and can be represented as a function f (x, y). coordinates (x, y) represent the spatial location of point (x, y) that is called pixel (picture element) value of f (x, y) is the light intensity called gray value (or gray level) of image f · Images are of two types: continuous and discrete A continuous image is a function of two variables, that take values in a continuum. E.g.: The intensity of a photographic image recorded on a film is a 2D function f (x, y) of two real-valued variables x and y.

· A discrete image is a function of two variables, that take values over a discrete set (an integer grid) E.g.: The intensity of a discretized 320 x 240 photographic image is 2D function f (i, j) of two integer-valued variables i and j. Thus, f can be represented as a 2D matrix I[320,240] A color image is usually represented with three matrices: Red[320,240], Green[320,240], Blue[320,240]

Pixel based image similarity Let f and g be two gray-value image functions.

Let a and b bet two images of size w x h. Let c be some image characteristics that assigns a number to each image pixels, e.g., c(a,x,y) is the gray value of the pixel. Pixel to pixel differences:

We can use statistical mean and variance to add stability to pixel to pixel image difference:

Let v(a) be a vector of all c(a,x,y) values assigned to all pixels in the image a. Image similarity can be expressed as normalized inner products of such vectors. Since it yields maximum values for equal frames, a possible disparity measure is

Image histogram is a vector If f:[1, n]x[1, m]  [0, 255] is a gray value image, then H(f): [0, 255]  [0, n*m] is its histogram, where H(f)(k) is the number of pixels (i, j) such that F(i, j)=k Similar images have similar histograms Warning: Different images can have similar histograms

Image Histogram (3, 8, 5)

Histogram-based image similarity Let c be some image characteristics and h(a) its histogram for image a with k histogram bins.