This paper proposes a novel framework for image retrieval. The retrieval is treated as searching for an ordered cycle in an image database. The optimal cycle can be found by minimizing the geometric manifold entropy of images. The minimization is solved by the proposed method, fast active tabu search. Experimental results demonstrate the framework for image retrieval is feasible and quite promi...

A fast iterative method is derived for minimum cross entropy thresholding using a one-point iteration scheme. Simulations performed using synthetic generated histograms and a real image show the speed advantage and the accuracy of the iterated version. q 1998 Elsevier Science B.V. All rights reserved.

| Entropy-constrained vector quantization (ECVQ) 3] offers substantially improved image quality over vector quan-tization (VQ) at the cost of additional encoding complexity. We extend results in the literature for fast nearest neighbor search of VQ to ECVQ. We use a new, easily computed distance that successfully eliminates most codewords from consideration.

A vortex particle method is developed for simulating two-dimensional, unsteady compressible flow. The method uses the Helmholtz decomposition of the velocity field to separately treat the irrotational and solenoidal portions of the flow, and the particles are allowed to change volume to conserve mass. In addition to having vorticity and dilatation properties, the particles also carry density, e...

Image compression is achieved by removing data redundancy while preserving information content. SPIHT is computationally very fast and among the best image compression algorithms known today. According to statistic analysis of the output binary stream of SPIHT encoding, propose a simple and effective method combined with Entropy for further compression that saves a lot of bits in the image data...

In this short paper, an off-the-shelf maximum entropy-based POS-tagger is used as a partial parser to improve the accuracy of an extremely fast linear time dependency parser that provides state-of-the-art results in multilingual unlabeled POS sequence parsing.

The long-time asymptotics are determined for fast nonlinear diffusion by linearizing Otto's gradient descent model at the Barenblatt profile. The spectrum of the entropy is explicitly determined. The dynamics are found to undergo a phase transition in which rotational symmetry is broken as the strength of the nonlinearity is varied.

We present a novel entropy coding technique which is adaptable in that each bit to be encoded may have an associated probability estimate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redundancy and admits a simple and fast decoder.

In this work we derive local gradient and Laplacian estimates of the AronsonBénilan and Li-Yau type for positive solutions of porous medium equations posed on Riemannian manifolds with a lower Ricci curvature bound. We also prove similar results for some fast diffusion equations. Inspired by Perelman’s work we discover some new entropy formulae for these equations.

The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...