three step iterations for variational inequalities and nonexpansive mappings in this paper we introduce a new three step iterative scheme for finding the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality using the technique of updating the solution we show that the sequence converges strongly to a common element of two sets under some control conditions results proved in this paper may be viewed as an improvement and refinement of the recent results of noor and huang m aslam noor z huang three step methods for nonexpansive mappings and variational inequalities appl math comput in press and yao and yao y yao j c yao on modified iterative method for nonexpansive mappings and monotone mappings appl math comput in press

a progressive transmission capable diagnostically lossless compression scheme for 3d medical image sets this paper presents a novel and efficient diagnostically lossless compression for 3d medical image sets this compression scheme provides the 3d medical image sets with a progressive transmission capability an automated filter and threshold based preprocessing technique is used to remove noise outside the diagnostic region then a wavelet decomposition feature vector based approach is applied to determine the reference image for the entire 3d medical image set the selected reference image contains the most discernible anatomical structures within a relative large diagnostic region it is progressively encoded by a lossless embedded zerotree wavelet method so the validity of an entire set can be determined early this preprocessing technique is followed by an optimal predictor plus a 1st level integer wavelet transform to de correlate the 3d medical image set run length and arithmetic coding are used to further remove coding redundancy this diagnostically lossless compression method achieves an average compression of 2 1038 2 4292 and 1 6826 bits per pixel for three types of 3d magnetic resonance image sets the integrated progressive transmission capability degrades the compression performance by an average of 7 25 6 60 and 4 49 for the above three types moreover our compression without and with progressive transmission achieves better compression than the state of the art

strong convergence of a general iterative method for variational inequality problems and fixed point problems in hilbert spaces abstract in this paper we introduce a new iterative scheme to investigate the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of solutions of a variational inequality problem for a relaxed cocoercive mapping by viscosity approximate methods our results improve and extend the recent ones announced by chen et al j m chen l j zhang t g fan viscosity approximation methods for nonexpansive mappings and monotone mappings doi 10 1016 j jmaa 2006 12 088 iiduka and tahakshi h iiduka w takahashi strong convergence theorems for nonexpansive mappings and inverse strongly monotone mappings nonlinear anal 61 2005 341 350 yao and yao y h yao j c yao on modified iterative method for nonexpansive mappings and monotone mappings appl math comput doi 10 1016 j amc 2006 08 062 and many others

two extragradient methods for generalized mixed equilibrium problems nonexpansive mappings and monotone mappings in this paper we introduce iterative schemes based on the extragradient method for finding a common element of the set of solutions of a generalized mixed equilibrium problem and the set of fixed points of an infinite a finite family of nonexpansive mappings and the set of solutions of a variational inequality problem for a monotone lipschitz continuous mapping we obtain some weak convergence theorems for the sequences generated by these processes in hilbert spaces the results in this paper generalize extend and unify some well known weak convergence theorems in the literature

a relaxed extragradient like method for a generalized mixed equilibrium problem a general system of generalized equilibria and a fixed point problem abstract very recently takahashi and takahashi s takahashi w takahashi strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a hilbert space nonlinear anal 69 2008 1025 1033 suggested and analyzed an iterative method for finding a common solution of a generalized equilibrium problem and a fixed point problem of a nonexpansive mapping in a hilbert space in this paper based on takahashi takahashi s iterative method and well known extragradient method we introduce a relaxed extragradient like method for finding a common solution of a generalized mixed equilibrium problem a general system of generalized equilibria and a fixed point problem of a strictly pseudocontractive mapping in a hilbert space and then obtain a strong convergence theorem utilizing this theorem we establish some new strong convergence results in fixed point problems variational inequalities mixed equilibrium problems and systems of generalized equilibria

toward optimality in scalable predictive coding a method is proposed for efficient scalability in predictive coding which overcomes known fundamental shortcomings of the prediction loop at enhancement layers the compression efficiency of an enhancement layer is substantially improved by casting the design of its prediction module within an estimation theoretic framework and thereby exploiting all information available at that layer for the prediction of the signal and encoding of the prediction error while the most immediately important application is in video compression the method is derived in a general setting and is applicable to any scalable predictive coder thus the estimation theoretic approach is first developed for basic dpcm compression and demonstrates the power of the technique in a simple setting that only involves straightforward prediction scalar quantization and entropy coding results for the scalable compression of first order gauss markov and laplace markov signals illustrate the performance a specific estimation algorithm is then developed for standard scalable dct based video coding simulation results show consistent and substantial performance gains due to optimal estimation at the enhancement layers

embedded image coding using zerotrees of wavelet coefficients the embedded zerotree wavelet algorithm ezw is a simple yet remarkably effective image compression algorithm having the property that the bits in the bit stream are generated in order of importance yielding a fully embedded code the embedded code represents a sequence of binary decisions that distinguish an image from the null image using an embedded coding algorithm an encoder can terminate the encoding at any point thereby allowing a target rate or target distortion metric to be met exactly also given a bit stream the decoder can cease decoding at any point in the bit stream and still produce exactly the same image that would have been encoded at the bit rate corresponding to the truncated bit stream in addition to producing a fully embedded bit stream the ezw consistently produces compression results that are competitive with virtually all known compression algorithms on standard test images yet this performance is achieved with a technique that requires absolutely no training no pre stored tables or codebooks and requires no prior knowledge of the image source the ezw algorithm is based on four key concepts 1 a discrete wavelet transform or hierarchical subband decomposition 2 prediction of the absence of significant information across scales by exploiting the self similarity inherent in images 3 entropy coded successive approximation quantization and 4 universal lossless data compression which is achieved via adaptive arithmetic coding

optimum nonnegative integer bit allocation for wavelet based signal compression and coding in this paper first a new optimum nonnegative integer bit allocation oniba algorithm is proposed for transform coding with lower computational complexity compared to the existing algorithms the algorithm is extended for the cases in which the variances of some sources are zero then an oniba algorithm is developed for wavelet based subband coding finally the algorithm is modified for adaptive subband coding computer simulations demonstrate considerable superiority of the proposed subband coding algorithm over the existing ones

strong convergence theorems for strongly nonexpansive sequences the aim of this paper is to prove a strong convergence theorem for a pair of sequences of nonexpansive mappings in a hilbert space where one of them is a strongly nonexpansive sequence and provide some applications of the theorem

strong convergence theorems based on a new modified extragradient method for variational inequality problems and fixed point problems in banach spaces in this paper we introduce a new iterative algorithm by a modified extragradient method for finding a common element of the set of solutions of a general variational inequality and the set of common fixed points of an infinite family of k i strict pseudocontractions in a banach space we obtain some strong convergence theorems under suitable conditions the results obtained in this paper improve and extend the recent ones announced by many others

reversible intraframe compression of medical images the performance of several reversible intraframe compression methods is compared by applying them to angiographic and magnetic resonance mr images reversible data compression involves two consecutive steps decorrelation and coding the result of the decorrelation step is presented in terms of entropy because huffman coding generally approximates these entropy measures within a few percent coding has not been investigated separately it appears that a hierarchical decorrelation method based on interpolation hint outperforms all other methods considered the compression ratio is around 3 for angiographic images of 8 9 b pixel but is considerably less for mr images whose noise level is substantially higher

algorithms for approximating minimization problems in hilbert spaces in this paper we study the following minimization problem minx fix s w m2 12 x 2 h x where b is a bounded linear operator m 0 is some constant h is a potential function for c f fix t is the set of fixed points of nonexpansive mapping s and w is the solution set of an equilibrium problem this paper introduces two new algorithms one implicit and one explicit that can be used to find the solution of the above minimization problem

hybrid noor iteration method for nonexpansive mappings in hilbert spaces in this paper hybrid noor iteration method was introduced for nonexpansive mappings in hilbert spaces the sufficient and necessary conditions that the iteration sequences converge strongly to a fixed point of a nonexpansive mapping are obtained in hilbert spaces

a hybrid algorithm for pseudo contractive mappings abstract in this paper we suggest and analyze a hybrid algorithm for pseudo contractive mappings in hilbert spaces further we prove the strong convergence of the proposed iterative algorithm for lipschitz pseudo contractive mappings in hilbert spaces

singularity detection and processing with wavelets the mathematical characterization of singularities with lipschitz exponents is reviewed theorems that estimate local lipschitz exponents of functions from the evolution across scales of their wavelet transform are reviewed it is then proven that the local maxima of the wavelet transform modulus detect the locations of irregular structures and provide numerical procedures to compute their lipschitz exponents the wavelet transform of singularities with fast oscillations has a particular behavior that is studied separately the local frequency of such oscillations is measured from the wavelet transform modulus maxima it has been shown numerically that one and two dimensional signals can be reconstructed with a good approximation from the local maxima of their wavelet transform modulus as an application an algorithm is developed that removes white noises from signals by analyzing the evolution of the wavelet transform maxima across scales in two dimensions the wavelet transform maxima indicate the location of edges in images

approach to common elements of variational inequality problems and fixed point problems via a relaxed extragradient method in this paper we introduce an iterative method based on the extragradient method for finding a common element of the set of a general system of variational inequalities and the set of fixed points of a strictly pseudocontractive mapping in a real hilbert space furthermore we prove that the studied iterative method strongly converges to a common element of the set of a general system of variational inequalities and the set of fixed points of a strictly pseudocontractive mapping under some mild conditions imposed on algorithm parameters

variational inequalities with generalized monotone operators we investigate the variational inequality with pseudomonotone operators in the sense of karamardian in banach spaces new existence results which extend many known results in infinite dimensional spaces are derived under rather weak assumptions new uniqueness results which also seem to be new even in finite dimensional spaces are also derived in particular new existence and uniqueness results for the complementarity problem with pseudomonotone operators in banach spaces are obtained also existence and uniqueness results for minimization problems with pseudoconvex functions in banach spaces are obtained

strong convergence of krasnoselskii and mann s type sequences for one parameter nonexpansive semigroups without bochner integrals abstract in this paper we prove krasnoselskii and mann s type convergence theorems for nonexpansive semigroups without using bochner integral and without assuming the strict convexity of banach spaces one of our main results is the following let c be a compact convex subset of a banach space e and let t t t 0 be a one parameter strongly continuous semigroup of nonexpansive mappings on c let t n be a sequence in 0 satisfying lim inf n t n lim sup n t n and lim n t n 1 t n 0 let 0 1 define a sequence x n in c by x 1 c and x n 1 t t n x n 1 x n for n n then x n converges strongly to a common fixed point of t t t 0

viscosity approximation methods for nonexpansive mappings abstract viscosity approximation methods for nonexpansive mappings are studied consider a nonexpansive self mapping t of a closed convex subset c of a banach space x suppose that the set fix t of fixed points of t is nonempty for a contraction f on c and t 0 1 let x t c be the unique fixed point of the contraction x tf x 1 t tx consider also the iteration process x n where x 0 c is arbitrary and x n 1 n f x n 1 n tx n for n 1 where n 0 1 if x is either hilbert or uniformly smooth then it is shown that x t and under certain appropriate conditions on n x n converge strongly to a fixed point of t which solves some variational inequality

viscosity approximation schemes for fixed point problems and equilibrium problems and variational inequality problems abstract in this paper we first introduce a general iterative scheme by halpern approximation method for finding a common element of the set of solutions of an equilibrium problem the set of solutions of the variational inequality for an infinite family of i inverse strongly monotone mappings and the set of common fixed points for a family of infinitely nonexpansive mappings in a hilbert space then we extend the halpern iterative scheme to a general viscosity approximation scheme by a simple and different method as applications we utilize our results to investigate some convergence problems for strictly pseudocontractive mappings and maximal monotone operators the results obtained in this paper extend and improve the recent ones announced by many others

a new class of biorthogonal wavelet systems for image transform coding we construct general biorthogonal coifman wavelet systems a new class of compactly supported biorthogonal wavelet systems with vanishing moments equally distributed for a scaling function and wavelet pair a time domain design method is employed and closed form expressions for the impulse responses and the frequency responses of the corresponding dual filters are derived the resulting filter coefficients are all dyadic fractions which is an attractive feature in the realization of multiplication free discrete wavelet transform even ordered systems in this family are symmetric which correspond to linear phase dual filters in particular three filterbanks fbs in this family are systematically verified to have competitive compression potential to the 9 7 tap biorthogonal wavelet fb by cohen et al 1992 which is currently the most widely used one in the field of wavelet transform coding in addition the proposed fb s have much smaller computational complexity in terms of floating point operations required in transformation and therefore indicate a better tradeoff between compression performance and computational complexity

morse theory for lagrangian intersections soit p une variete symplectique compacte et soit l p une sous variete lagrangienne avec 2 p l 0 pour un diffeomorphisme exact de p avec la propriete que l coupe l transversalement on demontre une inegalite de morse reliant l ensemble l l a la cohomologie de l

on modified iterative method for nonexpansive mappings and monotone mappings abstract in this paper we introduce a new iterative scheme for finding the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for inverse strongly monotone mappings we show that the sequence converges strongly to a common element of the above two sets under some parameters controlling conditions

convergence theorems based on hybrid methods for generalized equilibrium problems and fixed point problems abstract the purpose of this work is to introduce a hybrid projection method for finding a common element of the set of a generalized equilibrium problem the set of solutions to a variational inequality and the set of fixed points of a strict pseudo contraction in a real hilbert space

information theoretic analysis of interscale and intrascale dependencies between image wavelet coefficients this paper presents an information theoretic analysis of statistical dependencies between image wavelet coefficients the dependencies are measured using mutual information which has a fundamental relationship to data compression estimation and classification performance mutual information is computed analytically for several statistical image models and depends strongly on the choice of wavelet filters in the absence of an explicit statistical model a method is studied for reliably estimating mutual information from image data the validity of the model based and data driven approaches is assessed on representative real world photographic images our results are consistent with empirical observations that coding schemes exploiting inter and intrascale dependencies alone perform very well whereas taking both into account does not significantly improve coding performance a similar observation applies to other image processing applications

on mann implicit iterations for strongly accretive and strongly pseudo contractive mappings abstract for a lipschitz strongly accretive map considered by chidume in c e chidume picard iteration for strongly accretive and strongly pseudo contractive lipschitz maps ictp preprint no ic2000098 c e chidume iterative algorithms for nonexpansive mappings and some of their generalizations nonlinear analysis and applications to v lakshmikantam on his 80th birthday vols 1 and 2 kluwer acad publ dordrecht 2003 pp 383 429 it is known that a classical picard type iteration process converges strongly to a zero of the operator he also proved that the rate of convergence in this case is at least as fast as a geometric progression in this paper we study the mann implicit iteration sequence for strongly accretive and strongly pseudo contractive mappings we showed that this implicit scheme gives better convergence rate estimate presented results improve the corresponding results of c e chidume picard iteration for strongly accretive and strongly pseudo contractive lipschitz maps ictp preprint no ic2000098 c e chidume iterative algorithms for nonexpansive mappings and some of their generalizations nonlinear analysis and applications to v lakshmikantam on his 80th birthday vols 1 and 2 kluwer acad publ dordrecht 2003 pp 383 429 l liu approximation of fixed points of a strictly pseudo contractive mapping proc am math soc 125 2 1997 1363 1366 w r sastry g v r babu approximation of fixed points of strictly pseudo contractive mappings on arbitrary closed convex sets in a banach space proc amer math soc 128 2000 2907 2909 y song r chen viscosity approximative methods to cesaro means for non expansive mappings appl math comput 186 2 2007 1120 1128

performance analysis of reversible image compression techniques for high resolution digital teleradiology the performances of a number of block based reversible compression algorithms suitable for compression of very large format images 4096 4096 pixels or more are compared to that of a novel two dimensional linear predictive coder developed by extending the multichannel version of the burg algorithm to two dimensions the compression schemes implemented are huffman coding lempel ziv coding arithmetic coding two dimensional linear predictive coding in addition to the aforementioned one transform coding using discrete fourier discrete cosine and discrete walsh transforms linear interpolative coding and combinations thereof the performances of these coding techniques for a few mammograms and chest radiographs digitized to sizes up to 4096 4096 10 b pixels are discussed compression from 10 b to 2 5 3 0 b pixel on these images has been achieved without any loss of information the modified multichannel linear predictor outperforms the other methods while offering certain advantages in implementation

image registration by compression abstract image registration consists in finding the transformation that brings one image into the best possible spatial correspondence with another image in this paper we present a new framework for image registration based on compression the basic idea underlying our approach is the conjecture that two images are correctly registered when we can maximally compress one image given the information in the other the contribution of this paper is twofold first we show that image registration can be formulated as a compression problem second we demonstrate the good performance of the similarity metric introduced by li et al in image registration two different approaches for the computation of this similarity metric are described the kolmogorov version computed using standard real world compressors and the shannon version calculated from an estimation of the entropy rate of the images

transversality in elliptic morse theory for the symplectic action our goal in this paper is to settle some transversality question for the perturbed nonlinear cauchy riemann equations on the cylinder these results play a central role in the denition of symplectic floer homology and hence in the proof of the arnold conjecture there is currently no other reference to these transversality results in the open literature our approach does not require aronszajn s theorem instead we derive the unique continuation theorem from a generalization of the carleman similarity principle

convergence of an iterative algorithm for systems of variational inequalities and nonexpansive mappings with applications in this paper we consider the problem of convergence of an iterative algorithm for a system of generalized variational inequalities and a nonexpansive mapping strong convergence theorems are established in the framework of real banach spaces

a new iterative method for equilibrium problems and fixed point problems of infinitely nonexpansive mappings and monotone mappings in this paper we introduce a new iterative scheme for finding the common element of the set of common fixed points of infinitely many nonexpansive mappings the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for a inverse strongly monotone mapping in hilbert spaces we prove that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions this main result improve and extend plubtieng and punpaeng s corresponding result s plubtieng r punpaeng a new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings applied mathematics and computation 197 2008 548 558 using this theorem we obtain three corollaries

weak and strong convergence theorems for countable lipschitzian mappings and its applications abstract we use mann s iteration and the hybrid method in mathematical programming to obtain weak and strong convergence to common fixed points of a countable family of lipschitzian mappings finally we apply our results to solve the equilibrium problems and variational inequalities for continuous monotone mappings

some new algorithms for solving mixed equilibrium problems in this paper we suggest and analyze two projection methods one implicit and one explicit for finding a particular solution of a mixed equilibrium problem in a real hilbert space furthermore we prove that the proposed projection methods converge strongly to a particular solution of the mixed equilibrium problem

iterative algorithms for a general system of generalized nonlinear mixed composite type equilibria in this paper we consider and study a general system of generalized nonlinear mixed composite type equilibria in hilbert spaces first we prove the existence and uniqueness of the solution for this system of generalized nonlinear mixed composite type equilibria second the mann iterative method with errors is extended to develop some new iterative algorithms for finding approximate solutions for this system of generalized nonlinear mixed composite type equilibria we also derive the strong convergence of the sequences generated by these iterative algorithms in hilbert spaces

lossless compression of medical images using two dimensional multiplicative autoregressive models presents new methods for lossless predictive coding of medical images using two dimensional multiplicative autoregressive models both single resolution and multi resolution schemes are presented the performances of the proposed schemes are compared with those of four existing techniques the experimental results clearly indicate that the proposed schemes achieve higher compression compared to the lossless image coding techniques considered

algorithms with strong convergence for a system of nonlinear variational inequalities in banach spaces abstract in this paper a general system of nonlinear variational inequality problem in banach spaces was considered which includes some existing problems as special cases for solving this nonlinear variational inequality problem we construct two methods which were inspired and motivated by korpelevich s extragradient method furthermore we prove that the suggested algorithms converge strongly to some solutions of the studied variational inequality

a new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings abstract in this paper we introduce a new iterative scheme for finding the common element of the set of fixed points of a nonexpansive mapping the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for inverse strongly monotone mappings we show that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions this main theorem extends a recent result of yao and yao y yao j c yao on modified iterative method for nonexpansive mappings and monotone mappings applied mathematics and computation 186 2 2007 1551 1558

weak and strong convergence theorems for fixed points of pseudocontractions and solutions of monotone type operator equations abstract let h be a real hilbert space k a nonempty closed convex subset of h and t k k a lipschitz pseudocontraction with a nonempty fixed point set weak and strong convergence theorems for the iterative approximation of fixed points of t are proved furthermore if t h h is a lipschitz monotone operator and f r t where r t denotes the range of t weak and strong convergence theorems for the iterative approximation of solutions of the operator equation tx f are proved

holomorphic disks and topological invariants for closed three manifolds the aim of this article is to introduce certain topological invariants for closed oriented three manifolds y equipped with a spiny structure given a heegaard splitting of y u 0o u u 1 these theories are variants of the lagrangian floer homology for the g fold symmetric product of relative to certain totally real subspaces associated to u 0 and u 1

on variational inclusion and common fixed point problems in hilbert spaces with applications abstract the purpose of this paper is to introduce a general iterative method for finding a common element of the solution set of quasi variational inclusion problems and of the common fixed point set of an infinite family of nonexpansive mappings in the framework hilbert spaces strong convergence of the sequences generated by the purposed iterative scheme is obtained

a new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization abstract in this paper we introduce a new iterative scheme for finding a common element of the set of solutions of an equilibrium problem the set of common fixed point for a family of infinitely nonexpansive mappings and the set of solutions of the variational inequality for inverse strongly monotone mappings in a hilbert space under suitable conditions some strong convergence theorems for approximating a common element of the above three sets are obtained as applications at the end of the paper we utilize our results to study the optimization problem and some convergence problem for strictly pseudocontractive mappings the results presented in the paper extend and improve some recent results of yao and yao y y yao j c yao on modified iterative method for nonexpansive mappings and monotone mappings appl math comput 186 2 2007 1551 1558 plubtieng and punpaeng s plubtieng r punpaeng a new iterative method for equilibrium problems and fixed point problems of nonlinear mappings and monotone mappings appl math comput 2007 doi 10 1016 j amc 2007 07 075 s takahashi and w takahashi s takahashi w takahashi viscosity approximation methods for equilibrium problems and fixed point problems in hilbert spaces j math anal appl 331 2006 506 515 su shang and qin y f su m j shang x l qin an iterative method of solution for equilibrium and optimization problems nonlinear anal 2007 doi 10 1016 j na 2007 08 045 and chang cho and kim s s chang y j cho j k kim approximation methods of solutions for equilibrium problem in hilbert spaces dynam systems appl in print