Browsing by Subject "SVM"
Now showing 1 - 7 of 7
Results Per Page
Sort Options
Item Open Access Cepstrum based feature extraction method for fungus detection(SPIE, 2011) Yorulmaz, Onur; Pearson, T.C.; Çetin, A. EnisIn this paper, a method for detection of popcorn kernels infected by a fungus is developed using image processing. The method is based on two dimensional (2D) mel and Mellin-cepstrum computation from popcorn kernel images. Cepstral features that were extracted from popcorn images are classified using Support Vector Machines (SVM). Experimental results show that high recognition rates of up to 93.93% can be achieved for both damaged and healthy popcorn kernels using 2D mel-cepstrum. The success rate for healthy popcorn kernels was found to be 97.41% and the recognition rate for damaged kernels was found to be 89.43%. © 2011 Copyright Society of Photo-Optical Instrumentation Engineers (SPIE).Item Open Access Classification of Camellia species from 3 sections using leaf anatomical data with back-propagation neural networks and support vector machines(Scientific and Technical Research Council of Turkey - TUBITAK, 2013) Jiang, W.; Özaktaş Barshan, Billur; Mantri, Nitin; Tao, Z.; Lu, H.Leaf characteristics provide many useful clues for taxonomy. We used a back-propagation artificial neural network (BPANN) and C-support vector machines (C-SVMs) to classify 47 species from 3 sections of genus Camellia (16 from sect. Chrysanthae, 16 from sect. Tuberculata, and 15 from sect. Paracamellia). The classification model was constructed based on 7 leaf anatomy attributes including, area of adaxial epidermal cell, thickness of adaxial epidermal cell, thickness of palisade parenchyma, thickness of total leaf, thickness of spongy parenchyma, thickness of abaxial epidermal cell, and area of abaxial epidermal cell. Model parameters of C-SVM, comprising regularization parameter (C) and kernel parameter (γ), were optimized by cross-validation. The best classification accuracy of the 3 Camellia sections was achieved by the radial basis function SVM classifier (with parameters C = 32, γ = 0.13), as well as the sigmoid SVM classifier (with parameters C = 32, γ = 0.13), which was up to 84.00% in the training set and 90.91% in the prediction set, respectively. Compared with BP-ANN, SVM yields slightly higher prediction accuracy, which indicates that it is feasible to accurately classify the 3 sections of Camellia using SVMs based on leaf anatomy data. © TÜBİTAK.Item Open Access Classifying fonts and calligraphy styles using complex wavelet transform(Springer-Verlag London Ltd, 2015) Bozkurt, A.; Duygulu P.; Cetin, A.E.Recognizing fonts has become an important task in document analysis, due to the increasing number of available digital documents in different fonts and emphases. A generic font recognition system independent of language, script and content is desirable for processing various types of documents. At the same time, categorizing calligraphy styles in handwritten manuscripts is important for paleographic analysis, but has not been studied sufficiently in the literature. We address the font recognition problem as analysis and categorization of textures. We extract features using complex wavelet transform and use support vector machines for classification. Extensive experimental evaluations on different datasets in four languages and comparisons with state-of-the-art studies show that our proposed method achieves higher recognition accuracy while being computationally simpler. Furthermore, on a new dataset generated from Ottoman manuscripts, we show that the proposed method can also be used for categorizing Ottoman calligraphy with high accuracy. © 2015, Springer-Verlag London.Item Open Access Detection of fungal damaged popcorn using image property covariance features(Elsevier, 2012) Yorulmaz, O.; Pearson, T. C.; Çetin, A.Covariance-matrix-based features were applied to the detection of popcorn infected by a fungus that causes a symptom called " blue-eye" . This infection of popcorn kernels causes economic losses due to the kernels' poor appearance and the frequently disagreeable flavor of the popped kernels. Images of kernels were obtained to distinguish damaged from undamaged kernels using image-processing techniques. Features for distinguishing blue-eye-damaged from undamaged popcorn kernel images were extracted from covariance matrices computed using various image pixel properties. The covariance matrices were formed using different property vectors that consisted of the image coordinate values, their intensity values and the first and second derivatives of the vertical and horizontal directions of different color channels. Support Vector Machines (SVM) were used for classification purposes. An overall recognition rate of 96.5% was achieved using these covariance based features. Relatively low false positive values of 2.4% were obtained which is important to reduce economic loss due to healthy kernels being discarded as fungal damaged. The image processing method is not computationally expensive so that it could be implemented in real-time sorting systems to separate damaged popcorn or other grains that have textural differences.Item Open Access Estimating the chance of success and suggestion for treatment in IVF(2013) Mısırlı, GizemIn medicine, the chance of success for a treatment is important for decision making for the doctor and the patient. This thesis focuses on the domain of In Vitro Fertilization (IVF), where there are two issues: the first one is the decision on whether or not go with the treatment procedure, the second one is the selection of the proper treatment protocol for the patient. It is important for both the doctor and the couple to have some idea about the chance of success of the treatment after the initial evaluation. If the chance of success is low, the patient couple may decide not to proceed with this stressful and expensive treatment. Once a decision for treatment is made, the next issue for the doctors is the choice of the treatment protocol which is the most suitable for the couple. Our first aim is to develop techniques to estimate the chance of success and determine the factors that affect the success in IVF treatment. So, we employ ranking algorithms to estimate the chance of success. The ranking methods used are RIMARC (Ranking Instances by Maximizing the Area under the ROC Curve), SVMlight (Support Vector Machine Ranking Algorithm) and RIkNN (Ranking Instances using k Nearest Neighbour). All of these three algorithms learn a model to rank the instances based on their score values. RIMARC is a method for ranking instances by maximizing the area under the ROC curve. SVMlight is an implementation of Support Vector Machine for ranking instances. RIkNN is a k Nearest Neighbour (kNN) based algorithm that is developed for ranking instances based on similarity metric. We also used RIwkNN, which is the version of RIkNN where the features are assigned weights by experts in the domain. These algorithms are compared on the basis of the AUC of 10-fold stratified cross-validation. Moreover, these ranking algorithms are modified as a classification algorithm and compared on the basis of the accuracy of 10-fold stratified cross-validation. As a by-product, the RIMARC algorithm learns the factors that affect the success in IVF treatment. It calculates feature weights and creates rules that are in a human readable form and easy to interpret. After a decision for a treatment is made, the second aim is to determine which treatment protocol is the most suitable for the couple. In IVF treatment, many different types of drugs and dosages are used, however, which drug and the dosage are the most suitable for the given patient is not certain. Doctors generally make their decision based on their past experiences and the results of research published all over the world. To the best of our knowledge, there are no methods for learning a model that can be used to suggest the best feature values to increase the chance that the class label to be the desired one. We will refer to such a system as Suggestion System. To help doctors in making decision on the selection of the suitable treatment protocols, we present three suggestion systems that are based on well-known machine learning techniques. We will call the suggestion systems developed as a part of this work as NSNS (Nearest Successful Neighbour Based Suggestion), kNNS (k Nearest Neighbour Based Suggestion) and DTS (Decision Tree Based Suggestion). We also implemented the weighted version of NSNS using feature weights that are produced by the RIMARC algorithm. Moreover, we propose performance metrics for the evaluation of the suggestion algorithms. We introduce four evaluation metrics namely; pessimistic metric (mp), optimistic metric (mo), validated optimistic metric (mvo) and validated pessimistic metric (mvp) to test the correctness of the algorithms. In order to help doctors to utilize developed algorithms, we develop a decision support system, called RAST (Risk Analysis and Suggestion for Treatment). This system is actively being used in the IVF center at Etlik Z¨ubeyde Hanım Woman’s Health and Teaching Hospital.Item Open Access Multi-scale directional-filtering-based method for follicular lymphoma grading(Springer U K, 2014-08-07) Bozkurt, A.; Suhre, A.; Çetin, A. EnisFollicular lymphoma (FL) is a group of malignancies of lymphocyte origin that arise from lymph nodes, spleen, and bone marrow in the lymphatic system. It is the second most common non-Hodgkins lymphoma. Characteristic of FL is the presence of follicle center B cells consisting of centrocytes and centroblasts. Typically, FL images are graded by an expert manually counting the centroblasts in an image. This is time consuming. In this paper, we present a novel multi-scale directional filtering scheme and utilize it to classify FL images into different grades. Instead of counting the centroblasts individually, we classify the texture formed by centroblasts. We apply our multi-scale directional filtering scheme in two scales and along eight orientations, and use the mean and the standard deviation of each filter output as feature parameters. For classification, we use support vector machines with the radial basis function kernel. We map the features into two dimensions using linear discriminant analysis prior to classification. Experimental results are presented.Item Open Access Naming faces on the web(2010) Zitouni, HilalIn this study, we introduce a method to name less-frequently appearing people on the web via naming frequently appearing ones first. Current image search engines are widely used for querying a person, however; retrievals are based on textual content; therefore, the results are not satisfactory. On the other hand, although; face recognition is a long standing problem; it is tested for limited sizes and successful results are acquired just for face images captured under controlled environments. Faces on the web, contrarily are huge in amount and vary in pose, illumination, occlusion and facial attributes. Recent researches on the area, suggest not to use simply the visual or textual content alone, but to combine them both. With this approach, face recognition problem is simplified to a face-name association problem. Following these approaches, in our method textual and visual information is combined to name faces. We divide the problem into two sub problems, first the more frequently appearing faces, then the less-frequently appearing faces on the web images are named. A supervised algorithm is used for naming a specified number of categories belonging to more frequently appearing faces. The faces that are not matched with any category are then considered to be the less-frequently appearing faces and labeled using the textual content. We extracted all the names from textual contents, and then eliminate the ones used to label frequentlyappearing faces before. The remaining names are the candidate categories for lessfrequently appearing faces. Each detected less-frequently appearing face finally matched to the names extracted from their corresponding textual content. In order to prune the irrelevant face images, finally, the most similar faces among this collection are found to be matched with their corresponding category. In our experiments, the method is applied on two different datasets. Bothdatasets are constructed from the images captured in realistic environments, varying in pose, illumination, facial expressions, occlusions and etc. The results of the experiments proved that the combination of textual and visual contents on realistic face images outperforms the methods that use either one of them. Besides, handling the face recognition problem as a face-name association, improves the results for the face images collected from uncontrolled environments.