{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3GVSK7LI6CEPVIO34UE7OUGVN7","short_pith_number":"pith:3GVSK7LI","schema_version":"1.0","canonical_sha256":"d9ab257d68f088faa1dbe509f750d56fe777c1d5223b63d7bbabd8da10e36ed3","source":{"kind":"arxiv","id":"2203.10479","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Camera Placements for Overlapped Coverage with 3D Camera Projections","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Akshay Malhotra, Dhananjay Singh, Luis Yoichi Morales, Tushar Dadlani","submitted_at":"2022-03-20T07:29:03Z","abstract_excerpt":"This paper proposes a method to compute camera 6Dof poses to achieve a user defined coverage. The camera placement problem is modeled as a combinatorial optimization where given the maximum number of cameras, a camera set is selected from a larger pool of possible camera poses. We propose to minimize the squared error between the desired and the achieved coverage, and formulate the non-linear cost function as a mixed integer linear programming problem. A camera lens model is utilized to project the cameras view on a 3D voxel map to compute a coverage score which makes the optimization problem "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.10479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2022-03-20T07:29:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d6c75d1290e2174b432411a353db59949143ca4a8ac325b22fad6b243deaa261","abstract_canon_sha256":"b08ccd0761f1b6986b7d28df93a7914bea6f39c86354816910b938332aefd066"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:53.479675Z","signature_b64":"pB80lXhXGrnFZkvJEJUOhlqHQh8fyCXapYkYQ1cOU6rVwhyo14BqmCg7jvi20Aux7iNGOHDCGgTxVKOnrLl7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ab257d68f088faa1dbe509f750d56fe777c1d5223b63d7bbabd8da10e36ed3","last_reissued_at":"2026-07-05T04:06:53.479276Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:53.479276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Camera Placements for Overlapped Coverage with 3D Camera Projections","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Akshay Malhotra, Dhananjay Singh, Luis Yoichi Morales, Tushar Dadlani","submitted_at":"2022-03-20T07:29:03Z","abstract_excerpt":"This paper proposes a method to compute camera 6Dof poses to achieve a user defined coverage. The camera placement problem is modeled as a combinatorial optimization where given the maximum number of cameras, a camera set is selected from a larger pool of possible camera poses. We propose to minimize the squared error between the desired and the achieved coverage, and formulate the non-linear cost function as a mixed integer linear programming problem. A camera lens model is utilized to project the cameras view on a 3D voxel map to compute a coverage score which makes the optimization problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10479","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.10479/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.10479","created_at":"2026-07-05T04:06:53.479340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.10479v1","created_at":"2026-07-05T04:06:53.479340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10479","created_at":"2026-07-05T04:06:53.479340+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GVSK7LI6CEP","created_at":"2026-07-05T04:06:53.479340+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GVSK7LI6CEPVIO3","created_at":"2026-07-05T04:06:53.479340+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GVSK7LI","created_at":"2026-07-05T04:06:53.479340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7","json":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7.json","graph_json":"https://pith.science/api/pith-number/3GVSK7LI6CEPVIO34UE7OUGVN7/graph.json","events_json":"https://pith.science/api/pith-number/3GVSK7LI6CEPVIO34UE7OUGVN7/events.json","paper":"https://pith.science/paper/3GVSK7LI"},"agent_actions":{"view_html":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7","download_json":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7.json","view_paper":"https://pith.science/paper/3GVSK7LI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.10479&json=true","fetch_graph":"https://pith.science/api/pith-number/3GVSK7LI6CEPVIO34UE7OUGVN7/graph.json","fetch_events":"https://pith.science/api/pith-number/3GVSK7LI6CEPVIO34UE7OUGVN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7/action/storage_attestation","attest_author":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7/action/author_attestation","sign_citation":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7/action/citation_signature","submit_replication":"https://pith.science/pith/3GVSK7LI6CEPVIO34UE7OUGVN7/action/replication_record"}},"created_at":"2026-07-05T04:06:53.479340+00:00","updated_at":"2026-07-05T04:06:53.479340+00:00"}