Noname manuscript No. (will be inserted by the editor) A Numerical Study of the Bottom-up and Top-down Inference Processes in And-Or Graphs
Citations in the corpus
I2T: Image Parsing to Text Description (2010, methodology): “Here we extend the discussion with several improvements, namely, a bottom–up/top–down inference algorithm from [64] and a cluster sampling algorithm from [51].”
Towards Interpretable Object Detection by Unfolding Latent Structures (2019, methodology): “…could unfold the space of latent part configurations, which is usually huge, we can evaluate the interpretability score in the spirit similar to the masking and scaling operators used in [61] for evaluating information contributions of bottom-up/top-down computing processes in a hierarchical model.”
Interpretable R-CNN (2017, methodology): “If we could unfold the space of latent part configurations, which is usually huge, we can evaluate the explainability score in the spirit similar to the masking and scaling operators used in [75] for evaluating information contributions of bottom-up/top-down computing processes in a hierarchical mod”
Joint Deep Learning for Pedestrian Detection (2013, methodology): “Some of them use the detection scores of blocks or parts [51, 34, 13, 54] as input for visibility estimation.”
From Red Wine to Red Tomato: Composition with Context (2017, background): “The parts-based systems such as Deformable Part Models [15], grammars [25, 44, 59, 62, 67, 69], and AND-OR graphs [54, 61, 66] also rely on compositionality of objects to build recognition systems.”