In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy assumption, also gradient constancy, as well as the constancy of the Hessian and the Laplacian are proposed. Since the model strictly refrains from a linearisation of these assumptions, it is also capable to deal with large displacements. For the minimisation of the rather complex energy functional, we present an efficient numerical scheme employing two nested fixed point iterations. Following a coarse-to-fine strategy it turns out that there is a theoretical foundation of so-called warping techniques hitherto justified only on an experimental basis. Since our algorithm consists of the integration of various concepts, ranging from different constancy assumptions to numerical implementation issues, a detailed account of the effect of each of these concepts is included in the experimental section. The superior performance of the proposed method shows up by significantly smaller estimation errors when compared to previous techniques. Further experiments also confirm excellent robustness under noise and insensitivity to parameter variations.

Highly accurate optic flow computation with theoretically justified warping

PART I: FUNDAMENTALS. 1 INTRODUCTION. 1.1 The World of Signals. 1.2 Digital Image Processing. 1.3 Elements of an Image Processing System. Appendix 1.A Selected List of Books on Image Processing and Computer Vision from Year 2000. References. 2 MATHEMATICAL PRELIMINARIES. 2.1 Laplace Transform. 2.2 Fourier Transform. 2.3 Z-Transform. 2.4 Cosine Transform. 2.5 Wavelet Transform. 3 IMAGE ENHANCEMENT. 3.1 Grayscale Transformation. 3.2 Piecewise Linear Transformation. 3.3 Bit Plane Slicing. 3.4 Histogram Equalization. 3.5 Histogram Specification. 3.6 Enhancement by Arithmetic Operations. 3.7 Smoothing Filter. 3.8 Sharpening Filter. 3.9 Image Blur Types and Quality Measures. 4 MATHEMATICAL MORPHOLOGY. 4.1 Binary Morphology. 4.2 Opening and Closing. 4.3 Hit-or-Miss Transform. 4.4 Grayscale Morphology. 4.5 Basic Morphological Algorithms. 4.6 Morphological Filters. 5 IMAGE SEGMENTATION. 5.1 Thresholding. 5.2 Object (Component) Labeling. 5.3 Locating Object Contours by the Snake Model. 5.4 Edge Operators. 5.5 Edge Linking by Adaptive Mathematical Morphology. 5.6 Automatic Seeded Region Growing. 5.7 A Top-Down Region Dividing Approach. 6 DISTANCE TRANSFORMATION AND SHORTEST PATH PLANNING. 6.1 General Concept. 6.2 Distance Transformation by Mathematical Morphology. 6.3 Approximation of Euclidean Distance. 6.4 Decomposition of Distance Structuring Element. 6.5 The 3D Euclidean Distance. 6.6 The Acquiring Approaches. 6.7 The Deriving Approaches. 6.8 The Shortest Path Planning. 6.9 Forward and Backward Chain Codes for Motion Planning. 6.10 A Few Examples. 7 IMAGE REPRESENTATION AND DESCRIPTION. 7.1 Run-Length Coding. 7.2 Binary Tree and Quadtree. 7.3 Contour Representation. 7.4 Skeletonization by Thinning. 7.5 Medial Axis Transformation. 7.6 Object Representation and Tolerance. 8 FEATURE EXTRACTION. 8.1 Fourier Descriptor and Moment Invariants. 8.2 Shape Number and Hierarchical Features. 8.3 Corner Detection. 8.4 Hough Transform. 8.5 Principal Component Analysis. 8.6 Linear Discriminate Analysis. 8.7 Feature Reduction in Input and Feature Spaces. 9 PATTERN RECOGNITION. 9.1 The Unsupervised Clustering Algorithm. 9.2 Bayes Classifier. 9.3 Support Vector Machine. 9.4 Neural Networks. 9.5 The Adaptive Resonance Theory Network. 9.6 Fuzzy Sets in Image Analysis. PART II: APPLICATIONS. 10 FACE IMAGE PROCESSING AND ANALYSIS. 10.1 Face and Facial Feature Extraction. 10.2 Extraction of Head and Face Boundaries and Facial Features. 10.3 Recognizing Facial Action Units. 10.4 Facial Expression Recognition in JAFFE Database. 11 DOCUMENT IMAGE PROCESSING AND CLASSIFICATION. 11.1 Block Segmentation and Classification. 11.2 Rule-Based Character Recognition System. 11.3 Logo Identification. 11.4 Fuzzy Typographical Analysis for Character Preclassification. 11.5 Fuzzy Model for Character Classification. 12 IMAGE WATERMARKING. 12.1 Watermarking Classification. 12.2 Spatial Domain Watermarking. 12.3 Frequency-Domain Watermarking. 12.4 Fragile Watermark. 12.5 Robust Watermark. 12.6 Combinational Domain Digital Watermarking. 13 IMAGE STEGANOGRAPHY. 13.1 Types of Steganography. 13.2 Applications of Steganography. 13.3 Embedding Security and Imperceptibility. 13.4 Examples of Steganography Software. 13.5 Genetic Algorithm-Based Steganography. 14 SOLAR IMAGE PROCESSING AND ANALYSIS. 14.1 Automatic Extraction of Filaments. 14.2 Solar Flare Detection. 14.3 Solar Corona Mass Ejection Detection. INDEX.

Image Processing and Pattern Recognition: Fundamentals and Techniques

Experiments in colour texture analysis

Postgraduate Students: Vladimír Arnot, Daniel Čapek, Rudolf Čejka, Dao Minh, Tomá Dulík, Martin Hrubý, Radek Kočí, Petr Kotásek, Marek Křejpský, Bohuslav Křena, Vladislav Kubíček, Vladimír Marek, Petr Matouek, Ale Mičín, Jiří Očenáek, Tomá Ondráček, Petr Peňás, Jaroslav Ráb, Richard Růička, Luká Sekanina, Ivan Schwarz, Azedien Sllame, Petr Smolík, Jiří Staroba, Josef Strnadel, Luká Szemla, Pavel Tinovský, Michal Tomů, Milan Urbáek, Michal Vojkůvka, Petr Vurm, Frantiek Zbořil

Department of Computer Science and Engineering

After a formal definition of segmentation as the largest partition of the space according to a criterion ? and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria.

The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study.

The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups.

The last section is based on one example, and goes back over the controversy about "lattice" versus "functional" optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.

A Lattice Approach to Image Segmentation

From the Publisher:
A comprehensive introduction to the algorithms and techniques associated with machine vision systems. Contains details relating to the design of a Java-based visual programming environment for machine vision, a wide range of illustrative examples, with a practical treatment of the subject matter.

Machine Vision Algorithms in Java: Techniques and Implementation

https://www.springer.com/productFlyer_978-1-85233-218-1.pdf?SGWID=0-0-1297-2093816-0

Machine Vision Algorithms in Java

This paper proposes a dynamic-shape-prior guided snake (DSP G-snake) model that is designed to improve the overall stability of the point-based snake model. The dynamic shape prior is first proposed for snakes, that efficiently unifies different types of high-level priors into a new force term. To be specific, a global-topology regularity is first introduced that settles the inherent self-intersection problem with snakes. The problem that a snake’s snaxels tend to unevenly distribute along the contour is also handled, leading to good parameterization. Unlike existing methods that employ learning templates or commonly enforce hard priors, the dynamic-template scheme strongly respects the deformation flexibility of the model, while retaining a decent global topology for the snake. It is verified by experiments that the proposed algorithm can effectively prevent snakes from self-crossing, or automatically untie an already self-intersected contour. In addition, the proposed model is combined with existing forces and applied to the very challenging task of tracking dense biological cell populations. The DSP G-snake model has enabled an improvement of up to 30% in tracking accuracy with respect to regular model-based approaches. Through experiments on real cellular datasets, with highly dense populations and relatively large displacements, it is confirmed that the proposed approach has enabled superior performance, in comparison to modern active-contour competitors as well as the state-of-the-art cell tracking frameworks.

/pdf/a-dynamic-shape-prior-guided-snake-model-with-application-in-1qcibr3qoo.pdf

Derek Molloy

Papers

Machine Vision Algorithms in Java: Techniques and Implementation

Machine Vision Algorithms in Java

A Dynamic-Shape-Prior Guided Snake Model With Application in Visually Tracking Dense Cell Populations

Raspberry Pi Hardware

Interfacing to the Raspberry Pi Buses