- begin{table}[h]
- begin{tabbing}
- label{tabulka1}
- texttt{textbf{void }} = texttt{findCandidates()}+ \
- ${$ \
- texttt{textbf{for}}=texttt{( int x = 0; x $<$ W; x += w+1 )}+ \
- texttt{textbf{for}}=texttt{( int y = 0; y $<$ H; y += h+1 )}+ \
- ${$ \
- texttt{int cx = x, cy = y;} \
- texttt{textbf{for}}= texttt{( int dx = 0; dx $<=$ w; dx++ )}+ \
- texttt{textbf{for}}=texttt{( int dy = 0; dy $<=$ h; dy++ )}+ \
- texttt{textbf{if}}=texttt{( I[cx][cy] $<$ I[x+dx][y+dy] )}+ \
- texttt{cx = c+dx, cy = y+dy;}--- \
- texttt{textbf{for}}=texttt{( int xx = (cx-w $>?$ 0); xx $<=$ (cx+w $<?$ W-1); xx++ )}+ \
- texttt{textbf{for}}=texttt{( int yy = (cy-h $>?$ 0); yy $<=$ (cy+h $<?$ H-1); yy++ )}+ \
- texttt{textbf{if}}=texttt{( I[cx][cy] $<=$ I[xx][yy] ) textbf{goto failed};}-- \
- texttt{textbf{cout} $<<$ "candidate at : " $<<$ cx $<<$ " " $<<$ cy $<<$ textbf{endl};}\
- texttt{textbf{failed:}} \
- $}$ -- \
- $}$
- end{tabbing}
- caption{Část algoritmu Non maximal supression}
- label{tab:tab1}
- end{table}
v
By: candidates | Date: Apr 5 2009 21:09 | Format: None | Expires: never | Size: 1.14 KB | Hits: 1125
Latest pastes
6 hours ago
2 days ago
3 days ago
6 days ago
7 days ago