<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Dogan_et_al_2017a</id>
		<title>Dogan et al 2017a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Dogan_et_al_2017a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dogan_et_al_2017a&amp;action=history"/>
		<updated>2026-08-24T23:10:12Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Dogan_et_al_2017a&amp;diff=215524&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 672169347 to Dogan et al 2017a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dogan_et_al_2017a&amp;diff=215524&amp;oldid=prev"/>
				<updated>2021-02-16T09:35:59Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_672169347&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 672169347&quot;&gt;Draft Content 672169347&lt;/a&gt; to &lt;a href=&quot;/public/Dogan_et_al_2017a&quot; title=&quot;Dogan et al 2017a&quot;&gt;Dogan et al 2017a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 09:35, 16 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Dogan_et_al_2017a&amp;diff=215523&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects  causing of tuberculosis disease. Therefore, several...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dogan_et_al_2017a&amp;diff=215523&amp;oldid=prev"/>
				<updated>2021-02-16T09:35:56Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects  causing of tuberculosis disease. Therefore, several...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects  causing of tuberculosis disease. Therefore, several bi-level thresholding algorithms are widely used  to increase the bacilli segmentation accuracy. However, bi-level microscopic image thresholding problem  has not been solved using optimization algorithms. This paper introduces a novel approach for the  segmentation problem using heuristic algorithms and presents visual and quantitative comparisons  of heuristic and state-of-art thresholding algorithms. In this study, well-known heuristic algorithms  such as Firefly Algorithm, Particle Swarm Optimization, Cuckoo Search, Flower Pollination are used to  solve bi-level microscopic image thresholding problem, and the results are compared with the  state-of-art thresholding algorithms such as K-Means, Fuzzy C-Means, Fast Marching. Kapur's  entropy is chosen as the entropy measure to be maximized. Experiments are performed to make  comparisons in terms of evaluation metrics and execution time. The quantitative results are  calculated based on ground truth segmentation. According to the visual results, heuristic  algorithms have better performance and the quantitative results are in accord with the visual  results. Furthermore, experimental time comparisons show the superiority and effectiveness of  the heuristic algorithms over traditional thresholding algorithms.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.4316/aece.2018.01015 http://dx.doi.org/10.4316/aece.2018.01015]&lt;br /&gt;
&lt;br /&gt;
* [https://avesis.erciyes.edu.tr/publication/details/bbc9a067-ea98-46cd-b027-9ac724a6c856/oai https://avesis.erciyes.edu.tr/publication/details/bbc9a067-ea98-46cd-b027-9ac724a6c856/oai]&lt;br /&gt;
&lt;br /&gt;
* [https://doi.org/10.4316/aece.2018.01015 https://doi.org/10.4316/aece.2018.01015] under the license cc-by-nc-nd&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.4316/AECE.2018.01015 http://dx.doi.org/10.4316/AECE.2018.01015],&lt;br /&gt;
: [https://doaj.org/toc/1582-7445 https://doaj.org/toc/1582-7445],&lt;br /&gt;
: [https://doaj.org/toc/1844-7600 https://doaj.org/toc/1844-7600]&lt;br /&gt;
&lt;br /&gt;
* [http://www.aece.ro/abstractplus.php?year=2018&amp;amp;number=1&amp;amp;article=15 http://www.aece.ro/abstractplus.php?year=2018&amp;amp;number=1&amp;amp;article=15],&lt;br /&gt;
: [https://avesis.erciyes.edu.tr/yayin/bbc9a067-ea98-46cd-b027-9ac724a6c856/optimization-of-charge-discharge-coordination-to-satisfy-network-requirements-using-heuristic-algorithms-in-vehicle-to-grid-concept https://avesis.erciyes.edu.tr/yayin/bbc9a067-ea98-46cd-b027-9ac724a6c856/optimization-of-charge-discharge-coordination-to-satisfy-network-requirements-using-heuristic-algorithms-in-vehicle-to-grid-concept],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2793318159 https://academic.microsoft.com/#/detail/2793318159]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>