Edge Detection Using ICA

Slides:



Advertisements
Similar presentations
Video Mosaics CS 294/283 Final Project Steve Martin U.C. Berkeley, Fall 2003.
Advertisements

Assignment 4 Cloning Yourself
3D Geometry for Computer Graphics
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Structured Sparse Principal Component Analysis Reading Group Presenter: Peng Zhang Cognitive Radio Institute Friday, October 01, 2010 Authors: Rodolphe.
Sliding Window Filters and Edge Detection Longin Jan Latecki Computer Graphics and Image Processing CIS 601 – Fall 2004.
Multimedia communications EG 371Dr Matt Roach Multimedia Communications EG 371 and EE 348 Dr Matt Roach Lecture 6 Image processing (filters)
1 Robust Video Stabilization Based on Particle Filter Tracking of Projected Camera Motion (IEEE 2009) Junlan Yang University of Illinois,Chicago.
Image Analysis Preprocessing Image Quantization Binary Image Analysis
Probabilistic video stabilization using Kalman filtering and mosaicking.
Prague Institute of Chemical Technology - Department of Computing and Control Engineering Digital Signal & Image Processing Research Group Brunel University,
Face Recognition using PCA (Eigenfaces) and LDA (Fisherfaces)
COMP322/S2000/L221 Relationship between part, camera, and robot (cont’d) the inverse perspective transformation which is dependent on the focal length.
1 Image Filtering Readings: Ch 5: 5.4, 5.5, 5.6,5.7.3, 5.8 (This lecture does not follow the book.) Images by Pawan SinhaPawan Sinha formal terminology.
Lecture 2: Image filtering
A Real-Time for Classification of Moving Objects
ICA Alphan Altinok. Outline  PCA  ICA  Foundation  Ambiguities  Algorithms  Examples  Papers.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
CHAPTER 7 Viewing and Transformations © 2008 Cengage Learning EMEA.
1 Activity and Motion Detection in Videos Longin Jan Latecki and Roland Miezianko, Temple University Dragoljub Pokrajac, Delaware State University Dover,
SVD(Singular Value Decomposition) and Its Applications
Image Segmentation by Clustering using Moments by, Dhiraj Sakumalla.
Edge Detection Hao Huy Tran Computer Graphics and Image Processing CIS 581 – Fall 2002 Professor: Dr. Longin Jan Latecki.
Stereo Matching Low-Textured Survey 1.Stereo Matching-Based Low-Textured Scene Reconstruction for Autonomous Land Vehicles (ALV) Navigation 2.A Robust.
National Center for Supercomputing Applications University of Illinois at Urbana-Champaign Image Features Kenton McHenry, Ph.D. Research Scientist.
WP3 - 3D reprojection Goal: reproject 2D ball positions from both cameras into 3D space Inputs: – 2D ball positions estimated by WP2 – 2D table positions.
Epipolar geometry The fundamental matrix and the tensor
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
Independent Component Analysis on Images Instructor: Dr. Longin Jan Latecki Presented by: Bo Han.
Access Control Via Face Recognition Progress Review.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
Vehicle Segmentation and Tracking From a Low-Angle Off-Axis Camera Neeraj K. Kanhere Committee members Dr. Stanley Birchfield Dr. Robert Schalkoff Dr.
3D Imaging Motion.
Digital Image Processing Lecture 10: Image Restoration
Duy & Piotr. How to reconstruct a high quality image with the least amount of samples per pixel the least amount of resources And preserving the image.
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
Auto-calibration we have just calibrated using a calibration object –another calibration object is the Tsai grid of Figure 7.1 on HZ182, which can be used.
Week 4 Functions and Graphs. Objectives At the end of this session, you will be able to: Define and compute slope of a line. Write the point-slope equation.
CS 376b Introduction to Computer Vision 03 / 31 / 2008 Instructor: Michael Eckmann.
Determining 3D Structure and Motion of Man-made Objects from Corners.
Image Similarity Presented By: Ronak Patel Guided By: Dr. Longin Jan Latecki.
Slope Fields Differential Equations. Slope Fields A slope field is a graphical picture of a derivative that projects the curve within the picture. Or.
Chapter 13 Discrete Image Transforms
CMSC5711 Image processing and computer vision
CSSE463: Image Recognition Day 27
Graphs and Applications of Linear Equations
Rigid Bodies: Equivalent Systems of Forces
Compressive Coded Aperture Video Reconstruction
Automatic Video Shot Detection from MPEG Bit Stream
Lecture 8:Eigenfaces and Shared Features
Computer Graphics.
Singular Value Decomposition
CMSC5711 Image processing and computer vision
Representing Motion Chapter 2.
Fall 2012 Longin Jan Latecki
Presented by :- Vishal Vijayshankar Mishra
Digital Image Fundamentals
Principal Component Analysis
2D transformations (a.k.a. warping)
CSC 381/481 Quarter: Fall 03/04 Daniela Stan Raicu
Video Compass Jana Kosecka and Wei Zhang George Mason University
Parallelization of Sparse Coding & Dictionary Learning
CSSE463: Image Recognition Day 25
CSSE463: Image Recognition Day 25
Evaluating Reliability of Motion Features in Surveillance Videos
Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5
USING DATA Obj
Fundamentals of Spatial Filtering
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Factorization by identity a3 + b3.
Presentation transcript:

Edge Detection Using ICA Supervisor: Dr. Longin Jan Latecki Presenter: Guoqiang Shan Class: CIS 601 Computer Graphics and Image Processing Date: December 6, 2004 2019/4/22

Basic Idea Consider the difference of the corresponding pixels between images A pixel is independent from each other Pros: Limit the scope of any condition Cons: No relation among neighbor pixels Similar as letter detection & motion detection Representing locality is important Locality: neighbor pixels tend same value 2019/4/22

Quick Tip of ICA X(k) = A*S(k) S: m*n, m independent signals length n X: m*n, m mixed signals length n A: m*m, each column of A is a basic vector S(k) = W*X(k) W: m*m, separating independent signals from mixed signals 2019/4/22

S (j,:) = average image? b: Frame 55 a: Frame 50 c: 1 Component of ICA 2019/4/22 d: Average Image

Why? 2 images: W = [-0.0549 0.0553; 0.0083 0.0102]; => c = 0.45a+0.55b Diff (c, d) < 0.19% 4 images: Diff (c, d) < 0.25% 2019/4/22

Basic Vector(1) Basic Vector is the main directions of the data. 2019/4/22

Basic Vector(2) A = [9.988 54.280 -8.166 53.940]; Conclusion: One of basic vector is approximately the diagonal. 2019/4/22

Basic Vector (3) t is coordinate T(t,t) (a, b) O K = (b-t)/(a-t) => t = a+(a-b)/(k-1), when k=-1, t = (a+b)/2 2019/4/22

Sense on ICA One basic vector of ICA is the diagonal, or say, one component shows the common feature among images, if: the mixed images are similar enough # of images is not large Other components of ICA show the difference among images 2019/4/22

Average Image as substitute? No! For the points changing a lot among images, average image can not give a good result. The points are just the points we need care more about. My proof is to obtain sense, not for simplifying the calculation. ICA calculation is still necessary. 2019/4/22

Locality of Image Locality is the similarity of neighbor pixels Edge is where locality is low. Locality can be represented by m*n matrix 2019/4/22

Locality vs. one component of ICA Locality is similarity One component shows common features among corresponding pixels They can be connected! 2019/4/22

Reshape the matrix 2019/4/22

One image => Several Images To connect locality with ICA component, consider the reshaped vector as column of X If the size of the image is X*Y, we have (X-m+1)*(Y-n+1) vectors. They consist of X. X is the overlap of the original image. Each image starts at (1..m, 1..n). Different image starts differently. 2019/4/22

Remove component Sj X is ready, run ICA. Sj = locality, thus remove Sj and the corresponding basic vector Aj. Reconstruct one of the overlapped images by other signals and other basic vectors. The image will show only low locality, edges. 2019/4/22

This method vs. 3*3 Operators (1) 3*3 operators have pre-defined coefficients. This method has self-adaptive coefficients. What is the coefficient matrix? Let A’ = A after removing Aj, A’*W is matrix. They’re the optimal coefficients for a particular image. 2019/4/22

This method vs. 3*3 Operators (2) 3*3 operators have pre-defined number of coefficients. This method has a flexible number of coefficients. The flexibility provides a better choice if the edges are mainly vertical or horizontal. 2019/4/22

Experiments (1) Original Images 2019/4/22

Experiments (2) Edge detection by 3*3 operator and ICA 2019/4/22

Experiments (3) Edge detection by 3*3 operator and ICA 2019/4/22

Experiments (4) Original Image By most of 3*3 operator By this method 2019/4/22

Experiments (5) Original Image I plane after RGB2YIQ 2019/4/22 3*3 Operator This method

Conclusion ICA provides a solution for edge detection. The solution provides the more accurate coefficients, compared to 3*3 operators. It configures the locality window size flexibly. It can recognize some edges, unable to be done by 3*3 operators. 2019/4/22

Future work Pre-processing on the image for edge detection Post- processing on result by this method Find the best locality window not by try Find what kind of images it is proper to use and what kind is improper. How to use ICA more efficiently? 2019/4/22

Reference Roberts and Everson, Independent Component Analysis – Principles and Practice, Cambridge University Press, 2001 Paper and software on http://www.cis.hut.fi/projects/ica/ Comparison of edge detection methods on http://robotics.eecs.berkeley.edu/~mayi/imgproc/ Video Analysis using Principal Component Analysis http://knight.cis.temple.edu/~video/VA/ 2019/4/22