11,490 research outputs found

    Glueball relevant study on isoscalars from Nf=2N_f=2 lattice QCD

    Full text link
    We perform a glueball-relevant study on isoscalars based on anisotropic Nf=2N_f=2 lattice QCD gauge configurations. In the scalar channel, we identify the ground state obtained through gluonic operators to be a single-particle state through its dispersion relation. When qqˉq\bar{q} operator is included, we find the mass of this state does not change, and the qqˉq\bar{q} operator couples very weakly to this state. So this state is most likely a glueball state. For pseudoscalars, along with the exiting lattice results, our study implies that both the conventional qqˉq\bar{q} state η2\eta_2 (or η′\eta' in flavor SU(3)SU(3)) and a heavier glueball-like state with a mass of roughly 2.6 GeV exist in the spectrum of lattice QCD with dynamical quarks.Comment: 8 pages, 3 figures, 3 tables, talk presented at the 35th International Symposium on Lattice Field Theory, 18-24 June 2017, Granada, Spai

    Sequential optimization for efficient high-quality object proposal generation

    Full text link
    We are motivated by the need for a generic object proposal generation algorithm which achieves good balance between object detection recall, proposal localization quality and computational efficiency. We propose a novel object proposal algorithm, BING ++, which inherits the virtue of good computational efficiency of BING [1] but significantly improves its proposal localization quality. At high level we formulate the problem of object proposal generation from a novel probabilistic perspective, based on which our BING++ manages to improve the localization quality by employing edges and segments to estimate object boundaries and update the proposals sequentially. We propose learning the parameters efficiently by searching for approximate solutions in a quantized parameter space for complexity reduction. We demonstrate the generalization of BING++ with the same fixed parameters across different object classes and datasets. Empirically our BING++ can run at half speed of BING on CPU, but significantly improve the localization quality by 18.5 and 16.7 percent on both VOC2007 and Microhsoft COCO datasets, respectively. Compared with other state-of-the-art approaches, BING++ can achieve comparable performance, but run significantly faster
    • …
    corecore