Response to the comments on "Fundamental limits of reconstruction-based superresolution algorithms under local translation"

Author

Lin, Zhouchen ; Shum, Heung-Yeung

Author_Institution

Microsoft Res. Asia, Beijing, China

Volume

28

Issue

5

fYear

2006

fDate

5/1/2006 12:00:00 AM

Firstpage

847

Abstract

Wang and Feng (IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 5, p 846, May 2006) pointed out that the deduction in (Z. Lin and H. Y. Shum, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004) overlooked the validity of the perturbation theorem used in (Z. Lin and H. Y. Shum, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004). In this paper, we show that, when the perturbation theorem is invalid, the probability of successful superresolution is very low. Therefore, we only have to derive the limits under the condition that validates the perturbation theorem, as done in (Z. Lin and H. Y. Shum, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004).

Keywords

algorithm theory; boundary-value problems; perturbation techniques; fundamental limits; local translation; perturbation theorem; reconstruction-based superresolution algorithms; Image resolution; Strontium; Upper bound; Superresolution; perturbation theory.; reconstruction-based algorithms;

fLanguage

English

Journal_Title

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Publisher

ieee

ISSN

0162-8828

Type

jour

DOI

10.1109/TPAMI.2006.105

Filename

1608049