2017
DOI: 10.1109/tvcg.2016.2637334
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Camera Placement for Motion Capture Systems

Abstract: Optical motion capture is based on estimating the three-dimensional positions of markers by triangulation from multiple cameras. Successful performance depends on points being visible from at least two cameras and on the accuracy of the triangulation. Triangulation accuracy is strongly related to the positions and orientations of the cameras. Thus, the configuration of the camera network has a critical impact on performance. A poor camera configuration may result in a low quality three-dimensional (3D) estimat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 53 publications
(32 citation statements)
references
References 23 publications
0
27
0
Order By: Relevance
“…Building on previous research, camera placement optimization techniques were further leveraged for a series of domain-specific applications. For example, the camera placement problem was reformulated to optimize the performance of visual analytics (e.g., reconstruction and motion captures) (Olague and Mohr 2002;Rahimian and Kearney 2017) and automated surveillance systems in urban areas (Bodor et al 2007;Szaloki et al 2013). In the construction domain, as the first step to addressing the AGP for optimal camera placement, the camera's coverage was computationally modeled to understand and evaluate the visibility of installed cameras.…”
Section: Art Gallery Problems For Camera Placement and Current Practimentioning
confidence: 99%
“…Building on previous research, camera placement optimization techniques were further leveraged for a series of domain-specific applications. For example, the camera placement problem was reformulated to optimize the performance of visual analytics (e.g., reconstruction and motion captures) (Olague and Mohr 2002;Rahimian and Kearney 2017) and automated surveillance systems in urban areas (Bodor et al 2007;Szaloki et al 2013). In the construction domain, as the first step to addressing the AGP for optimal camera placement, the camera's coverage was computationally modeled to understand and evaluate the visibility of installed cameras.…”
Section: Art Gallery Problems For Camera Placement and Current Practimentioning
confidence: 99%
“…After initialization, the subsequent heating and cooling of metal is imitated in the code by "raising temperature"-decreasing the viability of solutions-followed by "cooling down"-increasing the viability of solutions. Morsly et al [35] and Rahimian and Kearney [36] note SA as applied to the SCP and choosing viewpoints. The created set is then added to or removed from to achieve the desired coverage.…”
Section: Simulated Annealingmentioning
confidence: 99%
“…The sUAV SfM used in Italy builds off previous work by Palmer et al [28]. Various computational algorithms optimize what the sUAV needs to "see" as well as the best route to do so [23,[29][30][31][32][33]. The path planning algorithm, follows a weighted Traveling Salesman Problem (TSP).…”
Section: Optimized View and Path Planning Algorithmsmentioning
confidence: 99%