1. Computer Vision Chapter 1 Introduction

2.  The goal of computer vision is to make useful decisions about real physical objects and scenes based on sensed images.

3. Applications areas  Industrial inspection  Medical imaging  Image database and query  Satellite and surveillance imagery  Entertainment  Handwriting and printed character recognition

4. Image dimensionality  1D –audio (sound)  2D –digital camera picture, chest x-ray, ultrasound  3D –video sequence of 2D images –multispectral 2D images –volumetric medical imagery (CT, MRI)  4D –PET-CT –MRI

5. Image types  Binary  Grayscale  Color  Multispectral

6. Operations on images  Neighborhood (local) operations  Enhancing the entire image  Combining multiple images –Ex. differences, noise reduction, blending  Feature extraction –Ex. area, centroid (center of mass), orientation, lines –invariants

7. Extracting features

8. Example features

9. General hardware discussion  General purpose vs. special purpose (DSP, GPU)  Uniprocessors vs. parallel processors (COWs, multiprocessors)  Sensors (discussed later)

10. General software discussion  Android SDK –Java-based –freely available from http://developer.android.com/sdk/index.html –Albie start app  doxygen for source code documentation –freely available from doxygen.org  code format –http://www.oracle.com/technetwork/java/code conv-138413.html

11. General software discussion  C# –use Visual C# (Express Edition is freely available from Microsoft) –CSImageViewer starter app –main course web page has links  doxygen for source code documentation  code format

12. INTRODUCTION TO DOXYGEN

13. What’s in a program file? 1. Comments 2. Code

14. What’s a compiler?  A program –Input –Processing –Output

15. What’s a compiler?  A program –Input:  Text file (your program) –Processing:  Convert HLL statements into machine code (or similar)  Ignore comments –Output:  A binary file of machine code (or similar)

16. Traditional documentation  Code files are separate from design documents.  Wouldn’t it be great if we could bring code and documentation together into the same file(s)?

17. Tools like doxygen and javadoc  A program –Input:  Text file (your program) –Processing:  Convert (specially formatted) comments into documentation  Ignore HLL statements –Output:  Documentation (typically in HTML)

18. Getting started with doxygen  Download from doxy  Download from doxygen.org.   Do this only once in directory (folder) containing your source code: (already done for you) doxygen –g   This creates a doxygen configuration file called Doxyfile which you may edit to change default options.   Edit Doxyfile and make sure all EXTRACTs are YES   Then whenever you change your code and wish to update the documentation: doxygen   which updates all documentation in html subdirectory   Demonstrate.

19. Using doxygen: document every (source code) file /** * \fileImageData.java * \briefcontains ImageData class definition (note that this *class is abstract) * * \authorGeorge J. Grevera, Ph.D. */.

20. Using doxygen: document every class //---------------------------------------------------------------------- /** \brief CSImageViewer class. * * Longer description goes here. */ public class CSImageViewer : Form {.

21. Using doxygen: document every function //---------------------------------------------------------------- /** \brief Given a pixel's row and column location, this * function returns the gray pixel value. * \param row image row * \param col image column * \returns the gray pixel value at that position */ public int getGray ( int row, int col ) { int offset = row * mW + col; return mOriginalData[ offset ]; }

22. Using doxygen: document every function (parameters) //---------------------------------------------------------------- /** \brief Given a pixel's row and column location, this * function returns the gray pixel value. * \param row image row * \param col image column * \returns the gray pixel value at that position */ public int getGray ( int row, int col ) { int offset = row * mW + col; return mOriginalData[ offset ]; }

23. Using doxygen: document every function (return value) //---------------------------------------------------------------- /** \brief Given a pixel's row and column location, this * function returns the gray pixel value. * \param row image row * \param col image column * \returns the gray pixel value at that position */ public int getGray ( int row, int col ) { int offset = row * mW + col; return mOriginalData[ offset ]; }

24. Using doxygen: document all class members (and global and static variables in C/C++) protected boolmIsColor;///< true if color (rgb); false if gray protected boolmImageModified;///< true if image has been modified protected intmW;///< image width protected intmH;///< image height protected intmMin;///< overall min image pixel value protected intmMax;///< overall max image pixel value protected StringmFname;///< (optional) file name

25. doxygen (lengthier example including html) /** \brief Actual original (unmodified) unpacked (1 component per * array entry) image data. * * If the image data are gray, each entry in this array represents a * gray pixel value. So mImageData[0] is the first pixel's gray * value, mImageData[1] is the second pixel's gray value, and so * on. Each value may be 8 bits or 16 bits. 16 bits allows for * values in the range [0..65535]. * * If the image data are color, triples of entries (i.e., 3) represent * each color rgb value. So each value is in [0..255] for 24-bit * color where each component is 8 bits. So mImageData[0] is the * first pixel's red value, mImageData[1] is the first pixel's green * value, mImageData[2] is the first pixel's blue value, mImageData[3] * is the second pixel's red value, and so on. */ protected int[] mOriginalData;

30. Required documentation rules  Each file, class, method, and member variable must be documented w/ doxygen. –Exception is when we follow the one-class-per- file rule. In that case only the class or file needs to be documented.  The contents of the body of each method should contain comments, but none of these comments should be in the doxygen format. (Not every comment is a doxygen comment.)

31. Not every comment should be a doxygen comment. Required: 1.every file/class 2.every function/method 3.every class member (data) 4.(in C/C++, every static and/or global variable) Use regular, plain comments in the body of a function/method. (One exception is the \todo.)

32. int mColorImageData[][][]; ///< should be mColorImageData[mH][mW][3] int mColorImageData[][][]; ///< should be mColorImageData[mH][mW][3] //---------------------------------------------------------------------- //---------------------------------------------------------------------- /** \brief Given a buffered image, this ctor reads the image data, stores /** \brief Given a buffered image, this ctor reads the image data, stores * the raw pixel data in an array, and creates a displayable version of * the raw pixel data in an array, and creates a displayable version of * the image. Note that this ctor is protected. The user should only * the image. Note that this ctor is protected. The user should only * use ImageData.load( fileName ) to instantiate an object of this type. * use ImageData.load( fileName ) to instantiate an object of this type. * \param bi buffered image used to construct this class instance * \param bi buffered image used to construct this class instance * \param w width of image * \param w width of image * \param h height of image * \param h height of image * \returns nothing (constructor) * \returns nothing (constructor) */ */ protected ColorImageData ( final BufferedImage bi, final int w, final int h ) { protected ColorImageData ( final BufferedImage bi, final int w, final int h ) { mW = w; mW = w; mH = h; mH = h; mOriginalImage = bi; mOriginalImage = bi; mIsColor = true; mIsColor = true; //format TYPE_INT_ARGB will be saved to mDisplayData //format TYPE_INT_ARGB will be saved to mDisplayData mDisplayData = mOriginalImage.getRGB(0, 0, mW, mH, null, 0, mW); mDisplayData = mOriginalImage.getRGB(0, 0, mW, mH, null, 0, mW); mImageData = new int[ mW * mH * 3 ]; mImageData = new int[ mW * mH * 3 ]; mMin = mMax = mDisplayData[0] & 0xff; mMin = mMax = mDisplayData[0] & 0xff; for (int i=0,j=0; i<mDisplayData.length; i++) { for (int i=0,j=0; i<mDisplayData.length; i++) { mDisplayData[i] &= 0xffffff; //just to insure that we only have 24-bit rgb mDisplayData[i] &= 0xffffff; //just to insure that we only have 24-bit rgb final int r = (mDisplayData[i] & 0xff0000) >> 16; final int r = (mDisplayData[i] & 0xff0000) >> 16; final int g = (mDisplayData[i] & 0xff00) >> 8; final int g = (mDisplayData[i] & 0xff00) >> 8; final int b = mDisplayData[i] & 0xff; final int b = mDisplayData[i] & 0xff; if (r<mMin) mMin = r; if (r<mMin) mMin = r; if (g<mMin) mMin = g; if (g<mMin) mMin = g;…

33. Summary of most useful tags \file\author\brief\param\returns \todo (not used in assignments) And many, many others.

34. THE GOOD, THE BAD, AND THE UGLY Back to images and imaging…

35. The good, the bad, and the ugly.  Success is usually hard won!  Problems: 1.Matching models to reality 2.Lighting variation 3.Sensor noise 4.Occlusion & rotation/translation/scale 5.Limited resolution  An image is a discrete model of an underlying continuous function  Spatial discretization  Sensed values quantization 6.Levels Of Detail (LOD)

36. So let’s try to recognize chairs.  Task that is trivial for us.

37. The good, the bad, and the ugly.  Problem: Matching models to reality

38. The good, the bad, and the ugly.  Problem: Matching models to reality

39. The good, the bad, and the ugly.  Problem: Matching models to reality

40. The good, the bad, and the ugly.  Problem: Matching models to reality

41. The good, the bad, and the ugly.  Problem: Matching models to reality

42. The good, the bad, and the ugly.  Problem: Matching models to reality

43. The good, the bad, and the ugly.  Problem: Matching models to reality

44. The good, the bad, and the ugly.  Problem: Matching models to reality

45. The good, the bad, and the ugly.  Problem: Matching models to reality –Maybe CAD/CAM models can help! –http://www.3dcadbrowser.com/browse.aspx?category=59

46. The good, the bad, and the ugly.  Problems: Lighting variation

47. The good, the bad, and the ugly.  Problem: S ensor noise

48. The good, the bad, and the ugly.  Problem: Occlusion

49. The good, the bad, and the ugly.  Problem: Rotation, reflection, translation, & scale

50.  Problem: –Limited resolution  An image is a discrete model of an underlying continuous function  Spatial discretization (above and below)  Sensed values quantization (next slide)  Too much of a good thing can be a problem too! The good, the bad, and the ugly.

51.  Problem: –Limited resolution  An image is a discrete model of an underlying continuous function  Spatial discretization (previous slide)  Sensed values quantization (below: left 16M colors, right 16 colors very carefully chosen)

52. The good, the bad, and the ugly. Problem: Limited resolution of gray values (sensed value quantization)

53. The good, the bad, and the ugly.  Problem: L evels Of Detail (LOD)

54. EXAMPLE APPLICATION: COUNTING BOLT HOLES

55. Example application: counting bolt holes  A missing bolt hole is a very costly defect during assembly.

56. Counting bolt holes  Pixel = (is a contraction for what?)  Dark = 1 = no light= no hole  Light = 0 = light= part of hole We could have used other conventions as well. –Dark = 0 = no light = no hole; light = 1 = light = part of hole. –Dark = 255; light = 0. –Dark > 127; light 127; light <= 127.

57. Counting bolt holes  External corner (ext) = 2x2 neighborhood of exactly three 1s (and one 0)  Internal corner (int) = exactly three 0s (and one 1)  Holes = (ext – int) / 4

58. Counting bolt holes  External corner = 2x2 neighborhood of exactly 3-1’s (and 1-0)  Internal corner = exactly 3-0’s  How many (total) possible combinations (of 4 bits) are there?

59. Counting bolt holes  Ex. 3 objects row 0 (y’s) column 5 (x’s) (x,y)=(c,r)=(0,0) [r][c]=[0][0] (x,y)=(c,r)=(Cols-1,Rows-1) [r][c]=[Rows-1][Cols-1] adjacent in memory (in C++)

60. Algorithm for counting holes in a binary image Input: a binary image, M, of R rows and C cols (indexed as M[r][c]) Output: number of holes M contains int external=0, internal=0; for (int r=0; r<R-1; r++) { for (int c=0; c<C-1; c++) { if ( isExternal(M,r,c) ) external++; else if ( isInternal(M,r,c) ) internal++; }} return (external-internal) / 4;

61. Hole counting assumptions  All image border pixels must be 1s.  Each region of 0s (holes) must be 4- connected.  Holes must also be simply connected (not contain any objects).

62. Counting bolt holes  Ex. 3 objects –External –Internal

63. Counting bolt holes  Ex. 3 objects –External –Internal

64. Counting bolt holes  Ex. 3 objects –External –Internal

65. Counting bolt holes  Ex. 3 objects –External –Internal

66. Counting bolt holes  Ex. 3 objects –External –Internal

67. Counting bolt holes  Ex. 3 objects –External –Internal

68. Counting bolt holes  Ex. 3 objects –External –Internal …

69. Counting bolt holes  Ex. 3 objects –External –Internal

70. Counting bolt holes  Ex. 3 objects –External –Internal

71. Counting bolt holes  Ex. 3 objects = (21-9) / 4 = 12 / 4 –External –Internal

72. Algorithm for counting holes in a binary image Input: a binary image, M, of R rows and C cols (indexed as M[r][c]) Output: number of holes M contains int external=0, internal=0; for (int r=0; r<R-1; r++) { for (int c=0; c<C-1; c++) { if ( isExternal(M,r,c) ) external++; else if ( isInternal(M,r,c) ) internal++; }} return (external-internal) / 4; Why r<R-1 and c<C-1?

73. PROBLEMS FOR DISCUSSION

74. Problems: Ex. 1.5 –Problems can be solved in different ways and a problem solver should not get trapped early in a specific approach. Consider the problem of identifying cars in various situations:  entering a parking lot or a secured area,  passing through a tollgate,  exceeding the speed limit. –Several groups are developing or have developed machine vision methods to read a car’s license plate. Suggest an alternative to machine vision. How do the economic and social costs compare to the machine vision approach?

75. Problems: Ex. 1.6 –Identify some defects remaining in the right image of Figure 1.8 and describe simple neighborhood operations that will improve the image.

76. Problems: Ex. 1.9 –Examine the image of bacteria in Figure 1.8 and the sample of automatically computed features in Figure 1.12. Is there potential for obtaining a count of bacteria, say within 5% accuracy (in this example)? Explain.

77. Problems: Ex. 1.9 cont’d.

78. Problems: Ex. 1.12: On face interpretation. –Is it easy for you to decide the gender and approximate age of persons pictured in magazine ads? –Psychologists might tell us that humans have the ability to see a face and immediately decide on the age, sex, and degree of hostility of the person. Assume that this ability exists for humans. If you think it would be based on image features, then what are they? If you think that image features are not used, then explain how humans might make such decisions.

79. Problems: Ex. 1.14: Toward the correctness of holecounting. (a) How many possible 2x2 neighborhood patterns are there in a binary image? List them all. (b) Which of the patterns of part (a) cannot occur in a binary image that is 4-connected? Define border point to be the center grid point of a 2x2 neighborhood that contains both 0 and 1 pixels. (c) Argue that a single hole cannot be accounted for by just counting the number of e and i patterns along its border and that the formula n=(e-i)/4 is correct when one hole is present. (d) Argue that no two holes can have a common border point. (e) Argue that the formula is correct when an arbitrary number of holes is present.