Abstract

The ability to find the average of a set of contours has several applications in computer vision including prototype formation and computational atlases. While contour averaging can be handled in an informal manner, the formal formulation within the framework of generalized median as an optimization problem is attractive. In this work we will follow this line. A special class of contours is considered, which start from the top, pass each image row exactly once, and end in the last row of an image. Despite of the simplicity they frequently occur in many applications of image analysis. We propose a dynamic programming approach to exactly compute the generalized median contour in this domain. Experimental results will be reported on two scenarios to demonstrate the usefulness of the concept of generalized median contours. In the first case we postulate a general approach to implicitly explore the parameter space of a (segmentation) algorithm. It is shown that using the generalized median contour, we are able to achieve contour detection results comparable to those from explicitly training the parameters based on known ground truth. As another application we apply the exact median contour to verify the tightness of a lower bound for generalized median problems in metric space.

Keywords

Ground Truth Polar Space Closed Contour Dynamic Programming Approach Contour Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Chalana, V., Kim, Y.: A methodology for evaluation of boundary detection algorithms on medical images. IEEE Trans. on Medical Imaging 16(5), 642–652 (1997)CrossRefGoogle Scholar
  2. 2.
    Cheng, D., Jiang, X., Schmidt-Trucksäss, A., Cheng, K.: Automatic intima-media thickness measurement of carotid artery wall in B-mode sonographic images. In: Proc. of IEEE International Symposium on Biomedical Imaging: From Nano to Macro, pp. 912–915 (2006)Google Scholar
  3. 3.
    Cingue, L., Cucciara, R., Levialdi, S., Martinez, S., Pignalberi, G.: Optimal range segmentation parameters through genetic algorithms. In: Proc. of 15th Int. Conf. on Pattern Recognition, Barcelona, vol. 1, pp. 474–477 (2000)Google Scholar
  4. 4.
    de la Higuera, C., Casacuberta, F.: Topology of strings: Median string is NP-complete. Theoretical Computer Science 230(1/2), 39–48 (2000)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Jiang, X., Münger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. on Pattern Analysis and Machine Intelligence 23(10), 1144–1151 (2001)CrossRefGoogle Scholar
  6. 6.
    Jiang, X., Bunke, H.: Optimal lower bound for generalized median problems in metric space. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 143–151. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Jiang, X., Abegglen, K., Bunke, H., Csirik, J.: Dynamic computation of generalized median strings. Pattern Analysis and Applications 6(3), 185–193 (2003)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Jiang, X., Rothaus, S., Rothaus, K., Mojon, D.: Synthesizing face images by iris replacement: Strabismus simulation. In: Proc. of Int. Conf. on Computer Vision Theory and Applications, Setuba, Portugal, pp. 41–47 (2006)Google Scholar
  9. 9.
    Lopresti, D., Zhou, J.: Using consensus sequence voting to correct OCR errors. Computer Vision and Image Understanding 67(1), 39–47 (1997)CrossRefGoogle Scholar
  10. 10.
    Min, J., Powell, M., Bowyer, K.W.: Automated performance evaluation of range image segmentation algorithms. IEEE Trans. on SMC – Part B 34(1), 263–271 (2004)Google Scholar
  11. 11.
    Sebastian, T.B., Klein, P.N., Kimia, B.B.: On aligning curves. IEEE Trans. on Pattern Analysis and Machine Intelligence 25(1), 116–125 (2003)CrossRefGoogle Scholar
  12. 12.
    Sim, J.S., Park, K.: The consensus string problem for a metric is NP-complete. Journal of Discrete Algorithms 2(1) (2001)Google Scholar
  13. 13.
    Wang, L., Jiang, T.: On the complexity of multiple sequence alignment. Journal of Computational Biology 1(4), 337–348 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pakaket Wattuya
    • 1
  • Xiaoyi Jiang
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of MünsterGermany

Personalised recommendations