Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
DOI: 10.1109/robot.2006.1641829
|View full text |Cite
|
Sign up to set email alerts
|

Optimal positioning of multiple cameras for object recognition using Cramer-Rao lower bound

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…There have also been other algorithms for camera placement, for example a probabilistic approach for general sensor deployment based on the Cramér-Rao bound was proposed in [16], and an application of the idea for cameras was given in [17]. In [18] the authors choose to focus on positioning downward facing cameras, as opposed to arbitrarily oriented cameras.…”
Section: A Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…There have also been other algorithms for camera placement, for example a probabilistic approach for general sensor deployment based on the Cramér-Rao bound was proposed in [16], and an application of the idea for cameras was given in [17]. In [18] the authors choose to focus on positioning downward facing cameras, as opposed to arbitrarily oriented cameras.…”
Section: A Related Workmentioning
confidence: 99%
“…The first causes the robot to go up to take in a larger view, while the second causes it to go down to get a better view of what it already sees. The angular component (17) rotate the robot to get more of its field of view into the environment, while also rotating away from other robots whose field of view intersects its own. Computation of the gradient component for the rectangular field of view is of the same complexity as the circular case, and carries the same constraint on the communication topology.…”
Section: Theorem 3 (Rectangular Gradientmentioning
confidence: 99%
See 1 more Smart Citation
“…It is important to note that in importance sampling, degeneracy is a common problem; wherein, after a few time instances, the density of the weights in (18) become skewed. The resampling step in (18) is crucial in limiting the effects of degeneracy. Finally using Algorithm 1., the particle representation of p(dx t |y 1:t ) and p(dx t+1 |y 1:t+1 ) are given bỹ…”
Section: B General Non-linear Ssmsmentioning
confidence: 99%
“…Some of the key practical applications of the PCRLB include: comparison of several nonlinear filters for ballistic target tracking [13]; terrain navigation [14]; and design of systems with pre-specified performance bounds [15]. The PCRLB is also widely used in several other areas related to: multi-sensor resource deployment (e.g., radar resource allocation [16], sonobuoy deployment in submarine tracking [17]); sensor positioning [18]; and optimal observer trajectory for bearings-only tracking [19], [20].…”
Section: Introductionmentioning
confidence: 99%