
This directory contains the results of the evaluation of several shape 
matcing methods on closed shapes of marine life species. The database 
and the queries are also available at http://www.ced.tuc.gr/~petrakis.  
Each directory contains the results obtained by a different method.
There are 20 files of answers for each method. The name of the file 
is identical to the name of the query followed by ".seq". Each file 
contains the results of a query. Each query retrieved the best 50 answers. 
Each answer consists of three numbers: the first is the distance between 
the query and the answer, the second is the name (id) of the retrieved 
database shape and the third entry is the evaluation of the answer: "ja:" 
means that the answer has been considered (by the human who carried out 
the evaluation) similar to the query, "nein:" means that the answer has 
been considered dissimilar. 

The competitor methods are:


* Fourier Descriptors (answers in directory "fourier"), 
Wallace TP and Wintz PA (1980), "An Efficient Three-Dimensional 
Aircraft Recognition Algorithm Using Normalized Fourier Descriptors.
Computer Graphics and Image Processing, 13:99--126.

* Geometric Moments (answers in directory "geomoments"), 
Hu MK (1962), "Visual Pattern Recogn. by Moment Invariants", 
IRE Trans. on Info. Theory}, IT-8:179--187. This is the 
original methods, Many variants and improvements of the this
methods have been also proposed. 

* Sequential Moments (answers in directory "seqmoments"),
Gurta L and Srinath MD (1987), "Contour Sequence Moments for the 
Classification of Closed Planar Shapes".
Pattern Recognition, 20(3):267--271.

* Non Optimal Dynamic Programming (answers in "DPnonoptimal"),
Milios E and Petrakis EGM (1998), "Shape Retrieval Based on 
Dynamic Programming". IEEE Trans. on Image Processing}, 9(1):141--147.

* Optimal Dynamic Programming (answer in "DPoptimal"),
Euripides G.M. Petrakis, Aristeidi Diplaros, Evangelos Milios,
"Matching and Retrieval of Distroted and Occluded Shapes Using 
Dynamic Programming", IEEE Transactions on Pattern Analysis and
Maching Intelligence (to appear), 
available from http://www.ced.tuc.gr/~petrakis 
* 4 variants of this methods are evaluated. These correspond 
to the method with no restriction on backtracking (DPoptimal) and 
with restriction K (DPoptimalK=3,5,9 respectively).

Euripides G.M. Petrakis
Dept. of Electronic and Computer Engineering
Technical University of Crete
htpp://www.ced.tuc.gr/~petrakis
e-mail: petrakis@ced.tuc.gr



