1.2 Detection task For each of the four classes predict the bounding boxes of each object of that class in a test image (if any). Each bounding box should be output with an associated real-valued confidence of the detection so that a precision/recall curve can be drawn. To be considered a correct detection, the area of overlap ao between the predicted bounding box Bp and ground truth bounding b...

A tight lower-bounding measure for dynamic time warping (DTW) distances for univariate time series was introduced in [Keogh 2002] and a proof for its lower-bounding property was presented. Here we extend these findings to allow lower-bounding of DTW distances for multivariate time series.

This paper is concerned with the robust stability for uncertain systems with time-varying delay and nonlinear perturbations. Using Lyapunov stability theory and free weighting matrix techniques, delaydependent stability criterion is derived in terms of linear matrix inequality without applying any bounding techniques. Finally, numerical example is given to illustrate the improvement over some e...

terleaved over L = 3 channel blocks for four different Rician factors = 0; 5; 10; and infinity (= additive white Gaussian noise (AWGN) channel). The code polynomials in octal are (133; 145; 175). Here the union bounds are truncated at d max = 42. 4 The traditional bounds (7) get tighter for increasing values of and finally coincide with the modified bound for = 1 (AWGN channel) with which no av...

A probabilistic similarity query over uncertain data assigns to each uncertain database object o a probability indicating the likelihood that o meets the query predicate. In this paper, we formalize the notion of uncertain time series and introduce two novel and important types of probabilistic range queries over uncertain time series. Furthermore, we propose an original approximate representat...

This paper presents new techniques for fast view frustum culling. View frustum cullers (VFCs) are typically used in virtual reality software, walkthrough algorithms, scene graph APIs or other 3D graphics applications. First we develop a fast basic VFC algorithm. Then we suggest and evaluate four further optimizations, which are independent of each other and works for all kinds of VFC algorithms...

Continuous-time Markov reward structures over a finite time interval are studied. Conditions are provided to conclude error bounds or comparison results when studying systems under modified data assumptions such as for sensitivity, computitional or bounding purposes. A reliability network is studied as an application. An explicit sensitivity error bound on the effect of breakdown and repair rat...

Few geospatial data representations are more basic than the bounding box; a rectangle surrounding a geographic feature or dataset. Bounding boxes are a key component of geospatial metadata and lie at the heart of many computational geometry algorithms as well as spatial indexing systems. Despite their ubiquity and common use, bounding boxes are more complicated than they first appear. The phras...

This paper presents a method for computing a minimal bounding ellipsoid that contains the solution set to the uncertain linear equations. Particularly, we aim at finding a bounding ellipsoid for static response of structures, where both external forces and elastic moduli of members are assumed to be imprecisely known and bounded. By using the Slemma, we formulate a semidefinite programming (SDP...

In the recent IEEE communication letter “Grouping-ProofDistance-Bounding Protocols: Keep All Your Friends Close” by Karlsson and Mitrokotsa, a protocol for grouping-proof distance-bounding (GPDB) is proposed. In this letter, we show that the proof that is generated by the proposed GBDP protocol does not actually prove anything. Furthermore, we provide a construction towards a distance-bounding ...