Related papers: Turning grain maps into diagrams

This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…

We propose a novel technique to refine the modelling of galaxy clusters mass distribution using gravitational lensing. The idea is to combine the strengths of both "parametric" and "non-parametric" methods to improve the quality of the fit.…

We quantify the performance of mass mapping techniques on mock imaging and gravitational lensing data of galaxy clusters. The optimum method depends upon the scientific goal. We assess measurements of clusters' radial density profiles,…

To accelerate the HMC with field transformation, we consider a variant of the trivializing map, the decimation map, which can be regarded as a coarse-graining transformation. Using the 2D $U(1)$ pure gauge model, combined with the guided…

Depth maps are widely used in feed-forward 3D Gaussian Splatting (3DGS) pipelines by unprojecting them into 3D point clouds for novel view synthesis. This approach offers advantages such as efficient training, the use of known camera poses,…

In healthcare, accurately classifying medical images is vital, but conventional methods often hinge on medical data with a consistent grid structure, which may restrict their overall performance. Recent medical research has been focused on…

Granular media surround us, comprising everything from the ground we walk on to the foods we eat. Owing to their ubiquity our ability to understand and predict the mechanical evolution of grains is not only of key scientific importance, but…

We introduce a general, efficient method to completely describe the topology of individual grains, bubbles, and cells in three-dimensional polycrystals, foams, and other multicellular microstructures. This approach is applied to a pair of…

A brief review of modeling and simulation methods for a study of polymers at interfaces is provided. When studying truly multiscale problems as provided by realistic polymer systems, coarse graining is practically unavoidable. In this…

Sintering, as a thermal process at elevated temperature below the melting point, is widely used to bond contacting particles into engineering products such as ceramics, metals, polymers, and cemented carbides. Modelling and simulation as…

We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number…

Convolutional Neural Networks (Convnets) have achieved good results in a range of computer vision tasks the recent years. Though given a lot of attention, visualizing the learned representations to interpret Convnets, still remains a…

This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic…

Graphs are often used to model relationships between entities. The identification and visualization of clusters in graphs enable insight discovery in many application areas, such as life sciences and social sciences. Force-directed graph…

Cartograms combine statistical and geographical information in thematic maps, where areas of geographical regions (e.g., countries, states) are scaled in proportion to some statistic (e.g., population, income). Cartograms make it possible…

The problem of 3D reconstruction from posed images is undergoing a fundamental transformation, driven by continuous advances in 3D Gaussian Splatting (3DGS). By modeling scenes explicitly as collections of 3D Gaussians, 3DGS enables…

We derive an efficient method to perform clustering of nodes in Gaussian graphical models directly from sample data. Nodes are clustered based on the similarity of their network neighborhoods, with edge weights defined by partial…

In this work, a problem associated with imbalanced text corpora is addressed. A method of converting an imbalanced text corpus into a balanced one is presented. The presented method employs a clustering algorithm for conversion. Initially…

Coarse grain (CG) molecular dynamics (MD) can simulate systems inaccessible to fine grain (FG) MD simulations. A CG simulation decreases the degrees of freedom by mapping atoms from an FG representation into agglomerate CG particles. The FG…

Important graph mining problems such as Clustering are computationally demanding. To significantly accelerate these problems, we propose ProbGraph: a graph representation that enables simple and fast approximate parallel graph mining with…