Nonlinear Dynamics of Accelerator via Wavelet Approach

In this paper we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In the general case we have the solution as a multiresolution expansion in the base of compactly supported wavelet basis. The solution is parametrized by the solutions of two reduced algebraical problems, one is nonlinear and the second is some linear problem, which is obtained from one of the next wavelet constructions: Fast Wavelet Transform, Stationary Subdivision Schemes, the method of Connection Coefficients. According to the orbit method and by using construction from the geometric quantization theory we construct the symplectic and Poisson structures associated with generalized wavelets by using metaplectic structure. We consider wavelet approach to the calculations of Melnikov functions in the theory of homoclinic chaos in perturbed Hamiltonian systems and for parametrization of Arnold-Weinstein curves in Floer variational approach.Comment: 16 pages, no figures, LaTeX2e, aipproc.sty, aipproc.cl

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality

The new fuzzy analytical hierarchy process with interval type-2 trapezoidal fuzzy sets and its application

The degree of type-1 fuzzy sets membership function cannot express the linguistic variable of a complex problem. The type-2 fuzzy sets as a problem solver such that more fuzziness for constructing membership functions can be handled. Recently, many multi-criteria decision making (MCDM) methods have been expanded using type-2 fuzzy sets. Analytical Hierarchy Process (AHP) is one of the well-known MCDM that can take into account multiple and conflicting criteria at the same time. Our goal is to develop an interval type-2 trapezoidal fuzzy AHP through the new proposed ranking i.e. the modified total integral value. Based on the illustrative examples for trapezoidal type-2 fuzzy sets, the new proposed ranking has a well-performance in ranking. Furthermore, we apply the new trapezoidal type-2 fuzzy AHP to a supplier selection problem. Based on the results of the application, the new fuzzy AHP has the same ranking results as the existing fuzzy AHP

Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression

The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more difficult. In this paper we present a new rate-distortion optimization al-gorithm based on graph theory that can encode efficiently the coefficients of a critically sampled, non-orthogonal or even redundant transform, like the contourlet decomposition. The basic idea is to construct a specialized graph such that its min-imum cut minimizes the energy functional. We propose to ap-ply this technique for rate-distortion Lagrangian optimization in subband image coding. The method yields good compres-sion results compared to the state-of-art JPEG2000 codec, as well as a general improvement in visual quality. Index Terms — subband image coding, rate- distortion allocation 1