Symbolic approximation for computer vision
The need for a definition of discrete convergence in matching problems, which are essential in computer vision, is described and the fundamental properties of Scott lattice theory are outlined. Three data types: relational graphs, graph match_table and constraints, are considered and partial orderin...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
1998-12-01
|
| Series: | Nonlinear Analysis |
| Subjects: | |
| Online Access: | http://www.journals.vu.lt/nonlinear-analysis/article/view/15255 |
| Summary: | The need for a definition of discrete convergence in matching problems, which are essential in computer vision, is described and the fundamental properties of Scott lattice theory are outlined. Three data types: relational graphs, graph match_table and constraints, are considered and partial orderings are exhibited for them. A matching iteration consistent with the theory is sketched. |
|---|---|
| ISSN: | 1392-5113 2335-8963 |