Networks of constraints: Fundamental properties and applications to picture processing
Information SciencesPublished 1 January 1974Open access
Ugo Montanari
Citations1,248
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Constraints are treated algebraically, and the solution of a system of linear equations in this algebra provides an approximation of the minimal network, and this solution is proved exact in special cases, e.g., for tree-like and series-parallel networks and for classes of relations for which a distributive property holds.
Abstract
Computer Science Department
Keywords
Computer Science
Communications of the ACMAlgorithm 97: Shortest path
3,962 Citations1962Robert W. Floyd
The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
Journal of the ACMA Theorem on Boolean Matrices
1,657 Citations1962Stephen Warshall
It is proved the validity of an algorithm whose running time goes up slightly faster than the square of d, the running times of which increase-other things being equal-as the cube of d.
Communications of the ACMOn the optimal detection of curves in noisy pictures
295 Citations1971Ugo Montanari
A technique for recognizing systems of lines is presented, in which the heuristic of the problem is not embedded in the recognition algorithm but is expressed in a figure of merit, which allows for greater flexibility and adequacy in the particular problem.
DSpace@MIT (Massachusetts Institute of Technology)COMPUTER RECOGNITION OF THREE-DIMENSIONAL OBJECTS IN A VISUAL SCENE
159 Citations1968Adolfo Guzmán Arenas, Adolfo Guzmaan
The main conclusion is that it is possible to separate a picture or scene into the constituent objects exclusively on the basis of monocular geometric properties (onThe basis of pure form); in fact, successful methods are shown.
Information and ControlSeparable graphs, planar graphs and web grammars
82 Citations1970Ugo Montanari
It is proved that, in general, this extension of web grammar does not increase the generative power of the grammar, but it is useful, for otherwise it is not possible to incorporate negative contextual conditions into the rules, since the context of a given vertex can be unbounded.
Communications of the ACMRepresentations for space planning
69 Citations1970Charles M. Eastman
The representational requirements for this problem area are defined and compared with current computer graphic languages, and four alternative data structures that allow automated space planning are described and compared.
Computer recognition of three-dimensional objects in a visual scene
38 Citations1969A. Guzmán
Information SciencesConsistent properties of composite formation under a binary relation
4 Citations1970John C. Schwebel, Bruce H. McCormick
The object of this paper is to characterize binary relations by their consistent composite formation properties by the use of reduction theorems and by the construction of example systems.