z-logo
open-access-imgOpen Access
Optimisation Approaches to Constraint Satisfaction Problems in Computer Vision
Author(s) -
Kazuhiko Yamamoto
Publication year - 1994
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.8.2
Subject(s) - computer science , minification , energy minimization , artificial intelligence , constraint (computer aided design) , matching (statistics) , computer vision , elevation (ballistics) , energy (signal processing) , segmentation , constraint satisfaction , image segmentation , constraint satisfaction problem , image (mathematics) , mathematics , geometry , probabilistic logic , chemistry , statistics , computational chemistry , programming language
This paper describes several new image understanding methods based on parallel operation. There are several constraint satisfaction approaches using an energy minimization. We show how we reconstruct three-dimensional surfaces from contours without elevation data and sparse points of known elevation data using this approach. We also introduce Active Net using this approach, and apply this model to segmentation and binocular stereo matching. We experimented with these energy minimization approaches to solve the problems of early and intermediate levels of computer vision, and show some of the results of our recent research

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom