Asymptotic minimax bounds for stochastic deconvolution over groups
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Koo, Ja-Yong | - |
dc.contributor.author | Kim, Peter T. | - |
dc.date.accessioned | 2021-09-09T12:59:00Z | - |
dc.date.available | 2021-09-09T12:59:00Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2008-01 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/124501 | - |
dc.description.abstract | This paper examines stochastic deconvolution over noncommutative compact Lie groups. This involves Fourier analysis on compact Lie groups as well as convolution products over such groups. An observation process consisting of a known impulse response function convolved with an unknown signal with additive white noise is assumed. Data collected through the observation process then allow us to construct an estimator of the signal. Signal recovery is then assessed through integrated mean squared error for which the main results show that asymptotic minimaxity depends on smoothness properties of the impulse response function. Thus, if the Fourier transform of the impulse response function is bounded polynomially, then the asymptotic minimax signal recovery is polynomial, while if the Fourier transform of the impulse response function is exponentially bounded, then the asymptotic minimax signal recovery is logarithmic. Such investigations have been previously considered in both the engineering and statistics literature with applications in among others, medical imaging, robotics, and polymer science. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | EXPONENTIAL FOURIER-DENSITIES | - |
dc.subject | OPTIMAL RATES | - |
dc.subject | CONVERGENCE | - |
dc.subject | ERROR | - |
dc.title | Asymptotic minimax bounds for stochastic deconvolution over groups | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Koo, Ja-Yong | - |
dc.identifier.doi | 10.1109/TIT.2007.911263 | - |
dc.identifier.scopusid | 2-s2.0-38349092367 | - |
dc.identifier.wosid | 000252256900019 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.54, no.1, pp.289 - 298 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.title | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.citation.volume | 54 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 289 | - |
dc.citation.endPage | 298 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | EXPONENTIAL FOURIER-DENSITIES | - |
dc.subject.keywordPlus | OPTIMAL RATES | - |
dc.subject.keywordPlus | CONVERGENCE | - |
dc.subject.keywordPlus | ERROR | - |
dc.subject.keywordAuthor | fourier analysis on groups | - |
dc.subject.keywordAuthor | Hellinger distance | - |
dc.subject.keywordAuthor | irreducible characters | - |
dc.subject.keywordAuthor | irreducible representations | - |
dc.subject.keywordAuthor | positive roots | - |
dc.subject.keywordAuthor | Sobolev class | - |
dc.subject.keywordAuthor | weights | - |
dc.subject.keywordAuthor | Weyl&apos | - |
dc.subject.keywordAuthor | s formula | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.