… , the Gauss-tree. Our experimental evaluation demonstrates that pfv stored in a Gauss-tree …
Additionally, we show that the Gauss-tree significantly speeds up query times compared to …

… We adopt a Gaussian model on the relative position between the parts p(xj|xL,sL,hj,θj). The
… Additionally, the efficient matching scheme requires that the location model be a tree. No …

… efficiently predict the best location of an object in an image for a fixed (usually trained) quality
function. We start by formalizing the setup of window-based object detection… be a Gaussian …

… 15 trees. For detection, we used a Gaussian kernel with 2 ¼ 9 (10). In a multiscale setting,
the … first five trained trees for the TUD pedestrian data set due to efficiency. The depth of each …

… to deal with the problem of model-based object recognition in a scene. Most of these
systems try to solve the matching task by tree search, searching through all promising matches. …

… respect to these variations and are computationally efficient. … A general setting involves
a rooted tree where the leaves … the clusters with a mixture of Gaussian distributions [29]. …

… the shots of all stored video clips are now indexed employing the Gauss-tree [1]. The
Gauss-tree is a dedicated index structure for efficiently managing Gaussian distributions. The …

… The model objects are represented by a tree-like network … we not use Gaussian curvature
for the splash computation (which … reliable representation for the purpose of efficient matching. …

… greedy and can require traversing a tree of filters that is both … visual data and search it
efficiently. We believe the present … , multiplying it by the deformation Gaussian mask and taking the …

… 31], we derive an effective optimization algorithm to solve the … For example, a Gaussian
falloff function is frequently … In the following, we introduce a novel tree-structured sparsity-…