The Experts below are selected from a list of 807111 Experts worldwide ranked by ideXlab platform
Peter Balazs - One of the best experts on this subject based on the ideXlab platform.
-
Detailed Characterization of Conditions for the Unconditional Convergence and Invertibility of Multipliers
Sampling Theory Signal Processing and Data Analysis, 2013Co-Authors: Diana T Stoeva, Peter BalazsAbstract:In this paper we investigate the unconditional convergence and Invertibility of multipliers M _ m ,Φ,Ψ depending on the properties of the sequences Ψ, Φ and m . We determine if unconditional convergence and Invertibility is always, sometimes or never possible for the complete set of possibilities for the sequences Φ and Ψ: non-Bessel sequences, Bessel non-frames, frames non-Riesz bases, Riesz bases, combined with all the possibilities for norm-boundedness; and varying the weighting sequence m to be semi-normalized, bounded or non-bounded. The results are collected in tables as a convenient reference.
-
Invertibility of multipliers
Applied and Computational Harmonic Analysis, 2012Co-Authors: Diana T Stoeva, Peter BalazsAbstract:Abstract In the present paper the Invertibility of multipliers is investigated in detail. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or necessary conditions for Invertibility are determined depending on the properties of the analysis and synthesis sequences, as well as the symbol. Examples are given, showing that the established bounds are sharp. If a multiplier is invertible, a formula for the inverse operator is determined and n-term error bounds are given. The case when one of the sequences is a Riesz basis is completely characterized.
-
unconditional convergence and Invertibility of multipliers
arXiv: Functional Analysis, 2009Co-Authors: Diana T Stoeva, Peter BalazsAbstract:In the present paper the unconditional convergence and the Invertibility of multipliers is investigated. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or necessary conditions for unconditional convergence and Invertibility are determined depending on the properties of the analysis and synthesis sequences, as well as the symbol. Examples which show that the given assertions cover different classes of multipliers are given. If a multiplier is invertible, a formula for the inverse operator is determined. The case when one of the sequences is a Riesz basis is completely characterized.
Shuozhong Wang - One of the best experts on this subject based on the ideXlab platform.
-
Watermarking Protocol Compatible with Secret Algorithms for Resisting Invertibility Attack
Knowledge-Based Intelligent Information and Engineering Systems, 2005Co-Authors: Xinpeng Zhang, Shuozhong WangAbstract:Invertibility attack is a hostile measure to breach watermarking systems. In this paper, a novel watermarking protocol using a one-way hash function and a check of random watermarks is proposed in order to combat Invertibility attacks. The described technique can be used in conjunction with any watermarking algorithm, no matter it is kept secret or made public, without resorting to a third party jury as required by some previous approaches. By introducing a set of reference sequences, segmentation of the digital information and iterative computation of watermarks, the protocol is further enhanced so that it can resist more sophisticated types of attack based on forging an illegitimate detector.
Diana T Stoeva - One of the best experts on this subject based on the ideXlab platform.
-
Detailed Characterization of Conditions for the Unconditional Convergence and Invertibility of Multipliers
Sampling Theory Signal Processing and Data Analysis, 2013Co-Authors: Diana T Stoeva, Peter BalazsAbstract:In this paper we investigate the unconditional convergence and Invertibility of multipliers M _ m ,Φ,Ψ depending on the properties of the sequences Ψ, Φ and m . We determine if unconditional convergence and Invertibility is always, sometimes or never possible for the complete set of possibilities for the sequences Φ and Ψ: non-Bessel sequences, Bessel non-frames, frames non-Riesz bases, Riesz bases, combined with all the possibilities for norm-boundedness; and varying the weighting sequence m to be semi-normalized, bounded or non-bounded. The results are collected in tables as a convenient reference.
-
Invertibility of multipliers
Applied and Computational Harmonic Analysis, 2012Co-Authors: Diana T Stoeva, Peter BalazsAbstract:Abstract In the present paper the Invertibility of multipliers is investigated in detail. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or necessary conditions for Invertibility are determined depending on the properties of the analysis and synthesis sequences, as well as the symbol. Examples are given, showing that the established bounds are sharp. If a multiplier is invertible, a formula for the inverse operator is determined and n-term error bounds are given. The case when one of the sequences is a Riesz basis is completely characterized.
-
unconditional convergence and Invertibility of multipliers
arXiv: Functional Analysis, 2009Co-Authors: Diana T Stoeva, Peter BalazsAbstract:In the present paper the unconditional convergence and the Invertibility of multipliers is investigated. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or necessary conditions for unconditional convergence and Invertibility are determined depending on the properties of the analysis and synthesis sequences, as well as the symbol. Examples which show that the given assertions cover different classes of multipliers are given. If a multiplier is invertible, a formula for the inverse operator is determined. The case when one of the sequences is a Riesz basis is completely characterized.
Philip A Haile - One of the best experts on this subject based on the ideXlab platform.
-
connected substitutes and Invertibility of demand
Econometrica, 2013Co-Authors: Steven Berry, Amit Gandhi, Philip A HaileAbstract:We consider the Invertibility (injectivity) of a nonparametric nonseparable demand system. Invertibility of demand is important in several contexts, including identification of demand, estimation of demand, testing of revealed preference, and economic theory exploiting existence of an inverse demand function or (in an exchange economy) uniqueness of Walrasian equilibrium prices. We introduce the notion of "connected substitutes" and show that this structure is sufficient for Invertibility. The connected substitutes conditions require weak substitution between all goods and sufficient strict substitution to necessitate treating them in a single demand system. The connected substitutes conditions have transparent economic interpretation, are easily checked, and are satisfied in many standard models. They need only hold under some transformation of demand and can accommodate many models in which goods are complements. They allow one to show Invertibility without strict gross substitutes, functional form restrictions, smoothness assumptions, or strong domain restrictions. When the restriction to weak substitutes is maintained, our sufficient conditions are also "nearly necessary" for even local Invertibility. [PUBLICATION ABSTRACT]
-
connected substitutes and Invertibility of demand
2011Co-Authors: Steven Berry, Amit Gandhi, Philip A HaileAbstract:We consider the Invertibility of a nonparametric nonseparable demand system. Invertibility of demand is important in several contexts, including identification of demand, estimation of demand, testing of revealed preference, and economic theory requiring uniqueness of market clearing prices. We introduce the notion of, "connected substitutes," and show that this structure is sufficient for Invertibility. The connected substitutes conditions require weak substitution between all goods and sufficient strict substitution to necessitate treating them in a single demand system. These conditions are satisfied in many standard models, have transparent economic interpretation, and allow us to show Invertibility without functional form restrictions, smoothness assumptions, or strong domain restrictions.
Xinpeng Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Watermarking Protocol Compatible with Secret Algorithms for Resisting Invertibility Attack
Knowledge-Based Intelligent Information and Engineering Systems, 2005Co-Authors: Xinpeng Zhang, Shuozhong WangAbstract:Invertibility attack is a hostile measure to breach watermarking systems. In this paper, a novel watermarking protocol using a one-way hash function and a check of random watermarks is proposed in order to combat Invertibility attacks. The described technique can be used in conjunction with any watermarking algorithm, no matter it is kept secret or made public, without resorting to a third party jury as required by some previous approaches. By introducing a set of reference sequences, segmentation of the digital information and iterative computation of watermarks, the protocol is further enhanced so that it can resist more sophisticated types of attack based on forging an illegitimate detector.
