P. Melvin and H. Morton studied the expansion of the colored Jones polynomial of a knot in powers of q-1 and color. They conjectured an upper bound on the power of color versus the power of q-1. They also conjectured that the bounding line in their...
In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution. In this p...
Tailgating detection using Instance Segmentation and bounding box tracking via a fine-tuned Mask RCNN model (⭐ 10)
Automated wildlife surveys based on drone imagery and object detection technology are a powerful and increasingly popular tool in conservation biology. Most detectors require training images with annotated bounding boxes, which are tedious, expensive...
Ken appeared on the English horizon in the 16th century referring to the distance bounding the range of ordinary vision at sea (about 20 miles), and would thus have been familiar to skippers in particular. …
Ken appeared on the English horizon in the 16th century referring to the distance bounding the range of ordinary vision at sea (about 20 miles), and would thus have been familiar to skippers in particular. …
We propose ALFA - a novel late fusion algorithm for object detection. ALFA is based on agglomerative clustering of object detector predictions taking into consideration both the bounding box locations and the class scores. Each cluster represents a s...
The field of video generation has expanded significantly in recent years, with controllable and compositional video generation garnering considerable interest. Most methods rely on leveraging annotations such as text, objects' bounding boxes, and mot...
We provide an extension of the perfect sampling algorithm of Fill (1998) to general chains, and describe how use of bounding processes can ease computational burden. Along the way, we unearth a simple connection between the Coupling From The Past (...
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G. We study a variant of domination c...
Grounding is a fundamental capability for building graphical user interface (GUI) agents. Although existing approaches rely on large-scale bounding box supervision, they still face various challenges, such as cross-platform generalization, complex la...
Text-to-image models have rapidly advanced in realism and controllability, with recent approaches leveraging long, detailed captions to support fine-grained generation. However, a fundamental parametric gap remains: existing models rely on descriptiv...
We present three large families of new examples of plumbed 3-manifolds that bound rational homology 4-balls. These are constructed using two operations, also defined here, that preserve the lack of a lattice embedding obstruction to bounding rational...
Image cropping aims to improve the composition as well as aesthetic quality of an image by removing extraneous content from it. Existing image cropping databases provide only one or several human-annotated bounding boxes as the groundtruth, which can...
Automatic image cropping aims to extract the most visually salient regions while preserving essential composition elements. Traditional saliency-aware cropping methods optimize a single bounding box, making them ineffective for applications requiring...
We show that bounding ramification at infinity bounds fierce ramification. This answers positively a question of Deligne posed to the first named author....
Paper withdrawn, due a crucial error in the proof of Lemma 4.3: thus Theorems 1.2 and 1.3 remain unproven....
A simple tool for labeling object bounding boxes in images (⭐ 1135)
We formulate the notion of \emph{typical boundedness} of torsion on a family of abelian varieties defined over number fields. This means that the torsion subgroups of elements in the family can be made uniformly bounded by removing from the family al...
Jun 20, 2023 · 15 The point of this post is to explore some "elementary" but general ways one can quantify the "gap" in Jensen's inequality.