1 / 14

Today’s Lecture

Today’s Lecture. Computational Vision Images Image formation in brief (+reading) Image processing: filtering Linear filters Non-linear operations Signatures Edg es Image interpretation Edge extraction Grouping Scene recovery Recognition. Color code: Done Today

cybill
Download Presentation

Today’s Lecture

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. Today’s Lecture • Computational Vision • Images • Image formation in brief (+reading) • Image processing: filtering • Linear filters • Non-linear operations • Signatures • Edges • Image interpretation • Edge extraction • Grouping • Scene recovery • Recognition • Color code: • Done • Today • Next class (or not at all) CS-424 Gregory Dudek

  2. Image formation Key processes: 1. Light comes from source 2. Hits objects in scene 3. Is reflected towards A) other objects [return to step 2] B) the camera lens 4. Passes through lens being focussed on imaging surface 5. Interacts with transducers on surface to produce electrical signals In the eye, the lens is that of the eye, the imaging surface is the retina, and the transducers are rods and cones. In a camera, the imaging surface is a CCD (charge-coupled device) made up of transistors (or related devices). [several other types of video camera technology are commonly available, including newer “cheap and cheerful” CMOS cameras, and older “opticons”.] CS-424 Gregory Dudek

  3. Scene “Reconstruction” • Solve the inverse problem: find the scene that produced the image. • Things to account for: • The camera • The geometry of the scene • The interaction of light with objects in the scene. • Camera model can be: • Perspective [ loosely: x & y -> fx/z fy/z ] • Orthogonal & orthographic are special cases • Paraperspective (AKA weak perspective) CS-424 Gregory Dudek

  4. Recovery • Typically simplified models of illumination and reflectance are employed. • One light source. • All objects have the same matte reflectance. • Sometimes: don’t worry about occlusion. • Sometimes: don’t worry about shading. • Recovery of geometry is known as scene reconstruction. We will return to this later... CS-424 Gregory Dudek

  5. The Sobel Edge operator • Filter for horizontal and vertical edges, combine. CS-424 Gregory Dudek

  6. Edge extraction • Edges: places where the intensity changes: hence there is a large derivative. • Each edge has an amplitude and orientation that can be expressed as a combination of orthogonal components in the x and y directions. CS-424 Gregory Dudek

  7. Sobel detector specifics • Sobel edge detector • Convolve image with a pair of operators, S and S’ S*I and S’*I • The edge map was the Pythagorean sum of the two convolutions E = (S * I) 2 +(S' * I) 2 The Sobel kernel, as an example, can be broken down into two parts: 1. A smoothing operation (discussed last class) reduces effect of noise, sets scale (i.e. size)observe: d/dt F(w) = d/dt k e-iwt = -ikw e-iwt 2. A numerical differentiation df/dt ≈ f(t) - f(t-1) CS-424 Gregory Dudek

  8. Other edge operators • Older edge detectors neglected the smoothing step: • Larry Roberts developed one of the first (2x2 Robert’s operator[s]). • The Prewitt operator was based on assuming we could fit a smooth surface to the data and then differentiate. • Hueckel operator: use least-squares line fitting • More recent work involves smoothing with a two-dimension Gaussian: • Gaussian provides localization in space, as well as frequency. • Rather than explicitly compute (1D form): we can use the fact that I is constantto improve efficiency: Can be precomputed CS-424 Gregory Dudek

  9. Edges: modern methods • Instead to looking for peaks in the derivative, look for zero-crossings in the second derivative. • A recent operator developed by Canny uses multiple scales (sizes) to improve edge detection, based on optimizing the notion of what an edge is.Wanted: • Detection: detect an edge iff it’s there • Uniqueness: detect each edge just once • Localization: detect it at the right place • Consider an analytic step edge and derive an optimal edge detector. • Track edges along contours and suppress (remove) neighbors. CS-424 Gregory Dudek

  10. Edges • An UNREALISTICALLY simple example: • Edges from the Canny Operator. CS-424 Gregory Dudek

  11. Input image • Consider: extract the edge elements + grouping them into contours. CS-424 Gregory Dudek

  12. Sobel detector output CS-424 Gregory Dudek

  13. Canny operator output • Note the effect of non-maximum suppression. • Note how difficult naive grouping would be. CS-424 Gregory Dudek

  14. Human Edge Detection • Overheads CS-424 Gregory Dudek

More Related