1 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Singular Value Decompositions with applications to Singular Value Decompositions.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Face Recognition Sumitha Balasuriya.
Visual Vocabulary Construction for Mining Biomedical Images Arnab Bhattacharya, Vebjorn Ljosa, Jia-Yu Pan Presented by Li An, CIS, TU.
3D Geometry for Computer Graphics
Biomedical Person Identification via Eye Printing Masoud Alipour Ali Farhadi Ali Farhadi Nima Razavi.
The Global Digital Elevation Model (GTOPO30) of Great Basin Location: latitude 38  15’ to 42  N, longitude 118  30’ to 115  30’ W Grid size: 925 m.
Surface Classification Using Conformal Structures Xianfeng Gu 1, Shing-Tung Yau 2 1. Computer and Information Science and Engineering, University of Florida.
Sketch Tokens: A Learned Mid-level Representation for Contour and Object Detection CVPR2013 POSTER.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Principal Component Analysis CMPUT 466/551 Nilanjan Ray.
Principal Component Analysis
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
© 2003 by Davi GeigerComputer Vision September 2003 L1.1 Face Recognition Recognized Person Face Recognition.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
International Workshop on Computer Vision
A method for eye detection based on SVD transform Somayeh Danafar Lila Taghavi Alireza Tavakoli.
Robust Real-time Object Detection by Paul Viola and Michael Jones ICCV 2001 Workshop on Statistical and Computation Theories of Vision Presentation by.
Lecture 4: Feature matching
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
Fitting a Model to Data Reading: 15.1,
Information that lets you recognise a region.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Stereo Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision (with slides by James Rehg and.
CS 450: Computer Graphics 2D TRANSFORMATIONS
Copyright © Cengage Learning. All rights reserved. 7.6 The Inverse of a Square Matrix.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
SVD(Singular Value Decomposition) and Its Applications
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
CHAPTER SIX Eigenvalues
Chapter 2 Dimensionality Reduction. Linear Methods
Alignment Introduction Notes courtesy of Funk et al., SIGGRAPH 2004.
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Intelligent Vision Systems ENT 496 Object Shape Identification and Representation Hema C.R. Lecture 7.
Canonical Correlation Analysis and Related Techniques Simon Mason International Research Institute for Climate Prediction The Earth Institute of Columbia.
BING: Binarized Normed Gradients for Objectness Estimation at 300fps
SINGULAR VALUE DECOMPOSITION (SVD)
Face Recognition: An Introduction
Scientific Computing Singular Value Decomposition SVD.
Action as Space-Time Shapes
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Motivation Thus far we have dealt primarily with the input/output characteristics of linear systems. State variable, or state space, representations describe.
Doc.: IEEE /0431r0 Submission April 2009 Alexander Maltsev, Intel CorporationSlide 1 Polarization Model for 60 GHz Date: Authors:
CVPR2013 Poster Detecting and Naming Actors in Movies using Generative Appearance Models.
A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25,
Colour and Texture. Extract 3-D information Using Vision Extract 3-D information for performing certain tasks such as manipulation, navigation, and recognition.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
FACE DETECTION : AMIT BHAMARE. WHAT IS FACE DETECTION ? Face detection is computer based technology which detect the face in digital image. Trivial task.
How to tell the differences between a Cat and a Dog Masoud Alipour Ali Farhadi IPM – Scientific Computing Center Vision.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Features Jan-Michael Frahm.
Stereo March 8, 2007 Suggested Reading: Horn Chapter 13.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
Preliminary Transformations Presented By: -Mona Saudagar Under Guidance of: - Prof. S. V. Jain Multi Oriented Text Recognition In Digital Images.
Chapter 13 Discrete Image Transforms
Camera Calibration Course web page: vision.cis.udel.edu/cv March 24, 2003  Lecture 17.
- photometric aspects of image formation gray level images
Recognition of biological cells – development
Mean Shift Segmentation
Scale-Space Representation of 3D Models and Topological Matching
Principal Component Analysis
Scale-Space Representation for Matching of 3D Models
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Lecture 5: Feature invariance
Lecture 5: Feature invariance
Random Neural Network Texture Model
Presentation transcript:

1 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Singular Value Decompositions with applications to Singular Value Decompositions with applications to 1. Texture differentiation 2. Detection of an extraneous object in a texture environment 3. Segmentation of images 4. Locating eyes in facial images Alireza Tavakoli Targhi Institute for Studies in Theoretical Physics and Mathematics (IPM), Iran and Royal Institute of Technology (KTH), Sweden

2 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Introduction We propose new measures for texture classification based on a local version of Singular Value Decomposition (SVD). The proposed measures classify textures by their roughness and structure. Experimental results show that these measures are suitable for texture clustering and image segmentation and they are robust to changes in local lighting, orientation etc.

3 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Singular Value Decomposition A=U 1 *D*U 2 U i Orthogonal Matrix, D Diagonal Matrix with Diagonal Entries in descending order: d 1 >d 2 > …>=0 Overview of SVD

4 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran To find the SVD curve of an arbitrary row of the texture: 1. Scan a row with overlapping w*w windows W a, a=1,2,3,….. ; w ≈ Calculate the SVD Decomposition 3. W a =U 1,a *D a *U 2,a 4. As windows scan the image we obtain w curves (  i ) corresponding to diagonal entries d 1,a >d 2,a >….>d w,a SVD Curves

5 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Classification Diagonal entries reflect image characteristics.

6 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran The sizes of the first few coefficients are considerably larger than the remaining

7 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran SVD Curve Classifiers We introduce two measures, obtained from SVD curves, which capture some of the perceptual and conceptual features in an image. SVD Curve mean classifier SVD Curve distance classifier

8 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran SVD Curve Mean Classifier Our experiments show that the smaller coefficients d a,j, i.e., da,j with 23<j<32, are more representative of the structure of the texture and less dependent on inessential features. In practice, we set l = 22 and k = 10.

9 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran

10 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran SVD-Distance Classifier

11 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Detection of Extraneous Object: Detection of Extraneous Object:

12 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Even Small objects

13 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Interest Point Detector

14 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran The technique identifies the bug even the location of its legs

15 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Added two coins

16 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran No Differentiation

17 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran SVD Transform We slide a w*w window across the image. We slide a w*w window across the image. We identify each window by its upper left corner coordinates (x,y). We identify each window by its upper left corner coordinates (x,y). Let F be a function of w variables. Let F be a function of w variables. The SVD surface is the graph of the function (x,y) → the value of F on D (x,y ). The SVD surface is the graph of the function (x,y) → the value of F on D (x,y ). The SVD transform is the representation of the of the SVD surface as a 2D image. The SVD transform is the representation of the of the SVD surface as a 2D image.

18 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran SVD Transform

19 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Original Image SVD Transform SVD surface

20 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

21 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

22 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

23 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

24 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

25 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

26 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Application of Feature Vector II SVD Transform, Segmentation

27 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

28 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Sensitivity to Texture

29 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Sensitivity to Texture The Berkeley Segmentation Data Base. Computer Vision Group.

30 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD Transform

31 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation via SVD transform The Berkeley Segmentation Data Base. Computer Vision Group.

32 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran The Berkeley Segmentation Data Base. Computer Vision Group.

33 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Effect of change of a parameter The Berkeley Segmentation Data Base. Computer Vision Group.

34 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Effect of change of a parameter

35 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation (cont.)

36 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation (cont.)

37 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation (cont.)

38 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Segmentation (cont.)

39 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Images show the effect of substituting the diagonal part or the orthogonal parts from the SVD decomposition of an image into that of another image. ws=5 Understanding SVD

40 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Images show the effect of substituting the diagonal part or the orthogonal parts from the SVD decomposition of Lena into that of a randomly generated image. ws=5 Understanding SVD

41 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Understanding SVD Images show the effect of substituting the diagonal part or the orthogonal parts from the SVD decomposition of an image into that of another image. ws=32

42 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Images show the effect of substituting the diagonal part or the orthogonal parts from the SVD decomposition of Lena into that of a randomly generated image. ws=32 Understanding SVD

43 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Invariance relative to inversion These images are negatives of each other. Their SVD surfaces are identical.

44 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran An SVD Surface

45 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Detecting cracks and defects

46 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Detecting cracks and defects

47 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Detecting cracks and defects

48 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Detecting cracks and defects

49 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Theoretical Framework We do not have a definitive answer why SVD works to the extent that it does. However, on the basis of our experimentations we can assert the following: We do not have a definitive answer why SVD works to the extent that it does. However, on the basis of our experimentations we can assert the following: 1. The diagonal entries of SVD capture some features of an image which are not encoded by the correlations of nearby pixels in an image. 1. The diagonal entries of SVD capture some features of an image which are not encoded by the correlations of nearby pixels in an image. 2. This may explain why images constructed on the basis local correlations virtually never exhibit features similar to ones in real images. Images constructed on the basis of Markov random fields or similar procedures generally look very random. 2. This may explain why images constructed on the basis local correlations virtually never exhibit features similar to ones in real images. Images constructed on the basis of Markov random fields or similar procedures generally look very random. 3. As the size of the sliding window increases the importance of the orthogonal parts of SVD decomposition relative to the diagonal part increases. 3. As the size of the sliding window increases the importance of the orthogonal parts of SVD decomposition relative to the diagonal part increases.

50 International Workshop on Computer Vision April 26-30, 2004 Tehran,Iran Work in Progress We are in the process of applying SVD for material/surface classification. We are in the process of applying SVD for material/surface classification. The SVD transform can be applied to the test case of differentiating between a dog and a cat. The results are preliminary and require further tests. The SVD transform can be applied to the test case of differentiating between a dog and a cat. The results are preliminary and require further tests. SVD transforms are also being tested on movie images. SVD transforms are also being tested on movie images. Our methods are being tested on medical images by IRMA (Image Retrieval in Medical Applications) of Institut fuer Medizinische Informatik Universitaetklinikum der RWTH in Aachen, Germany. Our methods are being tested on medical images by IRMA (Image Retrieval in Medical Applications) of Institut fuer Medizinische Informatik Universitaetklinikum der RWTH in Aachen, Germany.