The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique cal...

Recurrence relations with minimization and maximization, called minmax recurrence relations are commonly encountered in the analysis of algorithms. In this paper we present the solution of one such challenging recurrence relation. We characterize the optimal partition sizes as well as derive the order of complexity of the overall recurrence relation. It is proved that ad hoc equal partitioning ...

The paper scrutinizes various stylized facts related to the minmax theorem for chess. We first point out that, in contrast to the prevalent understanding, chess is actually an infinite game, so that backward induction does not apply in the strict sense. Second, we recall the original argument for the minmax theorem of chess which is forward rather than backward looking. Then it is shown that, a...

Warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. In this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using Fourier transforms. Different methods have been used in this work including autocorrelation function. First, two dimensional power s...

Warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. In this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using Fourier transforms. Different methods have been used in this work including autocorrelation function. First, two dimensional power s...

[4] Igor Averbakh. Minmax regret solutions for minmax optimization problems with uncertainty. [5] Igor Averbakh. On the complexity of a class of combinatorial optimization problems with uncertainty. [7] Igor Averbakh and Oded Berman. Minimax regret p-center location on a network with demand uncertainty. [8] Igor Averbakh and Oded Berman. Minmax p-traveling salesman location problems on a tree.

In this letter, we study the R-D properties of independent sources based on MSE and SSIM, and compare the bit allocation performance under the MINAVE and MINMAX criteria in video encoding. The results show that MINMAX has similar results in terms of average distortion with MINAVE by using SSIM, which illustrates the consistency between these two criteria in independent perceptual video coding. ...

the classical method of process capability analysis necessarily assumes that collected data are independent; nonetheless, some processes such as biological and chemical processes are autocorrelated and violate the independency assumption. many processes exhibit a certain degree of correlation and can be treated by autoregressive models among which the autoregressive model of order one (ar (1)) ...

In this paper, we review a general framework for the optimal bit allocation among dependent quantizers based on the minimum maximum (MINMAX) distortion criterion. Pros and cons of this optimization criterion are discussed and compared to the well-known Lagrange multiplier method for the minimum average (MINAVE) distortion criterion. We argue that, in many applications, the MINMAX criterion is m...

Glossary AR(1): Autoregressive model of order one. The present state of a system can be described as a linear function of the state at the previous time, plus timeindependent noise. data assimilation: Method of optimally combining irregularly spaced observations with dynamical constraints to produce dynamically consistent fields on regular grids. CCA: Canonical Correlation Analysis EOF: Empiric...