lecture 08 roger s gaborski n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Advanced Computer Vision PowerPoint Presentation
Download Presentation
Advanced Computer Vision

Loading in 2 Seconds...

play fullscreen
1 / 15

Advanced Computer Vision - PowerPoint PPT Presentation


  • 83 Views
  • Uploaded on

Lecture 08 Roger S. Gaborski. Advanced Computer Vision. Histograms. H istogram is nothing more than mapping the pixels in a 2 dimensional matrix into a vector

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Advanced Computer Vision' - raja


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
lecture 08 roger s gaborski
Lecture 08

Roger S. Gaborski

Advanced Computer Vision

Roger S. Gaborski

histograms
Histograms
  • Histogram is nothing more than mapping the pixels in a 2 dimensional matrix into a vector
  • Each component in the vector is a bin (range of gray level values) and the corresponding value is the number of pixels with that gray level value
similarity between histograms
Similarity between Histograms
  • Similarity between histogram bins:
  • Assuming both histograms have ∑nj j=1…B pixels

M. Swain and D. Ballard. “Color indexing,”International Journal of Computer Vision, 7(1):11–32, 1991.

histogram intersection
Histogram Intersection
  • A simple example:
  • g = [ 17, 23, 45, 61, 15]; (histogram bins)
  • h = [ 15, 21, 42, 51, 17];
  • in=sum(min(h,g))/min( sum(h),sum(g))
  • in =

0.9863

slide5

>> g = [17,23,45,61,15];

>> h = [15,21,42,51,17];

>> min(g,h)

ans=

15 21 42 51 15

>> N = sum(min(g,h))

N =

144

>> D=min(sum(h),sum(g))

D =

146

>> intersection = N/D

intersection =

0.9863

Roger S. Gaborski

if histograms identical
If Histograms Identical
  • g = 15 21 42 51 17
  • h = 15 21 42 51 17
  • >> in=sum(min(h,g))/min( sum(h),sum(g))
  • in =

1

different histograms
Different Histograms
  • h = 15 21 42 51 17
  • g = 57 83 15 11 1
  • >> in=sum(min(h,g))/min( sum(h),sum(g))
  • in =

0.4315

region and histogram
Region and Histogram

Similarity with itself:

>>h = hist(q(:),256);

>> g=h;

>> in=sum(min(h,g))/min( sum(h),sum(g))

in = 1

slide10

>> r=236;c=236;

>> g=im(1:r,1:c);

>> g= hist(g(:),256);

>> in=sum(min(h,g))/min( sum(h),sum(g))

in =

0.5474

partial matches
Partial Matches

>> g= hist(g(:),256);

>> in=sum(min(h,g))/min( sum(h),sum(g))

in =

0.8014

in=sum(min(h,g))/min( sum(h),sum(g))

in =

0.8566

lack of spatial information
Lack of Spatial Information
  • Different patches may have similar histograms
slide14

For

Howard

Ross

Roger S. Gaborski