Abstract
The computation of generalized median patterns is typically an NP-complete task. Therefore, research efforts are focused on approximate approaches. One essential aspect in this context is the assessment of the quality of the computed approximate solutions. In this paper we present a lower bound in terms of a linear program for this purpose. It is applicable to any pattern space. The only assumption we make is that the distance function used for the definition of generalized median is a metric. We will prove the optimality of the lower bound, i.e. it will be shown that no better one exists when considering all possible instances of generalized median problems. An experimental verification in the domain of strings and graphs shows the tightness, and thus the usefulness, of the proposed lower bound.
Chapter PDF
Similar content being viewed by others
References
J. Astola, P. Haavisto, and Y. Neuvo, Vector median filters, Proceedings of the IEEE, 78(4): 678–689, 1990.
F. Bartolini, V. Cappellini, C. Colombo, and A. Mecocci, Enhancement of local optical flow techniques, Proc. of 4th Int. Workshop on Time Varying Image Processing and Moving Object Recognition, Florence, Italy, 1993.
C. Gramkow, On averaging rotations, Int. Journal on Computer Vision, 42(1/2): 7–16, 2001.
A. Guimond, J. Meunier, and J.-P. Thirion, Average brain models: A convergence study, Computer Vision and Image Understanding, 77(2): 192–210, 2000.
C. de la Higuera and F. Casacuberta, Topology of strings: Median string is NP-complete, Theoretical Computer Science, 230(1–2): 39–48, 2000.
X. Jiang, L. Schiffmann, and H. Bunke, Computation of median shapes, Proc. of 4th. Asian Conf. on Computer Vision, 300–305, Taipei, 2000.
X. Jiang, A. Münger, and H. Bunke, On median graphs: Properties, algorithms, and applications, IEEE Trans. on PAMI, 23(10): 1144–1151, 2001.
X. Jiang, H. Bunke, and J. Csirik, Median strings: A review, 2002. (submitted for publication)
A. Juan and E. Vidal, Fast median search in metric spaces, in A. Amin and D. Dori (eds.), Advances in Pattern Recognition, Springer-Verlag, 905–912, 1998.
T. Lewis, R. Owens, and A. Baddeley, Averaging feature maps, Pattern Recognition, 32(9): 1615–1630, 1999.
D. Lopresti and J. Zhou, Using consensus sequence voting to correct OCR errors, Computer Vision and Image Understanding, 67(1): 39–47, 1997.
L. Mico and J. Oncina, An approximate median search algorithm in non-metric spaces, Pattern Recognition Letters, 22(10): 1145–1151, 2001.
A. J. O’Toole, T. Price, T. Vetter, J. C. Barlett, and V. Blanz, 3D shape and 2D surface textures of human faces: The role of “averages” in attractiveness and age, Image and Vision Computing, 18(1): 9–19, 1999.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., 1982.
X. Pennec and N. Ayache, Uniform distribution, distance and expectation problems for geometric features processing, Journal of Mathematical Imaging and Vision, 9(1): 49–67, 1998.
J. S. Sim and K. Park, The consensus string problem for a metric is NP-complete, Journal of Discrete Algorithms, 2(1), 2001.
K. Subramanyan and D. Dean, A procedure to average 3D anatomical structures, Medical Image Analysis, 4(4): 317–334, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, X., Bunke, H. (2002). Optimal Lower Bound for Generalized Median Problems in Metric Space. In: Caelli, T., Amin, A., Duin, R.P.W., de Ridder, D., Kamel, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2002. Lecture Notes in Computer Science, vol 2396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70659-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-70659-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44011-6
Online ISBN: 978-3-540-70659-5
eBook Packages: Springer Book Archive