Dual adjacency matrix : exploring link groups in dense networks

Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high-quality overlapping node communities. There is a conceptual gap between node groups and link groups that poses an interesting visualization challenge. We introduce the Dual Adjacency Matrix to bridge this gap. This matrix combines node and link group techniques via a generalization that also enables it to be coordinated with a node-link-contour diagram. These methods have been implemented in a prototype that we evaluated with an information scientist and neuroscientist via interviews and prototype walk-throughs. We demonstrate this prototype with the analysis of a trade network and an fMRI correlation network

The research for shape-based visual recognition of object categories

摘要 视觉目标类识别旨在识别图像中特定的某类目标，基于形状的目标类识别是目前计算机视觉研究的热点之一。真实图像中物体姿态的多样性以及环境的复杂性，给目标的形状提取和识别带来巨大挑战。本文借鉴生物视觉机制的研究成果，对基于形状的目标类识别算法进行研究。主要研究内容如下： 1. 研究与形状认知相关的视觉机制，分析形状知觉整体性的生理基础及其生理模型。以形状知觉整体性为基础，建立基于形状的目标类识别系统框架。框架既重视整体性在自下而上的特征加工中的作用，也重视整体约束在自上而下的识别中的作用。 2. 受生物视觉上的整合野模型启发，本文提出了一个三阶段轮廓检测算法。阶段1利用结构自适应滤波器平滑...Categorical object detection addresses determining the number of instances of a particular object category in an image, and localizing those instances in space and scale. The shape-based visual recognition of object categories is one of hot topics in computer vision. The diversity of poses of targets and complexity of the environment in real images bring huge challenges to shape extraction and obj...学位：工学博士院系专业：信息科学与技术学院自动化系_控制理论与控制工程学号：2322006015337

Medialness and the Perception of Visual Art

In this article we explore the practical use of medialness informed by perception studies as a representation and processing layer for describing a class of works of visual art. Our focus is towards the description of 2D objects in visual art, such as found in drawings, paintings, calligraphy, graffiti writing, where approximate boundaries or lines delimit regions associated to recognizable objects or their constitutive parts. We motivate this exploration on the one hand by considering how ideas emerging from the visual arts, cartoon animation and general drawing practice point towards the likely importance of medialness in guiding the interaction of the traditionally trained artist with the artifact. On the other hand, we also consider recent studies and results in cognitive science which point in similar directions in emphasizing the likely importance of medialness, an extension of the abstract mathematical representation known as ‘medial axis’ or ‘Voronoi graphs’, as a core feature used by humans in perceiving shapes in static or dynamic scenarios.We illustrate the use of medialness in computations performed with finished artworks as well as artworks in the process of being created, modified, or evolved through iterations. Such computations may be used to guide an artificial arm in duplicating the human creative performance or used to study in greater depth the finished artworks. Our implementations represent a prototyping of such applications of computing to art analysis and creation and remain exploratory. Our method also provides a possible framework to compare similar artworks or to study iterations in the process of producing a final preferred depiction, as selected by the artist

Courbure discrète : théorie et applications

International audienceThe present volume contains the proceedings of the 2013 Meeting on discrete curvature, held at CIRM, Luminy, France. The aim of this meeting was to bring together researchers from various backgrounds, ranging from mathematics to computer science, with a focus on both theory and applications. With 27 invited talks and 8 posters, the conference attracted 70 researchers from all over the world. The challenge of finding a common ground on the topic of discrete curvature was met with success, and these proceedings are a testimony of this wor

Exploring Periodic Orbit Expansions and Renormalisation with the Quantum Triangular Billiard

A study of the quantum triangular billiard requires consideration of a boundary value problem for the Green's function of the Laplacian on a trianglar domain. Our main result is a reformulation of this problem in terms of coupled non--singular integral equations. A non--singular formulation, via Fredholm's theory, guarantees uniqueness and provides a mathematically firm foundation for both numerical and analytic studies. We compare and contrast our reformulation, based on the exact solution for the wedge, with the standard singular integral equations using numerical discretisation techniques. We consider in detail the (integrable) equilateral triangle and the Pythagorean 3-4-5 triangle. Our non--singular formulation produces results which are well behaved mathematically. In contrast, while resolving the eigenvalues very well, the standard approach displays various behaviours demonstrating the need for some sort of ``renormalisation''. The non-singular formulation provides a mathematically firm basis for the generation and analysis of periodic orbit expansions. We discuss their convergence paying particular emphasis to the computational effort required in comparision with Einstein--Brillouin--Keller quantisation and the standard discretisation, which is analogous to the method of Bogomolny. We also discuss the generalisation of our technique to smooth, chaotic billiards.Comment: 50 pages LaTeX2e. Uses graphicx, amsmath, amsfonts, psfrag and subfigure. 17 figures. To appear Annals of Physics, southern sprin

Robust and flexible multi-scale medial axis computation

The principle of the multi-scale medial axis (MMA) is important in that any object is detected at a blurring scale proportional to the size of the object. Thus it provides a sound balance between noise removal and preserving detail. The robustness of the MMA has been reflected in many existing applications in object segmentation, recognition, description and registration. This thesis aims to improve the computational aspects of the MMA. The MMA is obtained by computing ridges in a “medialness” scale-space derived from an image. In computing the medialness scale-space, we propose an edge-free medialness algorithm, the Concordance-based Medial Axis Transform (CMAT). It not only depends on the symmetry of the positions of boundaries, but also is related to the symmetry of the intensity contrasts at boundaries. Therefore it excludes spurious MMA branches arising from isolated boundaries. In addition, the localisation accuracy for the position and width of an object, as well as the robustness under noisy conditions, is preserved in the CMAT. In computing ridges in the medialness space, we propose the sliding window algorithm for extracting locally optimal scale ridges. It is simple and efficient in that it can readily separate the scale dimension from the search space but avoids the difficult task of constructing surfaces of connected maxima. It can extract a complete set of MMA for interfering objects in scale-space, e.g. embedded or adjacent objects. These algorithms are evaluated using a quantitative study of their performance for 1-D signals and qualitative testing on 2-D images

Contours in Visualization

This thesis studies the visualization of set collections either via or defines as the relations among contours. In the first part, dynamic Euler diagrams are used to communicate and improve semimanually the result of clustering methods which allow clusters to overlap arbitrarily. The contours of the Euler diagram are rendered as implicit surfaces called blobs in computer graphics. The interaction metaphor is the moving of items into or out of these blobs. The utility of the method is demonstrated on data arising from the analysis of gene expressions. The method works well for small datasets of up to one hundred items and few clusters. In the second part, these limitations are mitigated employing a GPU-based rendering of Euler diagrams and mixing textures and colors to resolve overlapping regions better. The GPU-based approach subdivides the screen into triangles on which it performs a contour interpolation, i.e. a fragment shader determines for each pixel which zones of an Euler diagram it belongs to. The rendering speed is thus increased to allow multiple hundred items. The method is applied to an example comparing different document clustering results. The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect the attributes. Adapting popular graph drawing approaches to the problem of contour tree drawing it is found that they are unable to convey this information. Five aesthetic criteria for drawing contour trees are proposed and a novel algorithm for drawing contour trees in the plane that satisfies four of these criteria is presented. The implementation is fast and effective for contour tree sizes usually used in interactive systems and also produces readable pictures for larger trees. Dynamical models that explain the formation of spatial structures of RNA molecules have reached a complexity that requires novel visualization methods to analyze these model\''s validity. The fourth part of the thesis focuses on the visualization of so-called folding landscapes of a growing RNA molecule. Folding landscapes describe the energy of a molecule as a function of its spatial configuration; they are huge and high dimensional. Their most salient features are described by their so-called barrier tree -- a contour tree for discrete observation spaces. The changing folding landscapes of a growing RNA chain are visualized as an animation of the corresponding barrier tree sequence. The animation is created as an adaption of the foresight layout with tolerance algorithm for dynamic graph layout. The adaptation requires changes to the concept of supergraph and it layout. The thesis finishes with some thoughts on how these approaches can be combined and how the task the application should support can help inform the choice of visualization modality

Perceptual segmentation and the perceived orientation of dot clusters: the role of robust statistics

We investigated perceptual segmentation in the context of a perceived-orientation task. Stimuli were dot clusters formed by the union of a large elliptical sub-cluster and a secondary circular sub-cluster. We manipulated the separation between the two sub-clusters, their common dot density, and the size of the secondary sub-cluster. As the separation between sub-clusters increased, the orientation perceived by observers shifted gradually from the global principal axis of the entire cluster to that of the main sub-cluster alone. Thus, with increasing separation, the dots within the secondary sub-cluster were assigned systematically lower weights in the principal-axis computation. In addition, this shift occurred at smaller separations for higher dot densitiesVconsistent with the idea that reliable segmentation is possible with smaller separations when the dot density is high. We propose that the visual system employs a robust statistical estimator in this task and that data points are weighted differentially based on the likelihood that they arose from a separate generative process. However, unlike in standard robust estimation, weights based on residuals are insufficient to characterize human segmentation. Rather, these must be computed based on more comprehensive generative models of dot clusters