Related papers: Color-map recommendation for MR relaxometry maps

I propose a fixed-range interaction multicomponent spin model, to be used as a physical analog to problems in plane geometry. Specifically, the model is applied to the open problem of the chromatic number of the plane. When spin values are…

We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that this leads to one of two interesting results. In one case,…

While typical qualitative T1-weighted magnetic resonance images reflect scanner and protocol differences, quantitative T1 mapping aims to measure T1 independent of these effects. Changes in T1 in the brain reflect structural changes in…

Given a grayscale photograph, the colorization system estimates a visually plausible colorful image. Conventional methods often use semantics to colorize grayscale images. However, in these methods, only classification semantic information…

Lineart colorization is a critical stage in professional content creation, yet achieving precise and flexible results under diverse user constraints remains a significant challenge. To address this, we propose OmniColor, a unified framework…

We study the integrality gap of the natural linear programming relaxation for the \textit{Bounded Color Matching} (BCM) problem. We provide several families of instances and establish lower bounds on their integrality gaps and we study how…

We explore distribution questions for rational maps on the projective line $\mathbb{P}^1$ over $\mathbb{Q}$ within the framework of arithmetic dynamics, drawing analogies to elliptic curves. Specifically, we investigate counting problems…

Purpose: To simulate effective transverse relaxation ($T_2^*$) as a part of MR simulation. $T_2^*$ consists of reversible ($T_2^{\prime}$) and irreversible ($T_2$) components. Whereas simulations of $T_2$ are easy, $T_2^{\prime}$ is not…

In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-coloring problem is to compute the minimum number of colors…

The color of skin lesions is an important diagnostic feature for identifying malignant melanoma and other skin diseases. Typical colors associated with melanocytic lesions include tan, brown, black, red, white, and blue gray. This study…

Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum computation in two-dimensional architectures. Recently,…

Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function…

Contour maps are widely used to display estimates of spatial fields. Instead of showing the estimated field, a contour map only shows a fixed number of contour lines for different levels. However, despite the ubiquitous use of these maps,…

In this paper a class of linear maps on the 2-torus and some planar piecewise isometries are discussed. For these discontinuous maps, by introducing codings underlying the map operations, symbolic descriptions of the dynamics and…

For a list assignment $L$ and an $L$-coloring $\varphi$, a Kempe swap in $\varphi$ is \emph{$L$-valid} if it yields another $L$-coloring. Two $L$-colorings are \emph{$L$-equivalent} if we can form one from another by a sequence of $L$-valid…

While medical imaging typically provides massive amounts of data, the extraction of relevant information for predictive diagnosis remains a difficult challenge. Functional MRI (fMRI) data, that provide an indirect measure of task-related or…

Let $G$ be a graph and $t$ a nonnegative integer. Suppose $f$ is a mapping from the vertex set of $G$ to $\{1,2,\dots, k\}$. If, for any vertex $u$ of $G$, the number of neighbors $v$ of $u$ with $f(v)=f(u)$ is less than or equal to $t$,…

Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color-blind people. Simple color transformations often result in information loss and ambiguities…

Long-range temporal coherence (LRTC) is quite common to dynamic systems and is fundamental to the system function. LRTC in the brain has been shown to be important to cognition. Assessing LRTC may provide critical information for…

Dynamic susceptibility-weighted contrast-enhanced (DSC) MRI or perfusion-MRI plays an important role in the non-invasive assessment of tumor vascularity. However, the large number of images provided by the method makes display and…