BMVC
2000
13 years 5 months ago
2000
The hybrid Radon-Fourier technique has been proposed for the discrimination and tracking of deforming and compound targets. The current work investigates the technique's uniq...
PICS
2003
13 years 5 months ago
2003
Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achiev...
ESANN
2001
13 years 5 months ago
2001
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
MVA
2007
13 years 5 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
HIS
2008
13 years 6 months ago
2008
Simulating the realistic behavior of large crowds of autonomous agents is still a challenge for the computer graphics community. In order to handle large crowds, some scalable arc...
CCCG
2008
13 years 6 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
CCCG
2007
13 years 6 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
CCCG
2007
13 years 6 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
DGCI
2008
Springer
13 years 6 months ago
2008
Springer
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...