Translator Disclaimer
Paper
3 April 1997 Multiple-resolution clustering for recursive divide and conquer
Author Affiliations +
Abstract
In recent work, a recursive divide-and-conquer approach was developed for path-minimization problems such as the traveling salesman problem (TSP). The approach is based on multiple-resolution clustering to decompose a problem into minimally-dependent parts. It is particularly effective for large-scale, fractal data sets, which exhibit clustering on all scales, and hence at all resolutions. This leads to the application of wavelets for performing the necessary multiple-resolution clustering. While the general topic of multiple-resolution clustering via wavelets is relatively immature, it has been explored for certain specific applications. However, nothing in the literature addresses the specific type of multiple-resolution clustering needed for the divide-and-conquer approach. That is the primary goal of this paper.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Steven E. Noel and Harold H. Szu "Multiple-resolution clustering for recursive divide and conquer", Proc. SPIE 3078, Wavelet Applications IV, (3 April 1997); https://doi.org/10.1117/12.271725
PROCEEDINGS
14 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Wavelet analysis of DNA sequences
Proceedings of SPIE (September 01 1995)
Image denoising using fractal- and wavelet-based methods
Proceedings of SPIE (February 27 2004)
Discrete wavelet approach to multifractality
Proceedings of SPIE (December 04 2000)
Self-similar random vector fields and their wavelet analysis
Proceedings of SPIE (September 04 2009)
A new method to estimate 1/<i>f</i> signals
Proceedings of SPIE (October 24 2006)

Back to Top