Ahlem Ouaddah
ABSTRACT
Image reconstruction from projections in tomography is an ill-posed, inverse problem. This problem is always a challenge because there are no standard methods which give satisfactory results. In this paper we propose hybridization between Local Search (LS) and Harmony Search (HS) metaheuristics to improve quality of reconstructed images. The proposed method is implemented, tested on some images and compared to LS and Filtered backprojection (FBP) methods. The preliminary results are promising and prove the efficiency of our method.
- Fessler, J.: Analytical Tomographic Image Reconstruction Methods., Chapter 3, November 19 (2009).Google Scholar
- Geem, Z. W., Kim, J. H. and Loganathan, G. V.: A new heuristic optimization algorithm: Harmony search. Simulation, 76:60--68. (2001).Google ScholarCross Ref
- Mou, C., Pen, L.,Yao, D., Xiao, D.: Image Reconstruction Using a Genetic Algorithm for Electrical Capacitance Tomography, Tsinghua science and technology, ISSN 1007-0214 12/20, vol. 10 No. 5, 587--592 October (2005).Google Scholar
- Ouaddah, A. and Boughaci, D.: Local Search Method for Image Reconstruction with Same Concentration in Tomography, Advances in Intelligent and Soft Computing Springer Series, SIRS (2014).Google ScholarCross Ref
- Qureshi, S. A., Mirza, S. M. and Arif, M.: A Hybrid Continuous Genetic Algorithm for Parallelray Transmission Tomography Image Reconstruction, Journal of Biomedical Informatics, in Process (2006).Google Scholar
- Radon J. On the determination of functions from their integrals along certain manifolds {in German}. Math Phys Klass. 69:262--277 (1917).Google Scholar
- Vadivel, A., Majumdar, A. K. and Sural, S.: Performance Comparison of Distance Metrics in Content-based Image Retrieval Applications. International Conference on Information Technology (CIT), Bhubaneswar, India, 159--164 (2003).Google Scholar
Index Terms
- Improving reconstructed images using hybridization between local search and harmony search meta-heuristics
Recommendations
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-...
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search
An effective hybridisation of adaptive VNS with LNS is proposed.Intelligent selection mechanism is integrated in the local search of the AVNS.Introduction of effective data structure and a neighbourhood reduction scheme.A novel implementation of LNS ...
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
The quadratic multiple knapsack problem (QMKP) concerns assigning a set of objects, which interact among themselves through paired profit values, to a set of capacity-constrained knapsacks such that the overall profit of the objects included in the ...
Comments