# Agrupamiento por similitud de imágenes mediante árbol de expansión mínima y soft heap

Cristian J. López del Alamo, Lizeth J. Fuentes Pérez, Luciano A. Romero Calla
Published in XXIV Encuentro Chileno de Computación - Jornadas Chilenas de Computación, Valparaíso, Chile, 2012

### Abstract

This research proposes a grouping of faces using a minimum spanning tree. The Prim’s algorithm is optimized using the structure Soft Heap as priority queue, and tests are done to check its efficiency compared to Prim’s algorithm with a Fibonacci Heap as queue priority. The characteristic vector is obtained by the Haar wavelet, and for the distances between images are used Euclidean distance between their feature vectors.

@ARTICLE{JCC2012,