Zobrazit minimální záznam



dc.contributor.authorGłowacki, Przemysław
dc.contributor.authorAmável Pinheiro, Miguel
dc.contributor.authorTüretken, Engin
dc.contributor.authorSznitman, Raphael
dc.contributor.authorLebrecht, Daniel
dc.contributor.authorKybic, Jan
dc.contributor.authorHoltmaat, Anthony
dc.contributor.authorFua, Pascal
dc.date.accessioned2014-12-11T12:51:22Z
dc.date.available2014-12-11T12:51:22Z
dc.date.issued2014
dc.identifier.citationGŁOWACKI, P. - AMÁVEL PINHEIRO, M. – TÜRETKEN, E. - SZNITMAN, R. – LEBRECHT, D. - KYBIC, J. – HOTLMAAT, A. - FUA, P.: Reconstructing Evolving Tree Structures in Time Lapse Sequences. In CVPR 2014: Proceedings of the 2014 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. New York: IEEE Computer Society Press, 2014, p. 3035-3042. DOI: 10.1109/CVPR.2014.388eng
dc.identifier.urihttp://hdl.handle.net/10467/60968
dc.description.abstractWe propose an approach to reconstructing tree structures that evolve over time in 2D images and 3D image stacks such as neuronal axons or plant branches. Instead of reconstructing structures in each image independently, we do so for all images simultaneously to take advantage of temporal-consistency constraints. We show that this problem can be formulated as a Quadratic Mixed Integer Program and solved efficiently. The outcome of our approach is a framework that provides substantial improvements in reconstructions over traditional single time-instance formulations. Furthermore, an added benefit of our approach is the ability to automatically detect places where significant changes have occurred over time, which is challenging when considering large amounts of data.eng
dc.language.isoeneng
dc.relation.urihttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6909784
dc.subjectResearch Subject Categories::TECHNOLOGY::Electrical engineering, electronics and photonicseng
dc.titleReconstructing Evolving Tree Structures in Time Lapse Sequenceseng
dc.typeArticleeng
dc.identifier.doihttp://dx.doi.org/10.1109/CVPR.2014.388


Soubory tohoto záznamu



Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam