Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,096,155 papers from all fields of science
Search
Sign In
Create Free Account
Minimum bounding box
Known as:
Minimum enclosing rectangle
, Axis aligned bounding box
, Object oriented bounding box
Expand
In geometry, the minimum or smallest bounding or enclosing box for a point set (S) in N dimensions is the box with the smallest measure (area, volume…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Bounding sphere
Bounding volume
Bounding volume hierarchy
Computational geometry
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
MOTS: Multi-Object Tracking and Segmentation
P. Voigtlaender
,
Michael Krause
,
+4 authors
B. Leibe
Computer Vision and Pattern Recognition
2019
Corpus ID: 60440659
This paper extends the popular task of multi-object tracking to multi-object tracking and segmentation (MOTS). Towards this goal…
Expand
Highly Cited
2017
Highly Cited
2017
Relation Networks for Object Detection
Han Hu
,
Jiayuan Gu
,
Zheng Zhang
,
Jifeng Dai
,
Yichen Wei
IEEE/CVF Conference on Computer Vision and…
2017
Corpus ID: 37158713
Although it is well believed for years that modeling relations between objects would help object recognition, there has not been…
Expand
Highly Cited
2015
Highly Cited
2015
Active Object Localization with Deep Reinforcement Learning
Juan C. Caicedo
,
Svetlana Lazebnik
IEEE International Conference on Computer Vision
2015
Corpus ID: 8506181
We present an active detection model for localizing objects in scenes. The model is class-specific and allows an agent to focus…
Expand
Highly Cited
2015
Highly Cited
2015
Multi-view Face Detection Using Deep Convolutional Neural Networks
S. Farfade
,
M. Saberian
,
Li-Jia Li
International Conference on Multimedia Retrieval
2015
Corpus ID: 3339441
In this paper we consider the problem of multi-view face detection. While there has been significant research on this problem…
Expand
Highly Cited
2015
Highly Cited
2015
Neural Activation Constellations: Unsupervised Part Model Discovery with Convolutional Networks
Marcel Simon
,
E. Rodner
IEEE International Conference on Computer Vision
2015
Corpus ID: 10605093
Part models of object categories are essential for challenging recognition tasks, where differences in categories are subtle and…
Expand
Highly Cited
2013
Highly Cited
2013
PANDA: Pose Aligned Networks for Deep Attribute Modeling
Ning Zhang
,
Manohar Paluri
,
Marc'Aurelio Ranzato
,
Trevor Darrell
,
Lubomir D. Bourdev
IEEE Conference on Computer Vision and Pattern…
2013
Corpus ID: 6943286
We propose a method for inferring human attributes (such as gender, hair style, clothes style, expression, action) from images of…
Expand
Highly Cited
2006
Highly Cited
2006
Peekaboom: a game for locating objects in images
Luis von Ahn
,
Ruoran Liu
,
M. Blum
International Conference on Human Factors in…
2006
Corpus ID: 207158556
We introduce Peekaboom, an entertaining web-based game that can help computers locate objects in images. People play the game…
Expand
2006
2006
Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
D. Dimitrov
,
Christian Knauer
,
K. Kriegel
,
G. Rote
2006
Corpus ID: 4014653
Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in R d . The popularity of this…
Expand
Highly Cited
1999
Highly Cited
1999
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
G. Barequet
,
Sariel Har-Peled
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 1542799
We present an efficient O(n+1/?4.5-time algorithm for computing a (1+?)-approximation of the minimum-volume bounding box of n…
Expand
Review
1999
Review
1999
Numerical integration of the Galerkin weak form in meshfree methods
J. Dolbow
,
T. Belytschko
1999
Corpus ID: 15685265
Abstract The numerical integration of Galerkin weak forms for meshfree methods is investigated and some improvements are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE