This paper deals with a new method for recognition of offline Handwritten noncompound Devnagari Characters in two stages. It uses two well known and established pattern recognitio...
Sandhya Arora, Debotosh Bhattacharjee, Mita Nasipu...
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
Many successful models for predicting attention in a scene involve three main steps: convolution with a set of filters, a center-surround mechanism and spatial pooling to constru...
Naila Murray, Maria Vanrell, Xavier Otazu, C. Alej...
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...