Replica inference approach to unsupervised multiscale image segmentation

Measuring structural nonstationarity: The use of imaging information to quantify homogeneity and inhomogeneity

Heterogeneity is the concept we encounter in numerous research areas and everyday life. While "not mixing apples and oranges" is easy to grasp, a more quantitative approach to such segregation is not always readily available. Consider the problem from a different angle: To what extent does one have to make apples more orange and oranges more "apple-shaped" to put them into the same basket (according to their appearance alone)? This question highlights the central problem of the blurred interface between heterogeneous and homogeneous, which also depends on the metrics used for its identification. This work uncovers the physics of structural stationarity quantification, based on correlation functions (CFs) and clustering based on CFs different between image subregions. By applying the methodology to a wide variety of synthetic and real images of binary porous media, we confirmed computationally that only periodically unit-celled structures and images produced by stationary processes with resolutions close to infinity are strictly stationary. Natural structures without recurring unit cells are only weakly stationary. We established a physically meaningful definition for these stationarity types and their distinction from nonstationarity. In addition, the importance of information content of the chosen metrics is highlighted and discussed. We believe the methodology as proposed in this contribution will find its way into numerous research areas dealing with materials, structures, and measurements and modeling based on structural imaging information.

Learning-based defect recognition for quasi-periodic HRSTEM images

Controlling crystalline material defects is crucial, as they affect properties of the material that may be detrimental or beneficial for the final performance of a device. Defect analysis on the sub-nanometer scale is enabled by high-resolution scanning transmission electron microscopy (HRSTEM), where the identification of defects is currently carried out based on human expertise. However, the process is tedious, highly time consuming and, in some cases, yields ambiguous results. Here we propose a semi-supervised machine learning method that assists in the detection of lattice defects from atomic resolution HRSTEM images. It involves a convolutional neural network that classifies image patches as defective or non-defective, a graph-based heuristic that chooses one non-defective patch as a model, and finally an automatically generated convolutional filter bank, which highlights symmetry breaking such as stacking faults, twin defects and grain boundaries. Additionally, we suggest a variance filter to segment amorphous regions and beam defects. The algorithm is tested on III-V/Si crystalline materials and successfully evaluated against different metrics and a baseline approach, showing promising results even for extremely small training data sets and for noise compromised images. By combining the data-driven classification generality, robustness and speed of deep learning with the effectiveness of image filters in segmenting faulty symmetry arrangements, we provide a valuable open-source tool to the microscopist community that can streamline future HRSTEM analyses of crystalline materials.

Using complex networks towards information retrieval and diagnostics in multidimensional imaging

We present a fresh and broad yet simple approach towards information retrieval in general and diagnostics in particular by applying the theory of complex networks on multidimensional, dynamic images. We demonstrate a successful use of our method with the time series generated from high content thermal imaging videos of patients suffering from the aqueous deficient dry eye (ADDE) disease. Remarkably, network analyses of thermal imaging time series of contact lens users and patients upon whom Laser-Assisted in situ Keratomileusis (Lasik) surgery has been conducted, exhibit pronounced similarity with results obtained from ADDE patients. We also propose a general framework for the transformation of multidimensional images to networks for futuristic biometry. Our approach is general and scalable to other fluctuation-based devices where network parameters derived from fluctuations, act as effective discriminators and diagnostic markers.

Automatic segmentation of fluorescence lifetime microscopy images of cells using multiresolution community detection--a first study

Inspired by a multiresolution community detection based network segmentation method, we suggest an automatic method for segmenting fluorescence lifetime (FLT) imaging microscopy (FLIM) images of cells in a first pilot investigation on two selected images. The image processing problem is framed as identifying segments with respective average FLTs against the background in FLIM images. The proposed method segments a FLIM image for a given resolution of the network defined using image pixels as the nodes and similarity between the FLTs of the pixels as the edges. In the resulting segmentation, low network resolution leads to larger segments, and high network resolution leads to smaller segments. Furthermore, using the proposed method, the mean-square error in estimating the FLT segments in a FLIM image was found to consistently decrease with increasing resolution of the corresponding network. The multiresolution community detection method appeared to perform better than a popular spectral clustering-based method in performing FLIM image segmentation. At high resolution, the spectral segmentation method introduced noisy segments in its output, and it was unable to achieve a consistent decrease in mean-square error with increasing resolution.

Statistical mechanics of multiplex networks: entropy and overlap

There is growing interest in multiplex networks where individual nodes take part in several layers of networks simultaneously. This is the case, for example, in social networks where each individual node has different kinds of social ties or transportation systems where each location is connected to another location by different types of transport. Many of these multiplexes are characterized by a significant overlap of the links in different layers. In this paper we introduce a statistical mechanics framework to describe multiplex ensembles. A multiplex is a system formed by N nodes and M layers of interactions where each node belongs to the M layers at the same time. Each layer α is formed by a network G^{α}. Here we introduce the concept of correlated multiplex ensembles in which the existence of a link in one layer is correlated with the existence of a link in another layer. This implies that a typical multiplex of the ensemble can have a significant overlap of the links in the different layers. Moreover, we characterize microcanonical and canonical multiplex ensembles satisfying respectively hard and soft constraints and we discuss how to construct multiplexes in these ensembles. Finally, we provide the expression for the entropy of these ensembles that can be useful to address different inference problems involving multiplexes.

Stability-to-instability transition in the structure of large-scale networks

We examine phase transitions between the "easy," "hard," and "unsolvable" phases when attempting to identify structure in large complex networks ("community detection") in the presence of disorder induced by network "noise" (spurious links that obscure structure), heat bath temperature T, and system size N. The partition of a graph into q optimally disjoint subgraphs or "communities" inherently requires Potts-type variables. In earlier work [Philos. Mag. 92, 406 (2012)], when examining power law and other networks (and general associated Potts models), we illustrated that transitions in the computational complexity of the community detection problem typically correspond to spin-glass-type transitions (and transitions to chaotic dynamics in mechanical analogs) at both high and low temperatures and/or noise. The computationally "hard" phase exhibits spin-glass type behavior including memory effects. The region over which the hard phase extends in the noise and temperature phase diagram decreases as N increases while holding the average number of nodes per community fixed. This suggests that in the thermodynamic limit a direct sharp transition may occur between the easy and unsolvable phases. When present, transitions at low temperature or low noise correspond to entropy driven (or "order by disorder") annealing effects, wherein stability may initially increase as temperature or noise is increased before becoming unsolvable at sufficiently high temperature or noise. Additional transitions between contending viable solutions (such as those at different natural scales) are also possible. Identifying community structure via a dynamical approach where "chaotic-type" transitions were found earlier. The correspondence between the spin-glass-type complexity transitions and transitions into chaos in dynamical analogs might extend to other hard computational problems. In this work, we examine large networks (with a power law distribution in cluster size) that have a large number of communities (q≫1). We infer that large systems at a constant ratio of q to the number of nodes N asymptotically tend towards insolvability in the limit of large N for any positive T. The asymptotic behavior of temperatures below which structure identification might be possible, T_{×}=O[1/lnq], decreases slowly, so for practical system sizes, there remains an accessible, and generally easy, global solvable phase at low temperature. We further employ multivariate Tutte polynomials to show that increasing q emulates increasing T for a general Potts model, leading to a similar stability region at low T. Given the relation between Tutte and Jones polynomials, our results further suggest a link between the above complexity transitions and transitions associated with random knots.

Detection of hidden structures for arbitrary scales in complex physical systems

Recent decades have experienced the discovery of numerous complex materials. At the root of the complexity underlying many of these materials lies a large number of contending atomic- and largerscale configurations. In order to obtain a more detailed understanding of such systems, we need tools that enable the detection of pertinent structures on all spatial and temporal scales. Towards this end, we suggest a new method that applies to both static and dynamic systems which invokes ideas from network analysis and information theory. Our approach efficiently identifies basic unit cells, topological defects, and candidate natural structures. The method is particularly useful where a clear definition of order is lacking, and the identified features may constitute a natural point of departure for further analysis.