An iterative hillclimbing algorithm for discrete optimization on images application to joint encoding of image transform coefficients.

An iterative hillclimbing algorithm for discrete optimization on images application to joint encoding of image transform coefficients.

We develop an iterative, hillclimbing-based assignment algorithm for the approximate solution of discrete-parameter cost minimization problems defined on the pixel sites of an image. While the method is applicable to a number of problems including encoding, decoding, and segmentation, this article f...

Täydet tiedot

Bibliografiset tiedot
Julkaisussa:IEEE Signal processing letters 9, 2 (2002).
Päätekijä: Bunyaratavej, P.
Aineistotyyppi: Artikkeli
Kieli:English
Aiheet:
DCT.
Approximate solution.
Coefficient sources.
Convergence.
Decoding.
Discrete optimization.
Discrete-parameter cost minimization.
Dynamic programming.
Entropy-constrained TCQ.
Entropy-constrained encoding.
Exhaustive search.
Globally optimal solution.
Greedy encoding.
Greedy methods.
Image transform coefficients.
Iterative hillclimbing algorithm.
Joint image encoding.
Local optimization.
Pixel sites.
Segmentation.
Statistical image models.
Trellis-coded quantization.