In this paper, we address the problem of learning an
adaptive appearance model for object tracking. In particular,
a class of tracking techniques called “tracking by detectionâ...
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
Matching based on local brightness is quite limited, because
small changes on local appearance invalidate the
constancy in brightness. The root of this limitation is its
treatme...
Ying Wu (Northwestern University), Jialue Fan (Nor...
Pedestrian detection is a key problem in computer vision,
with several applications including robotics, surveillance
and automotive safety. Much of the progress of the past
few ...
Bernt Schiele, Christian Wojek, Pietro Perona, Pio...
Stereo matching commonly requires rectified images that
are computed from calibrated cameras. Since all under-
lying parametric camera models are only approximations,
calibratio...