Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Order Parameters for Detecting Target Curves in Images: When Does High Level Knowledge Help?

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In this paper, we provide a theoretical framework based on Bayesian decision theory which involves evaluating performance based on an ensemble of problem instances. We pay special attention to the task of detecting a target in the presence of background clutter. This framework is then used to analyze the detectability of curves in images. We restrict ourselves to the case where the probability models are ergodic (both for the geometry of the curve and for the imaging). These restrictions enable us to use techniques from large deviation theory to simplify the analysis. We show that the detectability of curves depend on a parameter K which is a function of the probability distributions characterizing the problem. At critical values of K the target becomes impossible to detect on average. Our framework also enables us to determine whether a simpler approximate model is sufficient to detect the target curve and hence clarify how much information is required to perform specific tasks. These results generalize our previous work (Yuille, A.L. and Coughlan, J.M. 2000. Pattern Analysis and Machine Intelligence PAMI, 22(2):160–173) by placing it in a Bayesian decision theory framework, by extending the class of probability models which can be analyzed, and by analysing the case where approximate models are used for inference.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Amari, S. 1982. Differential geometry of curved exponential families-Curvature and information loss. Annals of Statistics, 10(2):357-385.

    Google Scholar 

  • Amit, D.J. 1989. Modelling Brain Function: The World of Attractor Neural Networks. Cambridge University Press: Cambridge England.

    Google Scholar 

  • Barron, J.L., Fleet, D.J., and Beauchemi, S.S. 1994. Systems and experiment performance of optical flow techniques. Int'l Journal of Computer Vision, 12(1):43-77.

    Google Scholar 

  • Bowye, K.W. and Phillips, J. (Eds.), 1998. Empirical Evaluation Techniques in Computer Vision. IEEE Computer Society Press.

  • Coughla, James M. and Yuille, A.L. 1999. Bayesian A* tree search with expected O (N) convergence rates for road tracking. In Proceedings EMMCVPR'99, pp. 189-204. Springer-Verlag Lecture Notes in Computer Science 1654.

  • Cove, T.M. and Thomas, J.A. 1991. Elements of Information Theory. Wiley Interscience Press: New York.

    Google Scholar 

  • DeGroot, M.H. 1970. Optimal Statistical Decisions. McGraw-Hill: New York.

    Google Scholar 

  • Dembo, A. and Zeitouni, O. 1998. Large Deviation Techniques and Applications (2nd ed.). Springer: New York.

    Google Scholar 

  • Geiger, D. and Liu, T.-L. 1997. Top-down recognition and bottom-up integration for recognizing articulated objects. In EMMCVPR'97, M. Pellilo and E. Hancock (Eds.), pp. 295-310. Springer-Verlag, CS 1223.

  • Geman, D. and Jedynak, B. 1996.Anactive testing model for tracking roads in satellite images. IEEE Trans. Patt. Anal. and Machine Intel., 18(1):1-14.

    Google Scholar 

  • Green, D.M. and Swets, J.A. 1988. Signal Detection Theory and Psychophysics (2nd ed.). Peninsula Publishing: Los Altos, California.

    Google Scholar 

  • Grenander, U., Miller, M.I., and Srivastav, A. 1998. Hilbert-Schmidt lower bounds for estimators on matrix Lie groups for ATR. IEEE Trans. Patt. Anal., and Machine Intel., 20(8):790-802.

    Google Scholar 

  • Griffiths, R. and Ruelle, D. 1971. Strict convexity (“continuity”) of the pressure in lattice systems. Comm. Math. Phys., 23:169-175.

    Google Scholar 

  • Heath, M., Sarkar, S., Sanocki, T., and Bowyer, K.W. 1997. A robust visual method for assessing the relative performance of edge detection algorithms. IEEE Trans. on Pattern Analysis and Machine Intelligence, 19(12):1338-1359.

    Google Scholar 

  • Hoover, A.W., Jean-Baptiste, G., Xiaoyi, Jiang, Flynn, P.J., Bunke, H., Goldgof, D.B., Bowyer, K., Eggert, D.W., Fitzgibbon, A., and Fishe, R.B. 1996. An experimental comparison of range image segmentation algorithms. IEEE Trans on Pattern Analysis and Machine Intelligence, 18(7):1-17.

    Google Scholar 

  • Kass, M., Witkin, A., and Terzopoulos, D. 1987. Snakes: Active contour models. In Proc. 1st Int. Conf. on Computer Vision, pp. 259-268.

  • Knill, D.C. and Richards, W. (Eds.), 1996. Perception as Bayesian Inference. Cambridge University Press.

  • Konishi, S., Yuille, A.L., Coughlan, J.M., and Zhu, S.C. 1999. Fundamental bounds on edge detection: An information theoretic evaluation of different edge cues. In Proc. Int'l Conf. on Computer Vision and Pattern Recognition, Fort Collins, Colorado, pp. 573-579.

  • Lanford, O.E. 1973. Entropy and equilibrium states in classical mechanics. In Statistical Mechanics and Mathematical Problems, A. Lenard(Ed.), Springer, Berlin, Germany.

    Google Scholar 

  • Lewis, J.T., Pfister, C.E., and Sullivan, W.G. 1995. Entropy, concentration of probability, and conditional limit theorems. Markov Processes Relat. Fields, 1:319-396, Moscow, Russia.

    Google Scholar 

  • Murray, M.K. and Rice, J.W. 1993. Differential Geometry and Statistics. Chapman and Hall.

  • O'Sullivan, J.A., Blahut, R.E., and Snyde, D.L. 1998. Informationtheoretic image formulation. IEEE Transactions on Information Theory, 44(6)

  • Pearl, J. 1984. Heuristics. Addison-Wesley.

  • Rajagopalan, A.N. and Chaudhuri, S. 1998. Performance analysis of maximum likelihood estimator for recovery of depth from defocused images and optimal selection of camera parameters. International Journal of Computer Vision, 30(3):175-190.

    Google Scholar 

  • Ratches, J.A., Walters, C.P., Buse R.G., and Guenther, B.D. 1997. Aided and automatic target recognition based upon sensory inputs from image forming systems. IEEE Trans. on PAMI, 19(9).

  • Szelisk, R. and Kang, S.B. 1997. Shape ambiguities in structure from motion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):506-512.

    Google Scholar 

  • Tsotsos, J.K. 1990. Analyzing vision at the complexity level. Behavioural and Brain Sciences, 13(3):423-469.

    Google Scholar 

  • Vapnik, V.N. 1998. Statistical Learning Theory. John Wiley and Sons: New York.

    Google Scholar 

  • Wu, Y., Zhu, S.C., and Liu, X.W. 2000. Equivalence of image ensembles and FRAME models. International Journal of Computer Vision, 38(3):245-261.

    Google Scholar 

  • Young, G. and Chellappa, R. 1992. Statistical analysis of inherent ambiguities in recovering 3D motion from a noisy flow field. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(10):995-1013.

    Google Scholar 

  • Yuille, A.L. and Coughlan, J.M. 2000. Fundamental limits of bayesian inference: Order parameters and phase transitions for road tracking. Pattern Analysis and Machine Intelligence PAMI, 22(2):160-173.

    Google Scholar 

  • Yuille, A.L. and Coughlan, J. 2000. An A* perspective on deterministic optimization for deformable templates. Pattern Recognition, 33(4):603-616.

    Google Scholar 

  • Yuille, A.L. and Coughlan, James M. 1999. High-level and generic models for visual search: When does high level knowledge help? In Proceedings Computer Vision and Pattern Recognition CVPR'99, Fort Collins, Colorado, pp. 631-637.

  • Yuille, A.L., Coughlan, James M., and Zhu, S.C. 2000. A unified framework for performance analysis of bayesian inference. In Proceedings SPIE, Orlando, Florida, pp. 333-346.

  • Yuille, A.L., Coughlan, James M., Wu, Y.N., and Zhu, S.C. 2000. Order parameters for minimax entropy distributions. Smith-Kettlewell Technical Report (yuille@ski.org).

  • Zhu, S.C., Wu, Y., and Mumford, D. 1997. Minimax entropy principle and its application to texture modeling. Neural Computation, 9(8):1627-1660.

    Google Scholar 

  • Zhu, S.C. 1999. Embedding gestalt laws in markov random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 21(11):1170-1187.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuille, A., Coughlan, J.M., Wu, Y. et al. Order Parameters for Detecting Target Curves in Images: When Does High Level Knowledge Help?. International Journal of Computer Vision 41, 9–33 (2001). https://doi.org/10.1023/A:1011156931605

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011156931605

Navigation