Vector quantization codebook design based on Fish School Search algorithm

Fonseca, Charles; Ferreira, Felipe A. B. S.; Madeiro, Francisco

doi:10.1016/j.asoc.2018.09.025

Cited by 12 publications

(12 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Extensive experimentation reveals that some configurations of category I ((2, 4), (4,16), (5,25), (6, 36)) yield offdiagonal coherence distribution with the variation of ≤ 0.01 (See Fig. 5).…”

Section: Numerical Resultsmentioning

confidence: 99%

“…Hybrid metaheuristics synergistically combine various optimization strategies (a combination of two metaheuristic or of an exact and metaheuristic algorithm) to achieve an optimum solution to the problem in a reduced amount of time [22]. Some hybrid metaheuristic schemes include [23][24][25][26][27][28].…”

Section: Introductionmentioning

confidence: 99%

“…In [24], the accelerated converging ant colony optimization process is used for vector quantization codebooks generation. In [25], fish school search algorithm based on swarm clustering algorithm is used for vector quantization codebook generation providing PSNR gains in comparison to the swarm clustering algorithm. In [26], codebooks for power control in distributed relay beamforming network are generated using Lloyd's algorithm and a metaheuristic general search algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks

Akram¹,

Rashid²,

Ghafoor³

et al. 2019

RADIOENGINEERING

View full text Add to dashboard Cite

Best Complex Antipodal Spherical Codes (BCASC) and Coherence Based Grassmannian Codebooks (CBGC) are state of the art algorithms to produce minimal coherence codebooks, however have high running time (relatively more in BCASC search than CBGC algorithm) which restricts their wider application. BCASC and CBGC algorithms are modified in a novel way by incorporating additional parameters adapted to three categories of codebook overcompleteness to check stagnance of optimization and divergent behaviour to achieve faster convergence. The proposed algorithms are compared with BCASC and CBGC algorithms to achieve similar coherence results in much less time.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks

Akram¹,

Rashid²,

Ghafoor³

et al. 2019

RADIOENGINEERING

View full text Add to dashboard Cite

show abstract

“…Como trabalho futuro, pretende-se avaliar a aplicação das técnicas de inicialização estudadas neste trabalho em outros algoritmos bioinspirados aplicados ao projeto de QV, como por exemplo, o algoritmo FSS-LBG (do inglês, Fish School Search -Linde-Buzo-Gray) [21].…”

Section: Conclusõesunclassified

Inicialização do Algoritmo do Vagalume Aplicado ao Projeto de Dicionários

Spencer¹,

Barros²,

Amorim³

et al. 2020

Anais Do 14. Congresso Brasileiro De Inteligência Computacional

View full text Add to dashboard Cite

“…Os impactos provocados por canais ruidosos no desempenho de um sistema de QV podem ser amenizados utilizando a Quantizac ¸ão Vetorial Otimizada para Canal (QVOC) [7], [8] ou a Quantizac ¸ão Vetorial Robusta (QVR) [6], [9], [10]. Na QVOC, o projeto do dicionário de vetores-códigos é realizado levando em considerac ¸ão a distorc ¸ão de um canal específico.…”

Section: Introduc ¸ãOunclassified

Algoritmo FSS modificado Aplicado à Quantização Vetorial Robusta de Imagens

Santana¹,

Lopes²,

Madeiro³

2021

Anais Do 15. Congresso Brasileiro De Inteligência Computacional

View full text Add to dashboard Cite

No presente trabalho, é apresentada uma versão modificada do algoritmo de Busca por Cardume (FSS – Fish School Search) aplicado ao problema de Quantização Vetorial Robusta (QVR), sendo consideradas distâncias Hamming igual a 1 e 2 no índice de desordem, o qual é figura de mérito para o problema de otimização considerado. Os resultados de simulação mostram que o algoritmo FSS apresentou melhor desempenho quando comparado ao Simulated Annealing (SA) para várias condições de transmissão de imagens por Canal Binário Simétrico.

show abstract

Vector quantization codebook design based on Fish School Search algorithm

Cited by 12 publications

References 23 publications

Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks

Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks

Inicialização do Algoritmo do Vagalume Aplicado ao Projeto de Dicionários

Algoritmo FSS modificado Aplicado à Quantização Vetorial Robusta de Imagens

Contact Info

Product

Resources

About