Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/168096
COMPARTIR / EXPORTAR:
logo share SHARE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Invitar a revisión por pares abierta
Campo DC Valor Lengua/Idioma
dc.contributor.authorVakhitov, Alexander-
dc.contributor.authorFunke, Jan-
dc.contributor.authorMoreno-Noguer, Francesc-
dc.date.accessioned2018-08-01T07:42:50Z-
dc.date.available2018-08-01T07:42:50Z-
dc.date.issued2016-
dc.identifier.citationEuropean Conference on Computer Vision (2016)-
dc.identifier.urihttp://hdl.handle.net/10261/168096-
dc.descriptionPóster presentado a la 14th European Conference on Computer Vision (ECCV), celebrada en Amsterdam (Netherlands) del 11 al 14 de octubre de 2016.-
dc.description.abstractThe Perspective-n-Point (PnP) problem seeks to estimate the pose of a calibrated camera from n 3D-to-2D point correspondences. There are situations, though, where PnP solutions are prone to fail because feature point correspondences cannot be reliably estimated (e.g. scenes with repetitive patterns or with low texture). In such scenarios, one can still exploit alternative geometric entities, such as lines, yielding the so-called Perspective-n-Line (PnL) algorithms. Unfortunately, existing PnL solutions are not as accurate and efficient as their point-based counterparts. In this paper we propose a novel approach to introduce 3D-to-2D line correspondences into a PnP formulation, allowing to simultaneously process points and lines. For this purpose we introduce an algebraic line error that can be formulated as linear constraints on the line endpoints, even when these are not directly observable. These constraints can then be naturally integrated within the linear formulations of two state-of-the-art point-based algorithms, the OPnP and the EPnP, allowing them to indistinctly handle points, lines, or a combination of them. Exhaustive experiments show that the proposed formulation brings remarkable boost in performance compared to only point or only line based solutions, with a negligible computational overhead compared to the original OPnP and EPnP.-
dc.description.sponsorshipThis work is partly funded by the Russian MES grant RFMEFI61516X0003; by the Spanish MINECO project RobInstruct TIN2014-58178-R and by the ERA-Net Chistera project I-DRESS PCIN-2015-147.-
dc.relationinfo:eu-repo/grantAgreement/MINECO/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/PCIN-2015-147-
dc.relationinfo:eu-repo/grantAgreement/MINECO/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2014-58178-R-
dc.relation.isversionofPublisher's version-
dc.rightsopenAccess-
dc.titleAccurate and linear time pose estimation from points and lines-
dc.typepóster de congreso-
dc.date.updated2018-08-01T07:42:50Z-
dc.description.versionPeer Reviewed-
dc.language.rfc3066eng-
dc.contributor.funderMinistry of Education and Science of the Russian Federation-
dc.contributor.funderEuropean Commission-
dc.contributor.funderMinisterio de Economía y Competitividad (España)-
dc.relation.csic-
dc.identifier.funderhttp://dx.doi.org/10.13039/501100000780es_ES
dc.identifier.funderhttp://dx.doi.org/10.13039/501100003329es_ES
dc.identifier.funderhttp://dx.doi.org/10.13039/501100003443es_ES
dc.type.coarhttp://purl.org/coar/resource_type/c_6670es_ES
item.openairetypepóster de congreso-
item.grantfulltextopen-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
Aparece en las colecciones: (IRII) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato
acculine.pdf1,12 MBAdobe PDFVista previa
Visualizar/Abrir
Show simple item record

CORE Recommender

Page view(s)

609
checked on 23-abr-2024

Download(s)

371
checked on 23-abr-2024

Google ScholarTM

Check


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.