Computer vision is an inter-disciplinary topic crossing boundaries between computer science, statistics, mathematics, engineering and cognitive science.

Research in computer vision involves the development and evaluation of computational methods for image analysis. This includes the design of new theoretical models and algorithms, and practical implementation of these algorithms using a variety of computer architectures and programming languages. The methods under consideration are often motivated by generative mathematical models of the world and the imaging process. Recent approaches also rely heavily on machine learning techniques and discriminative models such as deep neural networks.

Problems that will be considered in the program include image restoration, image segmentation, object recognition and 3D reconstruction. Current approaches to address these problems draw on a variety of mathematical and computational topics such as stochastic models, statistical methods,... (more)

Optimization appears in many computer vision and image processing problems such as image restoration (denoising, inpainting, compressed sensing), multi-view reconstruction, shape from X, object detection, image segmentation, optical flow, matching, and network training. While there are formulations allowing for global optimal optimization, e.g. using convex objectives or exact combinatorial algorithms, many problems in computer vision and image processing require efficient approximation methods.

Optimization methods that are widely used range from graph-based techniques and convex relaxations to greedy approaches (e.g. gradient descent). Each method has different efficiency and optimality guarantees. The goal of this workshop is a broad discussion of mathematical models (objectives and constraints) and robust efficient optimization methods (exact or approximate, discrete or continuous) addressing existing issues and advancing the state of the art.

Advanced Normalization Tools (ANTs, originating at sourceforge.net on 2008-06-26 and now residing at https://github.com/ANTsX/ANTs) is a computational framework for quantitative biological image analysis. ANTs was first created by Brian Avants, Nicholas Tustison, and Gang Song (now at Google) as a way to rapidly disseminate the latest methodological research to the community of scientists who depend on imaging analytics and the flexibility to study different organ systems, species or modalities all within the same computational framework. While originally focused on diffeomorphic image registration, ANTs grew to incorporate methods for segmentation, feature extraction and, more recently, evolved into a multi-package ecosystem featuring full statistical pipelines via ANTsR ( https://github.com/ANTsX/ANTsR ), such as multiple modality inference of structural/functional relationships with neuroimaging, and deep learning functionality with ANTsRNet ( https://github.com/ANTsX/ANTsRNet ).... (more)

Data science in low-dimensional spaces is motivated by applications in mapping, navigation, geographic resource allocation, modeling of body shapes and chemical structures, and more. In addition to datasets that naturally reside in low-dimension spaces, dimension-reduction methods can often transform high dimensional data to lower-dimensional data while preserving properties of interest. Since many computational problems are intractable for high-dimensional data but potentially tractable for low-dimensional data, it is useful to establish the algorithmic foundations of data science on low-dimensional data, to understand the special properties of such data, and to identify computational methods that are highly effective when applied to such data.

This workshop will bring together researchers in academia and industry to explore algorithmic and data analysis technique specialized for low-dimensional data, and application areas in which such problems arise. The focus of this workshop is... (more)

In this workshop, we will explore a number of themes in the arithmetic of abelian varieties of low dimension (typically dimension 2–4), with a focus on computational aspects. Topics will include the study of torsion points, Galois representations, endomorphism rings, Sato-Tate distributions, Mumford-Tate groups, complex and p-adic analytic aspects, L-functions, rational points, and so on. We also seek to classify and tabulate these objects, in particular to understand explicitly the underlying moduli spaces (with specified polarization, endomorphism, and torsion structure), and to find examples of abelian varieties exhibiting special behavior. Finally, we will pursue connections with related areas, including the theory of modular forms, related algebraic varieties (e.g., K3 surfaces), and special values of L-functions.

Our goal is for the workshop to bring together researchers working on abelian varieties in a number of facets to establish collaborations, develop algorithms, and... (more)

The area of encrypted search focuses on the design and cryptanalysis of practical algorithms and systems that can search on end-to-end encrypted data. With encrypted search algorithms, data can remain encrypted even in use. As such, encrypted search algorithms have a wide array of applications including in data management, healthcare, cloud computing, mobile security, blockchains, and censorship- and surveillance-resistant systems.

Imagine spending eight-weeks on the beautiful Brown University campus in historic Providence, RI, working in a small team setting to solve mathematical research problems developed by faculty experts in their fields.

Imagine creating career-building connections between peers, near peers (graduate students and postdocs), and academic professionals.

Imagine spending your summer in a fun, memorable, and intellectually stimulating environment.

Now, imagine having this experience with support for travel within the U.S., room and board paid, plus a $3,570 stipend*.

The 2019 Summer@ICERM program at Brown University is an eight-week residential program designed for a select group of 18-22 undergraduate scholars.

The faculty advisers will present a variety of interdisciplinary research... (more)

This workshop, a formal collaboration between ICERM and the American Institute of Mathematics (AIM), is one in a series of annual REUF workshops. These workshops bring together leading research mathematicians and faculty based at primarily undergraduate institutions to investigate open questions in the mathematical sciences and to equip participants with tools to engage in research with undergraduate students. REUF also serves to jump-start faculty who want to re-engage in research or who are considering a change in their research area.

The goals of this workshop are to promote undergraduate research and to forge research collaborations among the participating faculty. The majority of the workshop will be spent working on problems in small research groups, reporting on progress, and formulating plans for future work. Note that there are opportunities for participants to continue research activities beyond the workshop week, which will be discussed during the workshop.

Preference will... (more)

Designing, planning, and operating many systems is challenging due to the possibility of high-impact rare events. A motivating application is the electricity power grid, whose operation can be significantly disrupted by rare weather events such as a severe storm or a polar vortex. This workshop will explore optimization and simulation approaches to designing, planning, and operating systems impacted by such events. Stochastic optimization is one approach for optimizing such systems, in which the uncertain outcomes are modeled with random variables. Rare and high-impact events provide a challenge for stochastic optimization because (1) it is difficult to estimate the likelihood of rare events, (2) estimates of expected values with outcomes that have very low probability but high cost are inherently unstable, and (3) the actual distribution of the random events is often not known. Alternatively, robust and distributionally robust optimization models attempt to identify a solution that is... (more)

Dehn surgery has played a central role in the development of low-dimensional topology since it was first introduced by Max Dehn in 1910. Its study has stimulated several fascinating techniques that incorporate ideas from across mathematics: hyperbolic geometry, representation varieties, combinatorics, sutured manifold theory, and Floer homology, to name a few. These tools have led to sensational progress in understanding problems about Dehn surgery and low-dimensional topology at large. Furthermore, they seem well-suited to attack the major open problems in the area, such as the Berge conjecture and the L-space conjecture.

The workshop will function as a graduate summer school. At its core, the school will feature a sequence of mini-courses delivered by a cast of leading experts and distinguished expositors. The courses will unveil Dehn surgery and this suite of techniques to the next generation of researchers in the area. The school will additionally feature guided problem sessions... (more)

The Women in Symplectic and Contact Geometry and Topology workshop (WiSCon) is a Research Collaboration Conference for Women (RCCW) in the fields of contact and symplectic geometry/topology and related areas of low-dimensional topology. The goal of this workshop is to bring together women and nonbinary researchers at various career stages in these mathematical areas to collaborate in groups on projects designed and led by female leaders in the field. See below for information regarding project leaders and topics.

The mathematical fields of symplectic and contact geometry/topology, rooted in concepts from classical physics, have experienced huge growth in the past few decades. This growth has come in many forms, including multiple flavors of homology theories, symplectic embedding problems, techniques for regularizing spaces of pseudoholomorphic curves, and examples of mirror symmetry, to name a few. This workshop aims to generate research collaborations which build on the growing... (more)