Neighborhood Hybrid Structure for Discrete Optimization Problems

Cruz-Chávez, Marco Antonio; Martinez-Oropeza, Alina; Barquera, Sergio A. Serna

doi:10.1109/cerma.2010.24

Cited by 9 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The tuning of the parameters of the ILS algorithm for sign prediction have been obtained through a sensitivity analysis based on [10]. After the stopping criteria the best obtained results are shown.…”

Section: Ils For Sign Prediction Tablementioning

confidence: 99%

Tuning an Iterated Local Search Algorithm for Wavelet Sign Coding for 2D Image Compression

Moreno-Bernal

Cruz-Chávez

López

et al. 2013

2013 International Conference on Mechatronics, Electronics and Automotive Engineering

Self Cite

View full text Add to dashboard Cite

Wavelet transforms have proved to be very powerful tools for image compression. Previous studies haveverified that there is a strong correlation between the sign of a wavelet coefficient and the signs of their neighbors. This correlation opens the possibility of using a sign predictor in order to improve the image compression process. In this paper a new sign coding approximation method for the wavelet coefficients in a 2D image codec based on an iterated local search algorithm (ILS) is presented. The efficiency of the proposed algorithm versus simulated annealing algorithm (SA) and genetic algorithm (GA) using standard images and benchmarks of Kodak is compared. The proposed sign prediction algorithm is as efficient as other methods and it provides a significant reduction of wavelet coefficients sign information in the final bit-stream.

show abstract

Section: Ils For Sign Prediction Tablementioning

confidence: 99%

Tuning an Iterated Local Search Algorithm for Wavelet Sign Coding for 2D Image Compression

Moreno-Bernal

Cruz-Chávez

López

et al. 2013

2013 International Conference on Mechatronics, Electronics and Automotive Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…An exhaustive tuning of the ILS parameters has been done through a sensitivity analysis based on [25], in order to allow ILS algorithm to find out a solution with the best quality as possible. Stopping criteria for local search algorithm was set as twice the size of the NSPs that depends on the neighborhood configuration, (3 n * 2) for local search loop.…”

Section: Iterated Local Searchmentioning

confidence: 99%

A General Model for the Design of Efficient Sign-Coding Tools for Wavelet-Based Encoders

et al. 2020

View full text Add to dashboard Cite

Traditionally, it has been assumed that the compression of the sign of wavelet coefficients is not worth the effort because they form a zero-mean process. However, several image encoders such as JPEG 2000 include sign-coding capabilities. In this paper, we analyze the convenience of including sign-coding techniques into wavelet-based image encoders and propose a methodology that allows the design of sign-prediction tools for whatever kind of wavelet-based encoder. The proposed methodology is based on the use of metaheuristic algorithms to find the best sign prediction with the most appropriate context distribution that maximizes the resulting sign-compression rate of a particular wavelet encoder. Following our proposal, we have designed and implemented a sign-coding module for the LTW wavelet encoder, to evaluate the benefits of the sign-coding tool provided by our proposed methodology. The experimental results show that sign compression can save up to 18.91% of bit-rate when enabling sign-coding capabilities. Also, we have observed two general behaviors when coding the sign of wavelet coefficients: (a) the best results are provided from moderate to high compression rates; and (b) the sign redundancy may be better exploited when working with high-textured images.

show abstract

“…Como se puede observar, cada caja representa un elemento: el elemento 1 tiene un beneficio de $4 y un peso de 12 kg; el elemento 2 tiene un beneficio de $2 y un peso de 2 kg; el elemento 3 Figura 1. Búsqueda local iterada [7]…”

Section: Figura 2 Representación Del Problema De La Mochilaunclassified

Un algoritmo de búsqueda local iterada como solución al problema de la mochila

Nueva¹,

Urbano²,

Ojito³

2014

Progmat

View full text Add to dashboard Cite

El problema de la mochila se clasifica como un problema de optimización combinatoria y, desde el punto de vista computacional, entra en la categoría de los problemas NP-completos [1]. En este artículo se soluciona el problema de la mochila aplicando un algoritmo de búsqueda local iterada en el contexto de la distribución de productos almacenados en bodegas y a su distribución en tiendas. En los resultados obtenidos se observa la convergencia del algoritmo implementado.

show abstract

Neighborhood Hybrid Structure for Discrete Optimization Problems

Cited by 9 publications

References 11 publications

Tuning an Iterated Local Search Algorithm for Wavelet Sign Coding for 2D Image Compression

Tuning an Iterated Local Search Algorithm for Wavelet Sign Coding for 2D Image Compression

A General Model for the Design of Efficient Sign-Coding Tools for Wavelet-Based Encoders

Un algoritmo de búsqueda local iterada como solución al problema de la mochila

Contact Info

Product

Resources

About