Bio: Muhammed Cinsdikici is an academic researcher from Ege University. The author has contributed to research in topics: Backpropagation & Image registration. The author has an hindex of 6, co-authored 15 publications receiving 330 citations.
TL;DR: A novel approach (MF/ant algorithm) is proposed to overcome the deficiency of the MF and shows its success using the well known reference ophthalmoscope images of DRIVE database.
Abstract: Blood vessels in ophthalmoscope images play an important role in diagnosis of some serious pathologies on retinal images. Hence, accurate extraction of vessels is becoming a main topic of this research area. Matched filter (MF) implementation for blood vessel detection is one of the methods giving more accurate results. Using this filter alone might not recover all the vessels (especially the capillaries). In this paper, a novel approach (MF/ant algorithm) is proposed to overcome the deficiency of the MF. The proposed method is a hybrid model of matched filter and ant colony algorithm. In this work, the accuracy and parameters of the hybrid algorithm are also discussed. The proposed method shows its success using the well known reference ophthalmoscope images of DRIVE database.
TL;DR: A novel vehicle-classification algorithm that uses the time-variable signal generated by a single inductive loop detector to strengthen the classification accuracy by emphasizing the undercarriage height variation of the vehicle.
Abstract: This paper presents a novel vehicle-classification algorithm that uses the time-variable signal generated by a single inductive loop detector In earlier studies, the noisy raw signal was fed into the algorithm by reducing its size with rough sampling However, this approach loses the original signal form and cannot be the best exemplar vector The developed algorithm suggests three contributions to cope with these problems The first contribution is to clear the noise with discrete Fourier transform (DFT) The second contribution is to transfer the noiseless pattern into the Principal Component Analysis (PCA) domain PCA is exploited not only for decorrelation but for explicit dimensionality reduction as well This goal cannot be achieved by simple raw data sampling The last contribution is to expand the principal components with a local maximum (Lmax) parameter It strengthens the classification accuracy by emphasizing the undercarriage height variation of the vehicle These parameters are fed into the three-layered backpropagation neural network (BPNN) BPNN classifies the vehicles into five groups, and the recognition rate is 9421% This recognition rate has performed best, compared with the methods presented in published works
TL;DR: A genetic algorithm-based solution for TSP where all points are on the surface of a sphere is proposed and a Java-based interactive visualization tool is developed using Java 3D and optimization results obtained for different problem sizes are presented.
Abstract: The Traveling Salesman Problem (TSP) is one of the extensively studied combinatorial optimization problems. Various exact or approximation algorithms are devised for solving Euclidean TSP that determine the shortest route through a given set of points in 3-dimensional Euclidean space. In this paper, we proposed a genetic algorithm-based solution for TSP where all points are on the surface of a sphere. A Java-based interactive visualization tool is also developed using Java 3D and optimization results obtained for different problem sizes are presented.
TL;DR: These proposed algorithms are the first population-based algorithms to solve MWCDS problem on undirected graphs and compare the performance of the proposed algorithms with other greedy heuristics and brute force methods through extensive simulations.
Abstract: Minimum weight connected dominating set (MWCDS) is a very important NP-Hard problem used in many applications such as backbone formation, data aggregation, routing and scheduling in wireless ad hoc and sensor networks. Population-based approaches are very useful to solve NP-Hard optimization problems. In this study, a hybrid genetic algorithm (HGA) and a population-based iterated greedy (PBIG) algorithm for MWCDS problem are proposed. To the best of our knowledge, the proposed algorithms are the first population-based algorithms to solve MWCDS problem on undirected graphs. HGA is a steady-state procedure which incorporates a greedy heuristic with a genetic search. PBIG algorithm refines the population by partially destroying and greedily reconstructing individual solutions. We compare the performance of the proposed algorithms with other greedy heuristics and brute force methods through extensive simulations. We show that our proposed algorithms perform very well in terms of MWCDS solution quality and CPU time.
TL;DR: A novel approach for principal component analysis (PCA) and fast backpropagation neural net composition is used as a recognizer in recognition module of a new license plate information retrieval system.
Abstract: In this paper, a new license plate information retrieval system is designed and developed. The system has two main modules: segmentation and recognition. In segmentation, interested information on the image is extracted through the processes of Kaiser resizing, morphological filtering, artificial shifting and bi-directional vertical thresholding. In recognition module, a novel approach for principal component analysis (PCA) and fast backpropagation neural net composition is used as a recognizer. The novel approach is about the construction of Eigen space through the PCA that is used for feature extraction. Our approach is more tolerable to the problems of classical application PCA such as rotation, scaling and character width dependence. The outputs of the new feature extractor used as inputs to the fastbackpropagation neural net recognizer module. This neural network trained with scaled conjugate gradient function. For each module, alternative available methods are mentioned and proper sequence ...
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …
01 Jan 2006
TL;DR: Probability distributions of linear models for regression and classification are given in this article, along with a discussion of combining models and combining models in the context of machine learning and classification.
Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.
01 Jan 1990
TL;DR: An overview of the self-organizing map algorithm, on which the papers in this issue are based, is presented in this article, where the authors present an overview of their work.
Abstract: An overview of the self-organizing map algorithm, on which the papers in this issue are based, is presented in this article.
01 Dec 1988
TL;DR: In this paper, the spectral energy distribution of the reflected light from an object made of a specific real material is obtained and a procedure for accurately reproducing the color associated with the spectrum is discussed.
Abstract: This paper presents a new reflectance model for rendering computer synthesized images. The model accounts for the relative brightness of different materials and light sources in the same scene. It describes the directional distribution of the reflected light and a color shift that occurs as the reflectance changes with incidence angle. The paper presents a method for obtaining the spectral energy distribution of the light reflected from an object made of a specific real material and discusses a procedure for accurately reproducing the color associated with the spectral energy distribution. The model is applied to the simulation of a metal and a plastic.