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.

Kevin J. Dalton

dblp:78/4955 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

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.

Artificial intelligence
1 paper
3D vision · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d shape reconstruction
0.011998
3D Shape Reconstruction Using Volume Intersection Techniques · ICCV 1998
Geometric modeling and processing › 3d reconstruction
volume intersection
0.011998
3D Shape Reconstruction Using Volume Intersection Techniques · ICCV 1998
Medical and health informatics › medical imaging
ultrasound imaging
0.011998
3D Shape Reconstruction Using Volume Intersection Techniques · ICCV 1998

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

voxel carving · 0.1silhouette-based reconstruction · 0.1
YearPublicationVenuePosition
1998 3D Shape Reconstruction Using Volume Intersection Techniques
abstract
Volume intersection algorithms are used to reconstruct incomplete objects from their silhouettes. An imagined light source is moved about the data and the cumulative amount of "light" seen at each point an space is interpreted as indicating the likelihood that the point is inside the object. The object data need not be uniformly distributed nor exclusively surface data. Explicit distinction between noise, surface and interior data is avoided. The novel concept of a localised viewing region is introduced to overcome the inherent inability of volume intersection algorithms to reconstruct concave surfaces. Algorithms for 2D pixel and 3D voxel data are described and applied to 3D ultrasound data.
Jonathan C. Carr, W. Richard Fright, Andrew H. Gee, Richard W. Prager, Kevin J. Dalton
ICCV5
1998 Feature selection using expected attainable discrimination
David R. Lovell, Christopher R. Dance, Mahesan Niranjan, Richard W. Prager, Kevin J. Dalton, R. Derom
Pattern Recognit. Lett.5