@inproceedings{756, abstract = {This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, NeighborWatchRB, makes use of a novel strategy in which honest devices monitor their neighbors for malicious behavior. Second, we present a more robust variant, MultiPathRB, that tolerates the maximum possible density of malicious devices per region, using an elaborate voting strategy. We also introduce a new proof technique to show that both protocols ensure asymptotically optimal running time. We demonstrate the fault tolerance of our protocols through extensive simulation. Simulations show the practical superiority of the NeighborWatchRB protocol (an advantage hidden in the constants of the asymptotic complexity). The NeighborWatchRB protocol even performs relatively well when compared to the simple, fast epidemic protocols commonly used in the radio setting, protocols that tolerate no malicious faults. We therefore believe that the overhead for ensuring authenticated broadcast is reasonable, especially in applications that use authenticated broadcast only when necessary, such as distributing an authenticated digest.}, author = {Alistarh, Dan-Adrian and Gilbert, Seth and Guerraoui, Rachid and Milošević, Žarko and Newport, Calvin}, pages = {50 -- 59}, publisher = {ACM}, title = {{Securing every bit: Authenticated broadcast in radio networks}}, doi = {10.1145/1810479.1810489}, year = {2010}, } @inproceedings{758, abstract = {Set agreement [4] is a fundamental problem in distributed computing, in which processes collectively choose a small subset of values from a larger set of proposals. Set agreement has been extensively studied in both synchronous and asynchronous systems [10,11,3,5,8,9]. Real world distributed systems, however, are neither purely synchronous nor purely asynchronous. To describe such a system, Dwork et al. [6] introduced the idea of partial synchrony. They assume for every execution some (unknown) time GST (global stabilization time), after which the system is synchronous. In a recent paper [1,2], we study the complexity of set agreement in the context of partially synchronous systems, determining the minimum-sized window of synchrony in which set agreement can be solved. We show that at least ⌊t/k⌋ + 2 synchronous rounds are required for k-set agreement, where t < n is the number of crashes, and k is the agreement parameter of the set agreement task. We then introduce an algorithm that terminates in any window of synchrony of size at least ⌊t/k⌋ + 4 rounds. Together, these results tightly bound the inherent price of tolerating some asynchrony.}, author = {Alistarh, Dan-Adrian and Gilbert, Seth and Guerraoui, Rachid and Travers, Corentin}, pages = {404 -- 405}, publisher = {Springer}, title = {{Brief announcement: New bounds for partially synchronous set agreement}}, doi = {10.1007/978-3-642-15763-9_40}, volume = {6343 LNCS}, year = {2010}, } @inproceedings{3430, abstract = {These are notes for a set of 7 two-hour lectures given at the 2010 Summer School on Quantitative Evolutionary and Comparative Genomics at OIST, Okinawa, Japan. The emphasis is on understanding how biological systems process information. We take a physicist's approach of looking for simple phenomenological descriptions that can address the questions of biological function without necessarily modeling all (mostly unknown) microscopic details; the example that is developed throughout the notes is transcriptional regulation in genetic regulatory networks. We present tools from information theory and statistical physics that can be used to analyze noisy nonlinear biological networks, and build generative and predictive models of regulatory processes.}, author = {Gasper Tkacik}, publisher = {Elsevier}, title = {{Lecture notes for 2010 summer school on Quantitative Evolutionary and Comparative Genomics}}, year = {2010}, } @article{3441, abstract = {The hippocampus is an important brain circuit for spatial memory and the spatially selective spiking of hippocampal neuronal assemblies is thought to provide a mnemonic representation of space. We found that remembering newly learnt goal locations required NMDA receptorĝ€"dependent stabilization and enhanced reactivation of goal-related hippocampal assemblies. During spatial learning, place-related firing patterns in the CA1, but not CA3, region of the rat hippocampus were reorganized to represent new goal locations. Such reorganization did not occur when goals were marked by visual cues. The stabilization and successful retrieval of these newly acquired CA1 representations of behaviorally relevant places was NMDAR dependent and necessary for subsequent memory retention performance. Goal-related assembly patterns associated with sharp wave/ripple network oscillations, during both learning and subsequent rest periods, predicted memory performance. Together, these results suggest that the reorganization and reactivation of assembly firing patterns in the hippocampus represent the formation and expression of new spatial memory traces. © 2010 Nature America, Inc. All rights reserved.}, author = {Dupret, David and Joseph O'Neill and Pleydell-Bouverie, Barty and Jozsef Csicsvari}, journal = {Nature Neuroscience}, number = {8}, pages = {995 -- 1002}, publisher = {Nature Publishing Group}, title = {{The reorganization and reactivation of hippocampal maps predict spatial memory performance}}, doi = {10.1038/nn.2599}, volume = {13}, year = {2010}, } @article{3442, abstract = {Episodic and spatial memories each involve the encoding of complex associations in hippocampal neuronal circuits. Such memory traces could be stabilised from short- to long-term forms by consolidation processes involving the 'reactivation' of the original network firing patterns during sleep and rest. Waking experience can be replayed in many different brain areas, but an important role for the hippocampus lies in the organisation of the 'reactivation' process. Emerging evidence suggests that sharp wave/ripple (SWR) events in the hippocampus could coordinate the reactivation of memory traces and direct their reinstatement in cortical circuits. Although the mechanisms remain uncertain, there is a growing consensus that such SWR-directed reactivation of brain-wide memory traces could underlie memory consolidation. © 2010 Elsevier Ltd.}, author = {Joseph O'Neill and Pleydell-Bouverie, Barty and Dupret, David and Jozsef Csicsvari}, journal = {Trends in Neurosciences}, number = {5}, pages = {220 -- 229}, publisher = {Elsevier}, title = {{Play it again: reactivation of waking experience and memory}}, doi = {10.1016/j.tins.2010.01.006}, volume = {33}, year = {2010}, } @inbook{3459, abstract = {Ein zehnjähriger Junge aus dem Qureshi-birdari-Klan im Norden Pakistans war ob seines bizarren »Straßentheaters« weithin bekannt, insbesondere auch bei den lokalen medizinischen Versorgungsstellen: Er fügte sich selbst Wunden zu, bohrte sich Messer in die Arme und lief über glühende Kohlen – ohne dabei Schmerzen zu empfinden. Nach seinem Tod, er sprang kurz vor seinem vierzehnten Geburtstag als besonderes Kunststück vom Dach eines Hauses, wurden englische Ärzte und Genetiker auf diesen Fall aufmerksam. Bei ihren Nachforschungen entdeckten sie sechs weitere Kinder im Alter zwischen sechs und 14 Jahren, die alle keinerlei Schmerzempfindung zeigten, dafür aber zahlreiche Hämatome, schlecht verheilte Brüche sowie Verletzungen an Lippen und Zunge aufwiesen. Tastempfindung, Propriozeption oder Temperaturwahrnehmung dieser Kinder war normal. Umfangreiche genetische Analysen (sog. linkage -Analysen) erbrachten als Ursache für die vollständige Schmerzunempfindichkeit der Kinder Mutationen in einem Gen (SCN9A), das für einen spannungsgesteuerten Natriumkanal (Nav1.7) kodiert und vor allem in den schmerzleitenden Spinalnervenfasern exprimiert wird.}, author = {Fakler, Bernd and Jonas, Peter M}, booktitle = {Physiologie des Menschen}, editor = {Schmidt, R. and Heckmann, M. and Lang, Florian}, isbn = {9783642016509}, pages = {49--75}, publisher = {Springer}, title = {{Grundlagen zellulärer Erregbarkeit}}, doi = {10.1007/978-3-642-01651-6_4}, year = {2010}, } @article{3498, abstract = {Purpose Calcifying tendinitis is a common condition of the shoulder. In many cases, arthroscopic reduction in the deposit is indicated. The localization of the deposit is sometimes challenging and time-consuming. Pre-operative ultrasound (US)-guided needle placement in the deposit and pre-operative US marking of the deposit at the skin with a ballpoint are described and recommended methods to alleviate the procedure without using ionizing radiation by fluoroscopy. Methods Intra-operative sonography of the shoulder is introduced as a new method to localize the calcific deposit with high accuracy. After standard arthroscopic buresectomy, the surgeon performs an ultrasound examination under sterile conditions to localize the deposits. A ventral longitudinal US section is recommended, and the upper arm is rotated until the deposit is visible. Subsequently, perpendicular to the skin at the position of the transducer, a needle is introduced under arthroscopic and ultrasound visualization to puncture the deposit. Results The presence of snow-white crystals at the tip of the needle proves the exact localization. Consecutively, the curettage can be accomplished. Another intra-operative sonography evaluates possible calcific remnants and the tendon structure. Conclusion This new technique may alleviate arthroscopic calcific deposit curettage by visualizing the deposit without using ionizing radiation. Additionally, soft tissue damage due to decreased number of punctures to detect the deposit may be achieved. Both factors may contribute to reduced operation time.}, author = {Sabeti Aschraf, M. and Gonano, C. and Nemecek, E. and Cichocki, Lisa and Schueller Weidekamm, C.}, journal = {Knee Surgery, Sports Traumatology, Arthroscopy}, number = {12}, pages = {1792 -- 1794}, publisher = {Springer}, title = {{Intra-operative ultrasound facilitates the localization of the calcific deposit during arthroscopic treatment of calcifying tendinitis}}, doi = {10.1007/s00167-010-1227-9}, volume = {18}, year = {2010}, } @article{3538, abstract = {How seizures start is a major question in epilepsy research. Preictal EEG changes occur in both human patients and animal models, but their underlying mechanisms and relationship with seizure initiation remain unknown. Here we demonstrate the existence, in the hippocampal CA1 region, of a preictal state characterized by the progressive and global increase in neuronal activity associated with a widespread buildup of low-amplitude high-frequency activity (HFA) (> 100 Hz) and reduction in system complexity. HFA is generated by the firing of neurons, mainly pyramidal cells, at much lower frequencies. Individual cycles of HFA are generated by the near-synchronous (within similar to 5 ms) firing of small numbers of pyramidal cells. The presence of HFA in the low-calcium model implicates nonsynaptic synchronization; the presence of very similar HFA in the high-potassium model shows that it does not depend on an absence of synaptic transmission. Immediately before seizure onset, CA1 is in a state of high sensitivity in which weak depolarizing or synchronizing perturbations can trigger seizures. Transition to seizure is characterized by a rapid expansion and fusion of the neuronal populations responsible for HFA, associated with a progressive slowing of HFA, leading to a single, massive, hypersynchronous cluster generating the high-amplitude low-frequency activity of the seizure.}, author = {Jiruska, Premysl and Csicsvari, Jozsef L and Powell, Andrew and Fox, John and Chang, Wei and Vreugdenhil, Martin and Li, Xiaoli and Palus, Milan and Bujan, Alejandro and Dearden, Richard and Jefferys, John}, journal = {Journal of Neuroscience}, number = {16}, pages = {5690 -- 5701}, publisher = {Society for Neuroscience}, title = {{High-frequency network activity, global increase in neuronal activity, and synchrony expansion precede epileptic seizures in vitro}}, doi = {10.1523/JNEUROSCI.0535-10.2010}, volume = {30}, year = {2010}, } @article{3592, abstract = {The zebrafish is a favorite model organism to study tissue morphogenesis during development at a subcellular level. This largely results from the fact that zebrafish embryos are transparent and thus accessible to various imaging techniques, such as confocal and two-photon excitation (2PE) microscopy. In particular, 2PE microscopy has been shown to be useful for imaging deep cell layers within the embryo and following tissue morphogenesis over long periods. This chapter describes how to use 2PE microscopy to study morphogenetic movements during early zebrafish embryonic development, providing a general blueprint for its use in zebrafish.}, author = {Carvalho, Lara and Heisenberg, Carl-Philipp J}, journal = {Methods in Molecular Biology}, number = {Part 5}, pages = {273 -- 287}, publisher = {Springer}, title = {{Imaging zebrafish embryos by two-photon excitation time-lapse microscopy}}, doi = {10.1007/978-1-60327-977-2_17}, volume = {546}, year = {2010}, } @article{3603, abstract = {Classical models of gene flow fail in three ways: they cannot explain large-scale patterns; they predict much more genetic diversity than is observed; and they assume that loosely linked genetic loci evolve independently. We propose a new model that deals with these problems. Extinction events kill some fraction of individuals in a region. These are replaced by offspring from a small number of parents, drawn from the preexisting population. This model of evolution forwards in time corresponds to a backwards model, in which ancestral lineages jump to a new location if they are hit by an event, and may coalesce with other lineages that are hit by the same event. We derive an expression for the identity in allelic state, and show that, over scales much larger than the largest event, this converges to the classical value derived by Wright and Malécot. However, rare events that cover large areas cause low genetic diversity, large-scale patterns, and correlations in ancestry between unlinked loci.}, author = {Nicholas Barton and Kelleher, Jerome and Etheridge, Alison M}, journal = {Evolution; International Journal of Organic Evolution}, number = {9}, pages = {2701 -- 2715}, publisher = {Wiley-Blackwell}, title = {{A new model for large-scale population dynamics: quantifying phylogeography }}, doi = {10.1111/j.1558-5646.2010.01019.x}, volume = {64}, year = {2010}, } @article{3604, abstract = {We investigated temporal changes in hybridization and introgression between native red deer (Cervus elaphus) and invasive Japanese sika (Cervus nippon) on the Kintyre Peninsula, Scotland, over 15 years, through analysis of 1513 samples of deer at 20 microsatellite loci and a mtDNA marker. We found no evidence that either the proportion of recent hybrids, or the levels of introgression had changed over the study period. Nevertheless, in one population where the two species have been in contact since ∼1970, 44% of individuals sampled during the study were hybrids. This suggests that hybridization between these species can proceed fairly rapidly. By analysing the number of alleles that have introgressed from polymorphic red deer into the genetically homogenous sika population, we reconstructed the haplotypes of red deer alleles introduced by backcrossing. Five separate hybridization events could account for all the recently hybridized sika-like individuals found across a large section of the Peninsula. Although we demonstrate that low rates of F1 hybridization can lead to substantial introgression, the progress of hybridization and introgression appears to be unpredictable over the short timescales.}, author = {Senn, Helen and Goodman, Simon and Swanson, Graeme and Barton, Nicholas H and Pemberton, Josephine}, journal = {Molecular Ecology}, number = {5}, pages = {910 -- 924}, publisher = {Wiley-Blackwell}, title = {{Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland}}, doi = {10.1111/j.1365-294X.2009.04497.x}, volume = {19}, year = {2010}, } @inproceedings{3676, abstract = {Most state-of-the-art systems for content-based video understanding tasks require video content to be represented as collections of many low-level descriptors, e.g. as histograms of the color, texture or motion in local image regions. In order to preserve as much of the information contained in the original video as possible, these representations are typically high-dimensional, which conflicts with the aim for compact descriptors that would allow better efficiency and lower storage requirements. In this paper, we address the problem of semantic com- pression of video, i.e. the reduction of low-level descriptors to a small number of dimensions while preserving most of the semantic information. For this, we adapt topic models – which have previously been used as compact representations of still images – to take into account the temporal structure of a video, as well as multi-modal components such as motion information. Experiments on a large-scale collection of YouTube videos show that we can achieve a compression ratio of 20 : 1 compared to ordinary histogram representations and at least 2 : 1 compared to other dimensionality reduction techniques without significant loss of prediction accuracy. Also, improvements are demonstrated for our video-specific extensions modeling temporal structure and multiple modalities.}, author = {Wanke,Jörn and Ulges, Adrian and Christoph Lampert and Breuel,Thomas M}, pages = {275 -- 284}, publisher = {ACM}, title = {{Topic models for semantic video compression}}, doi = {10.1145/1743384.1743433}, year = {2010}, } @inproceedings{3682, abstract = {For object category recognition to scale beyond a small number of classes, it is important that algorithms be able to learn from a small amount of labeled data per additional class. One-shot recognition aims to apply the knowledge gained from a set of categories with plentiful data to categories for which only a single exemplar is available for each. As with earlier efforts motivated by transfer learning, we seek an internal representation for the domain that generalizes across classes. However, in contrast to existing work, we formulate the problem in a fundamentally new manner by optimizing the internal representation for the one-shot task using the notion of micro-sets. A micro-set is a sample of data that contains only a single instance of each category, sampled from the pool of available data, which serves as a mechanism to force the learned representation to explicitly address the variability and noise inherent in the one-shot recognition task. We optimize our learned domain features so that they minimize an expected loss over micro-sets drawn from the training set and show that these features generalize effectively to previously unseen categories. We detail a discriminative approach for optimizing one-shot recognition using micro-sets and present experiments on the Animals with Attributes and Caltech-101 datasets that demonstrate the benefits of our formulation.}, author = {Tang, Kevin D and Tappen, Marshall F and Sukthankar,Rahul and Christoph Lampert}, pages = {3027 -- 3034}, publisher = {IEEE}, title = {{Optimizing one-shot recognition with micro-set learning}}, doi = {10.1109/CVPR.2010.5540053}, year = {2010}, } @article{3686, abstract = {Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to incorporating only local interactions and cannot model global properties such as connectedness, which is a potentially useful high-level prior for object segmentation. In this work, we overcome this limitation by deriving a potential function that forces the output labeling to be connected and that can naturally be used in the framework of recent maximum a posteriori (MAP)-MRF linear program (LP) relaxations. Using techniques from polyhedral combinatorics, we show that a provably strong approximation to the MAP solution of the resulting MRF can still be found efficiently by solving a sequence of max-flow problems. The efficiency of the inference procedure also allows us to learn the parameters of an MRF with global connectivity potentials by means of a cutting plane algorithm. We experimentally evaluate our algorithm on both synthetic data and on the challenging image segmentation task of the PASCAL Visual Object Classes 2008 data set. We show that in both cases the addition of a connectedness prior significantly reduces the segmentation error. }, author = {Nowozin, Sebastian and Christoph Lampert}, journal = {SIAM Journal on Imaging Sciences}, number = {4 (Special Section on Optimization in Imaging Sciences)}, pages = {1048 -- 1074}, publisher = {Society for Industrial and Applied Mathematics }, title = {{Global interactions in random field models: A potential function ensuring connectedness}}, doi = {10.1137/090752614}, volume = {3}, year = {2010}, } @article{3697, abstract = {The goal of this paper is to evaluate and compare models and methods for learning to recognize basic entities in images in an unsupervised setting. In other words, we want to discover the objects present in the images by analyzing unlabeled data and searching for re-occurring patterns. We experiment with various baseline methods, methods based on latent variable models, as well as spectral clustering methods. The results are presented and compared both on subsets of Caltech256 and MSRC2, data sets that are larger and more challenging and that include more object classes than what has previously been reported in the literature. A rigorous framework for evaluating unsupervised object discovery methods is proposed.}, author = {Tuytelaars,Tinne and Christoph Lampert and Blaschko,Matthew B and Buntine,Wray}, journal = {International Journal of Computer Vision}, number = {2}, pages = {284 -- 302}, publisher = {Springer}, title = {{Unsupervised object discovery: A comparison}}, doi = {10.1007/s11263-009-0271-8}, volume = {88}, year = {2010}, } @inproceedings{3702, abstract = {Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can properly be returned to the opponent. These predictions get more accurate over time, hence the behaviors need to be continuously modified. As a result, movement templates with a learned global shape need to be adapted during the execution so that the racket reaches a target position and velocity that will return the ball over to the other side of the net or court. It requires altering learned movements to hit a varying target with the necessary velocity at a specific instant in time. Such a task cannot be incorporated straightforwardly in most movement representations suitable for learning. For example, the standard formulation of the dynamical system based motor primitives (introduced by Ijspeert et al. [1]) does not satisfy this property despite their flexibility which has allowed learning tasks ranging from locomotion to kendama. In order to fulfill this requirement, we reformulate the Ijspeert framework to incorporate the possibility of specifying a desired hitting point and a desired hitting velocity while maintaining all advantages of the original formulation. We show that the proposed movement template formulation works well in two scenarios, i.e., for hitting a ball on a string with a table tennis racket at a specified velocity and for returning balls launched by a ball gun successfully over the net using forehand movements. All experiments were carried out on a Barrett WAM using a four camera vision system.}, author = {Kober,Jens and Mülling,Katharina and Krömer,Oliver and Christoph Lampert and Schölkopf,Bernhard and Peters, Jan}, pages = {853 -- 858}, publisher = {IEEE}, title = {{Movement templates for learning of hitting and batting}}, doi = {10.1109/ROBOT.2010.5509672}, year = {2010}, } @inproceedings{3713, abstract = {We introduce a method to accelerate the evaluation of object detection cascades with the help of a divide-and-conquer procedure in the space of candidate regions. Compared to the exhaustive procedure that thus far is the state-of-the-art for cascade evaluation, the proposed method requires fewer evaluations of the classifier functions, thereby speeding up the search. Furthermore, we show how the recently developed efficient subwindow search (ESS) procedure [11] can be integrated into the last stage of our method. This allows us to use our method to act not only as a faster procedure for cascade evaluation, but also as a tool to perform efficient branch-and-bound object detection with nonlinear quality functions, in particular kernelized support vector machines. Experiments on the PASCAL VOC 2006 dataset show an acceleration of more than 50% by our method compared to standard cascade evaluation.}, author = {Christoph Lampert}, pages = {1022 -- 1029}, publisher = {IEEE}, title = {{An efficient divide-and-conquer cascade for nonlinear object detection}}, doi = {10.1109/CVPR.2010.5540107}, year = {2010}, } @article{3718, abstract = {Long-term depression (LTD) is a form of synaptic plasticity that may contribute to information storage in the central nervous system. Here we report that LTD can be elicited in layer 5 pyramidal neurons of the rat prefrontal cortex by pairing low frequency stimulation with a modest postsynaptic depolarization. The induction of LTD required the activation of both metabotropic glutamate receptors of the mGlu1 subtype and voltage-sensitive Ca(2+) channels (VSCCs) of the T/R, P/Q and N types, leading to the stimulation of intracellular inositol trisphosphate (IP3) receptors by IP3 and Ca(2+). The subsequent release of Ca(2+) from intracellular stores activated the protein phosphatase cascade involving calcineurin and protein phosphatase 1. The activation of purinergic P2Y(1) receptors blocked LTD. This effect was prevented by P2Y(1) receptor antagonists and was absent in mice lacking P2Y(1) but not P2Y(2) receptors. We also found that activation of P2Y(1) receptors inhibits Ca(2+) transients via VSCCs in the apical dendrites and spines of pyramidal neurons. In addition, we show that the release of ATP under hypoxia is able to inhibit LTD by acting on postsynaptic P2Y(1) receptors. In conclusion, these data suggest that the reduction of Ca(2+) influx via VSCCs caused by the activation of P2Y(1) receptors by ATP is the possible mechanism for the inhibition of LTD in prefrontal cortex.}, author = {Guzmán, José and Schmidt, Hartmut and Franke, Heike and Krügel, Ute and Eilers, Jens and Illes, Peter and Gerevich, Zoltan}, journal = {Neuropharmacology}, number = {6}, pages = {406 -- 415}, publisher = {Elsevier}, title = {{P2Y1 receptors inhibit long-term depression in the prefrontal cortex.}}, doi = {10.1016/j.neuropharm.2010.05.013}, volume = {59}, year = {2010}, } @inproceedings{3719, abstract = {The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a math- ematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the com- binatorial complexity by quotienting the reachable set of molecular species, into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper we prove that this quotienting yields a sufficient condition for weak lumpability and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system. We illustrate the framework on a case study of the EGF/insulin receptor crosstalk.}, author = {Feret, Jérôme and Henzinger, Thomas A and Koeppl, Heinz and Petrov, Tatjana}, location = {Jena, Germany}, pages = {142--161}, publisher = {Open Publishing Association}, title = {{Lumpability abstractions of rule-based systems}}, volume = {40}, year = {2010}, } @article{3735, abstract = {The visual system is challenged with extracting and representing behaviorally relevant information contained in natural inputs of great complexity and detail. This task begins in the sensory periphery: retinal receptive fields and circuits are matched to the first and second-order statistical structure of natural inputs. This matching enables the retina to remove stimulus components that are predictable (and therefore uninformative), and primarily transmit what is unpredictable (and therefore informative). Here we show that this design principle applies to more complex aspects of natural scenes, and to central visual processing. We do this by classifying high-order statistics of natural scenes according to whether they are uninformative vs. informative. We find that the uninformative ones are perceptually nonsalient, while the informative ones are highly salient, and correspond to previously identified perceptual mechanisms whose neural basis is likely central. Our results suggest that the principle of efficient coding not only accounts for filtering operations in the sensory periphery, but also shapes subsequent stages of sensory processing that are sensitive to high-order image statistics.}, author = {Gasper Tkacik and Prentice, Jason S and Victor,Jonathan D and Balasubramanian, Vijay}, journal = {PNAS}, number = {42}, pages = {18149 -- 18154}, publisher = {National Academy of Sciences}, title = {{Local statistics in natural scenes predict the saliency of synthetic textures}}, doi = {10.1073/pnas.0914916107}, volume = {107}, year = {2010}, }