There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We applied this approach to segmenting static images, as well as motion sequences, and found the results to be very encouraging.

/pdf/normalized-cuts-and-image-segmentation-2ru3ikxuj5.pdf

Normalized cuts and image segmentation

/pdf/scalable-molecular-dynamics-with-namd-3j7xyc70g4.pdf

Scalable Molecular Dynamics with NAMD

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We have applied this approach to segmenting static images and found results very encouraging.

/pdf/normalized-cuts-and-image-segmentation-1q390dk21h.pdf

In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at all and what it really does. The goal of this tutorial is to give some intuition on those questions. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.

/pdf/a-tutorial-on-spectral-clustering-536pmg9onu.pdf

A tutorial on spectral clustering

We describe DDE-BIFTOOL, a Matlab package for numerical bifurcation analysis of systems of delay differential equations with several fixed, discrete delays. The package implements continuation of steady state solutions and periodic solutions and their stability analysis. It also computes and continues steady state fold and Hopf bifurcations and, from the latter, it can switch to the emanating branch of periodic solutions. We describe the numerical methods upon which the package is based and illustrate its usage and capabilities through analysing three examples: two models of coupled neurons with delayed feedback and a model of two oscillators coupled with delay.

http://www.staff.science.uu.nl/~kouzn101/engelborhgsTOMS.pdf

Numerical bifurcation analysis of delay differential equations using DDE-BIFTOOL

Virtual textile composites software Wisetex: integration with micromechanical, permeability and structural analysis

This paper describes a new method for the suppression of noise in images via the wavelet transform. The method relies on two measures. The first is a classic measure of smoothness of the image and is based on an approximation of the local Holder exponent via the wavelet coefficients. The second, novel measure takes into account geometrical constraints, which are generally valid for natural images. The smoothness measure and the constraints are combined in a Bayesian probabilistic formulation, and are implemented as a Markov random field (MRF) image model. The manipulation of the wavelet coefficients is consequently based on the obtained probabilities. A comparison of quantitative and qualitative results for test images demonstrates the improved noise suppression performance with respect to previous wavelet-based image denoising methods.

Wavelet-based image denoising using a Markov random field a priori model

From the Publisher:
The target audience of this book is students and researchers in computational sciences who need to develop computer codes for solving partial differential equations. The exposition is focused on numerics and software related to mathematical models in solid and fluid mechanics. The book teaches finite element methods and basic finite difference methods from a computational point of view. The main emphasis regards development of flexible computer programs, using the numerical library Diffpack. The application of Diffpack is explained in detail for problems including model equations in applied mathematics, heat transfer, elasticity, and viscous fluid flow. Diffpack is a modern software development environment based on C++ and object-oriented programming.

Dirk Roose

Papers

Numerical bifurcation analysis of delay differential equations using DDE-BIFTOOL

Virtual textile composites software Wisetex: integration with micromechanical, permeability and structural analysis

Wavelet-based image denoising using a Markov random field a priori model

Computational Partial Differential Equations: Numerical Methods and Diffpack Programming

Continuous pole placement for delay equations