When is a closed-form RGB->S/P ratio adequate? A hyperspectral characterization on natural scenes for mesopic display
研究通过高光谱图像评估了在自然场景下使用闭合形式从RGB估计S/P比的准确性,发现经色适应处理后该方法误差较小。
研究通过高光谱图像评估了在自然场景下使用闭合形式从RGB估计S/P比的准确性,发现经色适应处理后该方法误差较小。
This work addresses two types of chromatic artifacts—hue looping and neutral-axis deviation—that arise during OKLCH interpolation in low-saturation regions, noting that existing approaches only mitigate the latter. To resolve both issues simultaneously, the authors propose a continuously differentiable chroma-gated interpolation mechanism that smoothly blends between OKLCH and linear Oklab paths. Built upon the Oklab color space, the method employs a single-parameter gating function of Michaelis–Menten form, $w(C) = C^n / (C^n + \sigma^n)$, enabling differentiable fusion without requiring thresholds or endpoint detection. Experimental results demonstrate that, under default parameters, the approach reduces the average lateral deviation of hue trajectories by 49.5% and decreases chroma-weighted hue shift by 35.5%, offering a generic and backward-compatible solution for modern CSS color interpolation.
This study investigates the pointwise relationship between Sibley’s guard-point convexity measure \( G(F) \) and the perimeter-based convexity measure \( P(F) \). Through geometric construction and inequality analysis, the authors present the first counterexample—a non-convex pentagon—for which \( G(F) = 62/63 > 185/189 = P(F) \), thereby disproving the conjecture that \( G(F) \leq P(F) \) holds pointwise. Concurrently, they establish a universal upper bound \( G(F) \leq 2P(F) \), demonstrating that the two measures remain asymptotically non-dominating. This work clarifies the theoretical boundaries between these two convexity measures and strengthens the mathematical foundation for comparing convexity in simple polygons.
This work addresses the tendency of large language models to prematurely commit to a single semantic interpretation when processing ambiguous inputs, thereby collapsing multiple plausible meanings into one output. To mitigate this, the authors propose a text-to-state mapping framework φ that preserves semantic ambiguity through a three-stage process: conflict detection, interpretation extraction, and state construction—operating within a non-collapsed state space. This framework establishes the first algorithmic bridge from text to a state space for non-resolution reasoning (NRR), enabling delayed collapse of ambiguity and supporting cross-lingual extension. It integrates rule-based explicit conflict markers (e.g., contrastive conjunctions) with LLM-driven enumeration of implicit ambiguities (cognitive, lexical, and structural). Evaluated on a test set of 68 ambiguous sentences, the method yields generated states with an average entropy of 1.087 bits—significantly outperforming collapsed baselines (entropy = 0)—and demonstrates cross-lingual validity using Japanese markers.
研究通过高光谱图像评估了在自然场景下使用闭合形式从RGB估计S/P比的准确性,发现经色适应处理后该方法误差较小。
This work addresses two types of chromatic artifacts—hue looping and neutral-axis deviation—that arise during OKLCH interpolation in low-saturation regions, noting that existing approaches only mitigate the latter. To resolve both issues simultaneously, the authors propose a continuously differentiable chroma-gated interpolation mechanism that smoothly blends between OKLCH and linear Oklab paths. Built upon the Oklab color space, the method employs a single-parameter gating function of Michaelis–Menten form, $w(C) = C^n / (C^n + \sigma^n)$, enabling differentiable fusion without requiring thresholds or endpoint detection. Experimental results demonstrate that, under default parameters, the approach reduces the average lateral deviation of hue trajectories by 49.5% and decreases chroma-weighted hue shift by 35.5%, offering a generic and backward-compatible solution for modern CSS color interpolation.
This study investigates the pointwise relationship between Sibley’s guard-point convexity measure \( G(F) \) and the perimeter-based convexity measure \( P(F) \). Through geometric construction and inequality analysis, the authors present the first counterexample—a non-convex pentagon—for which \( G(F) = 62/63 > 185/189 = P(F) \), thereby disproving the conjecture that \( G(F) \leq P(F) \) holds pointwise. Concurrently, they establish a universal upper bound \( G(F) \leq 2P(F) \), demonstrating that the two measures remain asymptotically non-dominating. This work clarifies the theoretical boundaries between these two convexity measures and strengthens the mathematical foundation for comparing convexity in simple polygons.
This work addresses the tendency of large language models to prematurely commit to a single semantic interpretation when processing ambiguous inputs, thereby collapsing multiple plausible meanings into one output. To mitigate this, the authors propose a text-to-state mapping framework φ that preserves semantic ambiguity through a three-stage process: conflict detection, interpretation extraction, and state construction—operating within a non-collapsed state space. This framework establishes the first algorithmic bridge from text to a state space for non-resolution reasoning (NRR), enabling delayed collapse of ambiguity and supporting cross-lingual extension. It integrates rule-based explicit conflict markers (e.g., contrastive conjunctions) with LLM-driven enumeration of implicit ambiguities (cognitive, lexical, and structural). Evaluated on a test set of 68 ambiguous sentences, the method yields generated states with an average entropy of 1.087 bits—significantly outperforming collapsed baselines (entropy = 0)—and demonstrates cross-lingual validity using Japanese markers.