The discretization of continuous attributes in a dataset is an essential step before the Rough-Set-Theory (RST)-based classification process applied. There are many methods for discretization, but not them have linked RST instruments from beginning process. objective this research to propose method improve accuracy and reliability RST-based classifier model by involving at In proposed method, k...

Digital image is often degraded by many kinds of noise during the process of acquisition and transmission. To make subsequent processing more convenient, it is necessary to decrease the effect of noise. There are many kinds of noises in image, which mainly include salt and pepper noise and Gaussian noise. This paper focuses on median filters to remove the salt and pepper noise. After summarizin...

An a posteriori stopping rule connected with monitoring the norm of second residual is introduced for Brakhage's implicit nonstation-ary iteration method, applied to ill-posed problems involving linear operators with closed range. It is also shown that for some classes of equations with such operators the algorithm consisting in combination of Brakhage's method with some new discretization sche...

We propose a Modiied Fourier Descriptor and a new distance measure for describing and comparing closed planar curves. Our method accounts for spatial discretization of shapes, an issue seldom mentioned, much less addressed in the literature. The motivating application is shape matching in the Multimedia Analysis and Retrieval System (MARS), our content-based image retrieval system. The applicat...

This paper concerns with the modeling and construction of a fifth order method for two dimensional acoustic wave equation in heterogenous media. The method is based on a standard discretization of the problem on smooth regions and a nonstandard method for nonsmooth regions. The construction of the nonstandard method is based on the special treatment of the interface using suitable jump conditio...

This paper describes a state space discretization scheme based on statistical experimental designs generated from orthogonal arrays of strength three with index unity. Chen et al. (1999) employed this eecient discretization scheme in a numerical solution method for high-dimensional continuous-state stochastic dynamic programming (SDP). These OAs are instrumental in reducing the dimensionality o...

Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of Birget et al.(2006) allows for false accepts and false rejects because the tolerance region is not guaranteed to be centered on the original click-point, causing usability and security concerns. Using empirical data fro...

The performance of many machine learning algorithms can be substantially improved with a proper discretization scheme. In this paper we describe a theoretically rigorous approach to discretization of continuous attribute values, based on a Bayesian clustering framework. The method produces a probabilistic scoring metric for diierent discretizations, and it can be combined with various types of ...

We consider a fully discrete approximation of the H gradient flow of an energy integral where the energy density is given by the sum of a nonnegative multi-well potential term and a bending energy term. The spatial discretization is based on a Fourier spectral method, which is combined with an implicit Euler time discretization. The numerical method is shown to be stable and to exhibit optimal ...