Application of shuffled frog-leaping algorithm on clustering

Amiri, Bahram; Fathian, Mohammad; Maroosi, Ali

doi:10.1007/s00170-009-1958-2

Cited by 111 publications

(56 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, the double watermark algorithm is chosen most of the two value image as the watermark embedding, although they have dual two the robustness of watermarking value advantage, however, is that few of watermark information, the protection of intellectual property is far better than the gray level watermark persuasive [11]. Therefore, this paper combines the actual situation has conducted the thorough research to the digital watermarking technology as well as the existing double digital watermark algorithm, and expatiates the dual watermarking self recovery technology, finally make a further improvement to the dual watermarking algorithm, proposed one kind based on the transform domain and self dual watermarking algorithm recovery technology [12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

Digital Image Watermarking Algorithms Based on Dual Transform Domain and Self-Recovery

Zhu

2015

International Journal on Smart Sensing and Intelligent Systems

View full text Add to dashboard Cite

Abstract-In view of dual watermarking algorithm for dual two value image watermarking, the watermark information there is a gray image watermarking in the expression is obviously insufficient. The proposed embedded in the carrier image on the dual watermark includes a two watermark image and a gray image watermarking algorithm, the persuasive power while maintaining the original two values of the watermark robustness at the same time, improve the watermark information. In order to balance the robustness and invisibility of watermarking algorithm, this paper analyzes the embedding position and strategy of transform domain algorithms, the DC coefficient in the carrier image is divided into blocks of DCT spectrum and spectrum on the combination of DWT coefficient method and the advantage of embedded dual watermarking, and use the NEC characteristic of the algorithm is improved adaptive based on the embedded mode. The gray image watermark bit plane decomposition compression high four bit plane information as watermarking, in reducing the original watermark loading and enhance the overall strength of self recovery system. This paper from the working principle, classification of digital watermarking, attack types, performance index, evaluation method and uses six aspects were introduced to the digital watermarking technology. Simulation study of a digital image watermarking algorithm based on DCT transform and Arnold transform, the algorithm's imperceptibility, robustness and security are analyzed, the algorithm for embedding process.

show abstract

Section: Introductionmentioning

confidence: 99%

Digital Image Watermarking Algorithms Based on Dual Transform Domain and Self-Recovery

Zhu

2015

International Journal on Smart Sensing and Intelligent Systems

View full text Add to dashboard Cite

show abstract

“…SFLA, which is full of powerful optimum-reaching ability and can be implemented easily, combines the features of Memetic algorithm (MA) and particle swarm optimization (PSO). Therefore, it integrates strong local search (LS) ability and good global search (GS) c apability into itself [5][6][7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%

“…A certain number of memetic evolution later, information exchange process goes through among memeplexes during re-shuffling period. The local scout and the reshuffling process alternate through out the whole process until a convergence criterion is reached [5][6][7][8][9].…”

Section: Brief Introduction On Sflamentioning

confidence: 99%

A Hybrid Intelligent Optimization Algorithm for an Unconstrained Single Level Lot-sizing Problem

Han¹,

Wang²,

Li-feng³

et al. 2014

TOCSJ

View full text Add to dashboard Cite

Scatter search algorithm (SSA) and shuffled frog leaping algorithm (SFLA) are two intelligent optimization algorithms. SSA was introduced to solve discrete optimization problems in 1977 and SFLA in 2003 was created for solving continuous optimization problems. Currently, These two algorithms had already been wildly applied to solving many engineering optimization problems. Within this paper, a hybrid algorithm, which combines SSA and SFLA, is presented in the hope that the hybrid algorithm can contribute a great deal to the advancement of intelligence optimization research. A test is done on an unconstrained single-level lot-sizing (SLLS) problem to further demonstrate the effectiveness and efficiency of this hybrid algorithm.

show abstract

“…Population polymorphism is proposed in paper [4], but the population updating is not adaptive. Neighborhood orthogonal operator is proposed in paper [7]. The common defect is that individuals do not have interaction.…”

Section: Introductionmentioning

confidence: 99%

An Improved Shuffled Frog Leaping Algorithm

Jiang¹

2013

J. Inf. Comput. Sci.

View full text Add to dashboard Cite

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficiency is improved. The experimental results indicate that the algorithm is feasible and show a good performance.

show abstract

Application of shuffled frog-leaping algorithm on clustering

Cited by 111 publications

References 14 publications

Digital Image Watermarking Algorithms Based on Dual Transform Domain and Self-Recovery

Digital Image Watermarking Algorithms Based on Dual Transform Domain and Self-Recovery

A Hybrid Intelligent Optimization Algorithm for an Unconstrained Single Level Lot-sizing Problem

An Improved Shuffled Frog Leaping Algorithm

Contact Info

Product

Resources

About