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

Albert Cardona

dblp:34/7251 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-4941-6536ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 6Graphics, computer vision, multimedia, augmented reality and games · 3Artificial intelligence and machine learning · 2 · 1 since 2021

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.

Interdisciplinary, comprehensive, and emerging computing
4 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
2 papers
3D vision · 38% Optimization for machine learning · 38% Segmentation and scene understanding · 23%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › bioimage informatics › bioimage analysis
microscopy image analysis
0.312017
Trainable Weka Segmentation: a machine learning tool for microscopy pixel classification · Bioinform. 2017
Bioinformatics and computational biology
bioimage informatics
0.222010
As-rigid-as-possible mosaicking and serial section registration of large ssTEM datasets · Bioinform. 2010
CATMAID: collaborative annotation toolkit for massive amounts of image data · Bioinform. 2009
Computer vision › 3D vision
3d reconstruction
0.112012
Efficient automatic 3D-reconstruction of branching neurons from EM data · CVPR 2012
Machine learning › Optimization for machine learning › combinatorial optimization
integer linear programming
0.112012
Efficient automatic 3D-reconstruction of branching neurons from EM data · CVPR 2012
Bioinformatics and computational biology › computational neuroscience
connectomics
0.112012
Efficient automatic 3D-reconstruction of branching neurons from EM data · CVPR 2012
Bioinformatics and computational biology › structural biology
electron microscopy
0.112012
Efficient automatic 3D-reconstruction of branching neurons from EM data · CVPR 2012
Bioinformatics and computational biology › computational neuroscience › computational neuroanatomy
neuron reconstruction
0.112012
Efficient automatic 3D-reconstruction of branching neurons from EM data · CVPR 2012
Computer vision › Segmentation and scene understanding
image segmentation
0.112017
Trainable Weka Segmentation: a machine learning tool for microscopy pixel classification · Bioinform. 2017

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

random forest · 0.6machine learning · 0.6clustering · 0.6trainable cost · 0.3integer linear programming · 0.3web interface · 0.2bookmarking · 0.2least-squares optimization · 0.1as-rigid-as-possible registration · 0.1SIFT · 0.1
YearPublicationVenuePosition
2023 Distance-based positive and unlabeled learning for ranking
abstract
Learning to rank – producing a ranked list of items specific to a query and with respect to a set of supervisory items – is a problem of general interest. The setting we consider is one in which no analytic description of what constitutes a good ranking is available. Instead, we have a collection of representations and supervisory information consisting of a (target item, interesting items set) pair. We demonstrate analytically, in simulation, and in real data examples that learning to rank via combining representations using an integer linear program is effective when the supervision is as light as “these few items are similar to your item of interest.” While this nomination task is quite general, for specificity we present our methodology from the perspective of vertex nomination in graphs. The methodology described herein is model agnostic.
Hayden S. Helm, Amitabh Basu, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Carey E. Priebe, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson, Marah Ihab Abdin, Piali Choudhury, Weiwei Yang 0004, Christopher M. White
Pattern Recognit.9
2017 Trainable Weka Segmentation: a machine learning tool for microscopy pixel classification
abstract
SUMMARY: State-of-the-art light and electron microscopes are capable of acquiring large image datasets, but quantitatively evaluating the data often involves manually annotating structures of interest. This process is time-consuming and often a major bottleneck in the evaluation pipeline. To overcome this problem, we have introduced the Trainable Weka Segmentation (TWS), a machine learning tool that leverages a limited number of manual annotations in order to train a classifier and segment the remaining data automatically. In addition, TWS can provide unsupervised segmentation learning schemes (clustering) and can be customized to employ user-designed image features or classifiers. AVAILABILITY AND IMPLEMENTATION: TWS is distributed as open-source software as part of the Fiji image processing distribution of ImageJ at http://imagej.net/Trainable_Weka_Segmentation . CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ignacio Arganda-Carreras, Verena Kaynig, Curtis Rueden, Kevin W. Eliceiri, Johannes E. Schindelin, Albert Cardona, H. Sebastian Seung
Bioinform.6
2015 Who Is Talking to Whom: Synaptic Partner Detection in Anisotropic Volumes of Insect Brain
Anna Kreshuk, Jan Funke, Albert Cardona, Fred A. Hamprecht
MICCAI (1)3
2014 Candidate Sampling for Neuron Reconstruction from Anisotropic Electron Microscopy Volumes
Jan Funke, Julien N. P. Martel, Stephan Gerhard, Bjoern Andres, Dan C. Ciresan, Alessandro Giusti, Luca Maria Gambardella, Jürgen Schmidhuber, Hanspeter Pfister, Albert Cardona, Matthew Cook 0001
MICCAI (1)10
2012 Efficient automatic 3D-reconstruction of branching neurons from EM data
abstract
We present an approach for the automatic reconstruction of neurons from 3D stacks of electron microscopy sections. The core of our system is a set of possible assignments, each of which proposes with some cost a link between neuron regions in consecutive sections. These can model the continuation, branching, and end of neurons. The costs are trainable on positive assignment samples. An optimal and consistent set of assignments is found for the whole volume at once by solving an integer linear program. This set of assignments determines both the segmentation into neuron regions and the correspondence between such regions in neighboring slices. For each picked assignment, a confidence value helps to prioritize decisions to be reviewed by a human expert. We evaluate the performance of our method on an annotated volume of neural tissue and compare to the current state of the art [26]. Our method is superior in accuracy and can be trained using a small number of samples. The observed inference times are linear with about 2 milliseconds per neuron and section.
Jan Funke, Bjoern Andres, Fred A. Hamprecht, Albert Cardona, Matthew Cook 0001
CVPR4
2010 As-rigid-as-possible mosaicking and serial section registration of large ssTEM datasets
abstract
MOTIVATION: Tiled serial section Transmission Electron Microscopy (ssTEM) is increasingly used to describe high-resolution anatomy of large biological specimens. In particular in neurobiology, TEM is indispensable for analysis of synaptic connectivity in the brain. Registration of ssTEM image mosaics has to recover the 3D continuity and geometrical properties of the specimen in presence of various distortions that are applied to the tissue during sectioning, staining and imaging. These include staining artifacts, mechanical deformation, missing sections and the fact that structures may appear dissimilar in consecutive sections. RESULTS: We developed a fully automatic, non-rigid but as-rigid-as-possible registration method for large tiled serial section microscopy stacks. We use the Scale Invariant Feature Transform (SIFT) to identify corresponding landmarks within and across sections and globally optimize the pose of all tiles in terms of least square displacement of these landmark correspondences. We evaluate the precision of the approach using an artificially generated dataset designed to mimic the properties of TEM data. We demonstrate the performance of our method by registering an ssTEM dataset of the first instar larval brain of Drosophila melanogaster consisting of 6885 images. AVAILABILITY: This method is implemented as part of the open source software TrakEM2 (http://www.ini.uzh.ch/~acardona/trakem2.html) and distributed through the Fiji project (http://pacific.mpi-cbg.de).
Stephan Saalfeld, Albert Cardona, Volker Hartenstein, Pavel Tomancak
Bioinform.2
2010 A high-level 3D visualization API for Java and ImageJ
abstract
BACKGROUND: Current imaging methods such as Magnetic Resonance Imaging (MRI), Confocal microscopy, Electron Microscopy (EM) or Selective Plane Illumination Microscopy (SPIM) yield three-dimensional (3D) data sets in need of appropriate computational methods for their analysis. The reconstruction, segmentation and registration are best approached from the 3D representation of the data set. RESULTS: Here we present a platform-independent framework based on Java and Java 3D for accelerated rendering of biological images. Our framework is seamlessly integrated into ImageJ, a free image processing package with a vast collection of community-developed biological image analysis tools. Our framework enriches the ImageJ software libraries with methods that greatly reduce the complexity of developing image analysis tools in an interactive 3D visualization environment. In particular, we provide high-level access to volume rendering, volume editing, surface extraction, and image annotation. The ability to rely on a library that removes the low-level details enables concentrating software development efforts on the algorithm implementation parts. CONCLUSIONS: Our framework enables biomedical image software development to be built with 3D visualization capabilities with very little effort. We offer the source code and convenient binary packages along with extensive documentation at http://3dviewer.neurofly.de.
Benjamin Schmid, Johannes E. Schindelin, Albert Cardona, Mark Longair, Martin Heisenberg
BMC Bioinform.3
2009 CATMAID: collaborative annotation toolkit for massive amounts of image data
abstract
SUMMARY: High-resolution, three-dimensional (3D) imaging of large biological specimens generates massive image datasets that are difficult to navigate, annotate and share effectively. Inspired by online mapping applications like GoogleMaps, we developed a decentralized web interface that allows seamless navigation of arbitrarily large image stacks. Our interface provides means for online, collaborative annotation of the biological image data and seamless sharing of regions of interest by bookmarking. The CATMAID interface enables synchronized navigation through multiple registered datasets even at vastly different scales such as in comparisons between optical and electron microscopy. AVAILABILITY: http://fly.mpi-cbg.de/catmaid.
Stephan Saalfeld, Albert Cardona, Volker Hartenstein, Pavel Tomancak
Bioinform.2