<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
		<id>http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization</id>
		<title>Procedural Texture Evolution Using Multiobjective Optimization - Versionsgeschichte</title>
		<link rel="self" type="application/atom+xml" href="http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization"/>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization&amp;action=history"/>
		<updated>2026-05-09T16:12:01Z</updated>
		<subtitle>Versionsgeschichte dieser Seite in de_evolutionary_art_org</subtitle>
		<generator>MediaWiki 1.27.4</generator>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization&amp;diff=1247&amp;oldid=prev</id>
		<title>Gbachelier am 13. November 2014 um 10:41 Uhr</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization&amp;diff=1247&amp;oldid=prev"/>
				<updated>2014-11-13T10:41:41Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&#039;diff-marker&#039; /&gt;
				&lt;col class=&#039;diff-content&#039; /&gt;
				&lt;col class=&#039;diff-marker&#039; /&gt;
				&lt;col class=&#039;diff-content&#039; /&gt;
				&lt;tr style=&#039;vertical-align: top;&#039; lang=&#039;de&#039;&gt;
				&lt;td colspan=&#039;2&#039; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Nächstältere Version&lt;/td&gt;
				&lt;td colspan=&#039;2&#039; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Version vom 13. November 2014, 10:41 Uhr&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l20&quot; &gt;Zeile 20:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Zeile 20:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Ebert, D. S., Musgrave, F. K., Peachey, D., Perlin, K. and Worley, S.,Texturing and Modeling: a Procedural Approach, 2 ed., Academic Press, 1998.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Ebert, D. S., Musgrave, F. K., Peachey, D., Perlin, K. and Worley, S.,Texturing and Modeling: a Procedural Approach, 2 ed., Academic Press, 1998.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Fonseca, C. M. and Fleming, P. J., “An Overview of Evolutionary Algorithms in Multiobjective Optimization,”Evolutionary Computation, 3, 1, pp. 1–16, 1995. &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;CrossRef&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Fonseca, C. M. and Fleming, P. J., “An Overview of Evolutionary Algorithms in Multiobjective Optimization,”Evolutionary Computation, 3, 1, pp. 1–16, 1995. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;http://dx.doi.org/10.1162/evco.1995.3.1.1&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Goldberg, D. E.,Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, 1989.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Goldberg, D. E.,Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, 1989.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l42&quot; &gt;Zeile 42:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Zeile 42:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Rowe, J., Vinsen, K. and Marvin, N., “Parallel GAs for Multiobjective Functions,” inProc. of the 2nd Nordic Workshop on Genetic Algorithms and their Applications (2NWGA), pp. 61–70, University of Vaasa, Finland, 1996.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Rowe, J., Vinsen, K. and Marvin, N., “Parallel GAs for Multiobjective Functions,” inProc. of the 2nd Nordic Workshop on Genetic Algorithms and their Applications (2NWGA), pp. 61–70, University of Vaasa, Finland, 1996.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Sims, K., “Interactive Evolution of Equations for Procedural Models,”The Visual Computer, 9, pp. 466–476, 1993. &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;CrossRef&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Sims, K., “Interactive Evolution of Equations for Procedural Models,”The Visual Computer, 9, pp. 466–476, 1993. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;http://dx.doi.org/10.1007/BF01888721&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Smith, J. R., “Integrated Spatial and Feature Image Systems: Retrieval, Analysis and Compression,” Ph.D. thesis, Center for Telecommunications Research, Graduate School of Arts and Sciences, Columbia University, 1997.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Smith, J. R., “Integrated Spatial and Feature Image Systems: Retrieval, Analysis and Compression,” Ph.D. thesis, Center for Telecommunications Research, Graduate School of Arts and Sciences, Columbia University, 1997.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l50&quot; &gt;Zeile 50:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Zeile 50:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Upstill, S.,The Renderman Companion: A Programmer’s Guide to Realistic Computer Graphics, Addison-Wesley, 1989.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Upstill, S.,The Renderman Companion: A Programmer’s Guide to Realistic Computer Graphics, Addison-Wesley, 1989.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Veldhuizen, D. A. van and Lamont, G. B., “Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art,”Evolutionary Computation, 8, 2, pp. 125–147, 2000, &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;CrossRef&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Veldhuizen, D. A. van and Lamont, G. B., “Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art,”Evolutionary Computation, 8, 2, pp. 125–147, 2000, &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;http://dx.doi.org/10.1162/106365600568158&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Watt, A. and Watt, M.,Advanced Animation and Rendering Techniques: Theory and Practice, ACM Press, 1992.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Watt, A. and Watt, M.,Advanced Animation and Rendering Techniques: Theory and Practice, ACM Press, 1992.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Wiens, A. L. and Ross, B. J., “Gentropy: Evolutionary 2D Texture Generation,”Computers and Graphics Journal, 26, 1, pp. 75–88, Feb. 2002. &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;CrossRef&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Wiens, A. L. and Ross, B. J., “Gentropy: Evolutionary 2D Texture Generation,”Computers and Graphics Journal, 26, 1, pp. 75–88, Feb. 2002. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;http://dx.doi.org/10.1016/S0097-8493(01)00159-5&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;#160;&amp;#160; &amp;#160; &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Zongker, D. and Punch, B.,lil-gp 1.0. User’s Manual, Dept. of Computer Science, Michigan State University, 1995.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Zongker, D. and Punch, B.,lil-gp 1.0. User’s Manual, Dept. of Computer Science, Michigan State University, 1995.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization&amp;diff=1246&amp;oldid=prev</id>
		<title>Gbachelier: Die Seite wurde neu angelegt: „ == Reference == Ross, B., Zhu, H. (2004). Procedural Texture Evolution Using Multiobjective Optimization. New Generation Computing, 22(3): 271–293.   == DOI…“</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Procedural_Texture_Evolution_Using_Multiobjective_Optimization&amp;diff=1246&amp;oldid=prev"/>
				<updated>2014-11-13T10:39:33Z</updated>
		
		<summary type="html">&lt;p&gt;Die Seite wurde neu angelegt: „ == Reference == Ross, B., Zhu, H. (2004). Procedural Texture Evolution Using Multiobjective Optimization. New Generation Computing, 22(3): 271–293.   == DOI…“&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Neue Seite&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Reference ==&lt;br /&gt;
Ross, B., Zhu, H. (2004). Procedural Texture Evolution Using Multiobjective Optimization. New Generation Computing, 22(3): 271–293. &lt;br /&gt;
&lt;br /&gt;
== DOI ==&lt;br /&gt;
http://link.springer.com/article/10.1007%2FBF03040964&lt;br /&gt;
&lt;br /&gt;
== Abstract ==&lt;br /&gt;
This paper investigates the application of evolutionary multi-objective optimization to two-dimensional procedural texture synthesis. Genetic programming is used to evolve procedural texture formulae. Earlier work used multiple feature tests during fitness evaluation to rate how closely a candidate texture matches visual characteristics of a target texture image. These feature test scores were combined into an overall fitness score using a weighted sum. This paper improves this research by replacing the weighted sum with a Pareto ranking scheme, which preserves the independence of feature tests during fitness evaluation. Three experiments were performed: a pure Pareto ranking scheme, and two Pareto experiments enhanced with parameterless population divergence strategies. One divergence strategy is similar to that used by the NSGA-II system, and scores individuals using their nearest-neighbour distance in feature-space. The other strategy uses a normalized, ranked abstraction of nearest neighbour distance. A result of this work is that acceptable textures can be evolved much more efficiently and with less user intervention with MOP evolution than compared to the weighted sum approach. Although the final acceptability of a texture is ultimately a subjective decision of the user, the proposed use of multi-objective evolution is useful for generating for the user a diverse assortment of possibilities that reflect the important features of interest.&lt;br /&gt;
&lt;br /&gt;
== Extended Abstract ==&lt;br /&gt;
&lt;br /&gt;
== Bibtex == &lt;br /&gt;
&lt;br /&gt;
== Used References ==&lt;br /&gt;
Coello, C. A. C., Van Veldhuizen, D. A. and Lamont, G. B.,Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, 2002.&lt;br /&gt;
    &lt;br /&gt;
Deb, K., Agrawa, S., Pratap, A. and Meyarivan, T., “A Fast Elitist Nondominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II,” inProc. PPSN VI, pp. 849–858, Springer-Verlag, 2000.&lt;br /&gt;
    &lt;br /&gt;
Ebert, D. S., Musgrave, F. K., Peachey, D., Perlin, K. and Worley, S.,Texturing and Modeling: a Procedural Approach, 2 ed., Academic Press, 1998.&lt;br /&gt;
    &lt;br /&gt;
Fonseca, C. M. and Fleming, P. J., “An Overview of Evolutionary Algorithms in Multiobjective Optimization,”Evolutionary Computation, 3, 1, pp. 1–16, 1995. CrossRef&lt;br /&gt;
    &lt;br /&gt;
Goldberg, D. E.,Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley, 1989.&lt;br /&gt;
    &lt;br /&gt;
Holland, J. H.,Adaptation in Notural and Artificial Systems, MIT Press, 1992.&lt;br /&gt;
    &lt;br /&gt;
Horn, J., Nafpliotis, N. and Goldberg, D. E., “A Niched Pareto Genetic Algorithm for Multiobjective Optimization,” inProc. ICEC’94, pp. 82–87, 1994.&lt;br /&gt;
    &lt;br /&gt;
Ibrahim, A. E. M., “GenShade: an Evolutionary Approach to Automatic and Interactive Procedural Texture Generation,” Ph.D. thesis, Texas A &amp;amp; M University, Dec. 1998.&lt;br /&gt;
    &lt;br /&gt;
Koza, J. R.,Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, 1992.&lt;br /&gt;
    &lt;br /&gt;
Laumanss, M., Zitzler, E. and Thiele, L., “On the Effects of Archiving, Elitism, and Density Based Selection in Evolutionary Multi-objective Optimization,” inProc. 1st Int. Conf. on Evolutionary Multi-Criterion Optimization, pp. 181–196, Springer-Verlag, 2001.&lt;br /&gt;
    &lt;br /&gt;
Lu, H. and Yen, G. G., “Rank-Density Based Multiobjective Genetic Algorithm,” inProc. CEC 2002, pp. 941–949, 2002.&lt;br /&gt;
    &lt;br /&gt;
Purshouse, R. C. and Fleming, P. J., “Elitism, Sharing, and Ranking Choices in Evolutionary Multi-Criterion Optimisation,”Technical Report 815, Dept. of Automatic Control and Systems Engineering, University of Sheffield, Jan. 2002.&lt;br /&gt;
    &lt;br /&gt;
Rooke, S., “Eons of Genetically Evolved Algorithmic Images,” in Bentley, P. J. and Corne, D. W. (eds.),Creative Evolutionary Systems, Morgan Kaufmann, pp. 330–365, 2002.&lt;br /&gt;
    &lt;br /&gt;
Rowe, J., Vinsen, K. and Marvin, N., “Parallel GAs for Multiobjective Functions,” inProc. of the 2nd Nordic Workshop on Genetic Algorithms and their Applications (2NWGA), pp. 61–70, University of Vaasa, Finland, 1996.&lt;br /&gt;
    &lt;br /&gt;
Sims, K., “Interactive Evolution of Equations for Procedural Models,”The Visual Computer, 9, pp. 466–476, 1993. CrossRef&lt;br /&gt;
    &lt;br /&gt;
Smith, J. R., “Integrated Spatial and Feature Image Systems: Retrieval, Analysis and Compression,” Ph.D. thesis, Center for Telecommunications Research, Graduate School of Arts and Sciences, Columbia University, 1997.&lt;br /&gt;
    &lt;br /&gt;
Stollnitz, E., Derose, T. and Salesin, D.,Wavelets for Computer Graphics: Theory and Application, Morgan Kaufmann, 1996.&lt;br /&gt;
    &lt;br /&gt;
Upstill, S.,The Renderman Companion: A Programmer’s Guide to Realistic Computer Graphics, Addison-Wesley, 1989.&lt;br /&gt;
    &lt;br /&gt;
Veldhuizen, D. A. van and Lamont, G. B., “Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art,”Evolutionary Computation, 8, 2, pp. 125–147, 2000, CrossRef&lt;br /&gt;
    &lt;br /&gt;
Watt, A. and Watt, M.,Advanced Animation and Rendering Techniques: Theory and Practice, ACM Press, 1992.&lt;br /&gt;
    &lt;br /&gt;
Wiens, A. L. and Ross, B. J., “Gentropy: Evolutionary 2D Texture Generation,”Computers and Graphics Journal, 26, 1, pp. 75–88, Feb. 2002. CrossRef&lt;br /&gt;
    &lt;br /&gt;
Zongker, D. and Punch, B.,lil-gp 1.0. User’s Manual, Dept. of Computer Science, Michigan State University, 1995.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
=== Full Text === &lt;br /&gt;
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.59.1006&amp;amp;rep=rep1&amp;amp;type=pdf&lt;br /&gt;
&lt;br /&gt;
[[intern file]]&lt;br /&gt;
&lt;br /&gt;
=== Sonstige Links ===&lt;br /&gt;
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.1006&lt;/div&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	</feed>