Bregman iteration has been around since 1967. It turns out to be unreasonably effective for optimization problems involving L1, BV and related penalty terms. This is partly because of a miraculous cancellation of error. We will discuss this and give biomedical imaging applications, related to compressive sensing and Total Variation based restoration.
The past few years have seen an incredible explosion of new (or revival of old) fast and effective algorithms for various imaging and information science applications. These include: nonlocal means, compressive sensing, graph cuts, Bregman iteration, as well as relatively old favorites such as the level set method and PDE based image restoration. I'll give my view of where we are, hopefully giving credit to all the people involved.
Henry & Lucy Moses Professor of Science Lai-Sang Young
Institution:
Courant Institute of Mathematical Sciences
Time:
Monday, May 11, 2009 - 2:00pm
Location:
NS2 1201
I will discuss the reliability of large networks of coupled oscillators in response to fluctuating inputs. The networks considered are quite generic. In this talk, I view them as idealized models from neuroscience and borrow some of the associated language. Reliability is the opposite of trial-to-trial variability; a system is reliable if a signal elicits identical responses upon repeated presentations. I will address the problem on two levels: neuronal reliability, which concerns the behavior of individual neurons (or oscillators) embedded in the network, and pooled-response reliability, which measures total outputs from subpopulations. The effects of network structure, cell heterogeneity and noise on reliability will be discussed. Our findings are based largely on dynamical systems ideas (with a slight statistical mechanics flavor) and are supported by simulations. This is joint work with Kevin Lin and Eric Shea-Brown.
Henry & Lucy Moses Professor of Science Lai-Sang Young
Institution:
Courant Institute of Mathematical Sciences
Time:
Wednesday, May 13, 2009 - 4:00pm
Location:
RH 306
I will discuss the phenomenon of shear-induced chaos in driven dynamical systems. The unforced system is assumed to be nonchaotic with certain simple structures (such as attracting periodic orbits). Specifics of the defining equations are unimportant. A geometric mechanism for producing chaos - equivalently promoting mixing - is proposed. This mechanism involves the amplification of the effects of the forcing by shearing in the unforced system. Rigorous results establishing the presence of strange attractors will be discussed. Statistical information is deduced by comparing these attractors to countable-state Markov chains. The phenomenon of shear-induced chaos manifests itself in many different guises. Examples presented will include periodically kicked oscillators, slow-fast systems, PDEs undergoing Hopf bifurcations and coupled oscillators.
Let k be a local field, and let K be a separable quadratic field extension of k. It is known that an irreducible complex representation π_1 of the unitary group G_1 = U_n(k) has a multiplicity free restriction to the subgroup G_2 = U{n−1}(k) fixing a non-isotropic line in the corresponding Hermitian space over K. More precisely, if π_2 is an irreducible representation of G_2 , then π = π_1 ⊗ π_2 is an irreducible representation of the product G = G_1 G_2 which we can restrict to the subgroup H = G_2 , diagonally embedded in G. The space of H-invariant linear forms on π has dimension ≤ 1.
In this talk, I will use the local Langlands correspondence and some number theoretic invariants of the Langlands parameter of π to predict when the dimension of H-invariant forms is equal to 1, i.e. when the dual of π_2 occurs in the restriction of π_1 . I will also illustrate this prediction with several examples, including the classical branching formula for representations of compact unitary groups. This is joint work with Wee Teck Gan and Dipendra Prasad.
Courant Institute of Mathematical Sciences New York University
Time:
Monday, January 26, 2009 - 2:00pm
Location:
RH 306
We say a region of space is "cloaked" with respect to electromagnetic measurements if its contents -- and even the existence of the cloak -- are inaccessible to such measurements. One recent proposal for such cloaking takes advantage of the coordinate-invariance of Maxwell's equations. As usually presented, this scheme uses a singular change of variables. That makes the mathematical analysis subtle, and the practical implementation difficult. This talk examines the correctness and robustness of the change-of-variable-based scheme, for scalar waves modelled by Helmholtz's equation, drawing on joint work with Onofrei, Shen, Vogelius, and Weinstein. The central idea is to use a less-singular change of variables. The quality of the resulting "approximate cloak" can be assessed by studying the detectability of a small inclusion in an otherwise uniform medium. We show that a small inclusion can be made nearly undetectable (regardless of its contents) by surrounding it with a suitable lossy layer.
Courant Institute of Mathematical Sciences New York University
Time:
Wednesday, January 28, 2009 - 4:00pm
Location:
RH 306
Energy-driven pattern formation is difficult to define, but easy to recognize. I'll discuss two examples: (a) cross-tie wall patterns in magnetic thin films. (b) surface-energy-driven coarsening of two-phase mixtures. The two problems are rather different -- the first is static, the second dynamic. But they share certain features: in each case nature forms complex patterns as it attempts to minimize a suitable "free energy". The task of modeling and analyzing such patterns is a rich source of challenges -- many still open -- in the multidimensional calculus of variations.