{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec8 prelim

lec8 prelim - Lecture 8 HW2 due Sept 22 Last Class Energy...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
USC CS574: Computer Vision, Fall 2010 Copyright 2010, by R. Nevatia 1 Lecture 8: Sept 20, 10 HW2 due Sept 22 Last Class Energy Minimization methods Graph cuts Edge Detectors Today’s objective Line fitting Intro to Stereo
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
USC CS574: Computer Vision, Fall 2010 Copyright 2010, by R. Nevatia 2 Edgels to Curves Edge detectors give edge points or edgels Curve is defined by an ordered list of points Connected components (regions) do not necessarily contain order information Linking Given an edge, find the next edge Look for a neighbor in the direction of the edge (normal to gradient) May impose constraints on continuity of edgel direction If multiple choices available, select one Based on local measures (direction/contrast continuity) Global search (corresponds to finding best path in a connectivity graph)
Image of page 2