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

Richard Schalek

dblp:71/8653 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0003-2450-1718ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 3Artificial intelligence and machine learning · 2Applied, interdisciplinary, general and emerging computing · 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
2 papers
Segmentation and scene understanding · 80% Efficient and distributed learning · 16% Learning paradigms · 4%

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

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding › biomedical image segmentation
connectomics segmentation
0.412020
Two Stream Active Query Suggestion for Active Learning in Connectomics · ECCV (18) 2020
Machine learning › Efficient and distributed learning
active learning
0.112020
Two Stream Active Query Suggestion for Active Learning in Connectomics · ECCV (18) 2020
Computer vision › Segmentation and scene understanding
boundary detection
0.112010
Boundary Learning by Optimization with Topological Constraints · CVPR 2010
Computer vision › Segmentation and scene understanding
image segmentation
0.112010
Boundary Learning by Optimization with Topological Constraints · CVPR 2010
Machine learning › Learning paradigms
supervised learning
0.012010
Boundary Learning by Optimization with Topological Constraints · CVPR 2010

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

two-stream network · 0.4active learning · 0.4warping error · 0.1digital topology · 0.1cost function learning · 0.1
YearPublicationVenuePosition
2020 Two Stream Active Query Suggestion for Active Learning in Connectomics
Zudi Lin, Donglai Wei 0001, Won-Dong Jang, Siyan Zhou, Xupeng Chen, Xueying Wang 0002, Richard Schalek, Daniel R. Berger, Brian Matejek, Lee Kamentsky, Adi Suissa, Daniel Haehn, Thouis R. Jones, Toufiq Parag, Jeff Lichtman, Hanspeter Pfister
ECCV (18)7
2020 Learning Guided Electron Microscopy with Active Acquisition
Lu Mi, Hao Wang 0014, Yaron Meirovitch, Richard Schalek, Srinivas C. Turaga, Jeff Lichtman, Aravinthan D. T. Samuel, Nir Shavit
MICCAI (5)4
2010 Boundary Learning by Optimization with Topological Constraints
abstract
Recent studies have shown that machine learning can improve the accuracy of detecting object boundaries in images. In the standard approach, a boundary detector is trained by minimizing its pixel-level disagreement with human boundary tracings. This naive metric is problematic because it is overly sensitive to boundary locations. This problem is solved by metrics provided with the Berkeley Segmentation Dataset, but these can be insensitive to topological differences, such as gaps in boundaries. Furthermore, the Berkeley metrics have not been useful as cost functions for supervised learning. Using concepts from digital topology, we propose a new metric called the warping error that tolerates disagreements over boundary location, penalizes topological disagreements, and can be used directly as a cost function for learning boundary detection, in a method that we call Boundary Learning by Optimization with Topological Constraints (BLOTC). We trained boundary detectors on electron microscopic images of neurons, using both BLOTC and standard training. BLOTC produced substantially better performance on a 1.2 million pixel test set, as measured by both the warping error and the Rand index evaluated on segmentations generated from the boundary labelings. We also find our approach yields significantly better segmentation performance than either gPb-OWT-UCM or multiscale normalized cut, as well as Boosted Edge Learning trained directly on our data.
Viren Jain, Benjamin Bollmann, Daniel R. Berger, Moritz Helmstaedter, Kevin L. Briggman, Winfried Denk, Jared B. Bowden, John M. Mendenhall, Wickliffe C. Abraham, Kristen M. Harris, Narayanan Kasthuri, Ken J. Hayworth, Richard Schalek, Juan Carlos Tapia, Jeff Lichtman, H. Sebastian Seung
CVPR14