Статьи журнала - International Journal of Intelligent Systems and Applications
Все статьи: 1126
Object Tracking System Using Approximate Median Filter, Kalman Filter and Dynamic Template Matching
Статья научная
In this work, we dealt with the tracking of single object in a sequence of frames either from a live camera or a previously saved video. A moving object is detected frame-by-frame with high accuracy and efficiency using Median approximation technique. As soon as the object has been detected, the same is tracked by kalman filter estimation technique along with a more accurate Template Matching algorithm. The templates are dynamically generated for this purpose. This guarantees any change in object pose which does not be hindered from tracking procedure. The system is capable of handling entry and exit of an object. Such a tracking scheme is cost effective and it can be used as an automated video conferencing system and also has application as a surveillance tool. Several trials of the tracking show that the approach is correct and extremely fast, and it's a more robust performance throughout the experiments.
Бесплатно
Off-line Handwritten Signature Verification System: Artificial Neural Network Approach
Статья научная
Nowadays, it is evident that signature is commonly used for personal verification, this justifies the necessity for an Automatic Verification System (AVS). Based on the application, verification could either be achieved Offline or Online. An online system uses the signature’s dynamic information; such information is captured at the instant the signature is generated. An offline system, on the other hand, uses an image (the signature is scanned). In this paper, some set of simple shaped geometric features are used in achieving offline Verification of signatures. These features include Baseline Slant Angle (BSA), Aspect Ratio (AR), and Normalized Area (NA), Center of Gravity as well as the line’s Slope that joins the Center of Gravities of the signature’s image two splits. Before the features extraction, a signature preprocessing is necessary to segregate its parts as well as to eliminate any available spurious noise. Primarily, System training is achieved via a signature record which was acquired from personalities whose signatures had to be validated through the system. An average signature is acquired for each subject as a result of incorporating the aforementioned features which were derived from a sample set of the subject’s true signatures. Therefore, a signature functions as the prototype for authentication against a requested test signature. The similarity measure within the feature space between the two signatures is determined by Euclidian distance. If the Euclidian distance is lower than a set threshold (i.e. analogous to the minimum acceptable degree of similarity), the test signature is certified as that of the claiming subject otherwise detected as a forgery. Details on the stated features, pre-processing, implementation, and the results are presented in this work.
Бесплатно
On Applications of a Generalized Hyperbolic Measure of Entropy
Статья научная
After generalization of Shannon’s entropy measure by Renyi in 1961, many generalized versions of Shannon measure were proposed by different authors. Shannon measure can be obtained from these generalized measures asymptotically. A natural question arises in the parametric generalization of Shannon’s entropy measure. What is the role of the parameter(s) from application point of view? In the present communication, super additivity and fast scalability of generalized hyperbolic measure [Bhatia and Singh, 2013] of probabilistic entropy as compared to some classical measures of entropy has been shown. Application of a generalized hyperbolic measure of probabilistic entropy in certain situations has been discussed. Also, application of generalized hyperbolic measure of fuzzy entropy in multi attribute decision making have been presented where the parameter affects the preference order.
Бесплатно
Статья научная
In this article, we would like to revisit and comment on the widely used definition of cardinality of fuzzy sets. For this purpose we have given a brief description of the history of development of fuzzy cardinality. In the process, we can find that the existing definition fails to give a proper cardinality while dealing with complementation of fuzzy sets. So there arises the need of defining the cardinality in a different manner. Here a new definition of cardinality is proposed which is rooted in the definition of complementation of fuzzy sets on the basis of reference function. This definition of cardinality will inevitably play an important role in any problem area that involves complementation. Further, some important results are proven with the help of the proposed definition and it is found that these properties are somewhat analogus to those obtained with the help of the existing definition.
Бесплатно
Статья научная
Classical sliding mode controller is robust to model uncertainties and external disturbances. A sliding mode control method with a switching control low guarantees asymptotic stability of the system, but the addition of the switching control law introduces chattering in to the system. One way of attenuating chattering is to insert a saturation function inside of a boundary layer around the sliding surface. Unfortunately, this addition disrupts Lyapunov stability of the closed-loop system. Classical sliding mode control method has difficulty in handling unstructured model uncertainties. One can overcome this problem by combining a sliding mode controller and fuzzy system together. Fuzzy rules allow fuzzy systems to approximate arbitrary continuous functions. To approximate a time-varying nonlinear system, a fuzzy system requires a large amount of fuzzy rules. This large number of fuzzy rules will cause a high computation load. The addition of an adaptive law to a fuzzy sliding mode controller to online tune the parameters of the fuzzy rules in use will ensure a moderate computational load. Refer to this research; tuning methodology can online adjust both the premise and the consequence parts of the fuzzy rules. Since this algorithm for is specifically applied to a robot manipulator.
Бесплатно
Статья научная
In this paper we consider the inclusion properties for upper and lower approximation of union and intersection of sets for both pessimistic and optimistic multigranulations. We find that two inclusions for pessimistic cases are actually equalities. For other six cases we provide examples to show that actually the proper inclusions hold true. On the approximation of classifications a theorem was proved in Tripathy et al to establish sufficient type properties. We establish here that actually the result is both necessary and sufficient one. Also, we consider types of elements in classifications with respect to both types of multigranulations and establish a general theorem on them.
Бесплатно
On Some Properties of Entropy of Fuzzy Numbers
Статья научная
Here at first we are going to give a brief history of the development of fuzzy entropy. Finally, new measures for entropy of fuzzy sets in continuous cases are introduced. In this article, our main purpose is to show that the entropy of fuzzy number is very much dependent on the selection of intervals. Another important thing which can be observed from the cases discussed is that the entropy of triangular fuzzy numbers is the same for the same choice of interval length and for non triangular fuzzy number this property does not hold.
Бесплатно
On Some Results Based on Geometrical Representation of Fuzzy Sets
Статья научная
The main purpose of this article is to highlight the fact that there are some drawbacks in the existing definition of complementation of fuzzy sets and hence the geometrical representation of fuzzy sets on the basis of such definition which itself is defective would have no meaning. As a result the theorems or formulas which were rooted in the geometrical representation would become unacceptable and it is realized that in most cases of practical significance it is desirable to consider an additional requirement in defining fuzzy complement. It is important to mention here the fact that all these existing properties are being seen through the application of complementation of fuzzy sets which is rooted in the reference function. The current definition of complementation would infact remove those drawbacks and cosequently produce the results which seems to be logical.
Бесплатно
On Some Topological Properties of Pessimistic Multigranular Rough Sets
Статья научная
Rough set theory was introduced by Pawlak as a model to capture impreciseness in data and since then it has been established to be a very efficient tool for this purpose. The definition of basic rough sets depends upon a single equivalence relation defined on the universe or several equivalence relations taken one each at a time. There have been several extensions to the basic rough sets introduced since then in the literature. From the granular computing point of view, research in classical rough set theory is done by taking a single granulation. It has been extended to multigranular rough set (MGRS) model, where the set approximations are defined by taking multiple equivalence relations on the universe simultaneously. Multigranular rough sets are of two types; namely optimistic MGRS and pessimistic MGRS. Topological properties of rough sets introduced by Pawlak in terms of their types were studied by Tripathy and Mitra to find the types of the union, intersection and complement of such sets. Tripathy and Raghavan have extended the topological properties of basic single granular rough sets to the optimistic MGRS context. Incomplete information systems take care of missing values for items in data tables. MGRS has also been extended to such type of incomplete information systems. In this paper we have carried out the study of topological properties of pessimistic MGRS by finding out the types of the union, intersection and complement of such sets. Also, we have provided proofs and examples to illustrate that the multiple entries in the table can actually occur in practice. Our results hold for both complete and incomplete information systems. The multiple entries in the tables occur due to impreciseness and ambiguity in the information. This is very common in many of the real life situations and needed to be addressed to handle such situations in efficient manner.
Бесплатно
On The Edge-balance Index Sets of the Power Circle Nested Graph C_(7^m)×P_(m_7) (m≡2(mod3))
Статья научная
Based on the equal-cycle nested graph, the power-cycle nested graph is brought forward. In this paper, we research on the largest edge-balance index of the graph C_(7^m)×P_(m_7) (m≡2(mod3))(m≥5) by the methods and techniques of graph theory and combinatorial mathematics, and solve formula proof and graphic tectonic methods.
Бесплатно
On the Performance of Classification Techniques with Pixel Removal Applied to Digit Recognition
Статья научная
The successive loss of the outermost pixel values or frames in the digital representation of handwritten digits is postulated to have an increasing impact on the degree of accuracy of categorizations of these digits. This removal of frames is referred to as trimming. The first few frames do not contain significant amounts of information and the impact on accuracy should be negligible. As more frames are trimmed, the impact becomes more significant on the ability of each classification model to correctly identify digits. This study focuses on the effects of the trimming of frames of pixels, on the ability of the Recursive Partitioning and Classification Trees method, the Naive Bayes method, the k-Nearest Neighbor method and the Support Vector Machine method in the categorization of handwritten digits. The results from the application of the k-Nearest Neighbour and Recursive Partitioning and Classification Trees methods exemplified the white noise effect in the trimming of the first few frames whilst the Naive Bayes and the Support Vector Machine did not. With respect to time all models saw a relative decrease in time from the initial dataset. The k-Nearest Neighbour method had the greatest decreases whilst the Support Vector Machine had significantly fluctuating times.
Бесплатно
On the Validity of Nonlinear and Nonsmooth Inequalities
Статья научная
In this article, a new approach is presented to survey the validity of the nonlinear and nonsmooth inequalities on a compact domain using optimization. Here, an optimization problem corresponding with the considered inequality is proposed and by solving of which, the validity of the inequality will be determined. The optimization problem, in smooth and nonsmooth forms, is solved by a linearization approach. The efficiency of presented approach is illustrated in some examples.
Бесплатно
On the root-power mean aggregation based neuron in quaternionic domain
Статья научная
This paper illustrates the new structure of artificial neuron based on root-power means (RPM) for quaternionic-valued signals and also presented an efficient learning process of neural networks with quaternionic-valued root-power means neurons (ℍ-RPMN). The main aim of this neuron is to present the potential capability of a nonlinear aggregation operation on the quaternionic-valued signals in neuron cell. A wide spectrum of aggregation ability of RPM in between minima and maxima has a beautiful property of changing its degree of compensation in the natural way which emulates the various existing neuron models as its special cases. Further, the quaternionic resilient propagation algorithm (ℍ-RPROP) with error-dependent weight backtracking step significantly accelerates the training speed and exhibits better approximation accuracy. The wide spectrums of benchmark problems are considered to evaluate the performance of proposed quaternionic root-power mean neuron with ℍ-RPROP learning algorithm.
Бесплатно
Ontology Development and Query Retrieval using Protégé Tool
Статья научная
This paper highlights the explicit description about concept of ontology which is concerned with the development and methodology involved in building ontology. The concept of ontologies has contributed to the development of Semantic Web where Semantic Web is an extension of the current World Wide Web in which information is given in a well-defined meaning that translates the given unstructured data into knowledgeable representation data thus enabling computers and people to work in cooperation. Thus, we can say that Semantic Web is information in machine understandable form. It is also called as Global Information Mesh (GIM). Semantic Web technology can be used to deal with challenges including traditional search engines and retrieval techniques within given organizations or for e-commerce applications whose initial focus is on professional users. Ontology represents information in a manner so that this information can also be used by machines not only for displaying, but also for automating, integrating, and reusing the same information across various applications which may include Artificial Intelligence, Information Retrieval (IR) and many more. Ontology is defined as a collection of set of concepts, their definitions and the relationships among them represented in a hierarchical manner that is termed as Taxonomy. There are various tools available for developing ontologies like Hozo, DOML, and AltovaSemantic Works etc. We have used protégé which is one of the most widely used ontology development editor that defines ontology concepts (classes), properties, taxonomies, various restrictions and class instances. It also supports several ontology representation languages, including OWL. There are various versions of protégé available like WebProtege 2.0 beta, Protégé 3.4.8, Protégé 4.1 etc. In this paper, we have illustrated ontology development using protégé 3.1 by giving an example of Computer Science Department of University System. It may be useful for future researchers in making ontology on protégé version 3.1.
Бесплатно
OpenMP Teaching-Learning Based Optimization Algorithm over Multi-Core System
Статья научная
The problem with metaheuristics, including Teaching-Learning-Based Optimization (TLBO) is that, it increases in the number of dimensions (D) leads to increase in the search space which increases the amount of time required to find an optimal solution (delay in convergence). Nowadays, multi-core systems are getting cheaper and more common. To solve the above large dimensionality problem, implementation of TLBO on a multi-core system using OpenMP API’s with C/C++ is proposed in this paper. The functionality of a multi-core system is exploited using OpenMP which maximizes the CPU (Central Processing Unit) utilization, which was not considered till now. The experimental results are compared with a sequential implementation of Simple TLBO (STLBO) with Parallel implementation of STLBO i.e. OpenMP TLBO, on the basis of total run time for standard benchmark problems by studying the effect of parameters, viz. population size, number of cores, dimension size, and problems of differing complexities. Linear speedup is observed by proposed OpenMP TLBO implementation over STLBO.
Бесплатно
Operational Mechanism and Evaluation System for Emergency Logistics Risks
Статья научная
Lots of risks existed in the operating process of emergency logistics especially when natural disasters happened. Both operating mechanism and evaluation system research on Emergency Logistics Risks (ELR) are the basis of effective recognizing, preventing and responding to risks, so it’s of great theoretical and practical significance to study the formation and influence mechanism and to establish an evaluating index system for ELR. Firstly, some foundation research about ELR was carried out, including definition, characteristics and classification of ELR. The formation and influence mechanism of ELR were discussed. The research of questionnaire survey offered an objective support for theoretical mechanism and index system establishment. Then, the evaluating index system for ELR was established. This system was a multi-level index system, and mainly evaluated by the decision-making risk, dispatching and commanding risk, organizing and coordinating risk, executing and controlling risk, resources supporting risk and their sub index. The establishment principles and significance of the index system were discussed. Then, the fuzzy comprehensive evaluation and Delphi method were used to confirm the index weight and value. Finally, a case analysis on ELR of Yushu earthquake was conducted to demonstrate the evaluating index system and to evaluate the actual risk level.
Бесплатно
Operations and Ranking Methods for Intuitionistic Fuzzy Numbers, a Review and New Methods
Статья научная
Intuitionistic Fuzzy Numbers (IFNs) transfer more information than fuzzy numbers do in uncertain situations. It is caused that many others tried to define methods for ranking of IFNs and arithmetic operations on them, which are used in practical applications of IFNs such as decision making. Arithmetic operators on IFNs changed membership and non-membership degrees. The resulted degrees have important interpretations in real application of IFNs. In this paper, we will first review the existing methods for ranking and arithmetic operations on several representations of IFNs. Then, we will propose a new method based on arithmetic mean and geometric mean to compute membership and non-membership degrees of resulted IFN from arithmetic operations on IFNs. It is caused that the resulted degrees don't change monotonousness and be closer to reality. Furthermore, a new method for ranking of IFNs will be proposed. Finally, the proposed methods are used in the numerical examples, compared to some other existing methods.
Бесплатно
Opinion score mining: an algorithmic approach
Статья научная
Opinions are used to express views and reviews are used to provide information about how a product is perceived. People contributions lie in posting text messages in the form their opinions and emotions which may be based on different topics such as movie, book, product, and politics and so on. The reviews available online can be available in thousands, so making the right decision to select a product becomes a very tedious task. Several research works has been proposed in the past but they were limited to certain issues discussed in this paper. The reviews are collected which periodically updates itself using crawler discussed in our previous work. Further after applying certain pre-processing tasks in order to filter reviews and remove unwanted tokens, the sentiments are classified according to the novel unsupervised algorithm proposed. Our algorithm does not require annotated training data and is adequate to sufficiently classify the raw text into each domain and it is applicable enough to categorize complex cases of reviews as well. Therefore, we propose a novel unsupervised algorithm for categorizing sentiments into positive, negative and neutral category. The accuracy of the designed algorithm is evaluated using the standard datasets like IRIS, MTCARS, and HAR.
Бесплатно
Optimal Control Approach for Solving Linear Volterra Integral Equations
Статья научная
In this paper we present a new approach for linear Volterra integral equations that is based on optimal control theory. Some optimal control problems corresponding Volterra integral equation be introduced which we solve these problems by discretization methods and linear programming approaches. Finally, some examples are given to show the efficiency of approach.
Бесплатно
Optimal Control of Switched Systems based on Bezier Control Points
Статья научная
This paper presents a new approach for solving optimal control problems for switched systems. We focus on problems in which a pre-specified sequence of active subsystems is given. For such problems, we need to seek both the optimal switching instants and the optimal continuous inputs. A Bezier control points method is applied for solving an optimal control problem which is supervised by a switched dynamic system. Two steps of approximation exist here. First, the time interval is divided into k sub-intervals. Second, the trajectory and control functions are approximatedby Bezier curves in each subinterval. Bezier curves have been considered as piecewise polynomials of degree n, then they will be determined by n+1 control points on any subinterval. The optimal control problem is there by converted into a nonlinear programming problem (NLP), which can be solved by known algorithms. However in this paper the MATLAB optimization routine FMINCON is used for solving resulting NLP.
Бесплатно
