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: | Richard E. Blake |
---|---|
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 |
Similar Items
-
Approximation by mean of the function given by dirichlet series by absolutely convergent Dirichlet series
by: A. Laurinčikas
Published: (1998-12-01) -
Computational Simulation of the Flow Past an Airfoil for an Unmanned Aerial Vehicle
by: L. Velázquez-Araque, et al.
Published: (2013-08-01) -
The State of Learning Patterns within Medical Education in a Post-pandemic World: Reflection from IJMS Authors and an Overview of the IJMS Volume 10 Issue 3
by: Ahmed Nahian, et al.
Published: (2022-09-01) -
Forecasting bond returns using asymmetric regression and investment management
by: Jonas Kanapeckas
Published: (1998-12-01) -
Apotheosizing Rain: An Eco-Critical Reading of Select Indian Folktales
by: Deborah Ann P. Manonmaniam, et al.
Published: (2023-11-01)