AU9734198A - Method and device for storing at least one digital image - Google Patents

Method and device for storing at least one digital image Download PDF

Info

Publication number
AU9734198A
AU9734198A AU97341/98A AU9734198A AU9734198A AU 9734198 A AU9734198 A AU 9734198A AU 97341/98 A AU97341/98 A AU 97341/98A AU 9734198 A AU9734198 A AU 9734198A AU 9734198 A AU9734198 A AU 9734198A
Authority
AU
Australia
Prior art keywords
image
pixels
image object
stored
contour information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
AU97341/98A
Other versions
AU751069B2 (en
Inventor
Christoph Heer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Publication of AU9734198A publication Critical patent/AU9734198A/en
Application granted granted Critical
Publication of AU751069B2 publication Critical patent/AU751069B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/98Adaptive-dynamic-range coding [ADRC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H04N19/423Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/20Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using video object coding

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Description

GR 97 P 2675 Foreign version Description Method and apparatus for storage of at least one digital image 5 The invention relates to the storage of digital images. Such a method is known for a method for block based image coding from [1]. In this method, the 10 digital images which are recorded by a camera have at least one image object. The image objects are of any shape, which is indicated in the form of contour information associated with the image object. The pixels are furthermore grouped into image 15 blocks, normally with a size of 8x8 or 16x16 pixels. In the method known from [1], the following procedure is described for storage of the image objects in the image. Each image object is described by a rectangle which surrounds the image object and is 20 broken down into rectangular blocks (8x8 or 16x16 pixels). The image blocks within the circumscribing rectangle are investigated to determine whether the image blocks in the rectangle all contain pixels which are or are not associated with the image object. Image 25 blocks which are not associated with the image object are marked and are written to the memory with a value which can be predetermined, for example a coding value with the value 255 for a black pixel, or with the value 0 for a white pixel. This procedure leads to a 30 considerable memory requirement for the storage of image objects. In the method known from [1] for object-based image coding, the contour information which is in each case used to describe an image object is used only for 35 masking the rectangular blocks for the object-based processing steps.
GR 97 P 2675 Foreign version The contour information exists, for example, in so called alpha planes. An alpha plane is a matrix with binary values, with a first binary value for the respective pixel in 5 the image indicating that the pixel is associated with the image object, and a second binary value for the respective pixel in the image indicating that the pixel is not associated with the image object. M4R coding for the intracoded image objects is 10 also known from [1], in which the contour information for the respective image object is likewise included. A method for image coding, in which all the edges are extracted from an image, is known from [2]. The extracted edges are stored in an edge file. The 15 extracted edges are furthermore subjected to processing, and the processed edges are removed from the image, thus resulting in a difference image. The difference image as well as the edge data are coded and transmitted. 20 An object-oriented image coding method is known from [3]. The invention is based on the problem of specifying a method as well as an apparatus by means of which it is possible to store image objects with a 25 memory space requirement which is less than that for the known methods. The problem is solved by the method as claimed in patent claim 1, and by the apparatus as claimed in patent claim 6. 30 In the method, at least some of the pixels are grouped into at least one image object. The pixels are furthermore grouped into image blocks. Contour information of the image object is associated with the image. The image is stored GR 97 P 2675 Foreign version taking account of the contour information of the image object. The apparatus has a processor unit which is set up in such a manner that the image is stored taking 5 account of the contour information. The contour information is associated with the image. At least some of the pixels are grouped into the image object, and the pixels are furthermore grouped into image blocks. The invention results in a considerable saving 10 in memory space requirement, and this is a considerable advantage, particularly in the case of object-based image coding methods. Advantageous developments of the invention result from the dependent claims. 15 In one development of the invention, it is advantageous to provide a memory header field for an image object, in which information is contained by means of which the stored pixels can be uniquely associated with their physical position in the image. 20 In this case, the only pixels stored are those which are associated with the image object. This development describes a very efficient method for storage of the information for an image object. The figures show an exemplary embodiment of the 25 invention, which will be explained in more detail in the following text, and in which: Figure 1 shows a sketch illustrating the exemplary embodiment graphically; Figures 2a and 2b show a sketch of an image coder unit 30 as well as an image decoder unit using the MPEG4 method. Figures 3a and 3b show sketches of an apparatus for storage (Figure 3a) of, and for reading (Figure 3b), an image block GR 97 P 2675 Foreign version - 4 taking account of the contour information; A sequence of images 201 recorded by a camera is coded in an image coder unit 200 (see Figure 2a) to 5 form an image data stream 202. In this case, the image which has pixels is grouped into image blocks with a size of 8x8 or 16x16 pixels. Furthermore, one image has at least one image object. The image object 101 (see Figure 1) is of any 10 desired shape and has any desired number of pixels 102 associated with the image object 101. If the image 100 contains a plurality of image objects 101, then the image objects are separately coded using the method according to the H.263 method 15 for block-based hybrid DCT image coding. This is done in means 203, 204, 205 for coding the image objects, to which the individual image objects 210, 211, 212, respectively, are passed. The coded image objects 206, 207, 208 are 20 passed to a multiplexer 209, which multiplexes the coded image objects to form the image data stream 202. The image data stream 202 is transmitted using any desired transmission system from the image coder unit 200 to an image decoder unit 250. Once the image 25 data stream 202 has been received in the image decoder unit 250, the image data stream 202 is split, in a demultiplexer 251, into the individual coded image objects 252, 253, 254. The image objects are respectively decoded in a means for decoding 255, 256, 30 257 an image object, and the decoded image objects 258, 259, 260 are reconstructed to form the image 100, in a means 261 for reconstruction of the images (see Figure 2b).
GR 97 P 2675 Foreign version Coding information is assigned to the pixels, that is to say luminance information and chrominance information is assigned to the pixels in the images 201, and the contour information for the respective 5 image object, that is to say parameters which indicate the shape of the image object, is/are assigned to each image object 101. The contour information exists in the form of a matrix which has binary values. A first binary value in 10 the matrix indicates that the respective pixel which represents the value in the matrix is associated with the image object. A second binary value indicates that the respective pixel is not associated with the image object. 15 This contour information is associated with the respective image object during the coding process. In the past, both the image blocks which are associated with the image object 101 as well as the image blocks 103 which are not associated with the 20 image object 101 were stored, the image objects which are not associated 103 with the image object [lacuna] with a default value 104. According to the invention, the image object 101 is stored in a memory 262, taking account of the 25 contour information. In order to store 8x8 image blocks, a memory header field is provided in which 1 bit in the memory header field 105, which indicates the association with the image object, is provided in the form of a matrix 30 for each pixel in the area of the image blocks. The only coding information values from the pixels which are stored in the memory 202 are those which are actually associated with the image object 101. The storage process takes place in a sequence 35 which can be predetermined, line-by-line, column-by column, or using a zigzag scan. The matrix (8x8 bit matrix) with a size of 8 bytes is interrogated line-by line, GR 97 P 2675 Foreign version -6 so that the value of the coding information associated with the pixel can be determined uniquely for each pixel. In the matrix, a first binary value is once 5 again assigned for a pixel which is associated with the image object 101, and the second binary value is assigned to a pixel which is not associated with the image object 101. Furthermore, the length of the stored image data for the respective image object is indicated 10 in the memory header field 105. Figure 3a shows a sketch of an apparatus for storage of an image block, taking account of the contour information. The contour information in the image block 301 15 to be stored is stored as a bit matrix in a field 302 which can be written to in parallel (8 bits per line) and can be read in serial form. A processor unit 303 controls the process of storing the image block 301 and its contour information via a multiplexer 304, for 20 selection of pixel data relating to the image block 301 or the bit matrix from the field 302, and a unit for address calculation 305 for the memory area 306. The data are stored in serial form. First of all, the 8 lines of the bit matrix (8 bytes) are 25 written from the field 302 to the addresses 3 to 10 in the memory area 306. The image block 301 is then written to the memory. Depending on the binary value of the bit matrix which is read in serial form from the field 301, the corresponding pixel is written from the 30 image block 301 to the memory area 306, or is masked out via the multiplexer 304. If the binary value of the bit matrix has the value which indicates that the respective pixel, to which [lacuna] image object is associated, [lacuna] an address is calculated in an 35 address calculation unit 305, and the respective pixel is stored at the appropriate address in the memory area 306. If the binary value of the bit GR 97 P 2675 Foreign version matrix has the value which indicates that the respective pixel, to which [lacuna] image object is not assigned, [lacuna] no address is calculated in the address calculation unit 305, and the respective pixel 5 in the image block 301 is jumped over. Once all the pixels in the image block 301 which are associated with the image object have been written to the memory area 306, the number of these pixels, together with an information word which indicates the binary coding, is 10 written by the processor unit, via the multiplexer 304, as header field information to the first two addresses 1 and 2 in the memory area 306. The data corresponding to the object data, as described in Figure 1, are present in the memory area. 15 Figure 3b shows a sketch of an apparatus for reading an image block which has been stored taking account of the contour information. Header field information relating to the image block stored in the memory area 350 is read, and is 20 decoded in a processor unit 351. The processor unit uses the address calculation unit 352 to control the reading of the next 8 data words, which are stored, via a multiplexer 353, as a bit matrix in a field 354 which can be written to in parallel (8 bits per line) and can 25 be read in serial form. The number of data words which are stored in the memory area 350, that is to say those which are associated with the image block to be read, is decoded from the header field information, in the processor unit 351. These addresses are addressed via 30 the address calculation unit 352, and the data words can be written to a queuing unit 355. The data are read in serial form. The bit matrix is read from the field 354 in serial form. Depending on the binary value of the bit matrix, the 35 appropriate pixel is output from the queuing unit 355, or a standard value is output, via the multiplexer 356. If the binary value of the bit matrix has the value GR 97 P 2675 - 7a - Foreign version which indicates that the respective pixel, with which [lacuna] GR 97 P 2675 Foreign version - 8 image object is associated, [lacuna] a data item is output from the queuing unit 355. If the binary value of the bit matrix has the value which indicates that the respective pixel, to which [lacuna] image object is 5 not assigned, [lacuna] a standard value which can be predetermined is output. If the standard value is output, the present value is maintained at the output of the queuing unit 355.
GR 97 P 2675 Foreign version The following publications have been cited in the course of this document: [1] ISO/IEC JTCl/SC29/WG11, Coding of moving pictures 5 and associated audio information, MPEG4 Video Verification Model Version 1.0, January 1996 [2] US 5 615 287 B1 10 [3] EP 0 825 556 Al

Claims (10)

1. A method for storage of a digital image which has pixels, 5 - [lacuna] at least some of the pixels are grouped into at least one image object, - in which pixels are grouped into image blocks, - in which contour information of the image object is associated with the image, 10 - in which the image is stored taking account of the contour information.
2. The method as claimed in claim 1, in which the contour information is provided in the form of a matrix with binary values, with a first 15 binary value for the respective pixel in the image indicating that the pixel is associated with the image object, and a second binary value for the respective pixel in the image indicating that the pixel is not associated with the image object. 20 The method as claimed in claim 1,
3. The method as claimed in claim 1 or 2, in which the image has a plurality of image objects.
4. The method as claimed in one of claims 1 to 3, in which the only pixels stored are those which are 25 associated with the image object.
5. The method as claimed in claim 4, in which a memory header field is provided for an image object, in which information is contained by means of which the stored pixels can be uniquely associated with 30 their physical position in the image.
6. An apparatus , for storage of a digital image which has pixels, having a processor unit which is set up in such a manner that GR 97 P 2675 Foreign version - at least some of the pixels are grouped into at least one image object, - pixels are grouped into image blocks, - contour information of the image object is associated 5 with the image, - the image is stored taking account of the contour information.
7. The apparatus as claimed in claim 6, in which the processor unit is set up in such a manner 10 that the contour information is provided in the form of a matrix with binary values, with a first binary value for the respective pixel in the image indicating that the pixel is associated with the image object, and a second binary value for the respective pixel in the 15 image indicating that the pixel is not associated with the image object.
8. The apparatus as claimed in claim 6 or 7, in which the processor unit is set up in such a manner that the image has a plurality of image objects. 20
9. The apparatus as claimed in one of claims 6 to 8, in which the processor unit is set up in such a manner that the only pixels stored are those which are associated with the image object. 25
10. The apparatus as claimed in claim 9, in which the processor unit is set up in such a manner that a memory header field is provided for an image object, in which information is contained by means of which the stored pixels can be uniquely associated with 30 their physical position in the image. - 12 10. The apparatus as claimed in claim 9, in which the processor unit is set up in such a manner that a memory header field is provided for an image object, in which information is contained by means of which the stored pixels can be uniquely associated with their physical position in the image. 5 DATED this Thirtieth Day of May, 2002 Siemens Aktiengesellschaft Patent Attorneys for the Applicant SPRUSON & FERGUSON 10 R- A GR 97 P 2675 Foreign version Abstract Method and apparatus for storage of at least one digital image An image to be stored has pixels which are grouped into at least one image object and into image blocks. Contour information is associated with the image object. The image is stored taking account of the contour information. Significant Figure 1
AU97341/98A 1997-09-29 1998-08-18 Method and device for storing at least one digital image Ceased AU751069B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19742959 1997-09-29
DE19742959 1997-09-29
PCT/DE1998/002403 WO1999017551A1 (en) 1997-09-29 1998-08-18 Method and device for storing at least one digital image

Publications (2)

Publication Number Publication Date
AU9734198A true AU9734198A (en) 1999-04-23
AU751069B2 AU751069B2 (en) 2002-08-08

Family

ID=7843989

Family Applications (1)

Application Number Title Priority Date Filing Date
AU97341/98A Ceased AU751069B2 (en) 1997-09-29 1998-08-18 Method and device for storing at least one digital image

Country Status (5)

Country Link
EP (1) EP1020082A1 (en)
JP (1) JP2001518763A (en)
KR (1) KR20010015667A (en)
AU (1) AU751069B2 (en)
WO (1) WO1999017551A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6683992B2 (en) * 1999-12-28 2004-01-27 Matsushita Electric Industrial Co., Ltd. Image decoding apparatus and image coding apparatus
EP1156678A3 (en) * 2000-05-15 2007-07-11 Matsushita Electric Industrial Co., Ltd. Video decoding method, video decoding apparatus, and video decoding program storage medium

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS60247782A (en) * 1984-05-23 1985-12-07 Fujitsu Ltd Arithmetic processing system for sparse matrix
CA2081140C (en) * 1992-01-14 1999-01-19 Charles Thomas Rutherfoord Digital video compression method and apparatus
US5574503A (en) * 1992-03-31 1996-11-12 Rockwell International Adaptive interframe video data compression and start-up techniques
US5353061A (en) * 1992-10-08 1994-10-04 International Business Machines Corporation System and method for frame-differencing video compression/decompression using perceptually-constant information and image analysis
KR100249028B1 (en) * 1995-03-20 2000-03-15 전주범 Apparatus for effectively encoding/decoding video signals having stationary object
US5933535A (en) * 1995-10-05 1999-08-03 Microsoft Corporation Object-based video compression process employing arbitrarily-shaped features

Also Published As

Publication number Publication date
JP2001518763A (en) 2001-10-16
KR20010015667A (en) 2001-02-26
AU751069B2 (en) 2002-08-08
EP1020082A1 (en) 2000-07-19
WO1999017551A1 (en) 1999-04-08

Similar Documents

Publication Publication Date Title
US10430099B2 (en) Data processing systems
US6941021B2 (en) Video conferencing
KR950012981B1 (en) Method and apparatus for transmitting digital information and recording
WO1998015915A9 (en) Methods and apparatus for performing digital image and video segmentation and compression using 3-d depth information
EP0782345A3 (en) Memory management for a video decoder
EP1012776A4 (en) Methods and apparatus for performing digital image and video segmentation and compression using 3-d depth information
US5410308A (en) System for processing a digital signal including auxiliary data to facilitate data reconstitution at a decoder
US7471298B1 (en) Fetching pixel data with reduced memory bandwidth requirement
AU751069B2 (en) Method and device for storing at least one digital image
US7124298B2 (en) Method and device for detecting a watermark
US6810080B1 (en) Method and apparatus for decoding video data
US7636490B2 (en) Deblocking filter process with local buffers
US5701159A (en) Digital image decoding apparatus
EP0794673B1 (en) Digital image decoding apparatus
JP3158064B2 (en) Video encoding device and video decoding device
US8265164B2 (en) Method and apparatus for determining whether adjacent macroblocks are located in the same slice
US20020071060A1 (en) Video processor using shared memory space
CN114915842A (en) Video data processing method, module, chip and storage medium
JP3170312B2 (en) Image processing device
JP2776284B2 (en) Image coding device
US20040213467A1 (en) Image processing apparatus
JPH07336675A (en) Image encoding and decoding method
US7848432B2 (en) System and method for efficiently storing macroblocks in SD-RAM
JP4404556B2 (en) Video encoding method and system, and video decoding method and system
US5774590A (en) Image data reproducing apparatus

Legal Events

Date Code Title Description
FGA Letters patent sealed or granted (standard patent)
MK14 Patent ceased section 143(a) (annual fees not paid) or expired