BTF Compression Expensive to run the fitting algorithm for an entire BTF. Non-linear numerical optimization in each iteration.
{"Image DocumentName": "BTF CompressionExpensive to run the fitting algorithm for an entire BTF. Non-linear numerical optimization in each iteration.", "Image ImageDescription": "We exploit spatial coherence to accelerate. k-means clustering. Fit for samples and use the union of all basis functions as the dictionary to fit the entire cluster. Store an additional residual function for each cluster. Improve fitting quality. Small footprint.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}