The converging squares algorithm: An efficient multidimensional peak picking method
Conference Paper, Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '83), pp. 112 - 115, April, 1983
Abstract
The converging squares algorithm is a method for locating peaks in sampled data of 2 dimensions or higher. There are two primary advantages of this algorithm over other conventional methods. First, it is robust with respect to noise and data type. There are no empirical parameters to allow adjustment of the process, so results are completely objective. Secondly, the method is computationally efficient. The inherent structure of the algorithm is that of a resolution pyramid. This enhances computational efficiency as well as contributing to the quality of noise immunity of the method. The algorithm is detailed for 2-dimensional data. Quantitative comparisons of computation are made with two conventional peak picking methods.
BibTeX
@conference{O'Gorman-1983-15145,author = {L. O'Gorman and Arthur C. Sanderson},
title = {The converging squares algorithm: An efficient multidimensional peak picking method},
booktitle = {Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '83)},
year = {1983},
month = {April},
pages = {112 - 115},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.