Eizaburo Doi

dblp:50/1215 · DBLP profile ↗
← Back
7ranked-venue papers
7as first author
0since 2021 · last 2014
0000-0002-5462-3372ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
2 papers
Coding theory · 78% Information theory · 22%
Artificial intelligence
2 papers
Representation and self-supervised learning · 90% Deep learning architectures and training · 10%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error protection
robust coding
0.122007
Robust Coding Over Noisy Overcomplete Channels · IEEE Trans. Image Process. 2007
A Theoretical Analysis of Robust Coding over Noisy Overcomplete Channels · NIPS 2005
Coding theory
source coding
0.112007
Robust Coding Over Noisy Overcomplete Channels · IEEE Trans. Image Process. 2007
Machine learning › Representation and self-supervised learning › computational neuroscience › neural coding
efficient coding
0.112006
A Theory of Retinal Population Coding · NIPS 2006
Information theory
channel capacity
0.112005
A Theoretical Analysis of Robust Coding over Noisy Overcomplete Channels · NIPS 2005
Machine learning › Representation and self-supervised learning
overcomplete representation
0.012004
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units · NIPS 2004
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.012004
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units · NIPS 2004
Bioinformatics and computational biology › computational neuroscience
neural coding
0.012005
A Theoretical Analysis of Robust Coding over Noisy Overcomplete Channels · NIPS 2005
Bioinformatics and computational biology › computational neuroscience › neural coding
sensory coding
0.012005
A Theoretical Analysis of Robust Coding over Noisy Overcomplete Channels · NIPS 2005
Machine learning › Representation and self-supervised learning › computational neuroscience
neural coding
0.012004
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units · NIPS 2004

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

linear coder-decoder analysis · 0.1information-theoretic analysis · 0.1wavelets · 0.1mean squared error optimization · 0.1PCA · 0.1ICA · 0.1wiener filter · 0.1sparse coding · 0.0independent component analysis · 0.0
YearPublicationVenuePosition
2014 A Simple Model of Optimal Population Coding for Sensory Systems
abstract
A fundamental task of a sensory system is to infer information about the environment. It has long been suggested that an important goal of the first stage of this process is to encode the raw sensory signal efficiently by reducing its redundancy in the neural representation. Some redundancy, however, would be expected because it can provide robustness to noise inherent in the system. Encoding the raw sensory signal itself is also problematic, because it contains distortion and noise. The optimal solution would be constrained further by limited biological resources. Here, we analyze a simple theoretical model that incorporates these key aspects of sensory coding, and apply it to conditions in the retina. The model specifies the optimal way to incorporate redundancy in a population of noisy neurons, while also optimally compensating for sensory distortion and noise. Importantly, it allows an arbitrary input-to-output cell ratio between sensory units (photoreceptors) and encoding units (retinal ganglion cells), providing predictions of retinal codes at different eccentricities. Compared to earlier models based on redundancy reduction, the proposed model conveys more information about the original signal. Interestingly, redundancy reduction can be near-optimal when the number of encoding units is limited, such as in the peripheral retina. We show that there exist multiple, equally-optimal solutions whose receptive field structure and organization vary significantly. Among these, the one which maximizes the spatial locality of the computation, but not the sparsity of either synaptic weights or neural responses, is consistent with known basic properties of retinal receptive fields. The model further predicts that receptive field structure changes less with light adaptation at higher input-to-output cell ratios, such as in the periphery.
Eizaburo Doi, Michael S. Lewicki
PLoS Comput. Biol.1
2011 Characterization of Minimum Error Linear Coding with Sensory and Neural Noise
abstract
Robust coding has been proposed as a solution to the problem of minimizing decoding error in the presence of neural noise. Many real-world problems, however, have degradation in the input signal, not just in neural representations. This generalized problem is more relevant to biological sensory coding where internal noise arises from limited neural precision and external noise from distortion of sensory signal such as blurring and phototransduction noise. In this note, we show that the optimal linear encoder for this problem can be decomposed exactly into two serial processes that can be optimized separately. One is Wiener filtering, which optimally compensates for input degradation. The other is robust coding, which best uses the available representational capacity for signal transmission with a noisy population of linear neurons. We also present spectral analysis of the decomposition that characterizes how the reconstruction error is minimized under different input signal spectra, types and amounts of degradation, degrees of neural precision, and neural population sizes.
Eizaburo Doi, Michael S. Lewicki
Neural Comput.1
2007 Robust Coding Over Noisy Overcomplete Channels
abstract
We address the problem of robust coding in which the signal information should be preserved in spite of intrinsic noise in the representation. We present a theoretical analysis for 1- and 2-D cases and characterize the optimal linear encoder and decoder in the mean-squared error sense. Our analysis allows for an arbitrary number of coding units, thus including both under- and over-complete representations, and provides insights into optimal coding strategies. In particular, we show how the form of the code adapts to the number of coding units and to different data and noise conditions in order to achieve robustness. We also present numerical solutions of robust coding for high-dimensional image data, demonstrating that these codes are substantially more robust than other linear image coding methods such as PCA, ICA, and wavelets.
Eizaburo Doi, Doru-Cristian Balcan, Michael S. Lewicki
IEEE Trans. Image Process.1
2006 A Theory of Retinal Population Coding
abstract
Efficient coding models predict that the optimal code for natural images is a population of oriented Gabor receptive fields. These results match response properties of neurons in primary visual cortex, but not those in the retina. Does the retina use an optimal code, and if so, what is it optimized for? Previous theories of retinal coding have assumed that the goal is to encode the maximal amount of information about the sensory signal. However, the image sampled by retinal photoreceptors is degraded both by the optics of the eye and by the photoreceptor noise. Therefore, de-blurring and de-noising of the retinal signal should be important aspects of retinal coding. Furthermore, the ideal retinal code should be robust to neural noise and make optimal use of all available neurons. Here we present a theoretical framework to derive codes that simultaneously satisfy all of these desiderata. When optimized for natural images, the model yields filters that show strong similarities to retinal ganglion cell (RGC) receptive fields. Importantly, the characteristics of receptive fields vary with retinal eccentricities where the optical blur and the number of RGCs are significantly different. The proposed model provides a unified account of retinal coding, and more generally, it may be viewed as an extension of the Wiener filter with an arbitrary number of noisy units.
Eizaburo Doi, Michael S. Lewicki
NIPS1
2005 A Theoretical Analysis of Robust Coding over Noisy Overcomplete Channels
abstract
Biological sensory systems are faced with the problem of encoding a high-fidelity sensory signal with a population of noisy, low-fidelity neurons. This problem can be expressed in information theoretic terms as coding and transmitting a multi-dimensional, analog signal over a set of noisy channels. Previously, we have shown that robust, overcomplete codes can be learned by minimizing the reconstruction error with a constraint on the channel capacity. Here, we present a theoretical analysis that characterizes the optimal linear coder and decoder for one- and twodimensional data. The analysis allows for an arbitrary number of coding units, thus including both under- and over-complete representations, and provides a number of important insights into optimal coding strategies. In particular, we show how the form of the code adapts to the number of coding units and to different data and noise conditions to achieve robustness. We also report numerical solutions for robust coding of highdimensional image data and show that these codes are substantially more robust compared against other image codes such as ICA and wavelets.
Eizaburo Doi, Doru-Cristian Balcan, Michael S. Lewicki
NIPS1
2004 Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units
abstract
It has been suggested that the primary goal of the sensory system is to represent input in such a way as to reduce the high degree of redun- dancy. Given a noisy neural representation, however, solely reducing redundancy is not desirable, since redundancy is the only clue to reduce the effects of noise. Here we propose a model that best balances redun- dancy reduction and redundant representation. Like previous models, our model accounts for the localized and oriented structure of simple cells, but it also predicts a different organization for the population. With noisy, limited-capacity units, the optimal representation becomes an overcom- plete, multi-scale representation, which, compared to previous models, is in closer agreement with physiological data. These results offer a new perspective on the expansion of the number of neurons from retina to V1 and provide a theoretical model of incorporating useful redundancy into efficient neural representations. 1 Introduction Efficient coding theory posits that one of the primary goals of sensory coding is to eliminate redundancy from raw sensory signals, ideally representing the input by a set of statistically independent features [1]. Models for learning efficient codes, such as sparse coding [2] or ICA [3], predict the localized, oriented, and band-pass characteristics of simple cells. In this framework, units are assumed to be non-redundant and so the number of units should be identical to the dimensionality of the data. Redundancy, however, can be beneficial if it is used to compensate for inherent noise in the system [4]. The models above assume that the system noise is low and negligible so that redundancy in the representation is not necessary. This is equivalent to assuming that the representational capacity of individual units is unlimited. Real neurons, however, have limited capacity [5], and this should place constraints on how a neural population can best encode a sensory signal. In fact, there are important characteristics of simple cells, such as the multi-scale representation, that cannot be explained by efficient coding theory. The aim of this study is to evaluate how the optimal representation changes when the system is constrained by limited capacity units. We propose a model that best balances redundancy reduction and redundant representation given the limited capacity units. In contrast to the efficient coding models, it is possible to have a larger number of units than the intrinsic dimensionality of the data. This further allows to introduce redundancy in the population, enabling precise reconstruction using the imprecise representation of a single unit.
Eizaburo Doi, Michael S. Lewicki
NIPS1
2003 Spatiochromatic Receptive Field Properties Derived from Information-Theoretic Analyses of Cone Mosaic Responses to Natural Scenes
abstract
Neurons in the early stages of processing in the primate visual system efficiently encode natural scenes. In previous studies of the chromatic properties of natural images, the inputs were sampled on a regular array, with complete color information at every location. However, in the retina cone photoreceptors with different spectral sensitivities are arranged in a mosaic. We used an unsupervised neural network model to analyze the statistical structure of retinal cone mosaic responses to calibrated color natural images. The second-order statistical dependencies derived from the covariance matrix of the sensory signals were removed in the first stage of processing. These decorrelating filters were similar to type I receptive fields in parvo- or konio-cellular LGN in both spatial and chromatic characteristics. In the subsequent stage, the decorrelated signals were linearly transformed to make the output as statistically independent as possible, using independent component analysis. The independent component filters showed luminance selectivity with simple-cell-like receptive fields, or had strong color selectivity with large, often double-opponent, receptive fields, both of which were found in the primary visual cortex (V1). These results show that the "form" and "color" channels of the early visual system can be derived from the statistics of sensory signals.
Eizaburo Doi, Toshio Inui, Te-Won Lee, Thomas Wachtler, Terrence J. Sejnowski
Neural Comput.1