Cost-Based Region Growing for Fractal Image Compression

Cost-Based Region Growing for Fractal Image Compression (1998)

by Hannes Hartenstein , Dietmar Saupe

Venue:	Proc. IX European Signal Processing Conference EUSIPCO, Rhodes
Citations:	1 - 1 self

Datum	Value	Source
TITLE	Cost-based region growing for fractal image compression	INFERENCE
AUTHOR NAME	Hannes Hartenstein	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut fur Informatik, Universtitat Freiburg,	SVM HeaderParse 0.2
AUTHOR ADDR	Am Flughafen 17, 79110 Freiburg, Germany	SVM HeaderParse 0.1
AUTHOR NAME	Dietmar Saupe	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut fur Informatik, Universtitat Freiburg,	SVM HeaderParse 0.2
AUTHOR ADDR	Am Flughafen 17, 79110 Freiburg, Germany	SVM HeaderParse 0.1
ABSTRACT	For application in fractal coding we investigate image partitionings that are derived by a merge process starting with a uniform partition. At each merging step one would like to opt for the rate-distortion optimal choice. Unfortunately, this is computationally infeasible when efficient coders for the partition information are employed. Therefore, one has to use a model for estimating the coding costs. We discuss merging criteria that depend on variance or collage error and on the Euclidean length of the partition boundaries. Preliminary tests indicate that improved coding costs estimators may be of crucial importance for the success of our approach.	SVM HeaderParse 0.1
YEAR	1998	INFERENCE
VENUE	Proc. IX European Signal Processing Conference EUSIPCO, Rhodes	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	2313--2316	INFERENCE
CITATIONS	12 found	ParsCit 1.0