EMAIL: PASSWORD:
Front Office
UPT. PERPUSTAKAAN
Institut Teknologi Sepuluh Nopember Surabaya


Kampus ITS Sukolilo - Surabaya 60111

Phone : 031-5921733 , 5923623
Fax : 031-5937774
E-mail : libits@its.ac.id
Website : http://library.its.ac.id

Support (Customer Service) :
timit_perpus@its.ac.id




Welcome..guys!

Have a problem with your access?
Please, contact our technical support below:
LIVE SUPPORT


Moh. Fandika Aqsa


Davi Wahyuni


Tondo Indra Nyata


Anis Wulandari


Ansi Aflacha




ITS » Undergraduate Theses » Teknologi Informasi - D4
Posted by dee@its.ac.id at 27/10/2011 14:54:37  •  3751 Views


KLASIFIKASI DAUN DENGAN CENTROID LINKED CLUSTERING BERDASARKAN FITUR BENTUK TEPI DAUN

LEAVES CLASSIFICATION WITH CENTROID LINKED CLUSTERING BASED ON THE SHAPE FEATURE OF THE LEAVES EDGE

Author :
LIANTONI, FEBRI ( 7406040010 )




ABSTRAK

Ilmu tumbuhan pada waktu sekarang telah mengalami kemajuan yang sangat pesat hingga bidang-bidang pengetahuan yang semula hanya merupakan cabang ilmu tumbuhan saja sekarang ini telah menjadi ilmu yang berdiri sendiri. Salah satunya cabang ilmu tumbuhan yaitu morfologi tumbuhan ilmu tumbuhan ini mempelajari bentuk dan susunan tubuh tumbuhan khususnya mengenai morfologi tumbuhan berdasarkan bentuk tepi daun. Pada proyek akhir ini akan dibangun sebuah program yang bertujuan untuk mengklasifikasikan jenis daun. Ciri yang digunakan dalam proses pengklasifikasian daun adalah bentuk dari tepi daun. Selanjutnya dilakukan pengolahan gambar meliputi proses gray-scale thersholding dan edge detection. Dari gambar hasil deteksi tepi ini akan dihitung menggunakan moment invariant. Dalam proyek akhir ini akan dilakukan klasifikasi menggunakan metode centroid linked dan metode k-means. Pada proses klasifikasi akan menghasilkan 10 sepuluh jumlah cluster yang berdasarkan bentuk tepi daun.


ABSTRACT

Botany is growing rapidly from time to time. Eventually it develop new branches including the one that studies plants morphology. This particular branch studies extensively into plants anatomy and shape especially on its leavess shape.This final project will build a program to classified leavess types. The shape of leavess edge is used as a feature to classify leavess 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 leavess edge.



KeywordsMorfologi; Gray-scale; Thersholding; Edge detection; Moment invariant; Centroid linked; K-means
 
Subject:  Analisis cluster
Contributor
  1. Nana Ramadijanto, S.Kom, M.Kom
  2. Nur Rosyid Mubtada'i, S.Kom
Date Create: 06/08/2010
Type: Text
Format: pdf
Language: Indonesian
Identifier: ITS-Undergraduate-3100010041146
Collection ID: 3100010041146
Call Number: RSEP 519.53 Lia k


Source
Non Degree of Informatics, RSEP 519.53 Lia k, 2010

Coverage
ITS Community

Rights
Copyright @2010 by ITS Library. This publication is protected by copyright and per obtained from the ITS Library prior to any prohibited reproduction, storage in a re transmission in any form or by any means, electronic, mechanical, photocopying, reco For information regarding permission(s), write to ITS Library




[ Download - Open Access ]

  1.  ITS-Undergraduate-15590-7406040010-Abstract_id.pdf - 80 KB
  2.  ITS-Undergraduate-15590-7406040010-Abstract_en-.pdf - 80 KB
  3.  ITS-Undergraduate-15590-7406040010-Conclusion.pdf - 97 KB
  4.  ITS-Undergraduate-15590-7406040010-Paper.pdf - 435 KB




 Similar Document...




! ATTENTION !

To facilitate the activation process, please fill out the member application form correctly and completely

Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently

POLLING

Bagaimana pendapat Anda tentang layanan repository kami ?

Bagus Sekali
Baik
Biasa
Jelek
Mengecewakan





You are connected from 18.210.11.249
using CCBot/2.0 (https://commoncrawl.org/faq/)



Copyright © ITS Library 2006 - 2020 - All rights reserved.
Dublin Core Metadata Initiative and OpenArchives Compatible
Developed by Hassan