Internet Archive Scholar
Filters
























1 Hit in 2.7 sec

HARD-PnP: PnP Optimization Using a Hybrid Approximate Representation

Simon James Hadfield, Karel Lebeda, Richard Bowden
2018 IEEE Transactions on Pattern Analysis and Machine Intelligence  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (979.3 kB)
https://web.archive.org/web/20180720015755/http://epubs.surrey.ac.uk/845787/1/HARD-PnP%20-%20PnP%20Optimization%20Using%20a%20Hybrid%20Approximate%20Representation.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

This paper proposes a Hybrid Approximate Representation (HAR) based on unifying several efficient approximations of the  ...  We also introduce a Hybrid Approximate Representation (HAR) and corresponding joint optimization framework HAR-Descent, which make it possible to unify the representations from several of stateof-the-art  ...  We can now repeat the previous approximation starting from Equation 8 , to obtain a new cost based on the Hybrid Approximate Representation R (i.e. combining approximations in various representations  ... 
doi:10.1109/tpami.2018.2806446 pmid:29994452 fatcat:ohxwqhup3fcufhmt32k4tffjra
Citation

Simon James Hadfield, Karel Lebeda, Richard Bowden. "HARD-PnP: PnP Optimization Using a Hybrid Approximate Representation." IEEE Transactions on Pattern Analysis and Machine Intelligence 41.3 (2018) 1-1