E. Scott Larsen

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

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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 · 75% Probabilistic and Bayesian machine learning · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 44% High-performance computing · 44% Parallel and multicore computing · 13%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d reconstruction
0.112007
Temporally Consistent Reconstruction from Multiple Video Streams Using Enhanced Belief Propagation · ICCV 2007
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
belief propagation
0.112007
Temporally Consistent Reconstruction from Multiple Video Streams Using Enhanced Belief Propagation · ICCV 2007
Computer vision › 3D vision › 3d reconstruction
multi-view stereo
0.112007
Temporally Consistent Reconstruction from Multiple Video Streams Using Enhanced Belief Propagation · ICCV 2007
Computer vision › 3D vision › 3d reconstruction › dynamic 3d reconstruction
temporally coherent reconstruction
0.112007
Temporally Consistent Reconstruction from Multiple Video Streams Using Enhanced Belief Propagation · ICCV 2007
GPUs and heterogeneous computing › graphics hardware
graphics hardware acceleration
0.012001
Fast matrix multiplies using graphics hardware · SC 2001
High-performance computing › numerical linear algebra
matrix multiplication
0.012001
Fast matrix multiplies using graphics hardware · SC 2001
Parallel and multicore computing › parallel algorithms
parallel matrix algorithms
0.012001
Fast matrix multiplies using graphics hardware · SC 2001

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

optical flow · 0.1multi-view stereo · 0.1belief propagation · 0.1parallel processing algorithm · 0.0graphics hardware visualization · 0.0
YearPublicationVenuePosition
2007 Temporally Consistent Reconstruction from Multiple Video Streams Using Enhanced Belief Propagation
abstract
We present an approach for 3D reconstruction from multiple video streams taken by static, synchronized and calibrated cameras that is capable of enforcing temporal consistency on the reconstruction of successive frames. Our goal is to improve the quality of the reconstruction by finding corresponding pixels in subsequent frames of the same camera using optical flow, and also to at least maintain the quality of the single time-frame reconstruction when these correspondences are wrong or cannot be found. This allows us to process scenes with fast motion, occlusions and self- occlusions where optical flow fails for large numbers of pixels. To this end, we modify the belief propagation algorithm to operate on a 3D graph that includes both spatial and temporal neighbors and to be able to discard messages from outlying neighbors. We also propose methods for introducing a bias and for suppressing noise typically observed in uniform regions. The bias encapsulates information about the background and aids in achieving a temporally consistent reconstruction and in the mitigation of occlusion related errors. We present results on publicly available real video sequences. We also present quantitative comparisons with results obtained by other researchers.
E. Scott Larsen, Philippos Mordohai, Marc Pollefeys, Henry Fuchs
ICCV1
2001 Fast matrix multiplies using graphics hardware
abstract
We present a technique for large matrix-matrix multiplies using low cost graphics hardware. The result is computed by literally visualizing the computations of a simple parallel processing algorithm. Current graphics hardware technology has limited precision and thus limits immediate applicability of our algorithm. We include results demonstrating proof of concept, correctness, speedup, and a simple application. This is therefore forward looking research: a technique ready for technology on the horizon.
E. Scott Larsen, David K. McAllister
SC1