Image Similarity Longin Jan Latecki 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.
Digital Image Processing Exercise 1.
UNC Pixel Planes designed by Prof. Henry Fuchs et al.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Ch. 17 Basic Statistical Models CIS 2033: Computational Probability and Statistics Prof. Longin Jan Latecki Prepared by: Nouf Albarakati.
Sliding Window Filters and Edge Detection Longin Jan Latecki Computer Graphics and Image Processing CIS 601 – Fall 2004.
[Image Similarity Based on Histogram] Wang wan 581 Project Prof. Longin Jan Latecki.
Digital Image Processing Lecture11: Histogram Processing.
Intensity Transformations
Image Processing IB Paper 8 – Part A Ognjen Arandjelović Ognjen Arandjelović
DIGITAL IMAGE PROCESSING CMSC 150: Lecture 14. Conventional Cameras  Entirely chemical and mechanical processes  Film: records a chemical record of.
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.
EE 7730 Image Segmentation.
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.
Eleven colors and rasters. Color objects [color name] Returns color with the specified name [color red green blue] Returns color with the specified amounts.
Face Recognition Jeremy Wyatt.
CS430 © 2006 Ray S. Babcock CS430 – Image Processing Image Representation.
Pattern Recognition. Introduction. Definitions.. Recognition process. Recognition process relates input signal to the stored concepts about the object.
Dorin Comaniciu Visvanathan Ramesh (Imaging & Visualization Dept., Siemens Corp. Res. Inc.) Peter Meer (Rutgers University) Real-Time Tracking of Non-Rigid.
Ch. 10: Linear Discriminant Analysis (LDA) based on slides from
Introduction to Digital Data and Imagery
Context-dependent Detection of Unusual Events in Videos by Geometric Analysis of Video Trajectories Longin Jan Latecki
Linear Algebra and Image Processing
Image segmentation by clustering in the color space CIS581 Final Project Student: Qifang Xu Advisor: Dr. Longin Jan Latecki.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 14/15 – TP3 Digital Images Miguel Tavares Coimbra.
Edge Detection Hao Huy Tran Computer Graphics and Image Processing CIS 581 – Fall 2002 Professor: Dr. Longin Jan Latecki.
Image processing Second lecture. Image Image Representation We have seen that the human visual system (HVS) receives an input image as a collection of.
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.
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
Chapter 1 INTRODUCTION TO IMAGE PROCESSING Section – 1.2.
1 Template Matching Longin Jan Latecki Temple University CIS 601 Based on a project by Roland Miezianko.
CIS 601 Image ENHANCEMENT in the SPATIAL DOMAIN Dr. Rolf Lakaemper.
CIS 601 Image Fundamentals Longin Jan Latecki Slides by Dr. Rolf Lakaemper.
3D transformations Dr Nicolas Holzschuch University of Cape Town Modified by Longin Jan Latecki
Computer Graphics & Image Processing Lecture 1 Introduction.
A Simple Image Model Image: a 2-D light-intensity function f(x,y)
Digital Image Processing (DIP) Lecture # 5 Dr. Abdul Basit Siddiqui Assistant Professor-FURC 1FURC-BCSE7.
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.
1 Motion Analysis using Optical flow CIS601 Longin Jan Latecki Fall 2003 CIS Dept of Temple University.
Image Segmentation by Histogram Thresholding Venugopal Rajagopal CIS 581 Instructor: Longin Jan Latecki.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
Discrete Approach to Curve and Surface Evolution
Computer Science 121 Scientific Computing Winter 2014 Chapter 14 Images.
Digital Topology CIS 601 Fall 2004 Longin Jan Latecki.
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.
Sliding Window Filters Longin Jan Latecki October 9, 2002.
More Digital Representation Discrete information is represented in binary (PandA), and “continuous” information is made discrete.
An Introduction to Digital Image Processing Dr.Amnach Khawne Department of Computer Engineering, KMITL.
Relationship between pixels Neighbors of a pixel – 4-neighbors (N,S,W,E pixels) == N 4 (p). A pixel p at coordinates (x,y) has four horizontal and vertical.
Color Image Processing
Miguel Tavares Coimbra
Digital Data Format and Storage
Histogram—Representation of Color Feature in Image Processing Yang, Li
REMOTE SENSING Multispectral Image Classification
Fall 2012 Longin Jan Latecki
CIS Dept. Temple Univ., Philadelphia
CSC 381/481 Quarter: Fall 03/04 Daniela Stan Raicu
Multimedia System Image
3D transformations Dr Nicolas Holzschuch University of Cape Town
Intensity Transform Contrast Stretching Y ← u0+γ*(Y-u)/s
Miguel Tavares Coimbra
CIS Dept. Temple Univ., Philadelphia
CIS Dept. Temple Univ., Philadelphia
Presentation transcript:

Image Similarity Longin Jan Latecki CIS Dept. Temple Univ., Philadelphia

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)

Hg Hr Hb

Histograms Histogram Processing gray level Number of Pixels

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

Homework 5 Implement in Matlab a simple image search engine (no GUI needed). Simply compare the performance of at least two image distances on a small set of images.