Presentation for korea multimedia(in english)


Published on

road extraction by using SVM-based approaches---please contact with if you have any idea to share.

Published in: Education
1 Like
  • Be the first to comment

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Presentation for korea multimedia(in english)

  1. 1. Road Extraction fromRemote Sensing Images using SVM combined with FCM and MRF<br />Jiawei Xu MULTIMEDIA PROCESSING LABORATORYDepartment of Electronic Engineering, Hallym UniversityE-mail:<br />
  2. 2. Contents<br />Introduction<br />A brief review of previous methods<br />Multi-times SVM<br />Proposed algorithm<br />Experimental results<br />Performance evaluation<br />Conclusion<br />
  3. 3. A brief review of previous methods<br />Mathematical morphology<br />Hough transform<br />P-value segmentation<br />Genetic algorithm<br />Markov random field<br />
  4. 4. MATHEMATICAL MORPHOLOGY<br />Flowchart of the proposed algorithm in mathematical morphology<br />Original image 2D median filter open operator erosion & thinning<br />Structure element:square, rectangle, ball, disk and line…<br />Morphology: Erosion,dilation,openoperator, close operator<br />
  5. 5. Hough transform<br />The Hough transform is most commonly used for the detection of regular curves such as lines, circles, ellipses, etc.<br />Parameter setting in this thesis:<br />Detection sensitivity: 0.15<br />The smaller the value is, the more features in the image will be considered as lines.<br />
  6. 6. P-value segmentation<br />This figure shows the entire procedure of road extraction using P value segmentation. In figure (a) is an input image with some selected road parts on it, (b) is the cumulative gray-image histogram distribution , (c) is the result of P value segmentation. Application of some morphological operators such as region property, open operator to (c) results in (d), (e) is the road net image using thinning function, (f) shows the input image with the extracted road net overlaid on it<br />
  7. 7. P-value segmentation<br />Post processing incurs an information loss. (a) is the original image, (b) is the P value diagram, (c) is the result of P value segmentation and (d) is the application of some morphological operators, such as region property, open operator based on (c).<br />Compare with Genetic algorithm threshold segmentation<br />Best fitness and best threshold with generation increase<br />
  8. 8. Markov random field<br />Mean value and variance of selected area<br />Original image MRF processing Speckle-like noise removal Road net <br />
  9. 9. Linear SVMs<br /><ul><li>Support vector machine, alias maximum margin classifiers.
  10. 10. belong to a family of generalized linear classifiers
  11. 11. minimize the empirical classification error
  12. 12. maximize the geometric margin</li></li></ul><li>Φ: x->φ(x)<br />Conversion of Nonlinear Classifier to Linear Classifier via Mapping<br /><ul><li>Two classes(red dots for class 1,blue dots for class 2) can be separated by a circle, and it is not a linear classifier, which means SVM can not be used.
  13. 13. To slove such a problem is to import a nonlinear mapping function. If data sets in lower dimensional space are transformed to a higher dimensional space and successfully separated by a linear hyperplane as we showed in right figure ,we can utilize SVM.</li></ul>linear optimal <br />separating hyper-plane<br />nonlinear optimal separating hyper-plane<br />
  14. 14. Multi-times SVM classification<br />Fig.1:Pre-trained model is constituted by 20 circles from road and 20 asterisks from non-road, respectively. <br />Advantages:<br />Disadvantages:<br />Easy to be implemented, using LIBSVM<br />Polynomial kernel, RBF kernel and Sigmoid kernel were experimented but due to their similar results, here we only illustrate polynomial kernel function, the formula is as follows:<br /><ul><li>Relatively lower accuracy
  15. 15. Complex post processing </li></li></ul><li>Multi-times SVM(binary classification)<br />(a)RS image<br />(b) first-time<br />SVM<br />(c)<br />Second-time<br />SVM<br />(d)<br />Road extraction<br />
  16. 16. Block diagram of our approach<br />FCM classifer<br />RS image<br />SVM classifer<br />MRF regularizer<br /> Road image <br />
  17. 17. FCM preprocessor<br />Algorithm<br />Calculate the fuzzy cluster centers <br /> by using and the new partition matrix <br /> by using<br />Update to <br />3. Stop iteration if <br /> otherwise set and return to step 2<br />non-road-like non-road-like road-like<br /> image1 image 2 image 3<br />Partition<br />into a collection of c fuzzy clusters with a list of c cluster centers V , such that <br />and a partition matrix<br />where is a numerical value in [0,1] that tells the degree to which the element belongs to the i-th cluster.<br />
  18. 18. FCM processing result <br />(a) (b)<br /> (c) (d)(Road-like image used for further processing)<br /> (a)Original image(b)~(d)cluster 1,2,3 <br />
  19. 19. Why we use FCM before SVM?<br />Because of unbalanced data<br />If class A(non-road) samples distributed over a large area<br />Class B(road) samples distributed over a small area,<br />Supposing we use SVM directly, the coefficient Matrix will be more close to the class that has a large distribution (which means hyper-plane is close to the large-distributed class because of the property of SVM)<br />An extreme case is : one-class SVM(to detect the outlier)<br />If samples amounts is very few and distributed in an extremely small area, SVM will recognize it as outlier,(in road extraction,for extreme case, road part will be neglected as the outlier)i.e., the hyperplane is unbalancedly assigned, which will lead to misclassification.<br />FCM can display the each cluster features more obviously,alternatively speaking, enlarge the difference/distance between different clusters, which more or less decrease the misclassification rate.<br />
  20. 20. Test Images & Reference Models to evaluate our performance<br />
  21. 21. Performance evaluation criteria<br />Complete: <br />Correct: <br />Rank distance: <br />Quality : <br />True positive (TP): both the processed model and the reference scene model classify the pixel belonging to road.<br />True negative (TN): both the processed model and the reference scene model classify the pixel as belonging to the background.<br />False positive (FP): processed model classifies the pixel as belonging to road, but the reference scene model classifies the pixel as belonging to the background.<br />False negative (FN): the processed model classifies the pixel as belonging to the background, but the reference scene model classifies the pixel as belonging to road<br />
  22. 22. Comparison between SVM and FCM+SVM<br />RS images<br /><ul><li>Beijing.bmp
  23. 23. Shanghai.bmp
  24. 24. Vancouver.bmp</li></li></ul><li>MRF regularizer<br />Mean value:<br />Variance:<br /> is the pixel set of the corresponding area, is the total number of the pixel set, is the intensity value of pixel, other values were decided empirically.<br /> iteration ,global E and temperature <br />
  25. 25. Experimental results<br />We intentionally selected RS images with different characteristics:Beijing,shanghai,Vancouver… (ALL images from<br />original images FCM-SVM processing MRF regularizer output images<br />
  26. 26. Multi-classes SVM(one against all)<br />RS image road-class image lake-class image<br />expectation value initialization<br /> classification of samples to be recognized by SVM<br /> plot result image<br />
  27. 27. Rank distance of K-means, SVM and our method <br /> (%)<br /> We do not list out morphology, Hough transform…because rank distance, <br />quality percentage and other values are much lower than these approaches <br />
  28. 28. Quality percentage of K-means, SVM and proposed method<br /> (%)<br />
  29. 29. Comparison of FCM+K-means with FCM+SVM<br />(a)<br />Comparison of FCM+K-means with FCM+SVM <br />(a) results of FCM clustering; (b) FCM followed by K-means clustring; (c) results of FCM followed by SVM.<br /> (b) (c)<br />(a)<br /> (b) (c)<br />
  30. 30. Comparison of FCM+K-means with FCM+SVM<br />
  31. 31. GUI IMPLEMENTATION FOR ROAD Extraction: example 1<br />
  32. 32. Example 2<br />
  33. 33. Example 3<br />
  34. 34. Executable file contains DOS window <br />Road.exe:<br />Classified the functions two categories:<br />One is for manual control methods and the other is for machine learning methods<br />Meanwhile, we can also conceal DOS window<br />
  35. 35. Conclusion<br />This thesis has proposed a new road extraction method based on SVM classification combined with FCM clustering and MRF regularization. <br /><ul><li>In terms of rank distance, and quality percentage, the proposed method is superior to SVM, morphological approaches, Hough transforms and K-means.
  36. 36. Using FCM clustering to separate road-like cluster and the other clusters increases the SVM classification accuracy.
  37. 37. We used MRF regularization to remove speckle-like noise then we could extract the fine road net.
  38. 38. Experimental results with several images with various features show that the proposed method gives us a higher accuracy and strong robustness regardless of input characteristics.</li></li></ul><li>Future research<br />Batch processing of remote sensing image<br />Fuzzy SVM application in RS images<br />One against all SVM computational duration reduction<br />ANN algorithm optimization<br />
  39. 39. References<br />[1] Stefan Hinz, “Automatic extraction of urban road networks from multi-view aerial imagery”, Technische University 2003<br />[2] VladmirVapnik, ”Statistical Learning Theory”, JOHN WILELY & SONS, Inc.1998<br />[3] Curt H.Davis, “An integrated system for automatic road mapping from high-resolution multi-spectral satellite imagery by information fusion”, Elsevier Inc. 2004<br /> [4] Yairmoshe, “GUI with Matlab” Department of Electronic Engineering, Columbia University , May 2004.<br />[5]<br />[6] Yang Li, “A new validity function for fuzzy clustering”, School of mathematical sciences, Beijing normal university, 2005<br />[6] Xu Yong and Shaoguang Zhou, “Markov random field for road extraction applications in remote sensing images”, Department of Surveying and Mapping Engineering, Hohai University, 2008<br />[7] David M.McKeown ,“Performance evaluation for automatic feature extraction ”, Computer Science Department, Carnegie Mellon University 2000<br />[8] Patrick Perez, “Markov random fields and images”, Campus Beauileu, 1999<br />[9] Drs. Trani and Rahka, “MATLAB Graphic user interfaces(GUI) computer applications in civil engineering ”, Spring, 2000<br />
  40. 40. Other fields<br />From 2009.01 to 2009.12<br />OpenCV1.0+VC6.0<br />OpenGL+VC6.0<br />OpenCV2.0+VS2008<br />Java3d on Myeclipse 7.5<br />
  41. 41. OpenCV1.0+VC6.0<br />Haarcascade<br />Cascade:<br /> Stage1:<br /> Classifier11:<br /> Feature11<br /> Classifier12:<br /> Feature12 ... <br /> Stage2:<br /> Classifier21: <br /> Feature21<br />CvHaarFeature, CvHaarClassifier, CvHaarStageClassifier, CvHaarClassifierCascade Boosted Haar------Tree structure<br />Here, we import cvLoadHaarClassifierCascade<br />
  42. 42. OpenGL+VC6.0<br />3D effect by using Anaglyph glasses<br />
  43. 43. OpenCV2.0+Visual studio2008<br />Configuration(CMake setup…)<br />Debug/Release Rebuild<br />Options -> Projects and Solutions -> VC++ Directories <br />Car plate recognition <br />
  44. 44. Soft matting<br />Function: Image enhancement<br />Boxfilter.m: Equivalent to the function: colfilt(imSrc, [2*r+1, 2*r+1], 'sliding', @sum) - But much faster<br />Guidefilter.m<br />% - guidance image: I<br />% - filtering input image: p (should be a gray-scale/single channel image)<br />% - local window radius: r<br />% - regularization parameter: eps<br />
  45. 45. THE END<br />Q&A<br />