CFU REU Week 1 Report Shelby Thompson. Session 2 Homework 1 For the first homework, I first read into MatLab a picture (the one on the right). I read.

Slides:



Advertisements
Similar presentations
Matlab Tutorial. Session 1 Basics, Filters, Color Space, Derivatives, Pyramids, Optical Flow Gonzalo Vaca-Castano.
Advertisements

SIFT & MatLab Pier Luigi Mazzeo.
Matlab Tutorial. Session 2. SIFT
Introduction to compositing. What is compositing?  The combination of two images to produce a single image  Many ways we can do this, especially in.
Image Filtering. Outline Outline Concept of image filter  Focus on spatial image filter Various types of image filter  Smoothing, noise reductions 
Dynamic Occlusion Analysis in Optical Flow Fields
Autonomous Vehicle Pursuit of Target Through Optical Recognition Vision & Image Science Laboratory, Department of Electrical Engineering,Technion Daniel.
Canny Edge Detector.
Announcements Mailing list: –you should have received messages Project 1 out today (due in two weeks)
1 CS 248 – Project 1 Help Session (demo) (demo) Painting RGB and HSV sliders Brush visualization Weighted mask driven painting HSV checkboxes.
USER VERIFICATION SYSTEM. Scope Web Interface RGB separation Pervasive.
LYU 0602 Automatic PhotoHunt Generation Automatic PhotoHunt Generation Shum Hei Lung To Wan Chi Supervisor: Prof. Michael R. Lyu.
2-D, 2nd Order Derivatives for Image Enhancement
Noise Filtering & Edge Detection Jeremy Wyatt. Filtering Last time we saw that we could detect edges by calculating the intensity change (gradient) across.
Blob detection.
© 2010 Cengage Learning Engineering. All Rights Reserved.
1 An Implementation Sanun Srisuk of EdgeFlow.
Image Filtering. Problem! Noise is a problem, even in images! Gaussian NoiseSalt and Pepper Noise.
Algebra February 10, Systems of Three Variables We have already seen a system of two equations used to solve two variables. Now we are going to.
Computer Vision, winter CS Department, Technion.
Version 1.0, 30 June 2004 APPLICATIONS OF METEOSAT SECOND GENERATION (MSG) RGB IMAGES: PART 02 INTRODUCTION TO RGB COLOURS Author:Jochen Kerkmann (EUMETSAT)
UCF Computer Vision REU 2012 Week 1 Presentation Paul Finkel 5/21/12.
UCF REU: Weeks 1 & 2. Gradient Code Gradient Direction of the Gradient: Calculating theta.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
KRISTIN LAM REU WEEKS 1 & 2. MATERIAL COVERED MATLAB basics Edge Detection Harris Corner Detector Adaboost Face Detection Optical Flow Lucas-Kanade Method.
CSC508 Convolution Operators. CSC508 Convolution Arguably the most fundamental operation of computer vision It’s a neighborhood operator –Similar to the.
October 7, 2014Computer Vision Lecture 9: Edge Detection II 1 Laplacian Filters Idea: Smooth the image, Smooth the image, compute the second derivative.
Optimal Component Analysis Optimal Linear Representations of Images for Object Recognition X. Liu, A. Srivastava, and Kyle Gallivan, “Optimal linear representations.
Kylie Gorman WEEK 1-2 REVIEW. CONVERTING AN IMAGE FROM RGB TO HSV AND DISPLAY CHANNELS.
1 Motion Analysis using Optical flow CIS601 Longin Jan Latecki Fall 2003 CIS Dept of Temple University.
WEEK 1-2 ALEJANDRO TORROELLA. CONVERTING AN IMAGE FROM RGB TO HSV AND DISPLAYING THE SEPARATE CHANNELS.
CS 376b Introduction to Computer Vision 02 / 11 / 2008 Instructor: Michael Eckmann.
A picture is worth more than a 1000 words. It can save a life. Arjun Watane.
HYPR Project Presentation By Nasser Abbasi HYPR Input-Output view.
PRESENTATION REU IN COMPUTER VISION 2014 AMARI LEWIS CRCV UNIVERSITY OF CENTRAL FLORIDA.
Zack Nemes By: Clemence Larroche. To track and follow a car as it travels along a path.
Implementation and Optimization of SIFT on a OpenCL GPU Final Project 5/5/2010 Guy-Richard Kayombya.
Canny Edge Detection Using an NVIDIA GPU and CUDA Alex Wade CAP6938 Final Project.
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Digital Image Processing
Digital Image Processing Week V Thurdsak LEAUHATONG.
Dr. J. Shanbehzadeh M.HosseinKord Science and Research Branch of Islamic Azad University Machine Vision 1/49 slides.
Sliding Window Filters Longin Jan Latecki October 9, 2002.
Week 5 Report Shelby Thompson. This week… 1 research paper Coded more Used PubFig83 dataset to run tests on.
REU Week 1 Presented by Christina Peterson. Edge Detection Sobel ◦ Convolve image with derivative masks:  x:  y: ◦ Calculate gradient magnitude ◦ Apply.
Blob detection.
Digital Image Processing
Invest. Ophthalmol. Vis. Sci ;52(5): doi: /iovs Figure Legend:
Horn-Schunk Optical Flow
ივანე ჯავახიშვილის სახელობის
Scale Invariant Feature Transform (SIFT)
AUTOMATIC IMAGE ORIENTATION DETECTION
Shane Bric and Kevin Paprocki
CSE 455 HW 1 Notes.
JPEG Image Coding Standard
Gaussian Lowpass Filter
Pictures and cars.
Edge Detection The purpose of Edge Detection is to find jumps in the brightness function (of an image) and mark them.
Report 1: Optical Flow and Sift
Levi Smith REU Week 1.
EE/CSE 576 HW 1 Notes.
What I learned in the first 2 weeks
REU Week 1 Ivette Carreras UCF.
Edge Detection Today’s reading
Homework Assignment 1: Use the following data set to test the performance difference of three clustering algorithms: K-means, AP clustering and Spectral.
Canny Edge Detector.
EE/CSE 576 HW 1 Notes.
Neil Gealy Outline What I Learned this Week Research Interests
ECE/CSE 576 HW 1 Notes.
CAP 5415 Computer Vision Fall 2004
Presentation transcript:

CFU REU Week 1 Report Shelby Thompson

Session 2 Homework 1 For the first homework, I first read into MatLab a picture (the one on the right). I read this in with the simple MatLab command imread (sun_dragon.jpg); I then proceeded to get the picture representations of the hsv (hue, saturation, and value) channels.

Session 2 Homework 1 The image to the left represents the red hsv channel of the original picture. It is created using the command: rI1=I2(:,:,1); to create and assign the picture to a variable, and figure;imshow(rI1); to show it.

Session 2 Homework 1 Continued The image to the right represents the green hsv channel of the original picture. It is created using the command: gI1=I2(:,:,2); to create and assign the picture to a variable, and figure;imshow(gI1); to show it.

Session 2 Homework 1 Continued The image to the left represents the blue hsv channel of the original picture. It is created using the command: bI1=I2(:,:,3); to create and assign the picture to a variable, and figure;imshow(bI1); to show it.

Session 2 Homework 1 Continued The image to the right represents the Laplacian of Gaussian using separability. It is achieved using this code: LoG=edge(rgb2gray(imread('su n_dragon.jpg')),'log', 0.5, 0.05); figure;imshow(LoG);

Session 2 Homework 1 Continued The image to the left represents the Guassian filtered smoothed version of the original image. It is achieved using the code: hg=fspecial('gaussian',[35 35],50); I3=conv2(rgb2gray(imread('sun _dragon.jpg')),hg,'same'); figure;imshow(uint8(I3));

Session 2 Homework 1 Continued The image to the right represents the derivative of the filtered image. It is achieved using this code: gaussder=conv2(fspecial('gaussi an',[35 35],50),[1 0 -1],'valid'); figure;surf(gaussder); gaussI1=conv2(rgb2gray(imread ('sun_dragon.jpg')),gaussder); figure;imshow(gaussI1);

Session 2 Homework 1 Continued The image to the left represents the magnitude of the gradient. It is achieved using the code: gradMag=sqrt(vergradI2.^2+ho rgradI2.^2); figure;imshow(uint8(gradMag)) ;

Session 2 Homework 1 Continued The image to the right represents the non-maximal suppression of the image. It is achieved using this code: imSup=edge(rgb2gray(imread('sun_dragon.jpg')),'canny'); figure;imshow(imSup);

Session 3 Homework 2 Homework 2 focused highly on using SIFT on images. I performed the SIFT using this code: pfx = fullfile(vl_root,'data', 'Derpy.png') ; I = imread(pfx) ; image(I) ; I = single(rgb2gray(I)) ; [f,d] = vl_sift(I) ; perm = randperm(size(f,2)) ; sel = perm(1:50) ; h1 = vl_plotframe(f(:,sel)) ; h2 = vl_plotframe(f(:,sel)) ; set(h1,'color','k','linewidth',3) ; set(h2,'color','y','linewidth',2) ; h3 = vl_plotsiftdescriptor(d(:,sel),f(:,sel)) ; set(h3,'color','g'); fc = [100;100;10;-pi/8]; [f,d] = vl_sift(I,'frames',fc); fc = [100;100;10;0]; [f,d] = vl_sift(I,'frames',fc,'orientations'); In order to get the image on the right.

Session 5 Homework 4 Homework 4 focused on Optical Flow, specifically the Lucas-Kanade algorithm. I first implemented the Lucas-Kanade algorithm and examined the results on two images of a car. I then implemented a Hierarchical Lucas-Kanade algorithm on two images of a table. I examined both algorithms and decided the regular Lucas-Kanade algorithm is much more efficient, as it takes a much shorter time to run than the Hierarchical Lucas-Kanade. The image below is the image of the car generated by the algorithm.