On the public citation graph

Syntactic analysis of two-dimensional visual signals in the presence of noise

https://doi.org/10.1007/bf01070399
0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-8243-4_1openalex-snapshot
Pattern Recognition: Heuristics or Science?
inferredcites →https://doi.org/10.1007/bf00995736openalex-snapshot
Stochastic grammars and languages
inferredcites →https://doi.org/10.1016/0041-5553(63)90538-xopenalex-snapshot
The correlation method for image recognition
inferredcites →https://doi.org/10.1016/s0019-9958(65)90241-xopenalex-snapshot
Fuzzy sets
inferredcites →https://doi.org/10.1016/s0019-9958(69)90050-3openalex-snapshot
On equal matrix languages
inferredcites →https://doi.org/10.1016/s0146-664x(72)80013-3openalex-snapshot
Edge detection using heuristic search methods
inferredcites →https://doi.org/10.1016/s0146-664x(72)80015-7openalex-snapshot
Web grammars and picture description
inferredcites →https://doi.org/10.1016/s0146-664x(72)80019-4openalex-snapshot
Abstract families of matrices and picture languages
inferredcites →https://doi.org/10.1145/1476589.1476631openalex-snapshot
Decomposition of a visual scene into three-dimensional bodies
inferredcites →https://doi.org/10.21236/ad0256582openalex-snapshot
PRINCIPLES OF NEURODYNAMICS. PERCEPTRONS AND THE THEORY OF BRAIN MECHANISMS
inferredcites →https://doi.org/10.21236/ad0633642openalex-snapshot
INTRODUCTION TO CYBERNETICS
inferredcites →https://doi.org/10.2307/1419730openalex-snapshot
Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms
inferredcites →https://doi.org/10.2307/2344304openalex-snapshot
Principles of Operations Research, with Applications to Managerial Decisions.
inferredcites →https://doi.org/10.2307/3006723openalex-snapshot
An Introduction to Cybernetics
inferredcites →https://doi.org/10.2307/3009056openalex-snapshot
Principles of Operations Research -- with Applications to Managerial Decisions
inferredcites →https://doi.org/10.4324/9781410604743-7openalex-snapshot
Information Processing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/ima.1850030309openalex-snapshot
Drawings recognition using two‐dimensional graph grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-14612-6_5openalex-snapshot
How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?
inferred← citeshttps://doi.org/10.1007/978-3-642-23094-3_7openalex-snapshot
Evaluation of a First-Order Primal-Dual Algorithm for MRF Energy Minimization
inferred← citeshttps://doi.org/10.1007/978-3-642-24028-7_23openalex-snapshot
Higher Order Markov Networks for Model Estimation
inferred← citeshttps://doi.org/10.1007/s10559-011-9300-zopenalex-snapshot
Diffusion algorithms and structural recognition optimization problems
inferred← citeshttps://doi.org/10.1007/s10559-022-00485-8openalex-snapshot
Self-Driven Algorithm for Solving Supermodular (max,+) Labeling Problems Based on Subgradient Descent*
inferred← citeshttps://doi.org/10.1016/j.cag.2012.11.002openalex-snapshot
Finding the M-best consistent correspondences between 3D symmetric objects
inferred← citeshttps://doi.org/10.1016/j.cviu.2015.05.002openalex-snapshot
Higher order maximum persistency and comparison theorems
inferred← citeshttps://doi.org/10.1109/cvpr.2011.5995652openalex-snapshot
A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling
inferred← citeshttps://doi.org/10.1109/cvpr.2013.227openalex-snapshot
Universality of the Local Marginal Polytope
inferred← citeshttps://doi.org/10.1109/cvpr.2014.149openalex-snapshot
A Primal-Dual Algorithm for Higher-Order Multilabel Markov Random Fields
inferred← citeshttps://doi.org/10.1109/cvpr.2014.152openalex-snapshot
Maximum Persistency in Energy Minimization
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7298650openalex-snapshot
Maximum persistency via iterative relaxed inference with graphical models
inferred← citeshttps://doi.org/10.1109/cvpr.2017.764openalex-snapshot
Newton-Type Methods for Inference in Higher-Order Markov Random Fields
inferred← citeshttps://doi.org/10.1109/iccvw.2013.43openalex-snapshot
Getting Feasible Variable Estimates from Infeasible Ones: MRF Local Polytope Study
inferred← citeshttps://doi.org/10.1109/tpami.2014.2353626openalex-snapshot
Universality of the Local Marginal Polytope
inferred← citeshttps://doi.org/10.1109/tpami.2015.2484327openalex-snapshot
Partial Optimality by Pruning for MAP-Inference with General Graphical Models
inferred← citeshttps://doi.org/10.1109/tpami.2016.2582165openalex-snapshot
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
inferred← citeshttps://doi.org/10.1109/tpami.2017.2730884openalex-snapshot
Maximum Persistency via Iterative Relaxed Inference in Graphical Models
inferred← citeshttps://doi.org/10.1109/wacv45572.2020.9093369openalex-snapshot
Fast Postprocessing for Difficult Discrete Energy Minimization Problems
inferred← citeshttps://doi.org/10.1137/130945648openalex-snapshot
The Power of Linear Programming for General-Valued CSPs
inferred← citeshttps://doi.org/10.1137/17m1142922openalex-snapshot
Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program
inferred← citeshttps://doi.org/10.1145/2974019openalex-snapshot
The Complexity of Finite-Valued CSPs
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12202openalex-snapshot
Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation
inferred← citeshttps://doi.org/10.34229/2707-451x.21.1.4openalex-snapshot
A New Approach to Solving the Problem of Generating Sets of Complex Structural Objects Based on a Quasi-Equivalent Transformation of a Labeling Scheme
inferred← citeshttps://doi.org/10.48550/arxiv.1109.1149openalex-snapshot
On Partial Opimality by Auxiliary Submodular Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1203.3526openalex-snapshot
Primal View on Belief Propagation
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3653openalex-snapshot
Maximum Persistency in Energy Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04428openalex-snapshot
TerpreT: A Probabilistic Programming Language for Program Induction
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06370openalex-snapshot
Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation
inferred← citeshttps://doi.org/10.70675/1379ae40z147ez4f2dz987bz8c1369fc0e2aopenalex-snapshot
Quelques applications de l’optimisation numérique aux problèmes d’inférence et d’apprentissage
inferred← citeshttps://doi.org/10.7282/t3xw4p7copenalex-snapshot
A Novel Use of Higher Order Information to Detect Inliers of an Implicit Model
inferred← citeshttps://doi.org/10.7551/mitpress/9969.003.0004openalex-snapshot
The Power of LP Relaxation for MAP Inference
inferred← citeshttps://doi.org/10.7551/mitpress/9969.003.0008openalex-snapshot
Getting Feasible Variable Estimates from Infeasible Ones: MRF Local Polytope Study
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.