3,816 research outputs found

    Hierarchical Relationships: A New Perspective to Enhance Scene Graph Generation

    Full text link
    This paper presents a finding that leveraging the hierarchical structures among labels for relationships and objects can substantially improve the performance of scene graph generation systems. The focus of this work is to create an informative hierarchical structure that can divide object and relationship categories into disjoint super-categories in a systematic way. Specifically, we introduce a Bayesian prediction head to jointly predict the super-category of relationships between a pair of object instances, as well as the detailed relationship within that super-category simultaneously, facilitating more informative predictions. The resulting model exhibits the capability to produce a more extensive set of predicates beyond the dataset annotations, and to tackle the prevalent issue of low annotation quality. While our paper presents preliminary findings, experiments on the Visual Genome dataset show its strong performance, particularly in predicate classifications and zero-shot settings, that demonstrates the promise of our approach.Comment: NeurIPS 2023 New Frontiers in Graph Learning Workshop (NeurIPS GLFrontiers 2023); NeurIPS 2023 Queer in AI Workshop. This paper is a preliminary work of the full paper available at arXiv:2311.1288

    Sequential Appointment Scheduling Considering Walk-In Patients

    Get PDF
    This paper develops a sequential appointment algorithm considering walk-in patients. In practice, the scheduler assigns an appointment time for each call-in patient before the call ends, and the appointment time cannot be changed once it is set. Each patient has a certain probability of being a no-show patient on the day of appointment. The objective is to determine the optimal booking number of patients and the optimal scheduling time for each patient to maximize the revenue of all the arriving patients minus the expenses of waiting time and overtime. Based on the assumption that the service time is exponentially distributed, this paper proves that the objective function is convex. A sufficient condition under which the profit function is unimodal is provided. The numerical results indicate that the proposed algorithm outperforms all the commonly used heuristics, lowering the instances of no-shows, and walk-in patients can improve the service efficiency and bring more profits to the clinic. It is also noted that the potential appointment is an effective alternative to mitigate no-show phenomenon

    Enhancing Scene Graph Generation with Hierarchical Relationships and Commonsense Knowledge

    Full text link
    This work presents an enhanced approach to generating scene graphs by incorporating a relationship hierarchy and commonsense knowledge. Specifically, we propose a Bayesian classification head that exploits an informative hierarchical structure. It jointly predicts the super-category or type of relationship between the two objects, along with the detailed relationship under each super-category. We design a commonsense validation pipeline that uses a large language model to critique the results from the scene graph prediction system and then use that feedback to enhance the model performance. The system requires no external large language model assistance at test time, making it more convenient for practical applications. Experiments on the Visual Genome and the OpenImage V6 datasets demonstrate that harnessing hierarchical relationships enhances the model performance by a large margin. The proposed Bayesian head can also be incorporated as a portable module in existing scene graph generation algorithms to improve their results. In addition, the commonsense validation enables the model to generate an extensive set of reasonable predictions beyond dataset annotations

    On shotnoise and Brownian motion limits to the accuracy of particle positioning with optical tweezers

    Get PDF
    This paper examines the fundamental resolution limit of particle positioning with optical tweezers due to the combined effects of Brownian motion and optical shotnoise. It is found that Brownian motion dominates at low signal frequencies, whilst shotnoise dominates at high frequencies, with the exact crossover frequency varying by many orders of magnitude depending on experimental parameters such as particle size and trapping beam power. These results are significant both for analysis of the bandwidth limits of particle monitoring with optical tweezers and for enhancements of optical tweezer systems based on non-classical states of light
    • …
    corecore