Image feature points are the basis for numerous computer vision tasks, such as pose estimation or object detection. State of the art algorithms detect features that are invariant to scale and orientation changes. While feature detectors and descriptors have been widely studied in terms of stability and repeatability, their localisation error has often been assumed to be uniform and insignifican...

Bernhard Zeisl1 http://campar.in.tum.de/Main/BernhardZeisl Pierre Fite Georgel1 http://campar.in.tum.de/Main/PierreGeorgel Florian Schweiger2 http://www.lmt.ei.tum.de/team/florian/ Eckehard Steinbach2 http://www.lmt.ei.tum.de/team/steinb/ Nassir Navab1 http://campar.in.tum.de/Main/NassirNavab 1 Chair for Computer Aided Medical Procedures & Augmented Reality Technische Universität München Munich...

of locating supply points optimally with respect to transportation costs i s given. Although the algorithm may fail to converge to an optimal solution, repeated application with judicious selections of alternative starting values will assure a good, i f not optimal, solution. The algorithm has been tested and some sample results are included. The location of factories, warehouses-and supply poi...

Where to put the monitoring points in a system is a very common problem (environment, industry, health, and so on). We show that Archimedes maps, that is, measure preserving transformations, provide the right tool for this problem. Conversely, we insist that random exploration, often preferred because of simplicity and low cost, should definitely be avoided. Many of our contracts, both in indus...

∗Faculty of Informatics, Kansai University, 2-1-1, Ryozenji, Takatsuki, Osaka 569-1095, Japan ∗∗Faculty of Engineering, Tokyo Polytechnic University, 1583, Iiyama, Atsugi, Kanagawa 243-0297, Japan ∗∗∗ Faculty of Management Information, Hannan University, 5-4-33, Amami-higashi, Matsubara, Osaka 580-8502, Japan ∗∗∗∗ Department of Computer Science, Eastern Washington University, CEB319F EWU, Chene...

Given a polynomial p of degree n ≥ 2 and with at least two distinct roots let Z(p) = {z : p(z) = 0}. For a fixed root α ∈ Z(p) we define the quantities ω(p, α) := min { |α − v| : v ∈ Z(p) \ {α} } and τ(p, α) := min { |α − v| : v ∈ Z(p′) \ {α} } . We also define ω(p) and τ(p) to be the corresponding minima of ω(p, α) and τ(p, α) as α runs over Z(p). Our main results show that the ratios τ(p, α)/...