Genetic optimization mapping applied to medical image segmentation

Pierre-Richard Jean Cornely

Article ID: 830
Vol 2, Issue 1, 2019

VIEWS - 366 (Abstract) 168 (PDF)

Abstract


A number of important optimization problems have been classified as mapping applied towards segmentation of important features. The segmentation of important features can be formulated as configurational mapping problems by representing mapping configurations as solutions to problems of interest. One example of such configuration mapping is found in image segmentation where an image can be represented as unique subsets of a complete image and then evolved through mapping to become a segment of specific interest within an image. An effective segmentation mapping algorithm must determine the specific image subsets of an image field that best exhibit an a priori set of quantitative and qualitative characteristics. In this paper, a Genetic Optimization Mapping Algorithm is used to produce a population of sub-images, characteristic of specific image subsets of interest that were tested via a quantitative objective function, ranked using a linear fitness scheme, and modified using a genetic Crossover operator. The mapping algorithm is found to converge, within fifty to one hundred generations of maps, to a good fit to the targeted mapping configuration in a very robust and efficient manner.


Keywords


Genetic Mapping; image processing; medical image segmentation; texture Segmentation

Full Text:

PDF


References


1. Beck J, Prazdny L, Rosenfeld A. A theory of textural segmentation, Human and Machine Vision. New-York Academic Press, 1983.

2. Blostein D, Ahuja N. Representation and three-dimensional interpretation of image texture: An integrated approach, In Proc. First Int. Conf. Computer Vision 1987, 444-449.

3. Byrne LC. Iterative image reconstruction based on cross entropy minimization. IEEE Transactions on image processing 1993; 2(1): 96-103.

4. Clark M, Bovik AC. Texture Segmentation using Gabor modulation/demodulation. Pattern Recognition Lett 1987; 6, 261-267.

5. Coggins JM., Jain AK. A spatial filtering approach to texture analysis. Pattern Recognition Lett 1985; 3, 195-203.

6. Cross GC., Jain AK. Markov random field texture model. IEEE Trans. Pattern Anal. Machine Intell., PAMI 1983; 5, 25-39.

7. Davis EG. Genetic Algorithms, Reading Massachusetts. Addison-Wesley, 1989.

8. Dejong K. Learning with Genetic algorithms: An overview, Machine Learning. 1988; 3, 212-138.

9. Dejong K. A 10 year prospective, in Proc. Int. Conf. Genetic Algorithms, Their Applications, 1985, 169-177.

10. Keren D, Kooper D. Describing complicated objects using polynomials. IEEE Trans. on Pattern Analysis and machine Intelligence 1994, 16.

11. Holland JH. Adaptation in natural and artificial systems, Ann Arbor, University of Michigan Press, 1975.

12. Lawrence D. Handbook on Genetic Algorithms, New-York, Van Nostrand Reinhold, 1991.

13. Lawrence D, Steenstrup M. Genetic Optimization and Simulated annealing, In Genetic Algorithms and Simulated Annealing, L. Davis, Ed. London, Pitman, 1987, 1-11.

14. Leehter Y, Sethares WA. Non linear parameter estimation via Genetic Algorithm. IEEE Trans, Signal Processing 1994; 42, 4.

15. Turner MR. Texture discrimination by Gabor functions. Biol Cybern 1986; 55, 71-82, 1986.

16. Vignaux GA., Michalewicz Z. A Genetic Algorithm for the linear transportation problem. IEEE Trans. Syst. Man Cybern 1991; 21, 445-452.




DOI: https://doi.org/10.24294/jgc.v2i1.830

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Creative Commons License

This site is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.