1 / 23

Counting windows

Counting windows. 1. 2. 3. 4. 5. 6. 7. 8. Project participants (in alphabetical order): Akif Durdu Middle East Technical University, Turkiye Viktor Jónás Budapest Polytechnic, Hungary Csaba Pintér University of Szeged, Hungary

jaimin
Download Presentation

Counting windows

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. Counting windows 1 2 3 4 5 6 7 8 • Project participants • (in alphabetical order): • Akif Durdu Middle East Technical University, Turkiye • Viktor Jónás Budapest Polytechnic, Hungary • Csaba PintérUniversity of Szeged, Hungary • Péter Rieger Budapest Polytechnic, Hungary • Umut Tilki Middle East Technical University, Turkiye

  2. Project Overview Main task was to count windows on the photo of a building Input: - Image that the user wants to count windows in - A length of the diagonal of an average sized window (user selects it on the input picture) Output: - Number of found windows- Output picture containing the original picture and the contours of the found windows

  3. Overview: • Preprocessing • Detecting lines with Hough transformation It will define boxes (creates separate quads) unifying “similar” boxes • Classify remaining boxes (windows <-> non-windows)

  4. Preprocessing: • Converting image to grayscale • Normalizing • Median filter (blurring) • Sobel operator (finding edges) • Opening

  5. Preprocessing 1 – Converting to grayscale: • Color information is not so important during preprocessing • Faster • Easier to handle

  6. Preprocessing 2 – Normalizing • Greater contrast • More determining edges

  7. Preprocessing 3 – Median filter • Blurs the unimportant edges (e.g. gutters, window frames (inner+outer=2)) • Still preserves the other edges • Disadvantage: rounds corners (Hough can compensate) • Parameters: • repetitions: 3 • window size: square root of the user input window diagonal

  8. Preprocessing 3 – Median filter

  9. Preprocessing 4 – Sobel operator • Finds the edges • Prepares the picture for Hough transform

  10. Preprocessing 5 – Opening • Dilation + erosion • Reduces remaining noise (unifies broken edges) • Makes possible double frame edges disappear

  11. Preprocessing 5 – Opening

  12. Detecting lines with Hough transformation: • Applying Hough transformation • Finding local maxima (finding the important lines) • Applying inverse Hough transformation(projecting found lines back)

  13. Hough 1 – Applying • Image space -> Hough space transformation • Strong lines with higher intensity

  14. Hough 2 – Finding local maxima • Separating dominant lines • Window size: 3*sqrt(UI diagonal)

  15. Hough 3 – Inverse Hough transformation • Hough space -> image space[inverse Hough formulas] • Projecting dominant lines back • It defines boxes (general quads) actual ideal

  16. Unifying “similar” boxes • Classify image to boxes (floodfill) • computing statistics • unifying “similar” boxes(similar <-> their statistics have little difference)

  17. Unifying 1 – Flood fill • It classifies image to boxes • Each class is a general quad • it is done with a simple floodfill until there are any black spots remaining • the color values of the areas represent the classes

  18. Unifying 2 – Statistics • They are used to represent a kind of similarity measure • Statistics: mean and variance of each color channelssome more statistics: center coordinates, area (for an easier determination of neighbourhood) The sample variance Eqn. The sample meanEqn.

  19. Unifying 3 – The unifying itself • we must decrease the number of classes radically • the reamaining classes may be • whole windows (we hope  ) • larger homogeneous areas (roof, grass, sky …)

  20. Unifying 3 – The unifying itself • The unifying algorithm put each class into a queue while (there is a class in the queue) { while (there is a similar neighbor) { unify them compute new statistics } remove from queue }

  21. Classifying remaining boxes • we must decide if an area represents a window or not • we do this according to the user input “ideal” window • the idea:if the ratio of edges or area is reasonable, let’s consider it to be a window, else it possibly belong to the class of non-windows

  22. The result

  23. THE END Thank YOU Have a nice day

More Related