In this paper, we suggest to use a modified version of Smoothed0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in t...

The first step required for many applications and algorithms is the segmentation or clustering of an image. This intuitively easy problem is actually very difficult for a computer to automatically perform. While having an effective solution to this problem would be valuable for all types of image processing, it would be especially useful in medical imaging. One method that addresses this proble...

This paper presents a new framework based on modified EMD method for detection of single and multiple PQ issues. In modified EMD, DWT precedes traditional EMD process. This scheme makes EMD better by eliminating the mode mixing problem. This is a two step algorithm; in the first step, input PQ signal is decomposed in low and high frequency components using DWT. In the second stage, the low freq...

In this paper, we suggest to use a modified version of Smoothed-!0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in...

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

Abstract. In the mid-1980s B.N. Parsons [29] and the author [10] independently had the idea to generalize linear stationary k-step methods to stationary (k, l)-step methods, which were further generalized to nonstationary and even nonlinear (k, l)-step methods. Later, conjugate-gradient-type methods that are (k, l)-step methods of a similar sort were introduced and investigated in the PhD thesi...

− A modified K−means algorithm for vector quantization design has been proposed recently. In this proposition the codevector updating step is as follows: new codevector = current codevector + scale factor (new centroid − current codevector). A fixed scale factor is being used in this algorithm. In this paper, we have studied a class of scaling functions which satisfy criteria derived in the pap...

a simple method has been developed for the preconcentration of copper(ii) based on the adsorption of its modified nano polyacrylonitrile fiber. modified nano polyacrylonitrile fiber (panf) was prepared by adding of acrylic fibers to msethanolamine (mma) with different concentration solutions. the stability of a chemically modified nano polyacrylonitrile fiber especially in concentrated hydrochl...