Camera Placement in Integer Lattices
نویسندگان
چکیده
The camera placement problem concerns the placement of a xed number of point-cameras on the integer lattice of d-tuples of integers in order to maximize their visibility. We give a caracterization of optimal conng-urations of size s less than 5 d and use it to compute in time O(s log s) an optimal abstract connguration under the assumption that the visibility of a connguration is computable in constant time.
منابع مشابه
جانمایی دوربین در طراحی شبکه‌های فتوگرامتری صنعتی با استفاده از بهینه‌سازی تکاملی چندگانه
Nowadays, the subject of vision metrology network design is local enhancement of the existing network. In the other words, it has changed from first to third order design concept. To improve the network, locally, some new camera stations should be added to the network in drawback areas. The accuracy of weak points is enhanced by the new images, if the related vision constraints are satisfied si...
متن کاملA degree bound for the Graver basis of non-saturated lattices
Let $L$ be a lattice in $ZZ^n$ of dimension $m$. We prove that there exist integer constants $D$ and $M$ which are basis-independent such that the total degree of any Graver element of $L$ is not greater than $m(n-m+1)MD$. The case $M=1$ occurs precisely when $L$ is saturated, and in this case the bound is a reformulation of a well-known bound given by several authors. As a corollary, we show t...
متن کاملSome Connections Between Learning Integer Lattices with Noise and Learning Parity Functions with Noise
We consider the problem of learning integer lattices in the presence of either classification noise or malicious noise, and show that learning integer lattices is at least as hard as learning Fq-linear subspaces over any finite field, Fq. In particular, learning integer lattices with noise is as hard as learning a parity function with noise. We also give a converse result which shows that the a...
متن کاملOn representing some lattices as lattices of intermediate subfactors of finite index
We prove that the very simple lattices which consist of a largest, a smallest and 2n pairwise incomparable elements where n is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite depth. Using the same techniques, we give a necessary and sufficient condition for subfactors coming from Loop groups of type A at generic levels to be maximal. Supp...
متن کاملCounting Co-Cyclic Lattices
Abstract. There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most V in Z. This set of lattices L can naturally be partitioned with respect to the factor group Z/L. Accordingly, we count the number of full-rank integer lattices L ⊆ Z such that Z/L is cyclic and of order at most V , and deduce that these co-cyclic lattice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 12 شماره
صفحات -
تاریخ انتشار 1994