A Hybrid Color Quantization Algorithm Incorporating a Human Visual Perception Model

Color quantization is a common image processing technique where full color images are to be displayed using a limited palette of colors. The choice of a good palette is crucial as it directly determines the quality of the resulting image. Standard quantization approaches aim to minimize the mean squared error (MSE) between the original and the quantized image, which does not correspond well to how humans perceive the image differences. In this article, we introduce a color quantization algorithm that hybridizes an optimization scheme based with an image quality metric that mimics the human visual system. Rather than minimizing the MSE, its objective is to maximize the image fidelity as evaluated by S‐CIELAB, an image quality metric that has been shown to work well for various image processing tasks. In particular, we employ a variant of simulated annealing with the objective function describing the S‐CIELAB image quality of the quantized image compared with its original. Experimental results based on a set of standard images demonstrate the superiority of our approach in terms of achieved image quality.     

基于3D-DCT和SVD的鲁棒彩色图像水印算法

在数字图像水印领域,水印算法主要集中于灰度图像,且提出的大部分彩色图像水印算法往往仅在亮度分量或在彩色图像的每一通道中嵌入水印,未能充分利用彩色图像的冗余空间,影响了水印的透明性和鲁棒性。针对此问题,提出了一种新颖的基于三维离散余弦变换和奇异值分解的彩色图像水印算法。算法先对水印图像进行预处理和对彩色图像进行互不重叠的分块;其次对每一分块进行三维离散余弦变换;最后选择对三维离散余弦变换系数的第一分量进行奇异值分解。嵌入水印时,对三维离散余弦变换系数第一分量的最大奇异值和第二分量分别采用量化和关系的嵌入方法嵌入水印。提取水印时,分别采用量化和关系提取算法提取水印并进行比较,选取相似值高的水印图像作为最终提取的水印。实验结果表明,提出的算法具有较好透明性的同时,具有抵抗常规信号处理和模糊、扭曲及锐化等攻击的能力。     

Extracting Microfacet‐based BRDF Parameters from Arbitrary Materials with Power Iterations

We introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that the eigenvector associated to the largest eigenvalue is always the only solution to this problem, and compute it using the power iteration method. This approach is straightforward to implement, much faster to compute, and considerably more robust than solutions based on nonlinear optimizations. In addition, we provide simple conversion procedures of our fits into both Beckmann and GGX roughness parameters, and discuss the advantages of microfacet slope space to make our fits editable. We apply our method to measured materials from two large databases that include anisotropic materials, and demonstrate the benefits of spatially varying roughness on texture mapped geometric models.     

Physically Meaningful Rendering using Tristimulus Colours

In photorealistic image synthesis the radiative transfer equation is often not solved by simulating every wavelength of light, but instead by computing tristimulus transport, for instance using sRGB primaries as a basis. This choice is convenient, because input texture data is usually stored in RGB colour spaces. However, there are problems with this approach which are often overlooked or ignored. By comparing to spectral reference renderings, we show how rendering in tristimulus colour spaces introduces colour shifts in indirect light, violation of energy conservation, and unexpected behaviour in participating media. Furthermore, we introduce a fast method to compute spectra from almost any given XYZ input colour. It creates spectra that match the input colour precisely. Additionally, like in natural reflectance spectra, their energy is smoothly distributed over wide wavelength bands. This method is both useful to upsample RGB input data when spectral transport is used and as an intermediate step for corrected tristimulus‐based transport. Finally, we show how energy conservation can be enforced in RGB by mapping colours to valid reflectances.     

Path‐space Motion Estimation and Decomposition for Robust Animation Filtering

Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation.     

Parametric Stabilization of Quantized Interconnected Systems with Application to Coupled Inverted Pendulums

This paper studies the analysis of parametric stability and decentralized state feedback control of a kind of quantized interconnected systems. The output of each controller is quantized logarithmically before it is input to the subsystem, and the quantized density would affect the stability of the systems. First, a decentralized state feedback controller is designed for interconnected systems without quantization and the corresponding stable region is obtained. Second, for a given controller, the lower bound of the quantization density is evaluated from parameters of local controllers. Finally, the proposed method is applied to coupled inverted pendulums systems which can be viewed as quantized interconnected systems. The simulation results show that by using the proposed quantized controllers, the interconnected inverted pendulum systems are parametrically stabilized.     

Quantized H∞ Control for Networked Systems with Communication Constraints

The problem of quantized H_∞ control for networked control systems (NCSs) subject to time‐varying delay and multiple packet dropouts is investigated in this paper. Both the control input and the measurement output signals are quantized before being transmitted and the quantized errors are described as sector bound uncertainties. The measurement channel and the control channel packet dropouts are considered simultaneously, and the stochastic variables satisfying Bernoulli random binary distribution are utilized to model the random multiple packet dropouts. Sufficient conditions for the existence of an observer‐based controller are established to ensure the exponential mean‐square stablility of the closed‐loop system and achieve the optimal H_∞ disturbance attenuation level. By using a globally convergent algorithm involving convex optimization, the nonconvex feasibility can be solved successfully. Finally, a numerical example is given to illustrate the effectiveness and applicability of the proposed method.     

煤矿监控图像中脸肤色和模板检测

煤矿监控图像的对比度低、灰度不均匀,使监控图像的处理和识别难度增大.在巷道环境下采集多角度的矿工监控图像,根据脸部肤色区域像素的统计特征,用上下限阈值的方法在HSV颜色空间分割出各种角度的矿工脸部,用半径为2的圆形结构元素进行数学形态学的开启和闭合操作,去除被误分为脸部区域的背景像素;根据脸部灰度分布特征构造了平均脸模板,用相似度函数作为脸部模板匹配的判别函数,检测矿工脸部位置.结果表明,用肤色分割和平均脸部模板匹配方法,可以快速检测出矿工脸部的精确位置.