Project acronym 19TH-CENTURY_EUCLID
Project Nineteenth-Century Euclid: Geometry and the Literary Imagination from Wordsworth to Wells
Researcher (PI) Alice Jenkins
Host Institution (HI) UNIVERSITY OF GLASGOW
Call Details Starting Grant (StG), SH4, ERC-2007-StG
Summary This radically interdisciplinary project aims to bring a substantially new field of research – literature and mathematics studies – to prominence as a tool for investigating the culture of nineteenth-century Britain. It will result in three kinds of outcome: a monograph, two interdisciplinary and international colloquia, and a collection of essays. The project focuses on Euclidean geometry as a key element of nineteenth-century literary and scientific culture, showing that it was part of the shared knowledge flowing through elite and popular Romantic and Victorian writing, and figuring notably in the work of very many of the century’s best-known writers. Despite its traditional cultural prestige and educational centrality, geometry has been almost wholly neglected by literary history. This project shows how literature and mathematics studies can draw a new map of nineteenth-century British culture, revitalising our understanding of the Romantic and Victorian imagination through its writing about geometry.
Summary
This radically interdisciplinary project aims to bring a substantially new field of research – literature and mathematics studies – to prominence as a tool for investigating the culture of nineteenth-century Britain. It will result in three kinds of outcome: a monograph, two interdisciplinary and international colloquia, and a collection of essays. The project focuses on Euclidean geometry as a key element of nineteenth-century literary and scientific culture, showing that it was part of the shared knowledge flowing through elite and popular Romantic and Victorian writing, and figuring notably in the work of very many of the century’s best-known writers. Despite its traditional cultural prestige and educational centrality, geometry has been almost wholly neglected by literary history. This project shows how literature and mathematics studies can draw a new map of nineteenth-century British culture, revitalising our understanding of the Romantic and Victorian imagination through its writing about geometry.
Max ERC Funding
323 118 €
Duration
Start date: 2009-01-01, End date: 2011-10-31
Project acronym 3D Reloaded
Project 3D Reloaded: Novel Algorithms for 3D Shape Inference and Analysis
Researcher (PI) Daniel Cremers
Host Institution (HI) TECHNISCHE UNIVERSITAET MUENCHEN
Call Details Consolidator Grant (CoG), PE6, ERC-2014-CoG
Summary Despite their amazing success, we believe that computer vision algorithms have only scratched the surface of what can be done in terms of modeling and understanding our world from images. We believe that novel image analysis techniques will be a major enabler and driving force behind next-generation technologies, enhancing everyday life and opening up radically new possibilities. And we believe that the key to achieving this is to develop algorithms for reconstructing and analyzing the 3D structure of our world.
In this project, we will focus on three lines of research:
A) We will develop algorithms for 3D reconstruction from standard color cameras and from RGB-D cameras. In particular, we will promote real-time-capable direct and dense methods. In contrast to the classical two-stage approach of sparse feature-point based motion estimation and subsequent dense reconstruction, these methods optimally exploit all color information to jointly estimate dense geometry and camera motion.
B) We will develop algorithms for 3D shape analysis, including rigid and non-rigid matching, decomposition and interpretation of 3D shapes. We will focus on algorithms which are optimal or near-optimal. One of the major computational challenges lies in generalizing existing 2D shape analysis techniques to shapes in 3D and 4D (temporal evolutions of 3D shape).
C) We will develop shape priors for 3D reconstruction. These can be learned from sample shapes or acquired during the reconstruction process. For example, when reconstructing a larger office algorithms may exploit the geometric self-similarity of the scene, storing a model of a chair and its multiple instances only once rather than multiple times.
Advancing the state of the art in geometric reconstruction and geometric analysis will have a profound impact well beyond computer vision. We strongly believe that we have the necessary competence to pursue this project. Preliminary results have been well received by the community.
Summary
Despite their amazing success, we believe that computer vision algorithms have only scratched the surface of what can be done in terms of modeling and understanding our world from images. We believe that novel image analysis techniques will be a major enabler and driving force behind next-generation technologies, enhancing everyday life and opening up radically new possibilities. And we believe that the key to achieving this is to develop algorithms for reconstructing and analyzing the 3D structure of our world.
In this project, we will focus on three lines of research:
A) We will develop algorithms for 3D reconstruction from standard color cameras and from RGB-D cameras. In particular, we will promote real-time-capable direct and dense methods. In contrast to the classical two-stage approach of sparse feature-point based motion estimation and subsequent dense reconstruction, these methods optimally exploit all color information to jointly estimate dense geometry and camera motion.
B) We will develop algorithms for 3D shape analysis, including rigid and non-rigid matching, decomposition and interpretation of 3D shapes. We will focus on algorithms which are optimal or near-optimal. One of the major computational challenges lies in generalizing existing 2D shape analysis techniques to shapes in 3D and 4D (temporal evolutions of 3D shape).
C) We will develop shape priors for 3D reconstruction. These can be learned from sample shapes or acquired during the reconstruction process. For example, when reconstructing a larger office algorithms may exploit the geometric self-similarity of the scene, storing a model of a chair and its multiple instances only once rather than multiple times.
Advancing the state of the art in geometric reconstruction and geometric analysis will have a profound impact well beyond computer vision. We strongly believe that we have the necessary competence to pursue this project. Preliminary results have been well received by the community.
Max ERC Funding
2 000 000 €
Duration
Start date: 2015-09-01, End date: 2020-08-31
Project acronym 4DRepLy
Project Closing the 4D Real World Reconstruction Loop
Researcher (PI) Christian THEOBALT
Host Institution (HI) MAX-PLANCK-GESELLSCHAFT ZUR FORDERUNG DER WISSENSCHAFTEN EV
Call Details Consolidator Grant (CoG), PE6, ERC-2017-COG
Summary 4D reconstruction, the camera-based dense dynamic scene reconstruction, is a grand challenge in computer graphics and computer vision. Despite great progress, 4D capturing the complex, diverse real world outside a studio is still far from feasible. 4DRepLy builds a new generation of high-fidelity 4D reconstruction (4DRecon) methods. They will be the first to efficiently capture all types of deformable objects (humans and other types) in crowded real world scenes with a single color or depth camera. They capture space-time coherent deforming geometry, motion, high-frequency reflectance and illumination at unprecedented detail, and will be the first to handle difficult occlusions, topology changes and large groups of interacting objects. They automatically adapt to new scene types, yet deliver models with meaningful, interpretable parameters. This requires far reaching contributions: First, we develop groundbreaking new plasticity-enhanced model-based 4D reconstruction methods that automatically adapt to new scenes. Second, we develop radically new machine learning-based dense 4D reconstruction methods. Third, these model- and learning-based methods are combined in two revolutionary new classes of 4DRecon methods: 1) advanced fusion-based methods and 2) methods with deep architectural integration. Both, 1) and 2), are automatically designed in the 4D Real World Reconstruction Loop, a revolutionary new design paradigm in which 4DRecon methods refine and adapt themselves while continuously processing unlabeled real world input. This overcomes the previously unbreakable scalability barrier to real world scene diversity, complexity and generality. This paradigm shift opens up a new research direction in graphics and vision and has far reaching relevance across many scientific fields. It enables new applications of profound social pervasion and significant economic impact, e.g., for visual media and virtual/augmented reality, and for future autonomous and robotic systems.
Summary
4D reconstruction, the camera-based dense dynamic scene reconstruction, is a grand challenge in computer graphics and computer vision. Despite great progress, 4D capturing the complex, diverse real world outside a studio is still far from feasible. 4DRepLy builds a new generation of high-fidelity 4D reconstruction (4DRecon) methods. They will be the first to efficiently capture all types of deformable objects (humans and other types) in crowded real world scenes with a single color or depth camera. They capture space-time coherent deforming geometry, motion, high-frequency reflectance and illumination at unprecedented detail, and will be the first to handle difficult occlusions, topology changes and large groups of interacting objects. They automatically adapt to new scene types, yet deliver models with meaningful, interpretable parameters. This requires far reaching contributions: First, we develop groundbreaking new plasticity-enhanced model-based 4D reconstruction methods that automatically adapt to new scenes. Second, we develop radically new machine learning-based dense 4D reconstruction methods. Third, these model- and learning-based methods are combined in two revolutionary new classes of 4DRecon methods: 1) advanced fusion-based methods and 2) methods with deep architectural integration. Both, 1) and 2), are automatically designed in the 4D Real World Reconstruction Loop, a revolutionary new design paradigm in which 4DRecon methods refine and adapt themselves while continuously processing unlabeled real world input. This overcomes the previously unbreakable scalability barrier to real world scene diversity, complexity and generality. This paradigm shift opens up a new research direction in graphics and vision and has far reaching relevance across many scientific fields. It enables new applications of profound social pervasion and significant economic impact, e.g., for visual media and virtual/augmented reality, and for future autonomous and robotic systems.
Max ERC Funding
1 977 000 €
Duration
Start date: 2018-09-01, End date: 2023-08-31
Project acronym ACCORD
Project Algorithms for Complex Collective Decisions on Structured Domains
Researcher (PI) Edith Elkind
Host Institution (HI) THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Call Details Starting Grant (StG), PE6, ERC-2014-STG
Summary Algorithms for Complex Collective Decisions on Structured Domains.
The aim of this proposal is to substantially advance the field of Computational Social Choice, by developing new tools and methodologies that can be used for making complex group decisions in rich and structured environments. We consider settings where each member of a decision-making body has preferences over a finite set of alternatives, and the goal is to synthesise a collective preference over these alternatives, which may take the form of a partial order over the set of alternatives with a predefined structure: examples include selecting a fixed-size set of alternatives, a ranking of the alternatives, a winner and up to two runner-ups, etc. We will formulate desiderata that apply to such preference aggregation procedures, design specific procedures that satisfy as many of these desiderata as possible, and develop efficient algorithms for computing them. As the latter step may be infeasible on general preference domains, we will focus on identifying the least restrictive domains that enable efficient computation, and use real-life preference data to verify whether the associated restrictions are likely to be satisfied in realistic preference aggregation scenarios. Also, we will determine whether our preference aggregation procedures are computationally resistant to malicious behavior. To lower the cognitive burden on the decision-makers, we will extend our procedures to accept partial rankings as inputs. Finally, to further contribute towards bridging the gap between theory and practice of collective decision making, we will provide open-source software implementations of our procedures, and reach out to the potential users to obtain feedback on their practical applicability.
Summary
Algorithms for Complex Collective Decisions on Structured Domains.
The aim of this proposal is to substantially advance the field of Computational Social Choice, by developing new tools and methodologies that can be used for making complex group decisions in rich and structured environments. We consider settings where each member of a decision-making body has preferences over a finite set of alternatives, and the goal is to synthesise a collective preference over these alternatives, which may take the form of a partial order over the set of alternatives with a predefined structure: examples include selecting a fixed-size set of alternatives, a ranking of the alternatives, a winner and up to two runner-ups, etc. We will formulate desiderata that apply to such preference aggregation procedures, design specific procedures that satisfy as many of these desiderata as possible, and develop efficient algorithms for computing them. As the latter step may be infeasible on general preference domains, we will focus on identifying the least restrictive domains that enable efficient computation, and use real-life preference data to verify whether the associated restrictions are likely to be satisfied in realistic preference aggregation scenarios. Also, we will determine whether our preference aggregation procedures are computationally resistant to malicious behavior. To lower the cognitive burden on the decision-makers, we will extend our procedures to accept partial rankings as inputs. Finally, to further contribute towards bridging the gap between theory and practice of collective decision making, we will provide open-source software implementations of our procedures, and reach out to the potential users to obtain feedback on their practical applicability.
Max ERC Funding
1 395 933 €
Duration
Start date: 2015-07-01, End date: 2020-06-30
Project acronym ACDC
Project Algorithms and Complexity of Highly Decentralized Computations
Researcher (PI) Fabian Daniel Kuhn
Host Institution (HI) ALBERT-LUDWIGS-UNIVERSITAET FREIBURG
Call Details Starting Grant (StG), PE6, ERC-2013-StG
Summary "Many of today's and tomorrow's computer systems are built on top of large-scale networks such as, e.g., the Internet, the world wide web, wireless ad hoc and sensor networks, or peer-to-peer networks. Driven by technological advances, new kinds of networks and applications have become possible and we can safely assume that this trend is going to continue. Often modern systems are envisioned to consist of a potentially large number of individual components that are organized in a completely decentralized way. There is no central authority that controls the topology of the network, how nodes join or leave the system, or in which way nodes communicate with each other. Also, many future distributed applications will be built using wireless devices that communicate via radio.
The general objective of the proposed project is to improve our understanding of the algorithmic and theoretical foundations of decentralized distributed systems. From an algorithmic point of view, decentralized networks and computations pose a number of fascinating and unique challenges that are not present in sequential or more standard distributed systems. As communication is limited and mostly between nearby nodes, each node of a large network can only maintain a very restricted view of the global state of the system. This is particularly true if the network can change dynamically, either by nodes joining or leaving the system or if the topology changes over time, e.g., because of the mobility of the devices in case of a wireless network. Nevertheless, the nodes of a network need to coordinate in order to achieve some global goal.
In particular, we plan to study algorithms and lower bounds for basic computation and information dissemination tasks in such systems. In addition, we are particularly interested in the complexity of distributed computations in dynamic and wireless networks."
Summary
"Many of today's and tomorrow's computer systems are built on top of large-scale networks such as, e.g., the Internet, the world wide web, wireless ad hoc and sensor networks, or peer-to-peer networks. Driven by technological advances, new kinds of networks and applications have become possible and we can safely assume that this trend is going to continue. Often modern systems are envisioned to consist of a potentially large number of individual components that are organized in a completely decentralized way. There is no central authority that controls the topology of the network, how nodes join or leave the system, or in which way nodes communicate with each other. Also, many future distributed applications will be built using wireless devices that communicate via radio.
The general objective of the proposed project is to improve our understanding of the algorithmic and theoretical foundations of decentralized distributed systems. From an algorithmic point of view, decentralized networks and computations pose a number of fascinating and unique challenges that are not present in sequential or more standard distributed systems. As communication is limited and mostly between nearby nodes, each node of a large network can only maintain a very restricted view of the global state of the system. This is particularly true if the network can change dynamically, either by nodes joining or leaving the system or if the topology changes over time, e.g., because of the mobility of the devices in case of a wireless network. Nevertheless, the nodes of a network need to coordinate in order to achieve some global goal.
In particular, we plan to study algorithms and lower bounds for basic computation and information dissemination tasks in such systems. In addition, we are particularly interested in the complexity of distributed computations in dynamic and wireless networks."
Max ERC Funding
1 148 000 €
Duration
Start date: 2013-11-01, End date: 2018-10-31
Project acronym ACQDIV
Project Acquisition processes in maximally diverse languages: Min(d)ing the ambient language
Researcher (PI) Sabine Erika Stoll
Host Institution (HI) UNIVERSITAT ZURICH
Call Details Consolidator Grant (CoG), SH4, ERC-2013-CoG
Summary "Children learn any language that they grow up with, adapting to any of the ca. 7000 languages of the world, no matter how divergent or complex their structures are. What cognitive processes make this extreme flexibility possible? This is one of the most burning questions in cognitive science and the ACQDIV project aims at answering it by testing and refining the following leading hypothesis: Language acquisition is flexible and adaptive to any kind of language because it relies on a small set of universal cognitive processes that variably target different structures at different times during acquisition in every language. The project aims at establishing the precise set of processes and at determining the conditions of variation across maximally diverse languages. This project focuses on three processes: (i) distributional learning, (ii) generalization-based learning and (iii) interaction-based learning. To investigate these processes I will work with a sample of five clusters of languages including longitudinal data of two languages each. The clusters were determined by a clustering algorithm seeking the structurally most divergent languages in a typological database. The languages are: Cluster 1: Slavey and Cree, Cluster 2: Indonesian and Yucatec, Cluster 3: Inuktitut and Chintang, Cluster 4: Sesotho and Russian, Cluster 5: Japanese and Turkish. For all languages, corpora are available, except for Slavey where fieldwork is planned. The leading hypothesis will be tested against the acquisition of aspect and negation in each language of the sample and also against the two structures in each language that are most salient and challenging in them (e. g. complex morphology in Chintang). The acquisition processes also depend on statistical patterns in the input children receive. I will examine these patterns across the sample with respect to repetitiveness effects, applying data-mining methods and systematically comparing child-directed and child-surrounding speech."
Summary
"Children learn any language that they grow up with, adapting to any of the ca. 7000 languages of the world, no matter how divergent or complex their structures are. What cognitive processes make this extreme flexibility possible? This is one of the most burning questions in cognitive science and the ACQDIV project aims at answering it by testing and refining the following leading hypothesis: Language acquisition is flexible and adaptive to any kind of language because it relies on a small set of universal cognitive processes that variably target different structures at different times during acquisition in every language. The project aims at establishing the precise set of processes and at determining the conditions of variation across maximally diverse languages. This project focuses on three processes: (i) distributional learning, (ii) generalization-based learning and (iii) interaction-based learning. To investigate these processes I will work with a sample of five clusters of languages including longitudinal data of two languages each. The clusters were determined by a clustering algorithm seeking the structurally most divergent languages in a typological database. The languages are: Cluster 1: Slavey and Cree, Cluster 2: Indonesian and Yucatec, Cluster 3: Inuktitut and Chintang, Cluster 4: Sesotho and Russian, Cluster 5: Japanese and Turkish. For all languages, corpora are available, except for Slavey where fieldwork is planned. The leading hypothesis will be tested against the acquisition of aspect and negation in each language of the sample and also against the two structures in each language that are most salient and challenging in them (e. g. complex morphology in Chintang). The acquisition processes also depend on statistical patterns in the input children receive. I will examine these patterns across the sample with respect to repetitiveness effects, applying data-mining methods and systematically comparing child-directed and child-surrounding speech."
Max ERC Funding
1 998 438 €
Duration
Start date: 2014-09-01, End date: 2019-08-31
Project acronym ACROSS
Project 3D Reconstruction and Modeling across Different Levels of Abstraction
Researcher (PI) Leif Kobbelt
Host Institution (HI) RHEINISCH-WESTFAELISCHE TECHNISCHE HOCHSCHULE AACHEN
Call Details Advanced Grant (AdG), PE6, ERC-2013-ADG
Summary "Digital 3D models are gaining more and more importance in diverse application fields ranging from computer graphics, multimedia and simulation sciences to engineering, architecture, and medicine. Powerful technologies to digitize the 3D shape of real objects and scenes are becoming available even to consumers. However, the raw geometric data emerging from, e.g., 3D scanning or multi-view stereo often lacks a consistent structure and meta-information which are necessary for the effective deployment of such models in sophisticated down-stream applications like animation, simulation, or CAD/CAM that go beyond mere visualization. Our goal is to develop new fundamental algorithms which transform raw geometric input data into augmented 3D models that are equipped with structural meta information such as feature aligned meshes, patch segmentations, local and global geometric constraints, statistical shape variation data, or even procedural descriptions. Our methodological approach is inspired by the human perceptual system that integrates bottom-up (data-driven) and top-down (model-driven) mechanisms in its hierarchical processing. Similarly we combine algorithms operating on different levels of abstraction into reconstruction and modeling networks. Instead of developing an individual solution for each specific application scenario, we create an eco-system of algorithms for automatic processing and interactive design of highly complex 3D models. A key concept is the information flow across all levels of abstraction in a bottom-up as well as top-down fashion. We not only aim at optimizing geometric representations but in fact at bridging the gap between reconstruction and recognition of geometric objects. The results from this project will make it possible to bring 3D models of real world objects into many highly relevant applications in science, industry, and entertainment, greatly reducing the excessive manual effort that is still necessary today."
Summary
"Digital 3D models are gaining more and more importance in diverse application fields ranging from computer graphics, multimedia and simulation sciences to engineering, architecture, and medicine. Powerful technologies to digitize the 3D shape of real objects and scenes are becoming available even to consumers. However, the raw geometric data emerging from, e.g., 3D scanning or multi-view stereo often lacks a consistent structure and meta-information which are necessary for the effective deployment of such models in sophisticated down-stream applications like animation, simulation, or CAD/CAM that go beyond mere visualization. Our goal is to develop new fundamental algorithms which transform raw geometric input data into augmented 3D models that are equipped with structural meta information such as feature aligned meshes, patch segmentations, local and global geometric constraints, statistical shape variation data, or even procedural descriptions. Our methodological approach is inspired by the human perceptual system that integrates bottom-up (data-driven) and top-down (model-driven) mechanisms in its hierarchical processing. Similarly we combine algorithms operating on different levels of abstraction into reconstruction and modeling networks. Instead of developing an individual solution for each specific application scenario, we create an eco-system of algorithms for automatic processing and interactive design of highly complex 3D models. A key concept is the information flow across all levels of abstraction in a bottom-up as well as top-down fashion. We not only aim at optimizing geometric representations but in fact at bridging the gap between reconstruction and recognition of geometric objects. The results from this project will make it possible to bring 3D models of real world objects into many highly relevant applications in science, industry, and entertainment, greatly reducing the excessive manual effort that is still necessary today."
Max ERC Funding
2 482 000 €
Duration
Start date: 2014-03-01, End date: 2019-02-28
Project acronym ActionContraThreat
Project Action selection under threat: the complex control of human defense
Researcher (PI) Dominik BACH
Host Institution (HI) UNIVERSITAT ZURICH
Call Details Consolidator Grant (CoG), SH4, ERC-2018-COG
Summary Run away, sidestep, duck-and-cover, watch: when under threat, humans immediately choreograph a large repertoire of defensive actions. Understanding action-selection under threat is important for anybody wanting to explain why anxiety disorders imply some of these behaviours in harmless situations. Current concepts of human defensive behaviour are largely derived from rodent research and focus on a small number of broad, cross-species, action tendencies. This is likely to underestimate the complexity of the underlying action-selection mechanisms. This research programme will take decisive steps to understand these psychological mechanisms and elucidate their neural implementation.
To elicit threat-related action in the laboratory, I will use virtual reality computer games with full body motion, and track actions with motion-capture technology. Based on a cognitive-computational framework, I will systematically characterise the space of actions under threat, investigate the psychological mechanisms by which actions are selected in different scenarios, and describe them with computational algorithms that allow quantitative predictions. To independently verify their neural implementation, I will use wearable magnetoencephalography (MEG) in freely moving subjects.
This proposal fills a lacuna between defence system concepts based on rodent research, emotion psychology, and clinical accounts of anxiety disorders. By combining a stringent experimental approach with the formalism of cognitive-computational psychology, it furnishes a unique opportunity to understand the mechanisms of action-selection under threat, and how these are distinct from more general-purpose action-selection systems. Beyond its immediate scope, the proposal has a potential to lead to a better understanding of anxiety disorders, and to pave the way towards improved diagnostics and therapies.
Summary
Run away, sidestep, duck-and-cover, watch: when under threat, humans immediately choreograph a large repertoire of defensive actions. Understanding action-selection under threat is important for anybody wanting to explain why anxiety disorders imply some of these behaviours in harmless situations. Current concepts of human defensive behaviour are largely derived from rodent research and focus on a small number of broad, cross-species, action tendencies. This is likely to underestimate the complexity of the underlying action-selection mechanisms. This research programme will take decisive steps to understand these psychological mechanisms and elucidate their neural implementation.
To elicit threat-related action in the laboratory, I will use virtual reality computer games with full body motion, and track actions with motion-capture technology. Based on a cognitive-computational framework, I will systematically characterise the space of actions under threat, investigate the psychological mechanisms by which actions are selected in different scenarios, and describe them with computational algorithms that allow quantitative predictions. To independently verify their neural implementation, I will use wearable magnetoencephalography (MEG) in freely moving subjects.
This proposal fills a lacuna between defence system concepts based on rodent research, emotion psychology, and clinical accounts of anxiety disorders. By combining a stringent experimental approach with the formalism of cognitive-computational psychology, it furnishes a unique opportunity to understand the mechanisms of action-selection under threat, and how these are distinct from more general-purpose action-selection systems. Beyond its immediate scope, the proposal has a potential to lead to a better understanding of anxiety disorders, and to pave the way towards improved diagnostics and therapies.
Max ERC Funding
1 998 750 €
Duration
Start date: 2019-10-01, End date: 2024-09-30
Project acronym AGESPACE
Project SPATIAL NAVIGATION – A UNIQUE WINDOW INTO MECHANISMS OF COGNITIVE AGEING
Researcher (PI) Thomas Wolbers
Host Institution (HI) DEUTSCHES ZENTRUM FUR NEURODEGENERATIVE ERKRANKUNGEN EV
Call Details Starting Grant (StG), SH4, ERC-2013-StG
Summary "By 2040, the European population aged over 60 will rise to 290 million, with those estimated to have dementia to 15.9 million. These dramatic demographic changes will pose huge challenges to health care systems, hence a detailed understanding of age-related cognitive and neurobiological changes is essential for helping elderly populations maintain independence. However, while existing research into cognitive ageing has carefully characterised developmental trajectories of functions such as memory and processing speed, one key cognitive ability that is particularly relevant to everyday functioning has received very little attention: In surveys, elderly people often report substantial declines in navigational abilities such as problems with finding one’s way in a novel environment. Such deficits severely restrict the mobility of elderly people and affect physical activity and social participation, but the underlying behavioural and neuronal mechanisms are poorly understood.
In this proposal, I will take a new approach to cognitive ageing that will bridge the gap between animal neurobiology and human cognitive neuroscience. With support from the ERC, I will create a team that will characterise the mechanisms mediating age-related changes in navigational processing in humans. The project will focus on three structures that perform key computations for spatial navigation, form a closely interconnected triadic network, and are particularly sensitive to the ageing process. Crucially, the team will employ an interdisciplinary methodological approach that combines mathematical modelling, brain imaging and innovative data analysis techniques with novel virtual environment technology, which allows for rigorous testing of predictions derived from animal findings. Finally, the proposal also incorporates a translational project aimed at improving spatial mnemonic functioning with a behavioural intervention, which provides a direct test of functional relevance and societal impact."
Summary
"By 2040, the European population aged over 60 will rise to 290 million, with those estimated to have dementia to 15.9 million. These dramatic demographic changes will pose huge challenges to health care systems, hence a detailed understanding of age-related cognitive and neurobiological changes is essential for helping elderly populations maintain independence. However, while existing research into cognitive ageing has carefully characterised developmental trajectories of functions such as memory and processing speed, one key cognitive ability that is particularly relevant to everyday functioning has received very little attention: In surveys, elderly people often report substantial declines in navigational abilities such as problems with finding one’s way in a novel environment. Such deficits severely restrict the mobility of elderly people and affect physical activity and social participation, but the underlying behavioural and neuronal mechanisms are poorly understood.
In this proposal, I will take a new approach to cognitive ageing that will bridge the gap between animal neurobiology and human cognitive neuroscience. With support from the ERC, I will create a team that will characterise the mechanisms mediating age-related changes in navigational processing in humans. The project will focus on three structures that perform key computations for spatial navigation, form a closely interconnected triadic network, and are particularly sensitive to the ageing process. Crucially, the team will employ an interdisciplinary methodological approach that combines mathematical modelling, brain imaging and innovative data analysis techniques with novel virtual environment technology, which allows for rigorous testing of predictions derived from animal findings. Finally, the proposal also incorporates a translational project aimed at improving spatial mnemonic functioning with a behavioural intervention, which provides a direct test of functional relevance and societal impact."
Max ERC Funding
1 318 990 €
Duration
Start date: 2014-01-01, End date: 2018-12-31
Project acronym ALEXANDRIA
Project "Foundations for Temporal Retrieval, Exploration and Analytics in Web Archives"
Researcher (PI) Wolfgang Nejdl
Host Institution (HI) GOTTFRIED WILHELM LEIBNIZ UNIVERSITAET HANNOVER
Call Details Advanced Grant (AdG), PE6, ERC-2013-ADG
Summary "Significant parts of our cultural heritage are produced on the Web, yet only insufficient opportunities exist for accessing and exploring the past of the Web. The ALEXANDRIA project aims to develop models, tools and techniques necessary to archive and index relevant parts of the Web, and to retrieve and explore this information in a meaningful way. While the easy accessibility to the current Web is a good baseline, optimal access to Web archives requires new models and algorithms for retrieval, exploration, and analytics which go far beyond what is needed to access the current state of the Web. This includes taking into account the unique temporal dimension of Web archives, structured semantic information already available on the Web, as well as social media and network information.
Within ALEXANDRIA, we will significantly advance semantic and time-based indexing for Web archives using human-compiled knowledge available on the Web, to efficiently index, retrieve and explore information about entities and events from the past. In doing so, we will focus on the concurrent evolution of this knowledge and the Web content to be indexed, and take into account diversity and incompleteness of this knowledge. We will further investigate mixed crowd- and machine-based Web analytics to support long- running and collaborative retrieval and analysis processes on Web archives. Usage of implicit human feedback will be essential to provide better indexing through insights during the analysis process and to better focus harvesting of content.
The ALEXANDRIA Testbed will provide an important context for research, exploration and evaluation of the concepts, methods and algorithms developed in this project, and will provide both relevant collections and algorithms that enable further research on and practical application of our research results to existing archives like the Internet Archive, the Internet Memory Foundation and Web archives maintained by European national libraries."
Summary
"Significant parts of our cultural heritage are produced on the Web, yet only insufficient opportunities exist for accessing and exploring the past of the Web. The ALEXANDRIA project aims to develop models, tools and techniques necessary to archive and index relevant parts of the Web, and to retrieve and explore this information in a meaningful way. While the easy accessibility to the current Web is a good baseline, optimal access to Web archives requires new models and algorithms for retrieval, exploration, and analytics which go far beyond what is needed to access the current state of the Web. This includes taking into account the unique temporal dimension of Web archives, structured semantic information already available on the Web, as well as social media and network information.
Within ALEXANDRIA, we will significantly advance semantic and time-based indexing for Web archives using human-compiled knowledge available on the Web, to efficiently index, retrieve and explore information about entities and events from the past. In doing so, we will focus on the concurrent evolution of this knowledge and the Web content to be indexed, and take into account diversity and incompleteness of this knowledge. We will further investigate mixed crowd- and machine-based Web analytics to support long- running and collaborative retrieval and analysis processes on Web archives. Usage of implicit human feedback will be essential to provide better indexing through insights during the analysis process and to better focus harvesting of content.
The ALEXANDRIA Testbed will provide an important context for research, exploration and evaluation of the concepts, methods and algorithms developed in this project, and will provide both relevant collections and algorithms that enable further research on and practical application of our research results to existing archives like the Internet Archive, the Internet Memory Foundation and Web archives maintained by European national libraries."
Max ERC Funding
2 493 600 €
Duration
Start date: 2014-03-01, End date: 2019-02-28