The reason is that the gradient is no longer group sparse along a few main directions. However, it is group sparse modulo the transform τ. Following this insight, we define TI-DTV DTV (2.2) (I) = (I τ), a …

Abstract Estimating the amount and center of distortion from lines in the scene has been addressed in the literature by the so-called “plumb-line” approach. In this paper we propose a new geometric …

These ICCV 2013 papers are the Open Access versions, provided by the Computer Vision Foundation. Except for the watermark, they are identical to the accepted versions; the final published version of …

Optical flow computation is a key component in many computer vision systems designed for tasks such as action detection or activity recognition. However, despite several major advances over the last …

a connection to k-submodular functions from combinato-rial optimization, and discuss k-submodular relaxations for general energy functions.

These ICCV 2013 papers are the Open Access versions, provided by the Except for the watermark, they are identical to the accepted versions; the final published version of the proceedings is available on …

Abstract This paper describes a method of finding thin, elongated structures in images and volumes. We use shortest paths to minimize very general functionals of higher-order curve properties, such as …

1. Introduction Despite the success of face detection where the target ob-jects are roughly rigid, generic object detection remains an open problem mainly due to the challenge of handling all possible …

co-segmentation were proposed, such as a discriminative model between the foreground and the background [11, 7] or generative models of the co-objects [1, 22]. In [21], a similarity measure …

We introduce a computationally efficient algorithm for multi-object tracking by detection that addresses four main challenges: appearance similarity among targets, missing data due to targets being out of …