A comparison of four algorithms in the alignment of plantar pressure images

• Autor(a) principal: Francisco P. M. Oliveira
• Data de Publicação: 2011
• Outros Autores: João Manuel R. S. Tavares
• Tipo de documento: Livro
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: https://hdl.handle.net/10216/55169
• topic: Análise matemática, Engenharia mecânica; Mathematical analysis, Mechanical engineering

Four distinct algorithms were study in the alignment of plantar pressure images: one is based on the matching of the feet external contours, another uses the technique of phase correlation, a third directly optimizes the cross-correlation and takes advantage on the fast Fourier transform properties, and a last one iteratively optimizes an intensity (dis)similarity measure. The later algorithm implements a two-steps approach: firstly, an initial alignment is accomplished by one of the former algorithms; then, the alignment is enhanced by optimizing a selected image (dis)similarity measure via Powell's method. Two kinds of tests were performed to assess the alignment accuracy: 1) a set of known control geometric transformations was applied to the testing images, and the residual errors were computed from the spatial positions of the aligned and transformed pixels. 2) 30 pairs of real plantar pressure images were aligned, and the mean squared error (MSE) and mutual information (MI) measures were evaluated. Regarding the accuracy obtained in the alignment of the images transformed by the control geometric transformations, the algorithm based on the iterative optimization achieved the best result (p<0.001), closely followed by the algorithm based on the direct optimization of the cross-correlation in the frequency domain and the algorithm based on the phase correlation technique. The same performance was observed in the alignment of the 30 pairs of real images. In terms of computational speed, the algorithm based on the matching of contours was the fastest, and the algorithm based on the iterative optimization the slowest.