### Abstract

The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method of finding the operational Rate-Distortion (RD) optimal set of coefficients. The major complexity reduction lies in the reformulation of the original RD-tradeoff problem, where a new set of coefficients is used as decision variables. These coefficients are connected to the orthogonalization of the set of selected frame vectors and not to the frame vectors themselves. By organizing all possible solutions as nodes in a solution tree, we use complexity saving techniques to find the optimal solution in an even more efficient way. Using an ordered vector selection process, the complexity can be again significantly reduced and efficient Run-length encoding becomes feasible. Contrary to the original problem, the new problem can be solved optimally in a reasonable amount of time.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Conference on Image Processing |

Pages | 777-780 |

Number of pages | 4 |

Volume | 3 |

State | Published - Dec 17 2003 |

Event | Proceedings: 2003 International Conference on Image Processing, ICIP-2003 - Barcelona, Spain Duration: Sep 14 2003 → Sep 17 2003 |

### Other

Other | Proceedings: 2003 International Conference on Image Processing, ICIP-2003 |
---|---|

Country | Spain |

City | Barcelona |

Period | 9/14/03 → 9/17/03 |

### ASJC Scopus subject areas

- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering

## Cite this

*IEEE International Conference on Image Processing*(Vol. 3, pp. 777-780)