<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000ctmaa22000003a 4500</leader>
  <controlfield tag="001">UP-1685675941123923272</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20151012112410.0</controlfield>
  <controlfield tag="006">aa    rb   |||1 u|</controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">151012s        xx     d     r    |||| u|</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPTAC-00017720376</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">UPVTC</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2="0">
   <subfield code="a">LG 993.5 2011 C66</subfield>
   <subfield code="b">D34</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Daga, Ryan Rey M.</subfield>
   <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">HarmoZip</subfield>
   <subfield code="b">image compression using Harmony Search Algorithm</subfield>
   <subfield code="c">Ryan M. Daga; John Paul T. Yusiong, adviser.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="c">2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">[4], 85 leaves</subfield>
   <subfield code="b">illustrations.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
   <subfield code="a">Undergraduate thesis (B.S. Computer Science) -- University of the Philippines, Tacloban.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">Image compression has been beneficial in data storage and image transmission through the Internet. It eliminates redundant data thus minimizing the physical space requirements. Numerous types of image compression software have been developed but the resulting image is less than the optimal. A lot of real-world problems require optimization and the discovery of an optimum solution is not always guaranteed. One approach to solve these problems is by using heuristics and a new development of this method called meta heuristics. These optimization algorithms require some level of randomness to search for the optimal solution. Harmony search algorithm (HSA), a relatively new meta heuristic optimization algorithm inspired by the music improvisation process of musicians, is applied as an underlying algorithm in image compression. Experiment results show that it is feasible to use the harmony search algorithm as an underlying algorithm in image compression. It was able to compress different image types (colored and grayscale) and images with different dimensions. Comparing with the results of hybrid PSO-GA, HSA was able to perform better in terms of quality.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Harmony Search Algorithm.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Meta heuristic.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Image compression.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Yusiong, John Paul T.</subfield>
   <subfield code="e">adviser.</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPTAC</subfield>
   <subfield code="b">UPTAC</subfield>
   <subfield code="h">LG 993.5 2011 C66</subfield>
   <subfield code="i">D34</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
