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.

Daniel Pooley

dblp:17/1847 · also Daniel W. Pooley · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 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
1 paper
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
3d reconstruction
0.212015
Part-based modelling of compound scenes from images · CVPR 2015
Geometric modeling and processing › shape modeling › 3d object modeling
part-based modeling
0.212015
Part-based modelling of compound scenes from images · CVPR 2015
Geometric modeling and processing › 3d reconstruction
shape from silhouette
0.112015
Part-based modelling of compound scenes from images · CVPR 2015

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

sparse estimation · 0.2combinatorial optimization · 0.2
YearPublicationVenuePosition
2015 Part-based modelling of compound scenes from images
abstract
We propose a method to recover the structure of a compound scene from multiple silhouettes. Structure is expressed as a collection of 3D primitives chosen from a predefined library, each with an associated pose. This has several advantages over a volume or mesh representation both for estimation and the utility of the recovered model. The main challenge in recovering such a model is the combinatorial number of possible arrangements of parts. We address this issue by exploiting the intrinsic structure and sparsity of the problem, and show that our method scales to scenes constructed from large libraries of parts.
Anton van den Hengel, Chris Russell 0001, Anthony R. Dick, John W. Bastian, Daniel Pooley, Lachlan Fleming, Lourdes Agapito
CVPR5
2003 A voting scheme for estimating the synchrony of moving-camera videos
abstract
Recovery of dynamic scene properties from multiple videos usually requires the manipulation of synchronous (simultaneously captured) frames. This paper is concerned with the automated determination of this synchrony when the temporal alignment of sequences is unknown. A cost function characterising departure from synchrony is first evolved for the case in which two videos are generated by cameras that may be moving. A novel voting method is then presented for minimising the cost function in the case where the ratio of the cameras' frame rates is unknown. Experimental results indicate this relatively general approach holds promise.
Daniel Pooley, Michael J. Brooks, Anton van den Hengel, Wojciech Chojnacki
ICIP (1)1