Liantoni, Febri and Ramadijanti, Nana and Rosyid Mubtada'i, Nur (2010) KLASIFIKASI DAUN DENGAN CENTROID LINKED CLUSTERING BERDASARKAN FITUR BENTUK TEPI DAUN. EEPIS Final Project.
![[img]](http://repo.pens.ac.id/style/images/fileicons/application_pdf.png)
| PDF - Published Version Download (598Kb) | Preview |
Abstract
Botany is growing rapidly from time to time. Eventually it develop new branches including the one that studies plant's morphology. This particular branch studies extensively into plant's anatomy and shape especially on its leaves's shape.This final project will build a program to classified leaves's types. The shape of leaves's edge is used as a feature to classify leaves's type. Image processing used in the process are gray scaling, thresholding and edge detecting. Edge detection will counted using invariant moment. This final project will use classification based on centroid linked and K means. The classification process will create 10 cluster based on the shape of leaves's edge.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
| Depositing User: | Mrs Hani Syarifati |
| Date Deposited: | 15 Apr 2011 21:52 |
| Last Modified: | 15 Apr 2011 21:52 |
| URI: | http://repo.pens.ac.id/id/eprint/348 |
Actions (login required)
| View Item |
