Hybrid ant colony algorithm for texture classification Zheng, Hong, Wong, Alan and Nahavandi, Saeid 2003, Hybrid ant colony algorithm for texture classification, in 2003 Congress on Evolutionary Computation, CEC 2003 : proceedings : Canberra, Australia, 8-12 December, 2003., IEEE Xplore, Piscataway, N.J., pp. 2648-2652. Attached Files Name Description MIMEType Size Downloads nahavandi-hybridantcolony-2003.pdf Published version application/pdf 955.04KB 184 Title Hybrid ant colony algorithm for texture classification Author(s) Zheng, Hong Wong, Alan Nahavandi, Saeid orcid.org/0000-0002-0360-5270 Conference name Congress on Evolutionary Computation (2003 : Canberra, A.C.T.) Conference location Canberra, Australia Conference dates 8-12 December 2003 Title of proceedings 2003 Congress on Evolutionary Computation, CEC 2003 : proceedings : Canberra, Australia, 8-12 December, 2003. Editor(s) Sarker, Ruhul Publication date 2003 Start page 2648 End page 2652 Publisher IEEE Xplore Place of publication Piscataway, N.J. Summary We present a novel ant colony algorithm integrating genetic algorithms and simplex algorithms. This method is able to not only speed up searching process for optimal solutions, but also improve the quality of the solutions. The proposed method is applied to set up a learning model for the "tuned" mask, which is used for texture classification. Experimental results on real world images and comparisons with genetic algorithms and genetic simplex algorithms are presented to illustrate the merit and feasibility of the proposed method. Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. ISBN 0780378040 9780780378049 Language eng Field of Research 080201 Analysis of Algorithms and Complexity HERDC Research category E1 Full written paper - refereed Copyright notice ©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Free to Read? Yes Persistent URL http://hdl.handle.net/10536/DRO/DU:30005222 Document type: Conference Paper Collections: Faculty of Science, Engineering and Built Environment School of Engineering and Technology Open Access Collection Related Links Link Description Connect to published version (restricted access) Go to link with your DU access privileges     Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved. Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au. Versions Version Filter Type Wed, 03 Dec 2008, 12:46:30 EST Fri, 13 Mar 2009, 14:22:16 EST Mon, 19 Apr 2010, 14:02:12 EST Sat, 24 Apr 2010, 15:32:28 EST Thu, 17 Jun 2010, 14:42:09 EST Tue, 18 Jan 2011, 15:44:01 EST Tue, 18 Jan 2011, 15:45:50 EST Wed, 21 Oct 2015, 13:05:42 EST Wed, 21 Oct 2015, 16:28:57 EST Tue, 06 Sep 2016, 09:58:53 EST Tue, 05 Dec 2017, 06:15:12 EST Fri, 07 Sep 2018, 13:25:27 EST Filtered Full Citation counts:   Cited 13 times in TR Web of Science Cited 17 times in Scopus Search Google Scholar Access Statistics: 966 Abstract Views, 266 File Downloads  -  Detailed Statistics Created: Mon, 07 Jul 2008, 09:46:59 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.