4 research outputs found

    Rearrangement of Coordinate Selection for Triangle Features Improvement in Digit Recognition

    Get PDF
    Triangle geometry feature demonstrated as useful properties in classifying the image. This feature has been implemented in numerous recognition field such as biometric area, security area, medical area, geological area, inspection area and digit recognition area. This study is focusing on improving triangle features in digit recognition. Commonly, triangle features are explored by determining three points of triangle shape which represent as A, B and C to extract useful features in digit recognition. There is possibilities triangle shape cannot be formed when chosen coordinate are in line. Thus, a prior study has proposed an improvement on triangle selection point technique by determining the position of coordinate A, B and C use gradient value to identify the triangle shape can be modelled or vice versa. The suggested improvement is based on the dominant distribution which only covers certain areas of an image. Hence, a method named Triangle Point using Three Block (Tp3B) was proposed in this study. The proposed method proposes the arrangement of selection coordinate point based on three different blocks which where all coordinates points of an image were covered. Experiments have developed over image digit dataset of IFCHDB, HODA, MNIST and BANGLA which contains testing and train data of each. Features classification accuracy tested using supervised machine learning (SML) which is Support Vector Machine (SVM). Experimental results show, the proposed technique gives a promising result for dataset HODA and MNIST

    A linear approach for sparse coding by a two-layer neural network

    Full text link
    Many approaches to transform classification problems from non-linear to linear by feature transformation have been recently presented in the literature. These notably include sparse coding methods and deep neural networks. However, many of these approaches require the repeated application of a learning process upon the presentation of unseen data input vectors, or else involve the use of large numbers of parameters and hyper-parameters, which must be chosen through cross-validation, thus increasing running time dramatically. In this paper, we propose and experimentally investigate a new approach for the purpose of overcoming limitations of both kinds. The proposed approach makes use of a linear auto-associative network (called SCNN) with just one hidden layer. The combination of this architecture with a specific error function to be minimized enables one to learn a linear encoder computing a sparse code which turns out to be as similar as possible to the sparse coding that one obtains by re-training the neural network. Importantly, the linearity of SCNN and the choice of the error function allow one to achieve reduced running time in the learning phase. The proposed architecture is evaluated on the basis of two standard machine learning tasks. Its performances are compared with those of recently proposed non-linear auto-associative neural networks. The overall results suggest that linear encoders can be profitably used to obtain sparse data representations in the context of machine learning problems, provided that an appropriate error function is used during the learning phase

    Rearrangement Of Coordinate Selection For Triangle Features Improvement In Digit Recognition

    Get PDF
    Triangle geometry feature demonstrated as useful properties in classifying the image. This feature has been implemented in numerous recognition field such as biometric area, security area, medical area, geological area, inspection area and digit recognition area. This study is focusing on improving triangle features in digit recognition. Commonly, triangle features are explored by determining three points of triangle shape which represent as A, B and C to extract useful features in digit recognition. There is possibilities triangle shape cannot be formed when chosen coordinate are in line. Thus, a prior study has proposed an improvement on triangle selection point technique by determining the position of coordinate A, B and C use gradient value to identify the triangle shape can be modelled or vice versa. The suggested improvement is based on the dominant distribution which only covers certain areas of an image. Hence, a method named Triangle Point using Three Block (Tp3B) was proposed in this study. The proposed method proposes the arrangement of selection coordinate point based on three different blocks which where all coordinates points of an image were covered. Experiments have developed over image digit dataset of IFCHDB, HODA, MNIST and BANGLA which contains testing and train data of each. Features classification accuracy tested using supervised machine learning (SML) which is Support Vector Machine (SVM). Experimental results show, the proposed technique gives a promising result for dataset HODA and MNIST

    Image receptive fields for artificial neural networks

    Get PDF
    This paper describes the structure of the Image Receptive Fields Neural Network (IRF-NN) introduced recently by our team. This structure extends simplified learning introduced by Extreme Learning Machine and Reservoir Computing techniques to the field of images. Neurons are organized in a single hidden layer feedforward network architecture with an original organization of the network׳s input weights. To represent color images efficiently, without prior feature extraction, the weight values linked to a neuron are determined by a 2-D Gaussian function. The activation of a neuron by an image presents the properties of a nonlinear localized receptive field, parameterized with a small number of degrees of freedom. A network composed of a large number of neurons, each associated with a randomly initialized and constant receptive field, induces a remarkable representation of the images. Supervised training determines only the output weights of the network. It is therefore extremely fast, without retropropagation or iterations, adapted to large sets of images. The network is easy to implement, presents excellent generalization performances for classification applications, and allows the detection of unknown inputs. The efficiency of this technique is illustrated with several benchmarks, photo and video datasets
    corecore