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 |
| _version_ | 1811312628809596928 |
|---|---|
| author | Richard E. Blake |
| author_facet | Richard E. Blake |
| author_sort | Richard E. Blake |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T10:40:41Z |
| format | Article |
| id | doaj.art-b6b5f5e6c5ad4df88c8bbc4eec641f79 |
| institution | Directory Open Access Journal |
| issn | 1392-5113 2335-8963 |
| language | English |
| last_indexed | 2024-04-13T10:40:41Z |
| publishDate | 1998-12-01 |
| publisher | Vilnius University Press |
| record_format | Article |
| series | Nonlinear Analysis |
| spelling | doaj.art-b6b5f5e6c5ad4df88c8bbc4eec641f792022-12-22T02:49:56ZengVilnius University PressNonlinear Analysis1392-51132335-89631998-12-01310.15388/NA.1998.3.0.15255Symbolic approximation for computer visionRichard E. Blake0Norwegian University of Science and Technology, NorwayThe 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.http://www.journals.vu.lt/nonlinear-analysis/article/view/15255none |
| spellingShingle | Richard E. Blake Symbolic approximation for computer vision Nonlinear Analysis none |
| title | Symbolic approximation for computer vision |
| title_full | Symbolic approximation for computer vision |
| title_fullStr | Symbolic approximation for computer vision |
| title_full_unstemmed | Symbolic approximation for computer vision |
| title_short | Symbolic approximation for computer vision |
| title_sort | symbolic approximation for computer vision |
| topic | none |
| url | http://www.journals.vu.lt/nonlinear-analysis/article/view/15255 |
| work_keys_str_mv | AT richardeblake symbolicapproximationforcomputervision |