28.02.2013 Views

Bio-medical Ontologies Maintenance and Change Management

Bio-medical Ontologies Maintenance and Change Management

Bio-medical Ontologies Maintenance and Change Management

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

End;<br />

for x1 = 0; 2*side+1 do<br />

for y1 = 0; 2*side+1 do<br />

Gr[x1,y1] = Gr[x1,y1]-m;<br />

End;<br />

End;<br />

End;<br />

Multimedia Medical Databases 115<br />

Proposition 1: The Gabor_filter procedure has a temporal complexity O(n 2 ) where<br />

n is the maximum dimension of the image (n= max{side, xs, ys}).<br />

Proof: The operations from the beginning of the procedure are elementary <strong>and</strong><br />

don’t have the complexity more than O(1). The products of the matrices have<br />

complexity O(dim1 *dim2 ), where ‘dim1 ’ <strong>and</strong> ‘dim2 ’ are the matrix dimensions (no<br />

more than ‘n’, as it has been stated at the beginning of the procedure). The<br />

function calls aren’t recursive, <strong>and</strong> the functions have a complexity no more than<br />

O(n 2 ). So, the Gabor function has complexity O(side 2 ), due to the FOR loops<br />

which contain only elementary operations of O(1) complexity. The functions<br />

MatrixFFT2D, MatrixFFT2D, MatrixIFFT2D have complexity no more than<br />

O(n 2<br />

), because they contain at most 2 nested FOR loops each having the maximum<br />

dimension ‘n’ <strong>and</strong> operations of O(1) complexity. The result is that the whole<br />

procedure has the time complexity O(n 2<br />

).<br />

4.3 Co-occurrence Matrices<br />

For comparison, the method based on co-occurrence matrices is implemented.<br />

In the case of color images, one matrix was computed for each of the three<br />

channels (R, G, B). For an image f(x, y), the co-occurrence matrix hdf (i, j) is<br />

defined so that each entry (i, j) is equal to the number of times for that f(x 1 ,y 1 )=i<br />

<strong>and</strong> f(x 2 ,y 2 )=j, where (x 2 ,y 2 ) = (x 1 ,y 1 ) + (d cos φ, d sin φ) [18].<br />

This leads to three quadratic matrices with a dimension equal to the number of<br />

the color levels presented in an image (256 in our case), for each distance d <strong>and</strong><br />

orientation f.<br />

The classification of texture is based on the characteristics extracted from the<br />

co-occurrence matrix: energy, entropy, maximum probability, contrast, inverse<br />

difference moment <strong>and</strong> correlation [18].<br />

Energy:<br />

Entropy:<br />

∑<br />

∑<br />

a , b ; a ≠ b<br />

P<br />

λ<br />

Φ , d<br />

( a,<br />

b)<br />

a − b<br />

2<br />

PΦ , d Φ d<br />

a,<br />

b<br />

( a,<br />

b)<br />

log 2 P , ( a,<br />

b)<br />

k<br />

(4.5)<br />

(4.6)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!