Is there an equivalent of Parseval's theorem for wavelets?Wavelets and cryptographyData fusion using 2d discrete wavelet transform (DWT)Nonlinear wavelets transform?Wavelets in time series predictionsDoes windowing affect Parseval's theorem?Parseval's Theorm and Effective BandwidthBand energy and Parseval theoremChecking Parseval's Theorem for Gaussian Signal by Using ScipyWhat are the constraints in design of discrete orthogonal wavelets?Is the convolution between a decomposition and reconstruction filter a scalar?

What could a reptilian race tell by candling their eggs?

How did Lefschetz do mathematics without hands?

Why would anyone even use a Portkey?

Chords behaving as a melody

Is there a canon reason why Klingon and Romulan vessels are so similar in shape?

Donkey as Democratic Party symbolic animal

What's the rule for a natural 20 on a Perception check?

Could a Weapon of Mass Destruction, targeting only humans, be developed?

Who voices the character "Finger" in The Fifth Element?

Procedurally generate regions on island

Details of video memory access arbitration in Space Invaders

My colleague is constantly blaming me for his errors

Symbol for "not absolutely continuous" in Latex

Can I travel from Germany to England alone as an unaccompanied minor?

What is the purpose of putting a capacitor on the primary side of a step-down transformer?

How would an order of Monks that renounce their names communicate effectively?

What game is this character in the Pixels movie from?

Security Patch SUPEE-11155 - Possible issues?

How can my story take place on Earth without referring to our existing cities and countries?

How exactly is a normal force exerted, at the molecular level?

Is it bad to describe a character long after their introduction?

Is there reliable evidence that depleted uranium from the 1999 NATO bombing is causing cancer in Serbia?

What does grep -v "grep" mean and do?

What's the safest way to inform a new user of their password on an invite-only website?



Is there an equivalent of Parseval's theorem for wavelets?


Wavelets and cryptographyData fusion using 2d discrete wavelet transform (DWT)Nonlinear wavelets transform?Wavelets in time series predictionsDoes windowing affect Parseval's theorem?Parseval's Theorm and Effective BandwidthBand energy and Parseval theoremChecking Parseval's Theorem for Gaussian Signal by Using ScipyWhat are the constraints in design of discrete orthogonal wavelets?Is the convolution between a decomposition and reconstruction filter a scalar?






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








3












$begingroup$


Parseval's theorem can be interpreted as:




... the total energy of a signal can be calculated by summing power-per-sample across time or spectral power across frequency.




For the case of a signal $x(t)$ and its Fourier transform $X(omega)$, the theorem says:



$$
int^2 ; dt = intX(omega)
$$



For the case of discrete wavelet transform (DWT), or wavelet packet decomposition (WPD), we get a 2D array of coefficients along the time and frequency (or scale) axis:



 |
| c1,f
| ...
freq | c1,2
| c1,1 c2, 1 ... ct, 1
|______________________________
time


Can a sum of this series somehow be understood as a signal's energy? Is there an equivalent rule to Parseval's theorem?










share|improve this question









$endgroup$


















    3












    $begingroup$


    Parseval's theorem can be interpreted as:




    ... the total energy of a signal can be calculated by summing power-per-sample across time or spectral power across frequency.




    For the case of a signal $x(t)$ and its Fourier transform $X(omega)$, the theorem says:



    $$
    int^2 ; dt = intX(omega)
    $$



    For the case of discrete wavelet transform (DWT), or wavelet packet decomposition (WPD), we get a 2D array of coefficients along the time and frequency (or scale) axis:



     |
    | c1,f
    | ...
    freq | c1,2
    | c1,1 c2, 1 ... ct, 1
    |______________________________
    time


    Can a sum of this series somehow be understood as a signal's energy? Is there an equivalent rule to Parseval's theorem?










    share|improve this question









    $endgroup$














      3












      3








      3





      $begingroup$


      Parseval's theorem can be interpreted as:




      ... the total energy of a signal can be calculated by summing power-per-sample across time or spectral power across frequency.




      For the case of a signal $x(t)$ and its Fourier transform $X(omega)$, the theorem says:



      $$
      int^2 ; dt = intX(omega)
      $$



      For the case of discrete wavelet transform (DWT), or wavelet packet decomposition (WPD), we get a 2D array of coefficients along the time and frequency (or scale) axis:



       |
      | c1,f
      | ...
      freq | c1,2
      | c1,1 c2, 1 ... ct, 1
      |______________________________
      time


      Can a sum of this series somehow be understood as a signal's energy? Is there an equivalent rule to Parseval's theorem?










      share|improve this question









      $endgroup$




      Parseval's theorem can be interpreted as:




      ... the total energy of a signal can be calculated by summing power-per-sample across time or spectral power across frequency.




      For the case of a signal $x(t)$ and its Fourier transform $X(omega)$, the theorem says:



      $$
      int^2 ; dt = intX(omega)
      $$



      For the case of discrete wavelet transform (DWT), or wavelet packet decomposition (WPD), we get a 2D array of coefficients along the time and frequency (or scale) axis:



       |
      | c1,f
      | ...
      freq | c1,2
      | c1,1 c2, 1 ... ct, 1
      |______________________________
      time


      Can a sum of this series somehow be understood as a signal's energy? Is there an equivalent rule to Parseval's theorem?







      wavelet signal-energy dwt parseval






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 9 hours ago









      hazrmardhazrmard

      1287 bronze badges




      1287 bronze badges




















          1 Answer
          1






          active

          oldest

          votes


















          4












          $begingroup$

          Yes indeed! In theory as long as the wavelet is orthogonal, the sum of the squares of all the coefficients should be equal to the energy of the signal. In practice, one should be careful that:



          • the decomposition is not "expansive", i.e. the number of samples and of coefficients is the same.

          • wavelet filter coefficients are not re-scaled, as happens in some applications (like lifting wavelets, to keep integer computations).

          • wavelets are orthogonal (this is not the case in JPEG2000 compression).

          You can verify this indirectly, looking at approximation coefficients. At each level, their number of samples is halved, and their amplitudes have around a $1.4$ scale factor, which is just $sqrt2$. This feature is used for instance to estimate the Gaussian noise power from wavelet coefficients:



          $$ hatsigma = textrmmedian (w_i)/0.6745$$



          A little further, there is a notion that generalizes (orthonormal) bases: frames. A set of functions $(phi_i)_iin mathcalI$ ($mathcalI$ is a finite or infinite index set) is a frame if for all vectors $x$:



          $$ C_flat|x|^2 le sum_iin mathcalI |<x,phi_i>|^2le C_sharp|x|^2$$



          with $0<C_flat,C_sharp < infty$. This is a more general Parseval-Plancherel-like result used for general wavelets.



          In other words, it "approximately preserves energy" by projection (inner product). If the constants $ C_flat$ and $C_sharp $ are equal, the frame is said to be tight. Orthonormal bases are non-redundant sets of vectors with $ C_flat=C_sharp = 1 $.






          share|improve this answer











          $endgroup$















            Your Answer








            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "295"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            bindNavPrevention: true,
            postfix: "",
            imageUploader:
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            ,
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdsp.stackexchange.com%2fquestions%2f59113%2fis-there-an-equivalent-of-parsevals-theorem-for-wavelets%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            4












            $begingroup$

            Yes indeed! In theory as long as the wavelet is orthogonal, the sum of the squares of all the coefficients should be equal to the energy of the signal. In practice, one should be careful that:



            • the decomposition is not "expansive", i.e. the number of samples and of coefficients is the same.

            • wavelet filter coefficients are not re-scaled, as happens in some applications (like lifting wavelets, to keep integer computations).

            • wavelets are orthogonal (this is not the case in JPEG2000 compression).

            You can verify this indirectly, looking at approximation coefficients. At each level, their number of samples is halved, and their amplitudes have around a $1.4$ scale factor, which is just $sqrt2$. This feature is used for instance to estimate the Gaussian noise power from wavelet coefficients:



            $$ hatsigma = textrmmedian (w_i)/0.6745$$



            A little further, there is a notion that generalizes (orthonormal) bases: frames. A set of functions $(phi_i)_iin mathcalI$ ($mathcalI$ is a finite or infinite index set) is a frame if for all vectors $x$:



            $$ C_flat|x|^2 le sum_iin mathcalI |<x,phi_i>|^2le C_sharp|x|^2$$



            with $0<C_flat,C_sharp < infty$. This is a more general Parseval-Plancherel-like result used for general wavelets.



            In other words, it "approximately preserves energy" by projection (inner product). If the constants $ C_flat$ and $C_sharp $ are equal, the frame is said to be tight. Orthonormal bases are non-redundant sets of vectors with $ C_flat=C_sharp = 1 $.






            share|improve this answer











            $endgroup$

















              4












              $begingroup$

              Yes indeed! In theory as long as the wavelet is orthogonal, the sum of the squares of all the coefficients should be equal to the energy of the signal. In practice, one should be careful that:



              • the decomposition is not "expansive", i.e. the number of samples and of coefficients is the same.

              • wavelet filter coefficients are not re-scaled, as happens in some applications (like lifting wavelets, to keep integer computations).

              • wavelets are orthogonal (this is not the case in JPEG2000 compression).

              You can verify this indirectly, looking at approximation coefficients. At each level, their number of samples is halved, and their amplitudes have around a $1.4$ scale factor, which is just $sqrt2$. This feature is used for instance to estimate the Gaussian noise power from wavelet coefficients:



              $$ hatsigma = textrmmedian (w_i)/0.6745$$



              A little further, there is a notion that generalizes (orthonormal) bases: frames. A set of functions $(phi_i)_iin mathcalI$ ($mathcalI$ is a finite or infinite index set) is a frame if for all vectors $x$:



              $$ C_flat|x|^2 le sum_iin mathcalI |<x,phi_i>|^2le C_sharp|x|^2$$



              with $0<C_flat,C_sharp < infty$. This is a more general Parseval-Plancherel-like result used for general wavelets.



              In other words, it "approximately preserves energy" by projection (inner product). If the constants $ C_flat$ and $C_sharp $ are equal, the frame is said to be tight. Orthonormal bases are non-redundant sets of vectors with $ C_flat=C_sharp = 1 $.






              share|improve this answer











              $endgroup$















                4












                4








                4





                $begingroup$

                Yes indeed! In theory as long as the wavelet is orthogonal, the sum of the squares of all the coefficients should be equal to the energy of the signal. In practice, one should be careful that:



                • the decomposition is not "expansive", i.e. the number of samples and of coefficients is the same.

                • wavelet filter coefficients are not re-scaled, as happens in some applications (like lifting wavelets, to keep integer computations).

                • wavelets are orthogonal (this is not the case in JPEG2000 compression).

                You can verify this indirectly, looking at approximation coefficients. At each level, their number of samples is halved, and their amplitudes have around a $1.4$ scale factor, which is just $sqrt2$. This feature is used for instance to estimate the Gaussian noise power from wavelet coefficients:



                $$ hatsigma = textrmmedian (w_i)/0.6745$$



                A little further, there is a notion that generalizes (orthonormal) bases: frames. A set of functions $(phi_i)_iin mathcalI$ ($mathcalI$ is a finite or infinite index set) is a frame if for all vectors $x$:



                $$ C_flat|x|^2 le sum_iin mathcalI |<x,phi_i>|^2le C_sharp|x|^2$$



                with $0<C_flat,C_sharp < infty$. This is a more general Parseval-Plancherel-like result used for general wavelets.



                In other words, it "approximately preserves energy" by projection (inner product). If the constants $ C_flat$ and $C_sharp $ are equal, the frame is said to be tight. Orthonormal bases are non-redundant sets of vectors with $ C_flat=C_sharp = 1 $.






                share|improve this answer











                $endgroup$



                Yes indeed! In theory as long as the wavelet is orthogonal, the sum of the squares of all the coefficients should be equal to the energy of the signal. In practice, one should be careful that:



                • the decomposition is not "expansive", i.e. the number of samples and of coefficients is the same.

                • wavelet filter coefficients are not re-scaled, as happens in some applications (like lifting wavelets, to keep integer computations).

                • wavelets are orthogonal (this is not the case in JPEG2000 compression).

                You can verify this indirectly, looking at approximation coefficients. At each level, their number of samples is halved, and their amplitudes have around a $1.4$ scale factor, which is just $sqrt2$. This feature is used for instance to estimate the Gaussian noise power from wavelet coefficients:



                $$ hatsigma = textrmmedian (w_i)/0.6745$$



                A little further, there is a notion that generalizes (orthonormal) bases: frames. A set of functions $(phi_i)_iin mathcalI$ ($mathcalI$ is a finite or infinite index set) is a frame if for all vectors $x$:



                $$ C_flat|x|^2 le sum_iin mathcalI |<x,phi_i>|^2le C_sharp|x|^2$$



                with $0<C_flat,C_sharp < infty$. This is a more general Parseval-Plancherel-like result used for general wavelets.



                In other words, it "approximately preserves energy" by projection (inner product). If the constants $ C_flat$ and $C_sharp $ are equal, the frame is said to be tight. Orthonormal bases are non-redundant sets of vectors with $ C_flat=C_sharp = 1 $.







                share|improve this answer














                share|improve this answer



                share|improve this answer








                edited 6 hours ago

























                answered 7 hours ago









                Laurent DuvalLaurent Duval

                17.3k3 gold badges21 silver badges66 bronze badges




                17.3k3 gold badges21 silver badges66 bronze badges



























                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to Signal Processing Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid


                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.

                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdsp.stackexchange.com%2fquestions%2f59113%2fis-there-an-equivalent-of-parsevals-theorem-for-wavelets%23new-answer', 'question_page');

                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                    Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                    Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її