** Next:** Random bounds
** Up:** Methodology
** Previous:** Methodology

To apply this segmentation method to seismic data, the weight calculation needs to be modified. Rather than looking for clusters of pixels with similar intensity, we are now looking for groups of pixels on each side of the bright amplitude salt boundary. Therefore, we want the weights connecting pixels on either side of the salt boundary to be low and the weights connecting pixels on the same side of the salt boundary to be relatively high. Taking the negative of the maximum amplitude along the shortest path between two nodes as the weight would insure that the weights connecting pixels on either side of the salt boundary will be low. However weights on the same side would be alternating from low to high as they go from peak to trough on the seismic data. This could make the grouping more uncertain. To correct this problem, we take the negative of the maximum of the absolute value of the complex trace (instantaneous amplitude) along the shortest path between two nodes.
is a vector representing the shortest path between two nodes and but excluding the nodes themselves. The weight connecting two nodes and is determined from the minimum of the negative instantaneous amplitude *A* sampled along and a user specified tolerance as:

| |
(3) |

The algorithm as designed by Shi and Malik (2000) is capable of using weights that are real-valued instead of binary as we are using here. We have found thus far that binary weights give the best results, but we still wish to experiment with real-valued weights. If we determine that binary weights are the best way to go, then we can take advantage of the cost savings of using logical arrays instead of real.

** Next:** Random bounds
** Up:** Methodology
** Previous:** Methodology
Stanford Exploration Project

4/5/2006