相关论文: Quantifying hierarchical mixture quality in polyme…

Identifying possible clusters in datasets and estimating their overall modularity are central tasks in pattern recognition. In the present work, concepts and methodologies are described for performing these tasks while considering only the…

Real-world vision based applications require fine-grained classification for various area of interest like e-commerce, mobile applications, warehouse management, etc. where reducing the severity of mistakes and improving the classification…

Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…

We study various manifestations of structural crossover in the properties of a binary mixture of hard-spheres. For homogeneous mixtures that are sufficiently asymmetric, there is a crossover line in the phase diagram such that for…

Remote sensing image scene classification remains a challenging task, primarily due to the complex spatial structures and multi-scale characteristics of ground objects. Although CNN-based methods excel at extracting local inductive biases,…

Unsupervised evaluation of segmentation quality is a crucial step in image segmentation applications. Previous unsupervised evaluation methods usually lacked the adaptability to multi-scale segmentation. A scale-constrained evaluation…

The statistical measure of spatial inhomogeneity for n points placed in chi cells each of size kxk is generalized to incorporate finite size objects like black pixels for binary patterns of size LxL. As a function of length scale k, the…

Biological systems often exhibit a heterogeneous arrangement of objects, such as assorted nuclear chromatin patterns in a tumor, assorted species of bacteria in biofilms, or assorted aggregates of subcellular particles. Principle Component…

Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges…

Most of the tailored materials are heterogeneous at the ingredient level. Analysis of those heterogeneous structures requires the knowledge of microstructure. With the knowledge of microstructure, multiscale analysis is carried out with…

Mixing a passive scalar field by stirring can be measured in a variety of ways including tracer particle dispersion, via the flux-gradient relationship, or by suppression of scalar concentration variations in the presence of inhomogeneous…

This paper presents a high discriminative texture analysis method based on the fusion of complex networks and randomized neural networks. In this approach, the input image is modeled as a complex networks and its topological properties as…

Much of our understanding of complex structures is based on simplification: for example, metal-organic frameworks are often discussed in the context of "nodes" and "linkers", allowing for a qualitative comparison with simpler inorganic…

We propose a kernel method to identify finite mixtures of nonparametric product distributions. It is based on a Hilbert space embedding of the joint distribution. The rank of the constructed tensor is equal to the number of mixture…

A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimension ($N_{_{D}}>3$). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering…

A general relation for the dependence of nearest neighbor degree correlations on degree is derived. Dependence of local clustering on degree is shown to be the sole determining factor of assortative versus disassortative mixing in networks.…

We propose a unified framework based on persistent homology (PH) to characterize both local and global structures in disordered systems. It can simultaneously generate local and global descriptors using the same algorithm and data…

We present a method to estimate the segregation parameter, $S,$ a key input in a continuum transport model of particulate flows. $S$ is determined by minimizing the difference between measured and model-predicted concentration profiles. To…

Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…

A first-principle multiscale modeling approach is presented, which is derived from the solution of the Ornstein-Zernike equation for the coarse-grained representation of polymer liquids. The approach is analytical, and for this reason is…