{
  "id": "enwiki-001370491179",
  "slug": "quantization-image-processing",
  "title": "Quantization (image processing)",
  "qid": "",
  "lead": "Quantization, involved in image processing, is a lossy compression technique achieved by compressing a range of values to a single quantum (discrete) value. When the number of discrete symbols in a given stream is reduced, the stream becomes more compressible. For example, reducing the number of colors required to represent a digital image makes it possible to reduce its file size. Specific applications include DCT data quantization in JPEG and DWT data quantization in JPEG 2000.",
  "body": "Quantization, involved in image processing, is a lossy compression technique achieved by compressing a range of values to a single quantum (discrete) value. When the number of discrete symbols in a given stream is reduced, the stream becomes more compressible. For example, reducing the number of colors required to represent a digital image makes it possible to reduce its file size. Specific applications include DCT data quantization in JPEG and DWT data quantization in JPEG 2000. Q(x) = \\left \\lfloor \\frac{x}{\\Delta} \\right \\rfloor \\times \\Delta + \\frac{\\Delta}{2} Where: Q(x) is the quantized intensity value. x is the original intensity value. Δ is the size of each quantization interval. Let's quantize an original intensity value of 147 to 3 intensity levels. Original intensity value: x=147 Desired intensity levels: L=3 We first need to calculate the size of each quantization interval: \\Delta = \\frac{255}{L-1} = \\frac{255}{3-1} = 127.5 Using the uniform quantization formula: Q(x) = \\left \\lfloor \\frac{147}{127.5} \\right \\rfloor \\times 127.5 + \\frac{127.5}{2} Q(x) = \\left \\lfloor 1.15294118 \\right \\rfloor \\times 127.5 + \\frac{127.5}{2} Q(x) = 1 \\times 127.5 + 63.75 = 191.25 Rounding 191.25 to the nearest integer, we get Q(x) = 191 So, the quantized intensity value of 147 to 3 levels is 191. = \\mathrm{round} \\left( -25.9375 \\right) =-26 Typically this process will result in matrices with values primarily in the upper left (low frequency) corner. By using a zig-zag ordering to group the non-zero entries and run-length encoding, the quantized matrix can be much more efficiently stored than the non-quantized version. ==See also== Image segmentation Image-based meshing Range segmentation ==References==",
  "categories": [
    "22968362",
    "23118434",
    "23221442",
    "23603337",
    "24043274",
    "29176270",
    "60231888"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1370491179",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1787306757.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001370491179",
    "type": "webpage",
    "title": "Quantization (image processing)",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/quantization-image-processing",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001370491179",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1370491179",
    "note": "Immutable snapshot enwiki-001370491179"
  }
}