A similarity measure is needed in many Computer Vision problems. Although Euclidean distance has traditionally been used, median distance was recently proposed as an alternative, mostly due to its robustness properties. In this paper, a parametric class of distances is presented which allow to introduce a notion of similarity depending on the problem being considered.