Response to the Comments on "Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation'

RSS feed for this publication

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.105

May 2006 (vol. 28 no. 5) pp. 847

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Zhouchen Lin Articles by Heung-Yeung Shum

	ASCII Text	x
	Zhouchen Lin, Heung-Yeung Shum, "Response to the Comments on "Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation'," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 5, pp. 847, May, 2006.

	BibTex	x
	@article{ 10.1109/TPAMI.2006.105, author = {Zhouchen Lin and Heung-Yeung Shum}, title = {Response to the Comments on "Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation'}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, number = {5}, issn = {0162-8828}, year = {2006}, pages = {847}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.105}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Response to the Comments on "Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation' IS - 5 SN - 0162-8828 SP EP EPD - 847 A1 - Zhouchen Lin, A1 - Heung-Yeung Shum, PY - 2006 KW - Superresolution KW - reconstruction-based algorithms KW - perturbation theory. VL - 28 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER -

Zhouchen Lin, IEEE

Heung-Yeung Shum, IEEE

Wang and Feng [1] pointed out that the deduction in [2] overlooked the validity of the perturbation theorem used in [2]. 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 [2].

[1] 847 L. Wang and J. Feng, “Comments on `Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation',” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 5, p. 846, May 2006.
[2] Z. Lin and H.-Y. Shum, “Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 83-97, Jan. 2004.
[3] G.H. Golub and C.F. Van Loan, Matrix Computations, third ed. Baltimore: The John Hopkins Univ. Press, 1996.
[4] S. Baker and T. Kanade, “Limits on Super-Resolution and How to Break Them,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1167-1183, Sept. 2002.

Index Terms:

Superresolution, reconstruction-based algorithms, perturbation theory.

Citation:

Zhouchen Lin, Heung-Yeung Shum, "Response to the Comments on "Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation'," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 5, pp. 847, May 2006, doi:10.1109/TPAMI.2006.105

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.