Public paste
v
By: candidates | Date: Apr 5 2009 21:09 | Format: None | Expires: never | Size: 1.14 KB | Hits: 674

  1. begin{table}[h]
  2.   begin{tabbing}
  3.     label{tabulka1}
  4.     texttt{textbf{void }} = texttt{findCandidates()}+ \
  5.     ${$ \
  6.     texttt{textbf{for}}=texttt{( int x = 0; x $<$ W; x += w+1 )}+ \
  7.     texttt{textbf{for}}=texttt{( int y = 0; y $<$ H; y += h+1 )}+ \
  8.     ${$ \
  9.     texttt{int cx = x, cy = y;} \
  10.     texttt{textbf{for}}= texttt{( int dx = 0; dx $<=$ w; dx++ )}+ \
  11.     texttt{textbf{for}}=texttt{( int dy = 0; dy $<=$ h; dy++ )}+ \
  12.     texttt{textbf{if}}=texttt{( I[cx][cy] $<$ I[x+dx][y+dy] )}+ \  
  13.     texttt{cx = c+dx, cy = y+dy;}--- \
  14.     texttt{textbf{for}}=texttt{( int xx = (cx-w $>?$ 0); xx $<=$ (cx+w $<?$ W-1); xx++ )}+ \
  15.     texttt{textbf{for}}=texttt{( int yy = (cy-h $>?$ 0); yy $<=$ (cy+h $<?$ H-1); yy++ )}+ \
  16.     texttt{textbf{if}}=texttt{( I[cx][cy] $<=$ I[xx][yy] ) textbf{goto failed};}-- \
  17.     texttt{textbf{cout} $<<$ "candidate at : " $<<$ cx $<<$ " " $<<$ cy $<<$ textbf{endl};}\
  18.     texttt{textbf{failed:}} \
  19.     $}$ -- \
  20.     $}$    
  21.   end{tabbing}
  22.   caption{&#268;ást algoritmu Non maximal supression}
  23.    label{tab:tab1}
  24. end{table}