1. November 5, 2013Computer Vision Lecture 15: Region Detection 1 Basic Steps for Filtering in the Frequency Domain

2. November 5, 2013Computer Vision Lecture 15: Region Detection 2 Noise Removal Fourier spectrum Noisy image Noise-cleaned image

3. November 5, 2013Computer Vision Lecture 15: Region Detection 3 Low Pass Filtering Original Low Pass Butterworth 50% cutoff diameter 10 (left) and 25

4. November 5, 2013Computer Vision Lecture 15: Region Detection 4 High Pass Filtering Original High Pass Butterworth 50% cutoff diameter 10 (left) and 25

5. November 5, 2013Computer Vision Lecture 15: Region Detection 5 Motion Blurring Filter Aerial photo blurred by motion and its spectrum The blur vector and its spectrum

6. November 5, 2013Computer Vision Lecture 15: Region Detection 6 Motion Blurring Filter The result of dividing the original spectrum by the motion spectrum and then retransforming

7. November 5, 2013Computer Vision Lecture 15: Region Detection 7 Convolution Theorem Let F {.} denote the application of the Fourier transform and * denote convolution (as usual). Then we have: F {(f*h)(x, y)} = F(u, v)  H(u, v) and F {f(x,y)  h(x, y)} = (F*H)(u, v), where F and H are the Fourier transformed images f and h, respectively. This means that instead of computing the convolution directly, we can Fourier transform f and h, multiply them, and then transform them back. In other words, a convolution in the space domain corresponds to a multiplication in the frequency domain, and vice versa.

8. November 5, 2013Computer Vision Lecture 15: Region Detection 8 Demo Website I highly recommend taking a look at this website: http://users.ecs.soton.ac.uk/msn/book/new_demo/ It has nice interactive demonstrations of the Fourier transform, the Hough transform, edge detection, and many other useful operations.

9. November 5, 2013Computer Vision Lecture 15: Region Detection 9 Region Detection There are two basic – and often complementary – approaches to segmenting an image into individual objects or parts of objects: region-based segmentation and boundary estimation. Region-based segmentation is based on region detection, which we will discuss in this lecture. Boundary estimation is based on edge detection, which we already discussed earlier.

10. November 5, 2013Computer Vision Lecture 15: Region Detection 10 Region Detection We have already seen the simplest kind of region detection. It is the labeling of connected components in binary images. Of course, in general, region detection is not that simple. Successful region detection through component labeling requires that we can determine an intensity threshold in such a way that all objects consist of 1- pixels and do not touch each other.

11. November 5, 2013Computer Vision Lecture 15: Region Detection 11 Region Detection We will develop methods that can do a better job at finding regions in real-world images. In our discussion we will first address the question of how to segment an image into regions. Afterwards, we will look at different ways to represent the regions that we detected.

12. November 5, 2013Computer Vision Lecture 15: Region Detection 12 Region Detection How shall we define regions? The basic idea is that within the same region the intensity, texture, or other features do not change abruptly. Between adjacent regions we do find such a change in at least one feature. Let us now formalize the idea of partitioning an image into a set of regions.

13. November 5, 2013Computer Vision Lecture 15: Region Detection 13 Region Detection A partition S divides an image I into a set of n regions R i. Regions are sets of connected pixels meeting three requirements: The union of regions includes all pixels in the image, Each region R i is homogeneous, i.e., satisfies a homogeneity predicate P so that P(R i ) = True. The union of two adjacent regions R i and R j never satisfies the homogeneity predicate, i.e., P(R i  R j ) = False.

14. November 5, 2013Computer Vision Lecture 15: Region Detection 14 Region Detection The homogeneity predicate could be defined as, for example, the maximum difference in intensity values between two pixels being no greater than a some threshold . Usually, however, the predicate will be more complex and include other features such as texture. Also, the parameters of the predicate such as  may be adapted to the properties of the image. Let us take a look at the split-and-merge algorithm of image segmentation.

15. November 5, 2013Computer Vision Lecture 15: Region Detection 15 The Split-and-Merge Algorithm First, we perform splitting: At the start of the algorithm, the entire image is considered as the candidate region. If the candidate region does not meet the homogeneity criterion, we split it into four smaller candidate regions. This is repeated until there are no candidate regions to be split anymore. Then, we perform merging: Check all pairs of neighboring regions and merge them if it does not violate the homogeneity criterion.

16. November 5, 2013Computer Vision Lecture 15: Region Detection 16 The Split-and-Merge Algorithm Sample image to be segmented with  = 1 11111112 11111110 31499810 11888410 11666310 11566310 11566210 11111100

17. November 5, 2013Computer Vision Lecture 15: Region Detection 17 The Split-and-Merge Algorithm First split 11111112 11111110 31499810 11888410 11666310 11566310 11566210 11111100

18. November 5, 2013Computer Vision Lecture 15: Region Detection 18 The Split-and-Merge Algorithm Second split 11111112 11111110 31499810 11888410 11666310 11566310 11566210 11111100

19. November 5, 2013Computer Vision Lecture 15: Region Detection 19 The Split-and-Merge Algorithm Third split 11111112 11111110 31499810 11888410 11666310 11566310 11566210 11111100

20. November 5, 2013Computer Vision Lecture 15: Region Detection 20 The Split-and-Merge Algorithm Merge 11111112 11111110 31499810 11888410 11666310 11566310 11566210 11111100

21. November 5, 2013Computer Vision Lecture 15: Region Detection 21 The Split-and-Merge Algorithm Final result 11111112 11111110 31499810 11888410 11666310 11566310 11566210 11111100