Related Experiment Video
Updated: May 29, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
The converging squares algorithm: an efficient method for locating peaks in multidimensions
1Department of Electrical Engineering and the Robotics Institute, Carnegie-Mellon University, Pittsburgh, PA 15213; Bell Laboratories, Murray Hill, NJ 07974.
Abstract:
The converging squares algorithm is a method for locating peaks in sampled data of two dimensions or higher. There are two primary advantages of this algorithm over conventional methods. First, it is robust with respect to noise and data type. There are no empirical parameters to permit adjustment of the process, so results are completely objective. Second, 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 two-dimensional data, and is described for three-dimensional data. Quantitative comparisons of computation are made with two conventional peak picking methods. Applications to biomedical image analysis, and for industrial inspection tasks are discussed.
Related Concept Videos
Chromatographic Resolution
The effectiveness of separation can be evaluated by determining the level of separation between two neighboring peaks in a chromatogram, which represents the individual components of a sample.
In chromatography,...
Area Computation by the Alternative Coordinate Method
Parallel-Axis Theorem for an Area
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...
Parallel-axis Theorem
Area Problem
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...

