ppt课件-数据结构 c s c i262，spring2002 lecture2 生动（ data structures c s c i262, spring2002 lecture2 classesand）.pptVIP

* Computational Vision CSCI 363, Fall 2016Lecture 6Edge Detection Convolution To smooth a function, we replace the value at each x position with the averaged values around that position. This process is called convolution. Smoothing works best if the average is weighted: nearby neighbors count more, distant neighbors count less. A Gaussian function works well for this weighting. Convolution of I with G is written: G(x) * I(x) For continuous functions: The Derivative of a Convolution Gaussian and its derivatives Instead of taking the derivative of a convolution of the image and the Gaussi