Automated brightfield layerwise evaluation in three-dimensional micropatterning via two-photon polymerization.

Two-photon polymerization (TPP) is an advanced 3D fabrication technique capable of creating features with submicron precision. A primary challenge in TPP lies in the facile and accurate characterization of fabrication quality, particularly for structures possessing complex internal features. In this study, we introduce an automated brightfield layerwise evaluation technique that enables a simple-to-implement approach for in situ monitoring and quality assessment of TPP-fabricated structures.

Fast Inference with Min-Sum Matrix Product.

The MAP inference problem in many graphical models can be solved efficiently using a fast algorithm for computing min-sum products of n × n matrices. The class of models in question includes cyclic and skip-chain models that arise in many applications. Although the worst-case complexity of the min-sum product operation is not known to be much better than O(n(3)), an O(n(2.

Dynamic programming and graph algorithms in computer vision.

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems.

Object detection with discriminatively trained part-based models.

We describe an object detection system based on mixtures of multiscale deformable part models. Our system is able to represent highly variable object classes and achieves state-of-the-art results in the PASCAL object detection challenges. While deformable part models have become quite popular, their value had not been demonstrated on difficult benchmarks such as the PASCAL data sets.

Representation and detection of deformable shapes.

We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite number of possible nonrigid transformations of the templates. This makes the problem of finding an optimal match of a deformable template to an image incredibly hard.