A conjugate gradient method for the spectral partitioning of graphs
β Scribed by N.P. Kruyt
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 615 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
β¦ Synopsis
The partitioning of graphs is a frequently occurring problem in science and engineering. The spectral graph partitioning method is a promising heuristic method for this class of problems. Its main disadvantage is the large computing time required to solve a special eigenproblem. Here a simple and efficient method is proposed to reduce this computing time. This method is based on the conjugate gradient minimization method. The convergence properties of the new method are studied for the case of regular one-, two-, and three-dimensional grids. The influence of the aspect ratio of the graph on the convergence rate is also investigated.
π SIMILAR VOLUMES
## a b s t r a c t In most applications, denoising image is fundamental to subsequent image processing operations. This paper proposes a spectral conjugate gradient (CG) method for impulse noise removal, which is based on a two-phase scheme. The noise candidates are first identified by the adaptiv