会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明专利
    • Method and image representation format for processing digital images
    • JP5238891B2
    • 2013-07-17
    • JP2012007115
    • 2012-01-17
    • モービル イメージング イン スウェーデン アー・ベー
    • ヨハン、ステンサミ、ニエミカール‐アンダース、ヨハンソン
    • H04N1/41G06K9/36G06T9/00H04N7/26H04N7/30
    • H04N21/8153H04N19/40H04N19/46H04N19/48H04N19/60H04N19/70H04N19/93H04N21/8455H04N21/85406
    • A technique for processing a digital image is provided. According to an embodiment, the technique comprises providing the digital image in a compressed format, wherein the digital image is represented as a bitstream representing sequential image blocks (12), each block comprising one or more components (14), each component comprising several data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions (16), wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component. The technique further comprises processing the digital image using a processing unit by sequentially stepping through the bitstream. While stepping through the bitstream, the technique comprises storing in a block information table (18) an indicator to one zeroth order or first order coefficient of each image block in the bitstream and decoding the zeroth order coefficients and storing in the block information table the zeroth order coefficient of the first data unit of each component of each image block, said zeroth order coefficient being represented in a non-differential form. Said stepping through non-zeroth order coefficients of a data unit in the bitstream, said non-zeroth order coefficients being represented by a sequence of bitstream entries, comprises looking at a bit sequence (20) of a predetermined number of following bits in the bitstream, making a table lookup (22) to determine category and zero run length of at least the first bitstream entry in the bit sequence and to determine the bit length of the first bitstream entry, skipping (24) the number of bits in the bitstream corresponding to the determined bit length, summing (26) the number of skipped bits for gathering information regarding the number of bits in the bitstream between coefficients of zeroth or first order in adjacent data units; and summing (28) the number of coefficients having been stepped through until all coefficients of the data unit have been stepped through or an end of block symbol is encountered.