Multiplication-free approximate algorithms for compressed domain linear operations on images
by Neri Merhav
Part of HP Laboratories technical report -- HPL-96-111.
No club is reading this yet — be the first to start one
Discuss Multiplication-free approximate algorithms for compressed domain linear operations on images with other readers
Join or start a book club for Multiplication-free approximate algorithms for compressed domain linear operations on images on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Multiplication-free approximate algorithms for compressed domain linear operations on images?
Sign up free on Readfeed, then browse public clubs or start your own club with Multiplication-free approximate algorithms for compressed domain linear operations on images as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Multiplication-free approximate algorithms for compressed domain linear operations on images with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Multiplication-free approximate algorithms for compressed domain linear operations on images with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.