A Survey of Image Compression Algorithms for Visual Sensor Networks

<table>Partitioning of the image <svg height="11.175" id="M18" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 13.5875 11.175" width="13.5875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M775 650l-6 -28q-60 -6 -81.5 -16t-61.5 -54l-175 -191l125 -243q30 -58 48.5 -71t82.5 -19l-5 -28h-275l7 28l35 4q31 4 37 12t-6 34l-108 216q-140 -165 -177 -219q-16 -22 -10.5 -30.5t41.5 -13.5l22 -3l-7 -28h-244l8 28q52 4 75 15.5t67 52.5q48 46 206 231
l-110 215q-26 51 -44 63t-72 17l6 28h250l-6 -28l-27 -4q-30 -5 -35 -10t3 -27q17 -43 95 -190q70 78 154 185q15 21 10 29.5t-33 12.5l-30 4l5 28h236z" id="x1D44B"></path></g>
</svg> into sets <svg height="11.75" id="M19" style="vertical-align:-0.23206pt" version="1.1" viewbox="0 0 8.2875004 11.75" width="8.2875004" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.4)"><path d="M457 488l-30 -3q-17 148 -131 148q-53 0 -84.5 -34.5t-31.5 -82.5q0 -42 25.5 -72t74.5 -62l33 -22q63 -42 95 -85t32 -102q0 -84 -67 -137t-163 -53q-58 0 -113 22t-70 43l-4 152l27 4q4 -32 15 -62.5t31 -59.5t53.5 -47t76.5 -18q56 0 92 35t36 96q0 39 -25 70t-78 68
l-31 22q-32 23 -53.5 41.5t-45 57t-23.5 77.5q0 82 58 132.5t156 50.5q46 0 101 -17l18.5 -6t17 -6t8.5 -3q-4 -55 0 -147z" id="x1D446"></path></g>
</svg> and <svg height="11.175" id="M20" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 7.5500002 11.175" width="7.5500002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M414 650l-6 -28q-63 -4 -78.5 -17.5t-27.5 -71.5l-77 -416q-11 -58 0.5 -71.5t77.5 -17.5l-5 -28h-275l8 28q63 4 79.5 18.5t27.5 70.5l80 416q11 57 -2 71t-81 18l6 28h273z" id="x1D43C"></path></g>
</svg>.</table>

International Scholarly Research Notices

A Survey of Image Compression Algorithms for Visual Sensor Networks

Figure 7