We study an efficient dynamic blind source separation algorithm of convolutive sound mixtures based on updating statistical information in the frequency domain, and minimizing the support of time domain demixing filters by a weighted least square method. The permutation and scaling indeterminacies of separation, and concatenations of signals in adjacent time frames are resolved with optimization of l 1 l norm on cross-correlation coefficients at multiple time lags. The algorithm is a direct method without iterations, and is adaptive to the environment. Computations on recorded benchmark mixtures of speech and music signals show excellent performance. The method in general separates a foreground source from a background of sounds as often encountered in realistic situations.

No abstract uploaded!

Conical diffraction in honeycomb lattices is analyzed. This phenomenon arises in nonlinear Schrödinger equations with honeycomb lattice potentials. In the tight-binding approximation the wave envelope is governed by a nonlinear classical Dirac equation. Numerical simulations show that the Dirac equation and the lattice equation have the same conical diffraction properties. Similar conical diffraction occurs in both the linear and nonlinear regimes. The Dirac system reveals the underlying mechanism for the existence of conical diffraction in honeycomb lattices.

Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh M into a Delaunay mesh. We show that the constructed DM has O(Kn) vertices, where n is the number of vertices in M and K is a model-dependent constant. We also develop a novel algorithm to simplify Delaunay meshes, allowing a smooth choice of detail levels. Our methods are conceptually simple, theoretically sound and easy to implement. The DM construction algorithm also scales well due to its O(nK logK) time complexity. Delaunay meshes have many favorable geometric and numerical properties. For example, a DM has exactly the same geometry as the input mesh, and it can be encoded by any mesh data structure. Moreover, the empty geodesic circumcircle property implies that the commonly used cotangent Laplace-Beltrami operator has non-negative weights. Therefore, the existing digital geometry processing algorithms can benefit the numerical stability of DM without changing any codes. We observe that DMs can improve the accuracy of the heat method for computing geodesic distances. Also, popular parameterization techniques, such as discrete harmonic mapping, produce more stable results on the DMs than on the input meshes.

We define the counting of holomorphic cylinders in log Calabi-Yau surfaces. Although we start with a complex log Calabi-Yau surface, the counting is achieved by applying methods from non-archimedean geometry. This gives rise to new geometric invariants. Moreover, we prove that the counting satisfies a property of symmetry. Explicit calculations are given for a del Pezzo surface in detail, which verify the conjectured wall-crossing formula for the focus-focus singularity. Our holomorphic cylinders are expected to give a geometric understanding of the combinatorial notion of broken line by Gross, Hacking, Keel and Siebert. Our tools include Berkovich spaces, tropical geometry, Gromov-Witten theory and the GAGA theorem for non-archimedean analytic stacks.