1 / 67

8D040 Basis beeldverwerking Feature Extraction

8D040 Basis beeldverwerking Feature Extraction. Anna Vilanova i Bartrol í Biomedical Image Analysis Group bmia.bmt.tue.nl. N=M=30. What is an image?. Image is a 2D rectilinear array of pixels (picture element). N=M=256. Binary Image L=1 (1 bit). L=3 (2 bits). L=15(4 bits).

joann
Download Presentation

8D040 Basis beeldverwerking Feature Extraction

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 8D040 Basis beeldverwerkingFeature Extraction Anna Vilanova i Bartrolí Biomedical Image Analysis Group bmia.bmt.tue.nl

  2. N=M=30 What is an image? Image is a 2D rectilinear array of pixels (picture element) N=M=256

  3. Binary Image L=1 (1 bit) L=3 (2 bits) L=15(4 bits) L=255 (8 bits) What is an image? No continuous values - Quantization 8 170 15 255

  4. An image is just 2D? No! – It can be in any dimension Example 3D: Voxel-Volume Element

  5. Segmentation VERY DIFFICULT

  6. Why feature extraction ? Reduction of dimensionality Pixel level Image of 256x256 and 8 bits 256 65536 ~ 10 157826 possible images

  7. Incorporation of cues from human perception Transcendence of the limits of human perception The need for invariance Why feature extraction ?

  8. Apple detection …

  9. Transformation (Rotation)

  10. How do we transform an image? How do we know which Q belongs to P? We transform a point P How do we transform an image f(P)?

  11. How do we transform an image? How do we know which Q belongs to P? We know T which is the transformation we want to achieve. How do we transform an image f(P)?

  12. Apple detection …

  13. Feature Characteristics • Invariance (e.g., Rotation, Translation) • Robust (minimum dependence on) • Noise, artifacts, intrinsic variations • User parameter settings • Quantitative measures

  14. We extract features from… Segmented Objects Region of Interest

  15. Features Texture Based (Image & ROI) Shape (Segmented objects) Classification

  16. Shape Based Features • Object based • Topology based (Euler Number) • Effective Diameter (similarity to a circle to a box) • Circularity • Compactness • Projections • Moments (derived by Hu 1962) • …

  17. Adjacency and Connectivity – 2D 4-neighbourhood of 8-neighbourhood of • Notation: k-Neighbourhood of is

  18. 6-neighbourhood 18-neighbourhood 26-neighbourhood Adjacency and Connectivity – 3D

  19. Objects or Components (Jordan Theorem) In 2D – (8,4) or (4,8)-connectivity In 3D – (6,26)-,(26,6)-,(18,6)- or (6,18)-connectivity

  20. Connected Components Labeling Each object gets a different label

  21. Connected Components Labeling B Raster Scan C A Note: We want to label A. Assuming objects are 4-connected B, C are already labeled. Cortesy of S. Narasimhan

  22. Connected Components Labeling X 0 X 0 0 1   label(A) = new label label(A) = “background” 0 C 1  label(A) = label(C)  label(A) = label(B) B B If label(B) = label(C) then, label(A) = label(B)  0 1 C 1 Cortesy of S. Narasimhan

  23. Connected Components Labeling B What if label(B) not equal to label(C)?  C 1

  24. Connected Components Labeling Each object gets a different label

  25. Features Texture Based (Image & ROI) Shape (Segmented objects) Classification

  26. Topology based – Euler Number Euler Number E describes topology. C is # connected components H is # of holes.

  27. Euler Number 3D E=1+0-1=0 E=1+0-1=0 E=1+1-0=2 • Euler Number E describes topology. • Cis # connected components • Cav is # of cavities • G is # of genus

  28. Euler Number 3D E=2+0-0=2 E=1+1-0=2 • Euler Number E describes topology. • Cis # connected components • Cav is # of cavities • G is # of genus

  29. 3D Euler Number • The Euler Number in 3D can be computed with local operations • Counting number of vertices, edges and faces of the surfaces of the objects

  30. Simple Shape Measurements • 2D area - 3D volume • Summing elements • 2D perimeter - 3D surface area • Selection of border elements • Sum of elemets with weights • Error of precision

  31. Similarity to other Shape • Effective Diameter • Circularity (Circle C=1) • Compactness – (Actually non-compactness)(Circle Comp= )

  32. Moments • Definition • Order of a moment is • Moments identify an object uniquely • ?is the Area • Centroid

  33. Central Moments Moments invariant to position Invariant to scaling

  34. Moments to Define Shape and Orientation Inertia Tensor

  35. Eigenanalysis of a Matrix • Given a matrixS, we solve the following equation • we find the eigenvectors and eigenvalues • Eigenvectors and eigenvalues go in couples an usually are ordered as follows:

  36. Eigenanalysis of the Inertia Matrix Eigenanalysis Sphere Flatness Elongated

  37. Eigenanalysis of the Inertia Matrix Eigenanalysis Sphere Flatness Elongated

  38. Orientation in 2D • Using similar concepts than 3D • Covariance or Inertia Matrix • Eigenanalysis we obtain 2 eigenvalues and 2 eigenvectors of the ellipse

  39. Moments Invariance • Translation • Central moments are invariant • Rotation • Eigenvalues of Inertia Matrix are invariant • Scaling • If moment scaled by (3D) (2D)

  40. Moments invariant rotation-translation-scaling • For 3D three moments (Sadjadi 1980) For 2D seven moments

  41. Features Texture Based (Image & ROI) Shape (Segmented objects) Classification

  42. Image Based Features Gonzalez & Woods – Digital Image Processing Chapter 11 – 11.3.3 Texture • Using all pixels individually • Histogram based features • Statistical Moments (Mean, variance, smoothness) • Energy • Entropy • Max-Min of the histogram • Median • Co-occurrance Matrix

  43. Histogram P(bi) bi L=9

  44. How do the histograms of this images look like?

  45. Bimodal Histogram

  46. Trimodal Features

  47. Histogram Features • Mean • Central Moments

  48. Histogram Features • Mean • Variance • Relative Smoothness • Skewness

  49. Histogram Features Energy (Uniformity) Entropy

More Related