Admissibility Of Constraint Functions In Relaxation Labeling
Explore this paper's citation graph
- Type
- article
- Published
- 1988-12-05
- Cited by
- 9
- References
- 6
- OpenAlex
- https://openalex.org/W1545691771
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:45459275
Keywords
Constraint (computer-aided design), Relaxation (psychology), Computer science, Algorithm, Artificial intelligence
References
- A Design Method for Relaxation Labeling Applications
- Analysis of relaxation processes: The two-node two-label case
- Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach
- Scene Labeling by Relaxation Operations
- On the Foundations of Relaxation Labeling Processes
- Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence
Cited by
- Shape Matching Based on Invariants
- Modeling, Estimation, and Pattern Analysis of Random Texture on 3-D surfaces
- Minimization of MRF Energy with Relaxation Labeling
- Markov Random Field Modeling in Computer Vision
- Markov Random Field Modeling in Image Analysis
- Advances in Pattern Recognition
- Relaxation labeling of Markov random fields
- Energy Minimization and Relaxation Labeling
- Helaxation Labeling 01
Related papers
- Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26
- Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance
- Using DataGrid Control to Realize DataBase of Querying in VB6.0
- Study and Two Types of Typical Usage of DataGrid Web Server Control
- PACWON: A parallelizing compiler for workstations on a network
- Bidirectional Sort and Choosing a Row to Update or Delete by Click Any Cell in DataGrid
- Flexible Application of VSFlexGrid