Browse by topic
Type of publication
An Algorithm For Fast Median Search. Proc. of the VII National Symposium on Pattern Recognition and Image Analysis, 1997. pp. 187-192.Searching for a median of a set of patterns is a well-known technique to model the set or to aidsearching for more accurate models such as ageneralized median or a k-median. While medians andgeneralized medians are (relatively) easy to compute in the case of Euclidean representation spaces, this is unfortunately no longer true when more complex distance measures are to be used, whichoften happens in practical situations. In these cases, a direct method to perform median search is not feasible for large sets of patterns. In order to cope with this computational problem, an algorithm formedian search is proposed which is faster than the direct method in terms of distance computations.