The Web KnowARR Framework: Orchestrating Computational Intelligence with Graph Databases

This chapter presents fuzzy cognitive maps (FCM) as a vehicle for Web knowledge aggregation, representation, and reasoning. The corresponding Web KnowARR framework incorporates findings from fuzzy logic. To this end, a first emphasis is particularly on the Web KnowARR framework along with a stakeholder management use case to illustrate the framework’s usefulness as a second focal point. This management form is to help projects to acceptance and assertiveness where claims for company decisions are actively involved in the management process. Stakeholder maps visually (re-) present these claims. On one hand, they resort to non-public content and on the other they resort to content that is available to the public (mostly on the Web). The Semantic Web offers opportunities not only to present public content descriptively but also to show relationships. The proposed framework can serve as the basis for the public content of stakeholder maps.

Geometry-Aware Multiscale Image Registration via OBBTree-Based Polyaffine Log-Demons

Non-linear image registration is an important tool in many areas of image analysis. For instance, in morphometric studies of a population of brains, free-form deformations between images are analyzed to describe the structural anatomical variability. Such a simple deformation model is justified by the absence of an easy expressible prior about the shape changes. Applying the same algorithms used in brain imaging to orthopedic images might not be optimal due to the difference in the underlying prior on the inter-subject deformations. In particular, using an un-informed deformation prior often leads to local minima far from the expected solution. To improve robustness and promote anatomically meaningful deformations, we propose a locally affine and geometry-aware registration algorithm that automatically adapts to the data. We build upon the log-domain demons algorithm and introduce a new type of OBBTree-based regularization in the registration with a natural multiscale structure. The regularization model is composed of a hierarchy of locally affine transformations via their logarithms. Experiments on mandibles show improved accuracy and robustness when used to initialize the demons, and even similar performance by direct comparison to the demons, with a significantly lower degree of freedom. This closes the gap between polyaffine and non-rigid registration and opens new ways to statistically analyze the registration results.

Optimized spectrally selective steady-state free precession sequences for cartilage imaging at ultra-high fields

OBJECT: Fat suppressed 3D steady-state free precession (SSFP) sequences are of special interest in cartilage imaging due to their short repetition time in combination with high signal-to-noise ratio. At low-to-high fields (1.5-3.0 T), spectral spatial (spsp) radio frequency (RF) pulses perform superiorly over conventional saturation of the fat signal (FATSAT pulses). However, ultra-high fields (7.0 T and more) may offer alternative fat suppression techniques as a result of the increased chemical shift. MATERIALS AND METHODS: Application of a single, frequency selective, RF pulse is compared to spsp excitation for water (or fat) selective imaging at 7.0 T. RESULTS: For SSFP, application of a single frequency selective RF pulse for selective water or fat excitation performs beneficially over the commonly applied spsp RF pulses. In addition to the overall improved fat suppression, the application of single RF pulses leads to decreased power depositions, still representing one of the major restrictions in the design and application of many pulse sequences at ultra-high fields. CONCLUSION: The ease of applicability and implementation of single frequency selective RF pulses at ultra-high-fields might be of great benefit for a vast number of applications where fat suppression is desirable or fat-water separation is needed for quantification purposes.

Applied Graph Theory in Computer Vision and Pattern Recognition

This book will serve as a foundation for a variety of useful applications of graph theory to computer vision, pattern recognition, and related areas. It covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks. The first part of the book presents the application of graph theory to low-level processing of digital images such as a new method for partitioning a given image into a hierarchy of homogeneous areas using graph pyramids, or a study of the relationship between graph theory and digital topology. Part II presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, including a survey of graph based methodologies for pattern recognition and computer vision, a presentation of a series of computationally efficient algorithms for testing graph isomorphism and related graph matching tasks in pattern recognition and a new graph distance measure to be used for solving graph matching problems. Finally, Part III provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks. It includes a critical review of the main graph-based and structural methods for fingerprint classification, a new method to visualize time series of graphs, and potential applications in computer network monitoring and abnormal event detection.