Pyramid segmentation algorithms revisited

R. Marfil, L. Molina-Tanco, A. Bandera, J.A. Rodríguez, F. Sandoval
2006 Pattern Recognition  
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, together with the data structures and decimation procedures which encode and manage the information in the pyramid. In order to compare the different segmentation algorithms, we have employed three types of quality measurements: the shift variance measure, the F function and the Q function.
doi:10.1016/j.patcog.2006.02.017 fatcat:f744w7onubh6ppz43r23vz2bkm