11,179 research outputs found
Comparison Between Supervised and Unsupervised Classifications of Neuronal Cell Types: A Case Study
In the study of neural circuits, it becomes essential to discern the different neuronal cell types that build the circuit. Traditionally, neuronal cell types have been classified using qualitative descriptors. More recently, several attempts have been made to classify neurons quantitatively, using unsupervised clustering methods. While useful, these algorithms do not take advantage of previous information known to the investigator, which could improve the classification task. For neocortical GABAergic interneurons, the problem to discern among different cell types is particularly difficult and better methods are needed to perform objective classifications. Here we explore the use of supervised classification algorithms to classify neurons based on their morphological features, using a database of 128 pyramidal cells and 199 interneurons from mouse neocortex. To evaluate the performance of different algorithms we used, as a “benchmark,” the test to automatically distinguish between pyramidal cells and interneurons, defining “ground truth” by the presence or absence of an apical dendrite. We compared hierarchical clustering with a battery of different supervised classification algorithms, finding that supervised classifications outperformed hierarchical clustering. In addition, the selection of subsets of distinguishing features enhanced the classification accuracy for both sets of algorithms. The analysis of selected variables indicates that dendritic features were most useful to distinguish pyramidal cells from interneurons when compared with somatic and axonal morphological variables. We conclude that supervised classification algorithms are better matched to the general problem of distinguishing neuronal cell types when some information on these cell groups, in our case being pyramidal or interneuron, is known a priori. As a spin-off of this methodological study, we provide several methods to automatically distinguish neocortical pyramidal cells from interneurons, based on their morphologies
Universal in vivo Textural Model for Human Skin based on Optical Coherence Tomograms
Currently, diagnosis of skin diseases is based primarily on visual pattern
recognition skills and expertise of the physician observing the lesion. Even
though dermatologists are trained to recognize patterns of morphology, it is
still a subjective visual assessment. Tools for automated pattern recognition
can provide objective information to support clinical decision-making.
Noninvasive skin imaging techniques provide complementary information to the
clinician. In recent years, optical coherence tomography has become a powerful
skin imaging technique. According to specific functional needs, skin
architecture varies across different parts of the body, as do the textural
characteristics in OCT images. There is, therefore, a critical need to
systematically analyze OCT images from different body sites, to identify their
significant qualitative and quantitative differences. Sixty-three optical and
textural features extracted from OCT images of healthy and diseased skin are
analyzed and in conjunction with decision-theoretic approaches used to create
computational models of the diseases. We demonstrate that these models provide
objective information to the clinician to assist in the diagnosis of
abnormalities of cutaneous microstructure, and hence, aid in the determination
of treatment. Specifically, we demonstrate the performance of this methodology
on differentiating basal cell carcinoma (BCC) and squamous cell carcinoma (SCC)
from healthy tissue
Sparse Bilinear Logistic Regression
In this paper, we introduce the concept of sparse bilinear logistic
regression for decision problems involving explanatory variables that are
two-dimensional matrices. Such problems are common in computer vision,
brain-computer interfaces, style/content factorization, and parallel factor
analysis. The underlying optimization problem is bi-convex; we study its
solution and develop an efficient algorithm based on block coordinate descent.
We provide a theoretical guarantee for global convergence and estimate the
asymptotical convergence rate using the Kurdyka-{\L}ojasiewicz inequality. A
range of experiments with simulated and real data demonstrate that sparse
bilinear logistic regression outperforms current techniques in several
important applications.Comment: 27 pages, 5 figure
Discriminative Features via Generalized Eigenvectors
Representing examples in a way that is compatible with the underlying
classifier can greatly enhance the performance of a learning system. In this
paper we investigate scalable techniques for inducing discriminative features
by taking advantage of simple second order structure in the data. We focus on
multiclass classification and show that features extracted from the generalized
eigenvectors of the class conditional second moments lead to classifiers with
excellent empirical performance. Moreover, these features have attractive
theoretical properties, such as inducing representations that are invariant to
linear transformations of the input. We evaluate classifiers built from these
features on three different tasks, obtaining state of the art results
- …