Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anthony Holtmaat

dblp:151/8865 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0002-7577-0769ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video processing · 83% Geometric modeling and processing · 17%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image reconstruction
curvilinear structure reconstruction
0.312018
Reconstructing Evolving Tree Structures in Time Lapse Sequences by Enforcing Time-Consistency · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Image and video processing
image segmentation
0.312018
Reconstructing Evolving Tree Structures in Time Lapse Sequences by Enforcing Time-Consistency · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Mathematical optimization
discrete optimization
0.312018
Reconstructing Evolving Tree Structures in Time Lapse Sequences by Enforcing Time-Consistency · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Mathematical optimization › discrete optimization
mixed integer linear programming
0.312018
Reconstructing Evolving Tree Structures in Time Lapse Sequences by Enforcing Time-Consistency · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Mathematical optimization › integer programming › nonlinear integer programming
mixed-integer quadratic programming
0.312018
Reconstructing Evolving Tree Structures in Time Lapse Sequences by Enforcing Time-Consistency · IEEE Trans. Pattern Anal. Mach. Intell. 2018
Image and video processing
image reconstruction
0.212014
Reconstructing Evolving Tree Structures in Time Lapse Sequences · CVPR 2014
Geometric modeling and processing › 3d reconstruction
tree reconstruction
0.212014
Reconstructing Evolving Tree Structures in Time Lapse Sequences · CVPR 2014

Methods — techniques the papers use, named apart from their topics

quadratic mixed integer programming · 0.8time-consistency enforcement · 0.7
YearPublicationVenuePosition
2018 Reconstructing Evolving Tree Structures in Time Lapse Sequences by Enforcing Time-Consistency
abstract
We propose a novel approach to reconstructing curvilinear tree structures evolving over time, such as road networks in 2D aerial images or neural structures in 3D microscopy stacks acquired in vivo. To enforce temporal consistency, we simultaneously process all images in a sequence, as opposed to reconstructing structures of interest in each image independently. We formulate the problem as a Quadratic Mixed Integer Program and demonstrate the additional robustness that comes from using all available visual clues at once, instead of working frame by frame. Furthermore, when the linear structures undergo local changes over time, our approach automatically detects them.
Przemyslaw Glowacki, Miguel Amável Pinheiro, Agata Mosinska, Engin Türetken, Daniel Lebrecht, Raphael Sznitman, Anthony Holtmaat, Jan Kybic, Pascal Fua
IEEE Trans. Pattern Anal. Mach. Intell.7
2014 Reconstructing Evolving Tree Structures in Time Lapse Sequences
abstract
We 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.
Przemyslaw Glowacki, Miguel Amável Pinheiro, Engin Türetken, Raphael Sznitman, Daniel Lebrecht, Jan Kybic, Anthony Holtmaat, Pascal Fua
CVPR7