Two algorithms for approximation in highly complicated planar domains (Q3447129)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5168213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for approximation in highly complicated planar domains |
scientific article; zbMATH DE number 5168213 |
Statements
28 June 2007
0 references
image approximation
0 references
image segmentation
0 references
image compression
0 references
adaptive method
0 references
image partition
0 references
approximation in complicated planar domains
0 references
measure of domain singularity
0 references
small encoding budget
0 references
0.7367741465568542
0 references
0.7289550304412842
0 references
0.7222194075584412
0 references
