Double Line Clustering based Colour Image Segmentation Technique for Plant Disease Detection

Author(s):  
Kalaivani Subramani ◽  
Shantharajah Periyasamy ◽  
Padma Theagarajan

Background: Agriculture is one of the most essential industry that fullfills people’s need and also plays an important role in economic evolution of the nation. However, there is a gap between the agriculture sector and the technological industry and the agriculture plants are mostly affected by diseases, such as the bacterial, fungus and viral diseases that lead to loss in crop yield. The affected parts of the plants need to be identified at the beginning stage to eliminate the huge loss in productivity. Methods: In the present scenario, crop cultivation system depend on the farmers experience and the man power, but it consumes more time and increases error rate. To overcome this issue, the proposed system introduces the Double Line Clustering technique based disease identification system using the image processing and data mining methods. The introduced method analyze the Anthracnose, blight disease in grapes, tomato and cucumber. The leaf images are captured and the noise has been removed by non-local median filter and the segmentation is done by double line clustering method. The segmented part compared with diseased leaf using pattern matching algorithm. Methods: In the present scenario, crop cultivation system depend on the farmers experience and the man power, but it consumes more time and increases error rate. To overcome this issue, the proposed system introduces the Double Line Clustering technique based disease identification system using the image processing and data mining methods. The introduced method analyze the Anthracnose, blight disease in grapes, tomato and cucumber. The leaf images are captured and the noise has been removed by non-local median filter and the segmentation is done by double line clustering method. The segmented part compared with diseased leaf using pattern matching algorithm. Conclusion: The result of the clustering algorithm achieved high accuracy, sensitivity, and specificity. The feature extraction is applied after the clustering process which produces minimum error rate.

Author(s):  
KUO-LIANG CHUNG

Given a pattern of length m and a text of length n, commonly m≪n, this paper presents a randomized parallel algorithm for pattern matching in O(n1/10) (=O(n1/10+(n−m)1/10)) time on a newly proposed n3/5×n2/5 modular meshconnected computers with multiple buses. Furthermore, the time bound of our parallel algorithm can be reduced to O(n1/11) if fewer processors are used.


2017 ◽  
Vol 80 ◽  
pp. 162-170 ◽  
Author(s):  
Muhammad Tahir ◽  
Muhammad Sardaraz ◽  
Ataul Aziz Ikram

2014 ◽  
Vol 571-572 ◽  
pp. 461-464
Author(s):  
Hai Yan Zhou

A fast and efficient matching algorithm is proposed to address the issue on multi-pattern matching of double-byte string, for example Chinese characters, which has major difference with single-byte string matching algorithm. The algorithm capitalizes on double cross link data list and two finite prefix automata to match a double-byte character, so as to solve the storage expansion problems in which the double-byte cross data link table results. The method requires less storage in comparison with double-byte cross data link table, and has the same order of magnitude in efficiency as a single-byte cross-link table approach.


Sign in / Sign up

Export Citation Format

Share Document