EP1588564A1 - Procede de reduction de donnees - Google Patents

Procede de reduction de donnees

Info

Publication number
EP1588564A1
EP1588564A1 EP03813911A EP03813911A EP1588564A1 EP 1588564 A1 EP1588564 A1 EP 1588564A1 EP 03813911 A EP03813911 A EP 03813911A EP 03813911 A EP03813911 A EP 03813911A EP 1588564 A1 EP1588564 A1 EP 1588564A1
Authority
EP
European Patent Office
Prior art keywords
image
transmission
information
areas
images
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.)
Ceased
Application number
EP03813911A
Other languages
German (de)
English (en)
Inventor
Ralf Hinkel
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.)
Mobotix AG
Original Assignee
Mobotix 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 Mobotix AG filed Critical Mobotix AG
Publication of EP1588564A1 publication Critical patent/EP1588564A1/fr
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
    • H04N21/2343—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements
    • H04N21/234327—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements by decomposing into layers, e.g. base layer and one or more enhancement layers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/107—Selection of coding mode or of prediction mode between spatial and temporal predictive coding, e.g. picture refresh
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/258—Client or end-user data management, e.g. managing client capabilities, user preferences or demographics, processing of multiple end-users preferences to derive collaborative data
    • H04N21/25808—Management of client data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/266—Channel or content management, e.g. generation and management of keys and entitlement messages in a conditional access system, merging a VOD unicast channel into a multicast channel
    • H04N21/2662—Controlling the complexity of the video stream, e.g. by scaling the resolution or bitrate of the video stream based on the client capabilities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/44—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs
    • H04N21/4402—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display
    • H04N21/440227—Processing of video elementary streams, e.g. splicing a video clip retrieved from local storage with an incoming video stream or rendering scenes according to encoded video stream scene graphs involving reformatting operations of video signals for household redistribution, storage or real-time display by decomposing into layers, e.g. base layer and one or more enhancement layers

Definitions

  • the present invention relates to the preamble and thus deals with the reduction of data in image data sequences.
  • a known method divides the image as in a plurality of equal-sized regions ( "tiles") and, at each of the areas, a discrete cosine transform (DCT) followed by lossy run length coding of the co-efficient (Huffmann encoding) through.
  • DCT discrete cosine transform
  • the quality and quality of the image to be transmitted are determined at the same time by the compression and compression of the coefficients to be transmitted. For each image tile, a reverse transformation is carried out at the receiver using the transmitted coefficients, and the image is then reassembled like a tile.
  • the terms "sender” and “receiver” and “transmission” are chosen for the sake of illustration only. It should be pointed out that data can always be sent locally to a specific unit , for example a hard disk memory, and that the receiver can be the same PC, for example, which previously stored data on a hard disk as a sender and now reads it again from there in order to display it.
  • JPEG Joint Photographic Experts Group
  • a disadvantage of the known methods is, inter alia, that the coding is often very complex, that a key frame is necessary, that the complex coding and waiting for a key frame transmission have a considerable delay between the scene recorded at the transmitter and the scene reproduced at the receiver brings and, what is particularly important for certain applications, that important details that can change from picture to picture are not recognizable, because only an unchanged block is shifted in the reproduced picture.
  • a separate coding is usually required, which. due to the required computing power creates additional difficulties and / or increases latency in a highly undesirable manner.
  • high resolutions can be achieved for the respective transmitted image areas. It would be desirable to at least partially alleviate at least some of the above problems.
  • the aim of the present invention is to provide something new for commercial use.
  • the present invention thus proposes, in a first basic concept, a method for image sequence data reduction, in which it is provided that image area prioritization information is provided, image area prioritization is carried out on the basis of the image area prioritization information, and image areas that change with time and are sufficiently prioritized, in particular be transmitted.
  • a first essential aspect of the present invention thus consists in the fact that the image data compression is carried out by selection, which is carried out on the basis of specific selection information. This makes it possible to extract only those image areas that are particularly important from the point of view of the selection, which lowers the data rate during transmission from the outset and, moreover, enables images from the through to be easily transmitted to the receiver
  • Priority with regard to the priority information selected image areas can be reconstructed by linking. All that is necessary is to store a corresponding amount of image areas with their respective position within an image and the time at which they were transmitted or recorded. By selecting taking into account the prioritization, a first, massive reduction in the amount of data is achieved.
  • this also allows a multi-user supply with different frame rates.
  • a memory for the different image areas is provided on the side of the receiver and the images are then composed of the most recent image areas available.
  • a receiver can also be a memory, such as a RAM or a hard disk, on which the image data are stored.
  • a receiver can be arranged remotely from the transmitter and the transmission has the advantage of the low data transmission rate, which can also be selected after coding. Unless otherwise apparent, it is also to be understood that if there is talk of a reduced transmission rate, one could just as well refer to the time integral of it, that is to say to the total amount of data of an image sequence.
  • the same areas are provided within the image sequence from image to image, at least for a large number of images. This can be achieved particularly easily by covering the image with tiles that always have the same tiles. Because of the brevity and For clarity of this term, it is often used below in places where reference is made to non-tile-like image areas instead.
  • a tile-like coverage at the same time allows particularly good further compression of the data stream using conventional methods such as JPEG compression.
  • JPEG compression it should be mentioned in this connection that it is entirely possible to provide different compression ratios for different tiles.
  • a different compression can be selected for refreshing image areas without further changes than for tiles in which there are major changes in the image. If necessary, this can further reduce the transmission rate.
  • it is possible to work with the same coding i.e. to prioritize or code for all users in the same way and then request or select the coded image information to make transmission-dependent and then only transmit those coded areas that are relatively new. As a result, the coding effort is reduced and nevertheless a good transmission with a dedicated transmission rate is obtained.
  • Different sizes can be evaluated as image area ' prioritization information.
  • the time since the last transmission should be mentioned in particular for the cyclical refreshing of the image; This is also important because by taking into account the time since the last transmission, very recent changes are used to prioritize an image area. This is advantageous, for example, when a person steps into a picture, which initially results in very strong changes at the edge. A user will then typically want to know what can be seen after the person has entered the image. An edge scan will therefore typically result in the corresponding image area being observed for some time longer.
  • coding can be carried out on the transmitter side, in particular using only the relevant fields of the frame to be captured, based on the prioritization information Frame (single image) changing or areas to be captured for other reasons and then only transmits the most recently changed image areas that are required on the receiver side to update the image and are transferable in the transmission rate.
  • prioritization information Frame single image
  • bitstream parts can be called up separately each time. It is possible to adapt a data transmission rate with regard to a full acceptance memory or the like, that is to say to allow a dynamic transmission rate also for different users, so that each or at least some of the users receive dynamic data rates.
  • pre / post alarm information arises from the fact that are not mandatory to store raw data on individual images here but rather the encoded, compressed data and also that only high-priority image tiles, or 'image areas are to be taken so that the Total amount of relevant information is relatively low.
  • FIG. 4 illustrates a possible hardware implementation for an image transmitter.
  • an arrangement 1, generally designated 1, for data compression or reduction in the transmission of images from a sequence, which here exemplifies a scene 2 at a bank counter, comprises an image generator 3, a subordinate image data reduction. and transmission unit 4, in which, as will be described in more detail below, image area prioritization information is provided, image area prioritization is carried out on the basis of the image area prioritization information, and sufficiently prioritized image areas are transmitted via a transmission line 5 to a receiver 6, which, as will be described below, does the same is designed to temporarily store and display transmitted image areas of a plurality of images of a sequence Link individual images and / or the entire image sequence.
  • the image scene 2 in the present example shows a bank counter 2a which is observed from a given direction and is open to the public, represented by a person 2b, and a bank device in the image area, shown here as a plant 2c. It will be appreciated that when monitoring scene 2, particular emphasis should be placed on observing customer traffic, as symbolized by person 2b, and less on furniture, as symbolized by switch 2a and plant 2c.
  • the imager 3 is designed as a camera with a CCD field, which delivers images from the perspective of the scene 2 shown in FIGS. 2a (I) - 2a (V). As can be seen, this perspective is unchangeable, so the camera is permanently mounted; however, this is not necessarily the case, but has been chosen only for the sake of clarification.
  • An input 4a for the image signals from the camera 3 is provided in the image data reduction and transmission unit .4.
  • An internal memory 4b is connected to the input 4a, which is designed to initially record several images completely and to output them in whole or in part repeatedly into a prioritization stage 4c.
  • the memory 4b has a storage capacity for at least two images.
  • the prioritization level 4c is designed to subdivide individual images, into several image areas and to prioritize the respective areas in an image, the prioritization level 4c for receiving prioritization information from one Prioritization information memory 4d is formed.
  • the prioritization stage 4c is linked at an output to an image region compression and transmission stage 4e, which is designed to feed data on image regions to the transmission line 5 in compressed form.
  • the transmission line 5 is limited in its bandwidth, in such a way that image sequences cannot be transmitted permanently and completely uncompressed.
  • the receiver 6 has an input stage 6a behind the outlet for the transmission line 5 with a memory for the transmitted image areas and the additionally transmitted information about their position in the respective image.
  • This input stage is connected to the logic stage 6b, which has read access to the memory of the input stage and links the data read from the memory in a manner to be described.
  • the link stage 6b is followed by an image output unit 6c in order to output the areas linked to an image to a display device.
  • the Schmfflereduktions- and transmission unit can be realized by a programmable micro-electronics such as a PC or a dedicated signal processing electronics', just as it is possible to realize nevertheless receiver and the steps described for instance by software on a computer system. Furthermore, it is evidently possible to combine receivers and transmitters, with image processing, storage and reproduction being possible simultaneously on one and the same system, for example a PC. With the system described, an image sequence data reduction now takes place, that is to say a compression of the data of an image sequence, for example a continuous stream of video data with 15-40 frames per second, as explained below with reference to FIGS. 2 and 3. The image area prioritization is explained with reference to FIG. 2 and the image reconstruction of an image of an image sequence with reference to FIG. 3.
  • FIG. 2a shows successively recorded images of scene 2.
  • images (I) and (II) a person is shown at the bank counter who is immobile there for a longer period of time, so that changes in image (I ) to image (II) are only caused by noise.
  • picture (III) the person draws a weapon.
  • picture (IV) the person begins to speak, which leads to the fact that the area around the mouth between picture (III) and picture (IV) changes significantly.
  • a random change in the background has occurred due to the falling off of a leaf of the plant shown. It will be appreciated that this change in the background is of minor interest to the viewer of the raid scene.
  • picture (V) the person turns his face to the camera.
  • the images (I) - (V) are first divided into a large number of image areas, namely in the present case in 6 x 8 boxes. smile, which are identical from picture to picture. This is shown by the grid in the pictures.
  • Fig. 2 (b) shows areas on the far left that are of less interest to the viewer. On the one hand, this is the area. on the left in the first picture of the row near the counter, which is completely unchangeable, and the area on the far right in this picture, which also shows the almost unchangeable bench furniture, • d. H. shows a plant. These areas of lesser interest can be specified by the user and stored as prioritization information in the image data reduction and transmission unit 4, in particular in the prioritization information memory 4d thereof, or can be identified automatically by long-term observation of changes.
  • FIG. 2c in the picture on the far left by the fact that a zero is shown instead of the two crosses, which means that after the information about the most changed area has been linked with the information about the typical relevance of the same areas in which this change occurs, a transmission can be dispensed with.
  • the images of FIG. 2c on the far left are thus obtained by determining the differences between two images, taking into account their typical relevance based on the respective area.
  • FIG. 2d shows that, in addition to the image areas determined to be transmitted by forming the difference and comparing them with particularly relevant areas, more are added cyclically.
  • this is a block of three tiles,. which moves from image to image in a meandering manner, as indicated by the serpentine arrow and is clearly visible when looking at the images from left to right.
  • This block is transmitted regardless of whether or not an image tile is in an area which is of no interest per se.
  • the 6 x 8 tiles into which each individual image is broken down are completely transferred with groups of three after the transmission of 16 partial images. At the latest after 16 drawing files, each tile was retransmitted once, even if there was no change in it.
  • Fig. 2e therefore shows on the far left that only the three image tiles from the cyclical for the transmission Transmission and a tile with high noise must be considered.
  • 2c there are two tiles in the region which is not marked as interesting in principle. These tiles are again hidden. 2c shows where tiles for the cyclical refresh are to be provided in the current image and FIG. 2e shows which tiles are actually to be transferred after taking the cyclical refresh into account. As can be seen, a total of thirteen tiles are transferred.
  • the pictures (III) and (IV) differ from each other in those tiles in which the person's mouth lies and in which the fallen leaf of the plant was located. Due to the large change, a frame is again drawn around the tile with the moving mouth, since changes could typically also be relevant in adjacent tiles and, moreover, a complete image section with the surroundings exercise of the change can be provided for the transfer. On the other hand, no frame is drawn around the strong change on the tile of the fallen plant leaf, because it is determined that this tile lies within an area of no interest per se. Furthermore, when prioritizing areas to be selected for transmission, it is found that there have previously been major changes in the area of the tiles in which the weapon has appeared.
  • FIG. 2c shows that those image areas which lie in the vicinity of the image tile provided with an exclamation mark and the two tiles in which the greatest change was previously observed are thus prioritized for the transmission.
  • FIG. 2d there are three tiles from the cyclical run of the image.
  • Fig. 2e shows where the fourteen tiles to be transferred are.
  • prioritization takes place, inter alia, with regard to the general meaning Sti mter image areas, which result from user specifications and / or from the image analysis itself, that and how noise thresholds, sizes of the change also and especially in comparison to other tiles in the current image, the short-term history of differences and the consideration of changes in nearby , in the present case, only immediately adjacent image tiles can be used as an example. It should be noted that further criteria can be added and / or parts or all of the above-mentioned criteria can be omitted and a considerable image sequence data reduction is nevertheless obtained ' . It should also be mentioned that other ways of linking the prioritization information than the existing one are possible, that is to say linking using methods of fuzzy logic, weighting etc.
  • FIG. 3 now shows how the image areas transmitted at specific times lie within the image. It can be seen that these areas can be stored in a memory in the receiver, in the present case in memory 6a, and can be read out for the reconstruction of a given image.
  • the images of the sequence are characterized in FIG. 3 by the times (t-0, t-1, • t-2 .%) at which they were taken.
  • the image to be displayed at time t-0 thus has a small number of tiles that are at most sixteen images in the sequence behind and a large number of tiles from images that are younger.
  • the invention is also particularly advantageous for feeding data streams with different transmission rates to different users. This should be discussed using the example of dedicated hardware, while at the same time pointing out the existence of other implementation options.
  • an imaging unit 40 is provided, which is connected to a raw image data memory 41 for feeding raw image data, which in turn is designed to feed processed image data to an image memory for storing image data. It should be mentioned that this can be achieved by paging or the like so that the data does not have to be physically transmitted.
  • the possibility of image / prototype paging is through the shared memory 43 for current raw image data . n and original raw data memory 42 are indicated.
  • the raw image data from the raw image data memory 41 can be fed, on the one hand, to a comparator 44, to which a line 45 also leads from the original raw data memory, and which is designed to detect changes in the raw image between the current and the original (although full image coding may also have been carried out could be and then the comparison is made on the basis of the compressed data, but this is not the case in the illustrated embodiment due to the lower required computing power, as is preferred).
  • a connection is provided for transmitting the current raw image data to an encoder, in the exemplary embodiment shown a JPEG encoder 46, which is designed to carry out the actual coding.
  • the JPEG encoder 46 outputs data frame by frame to a frame buffer 48, in which image data obtained successively over time is stored, in each case only the tiles that have changed.
  • a frame counter 49 is assigned to the frame buffer 48.
  • the frame buffer is now organized so that temporally successive image area information, in the present case compressed image areas for a plurality of image areas, can also be stored repeatedly.
  • image area information from important image areas in which a change takes place continuously can be found in each frame, while image area information is only rarely stored for the image areas in which a change rarely takes place.
  • the frame buffer 48 is connected via a communication line to a data transmission unit, the image data for the Dispatch compiles, in such a way that the most recently changed tiles are compiled in accordance with the transmission rate, similarly as is explained in detail for the reproduction case in FIG. 3.
  • Data can then be output from this transmission unit 50 via a suitable interface, such as a WLA connection, an Internet connection, GSM or the like.
  • the linksability with audio data should be mentioned; the circuits provided for this are not shown.
  • the tiles stored in the frame buffer can be time-coded and the entire audio information is then also provided with time stamps when it is converted, in order to ensure that all audio information that has accumulated since a last image call is transmitted.
  • the arrangement is used to feed data with different transmission rates as follows:
  • a first user who needs a still image receives image data in which the latest available tiles are used for an image to be displayed.
  • the picture compiled in this way is transferred to him. If he requests what is possible to collect older data for pre-alarm recording, he will be compiled with data that uses the most recent available since the cut-off time.
  • Another user who needs a video stream with a low transmission rate is periodically compiled and transmitted those images which each comprise the latest image tiles for all areas. If he now demands a higher transmission rate, such images are transmitted to him more often; accordingly, he now often receives image tiles that he would otherwise not see, otherwise with a lower temporal resolution than later, already outdated.
  • the higher transmission rate manifests itself in a larger up-to-date image data. It is understandable from the foregoing that the data that is transmitted as currently up-to-date is in turn prioritized over image areas that have already been recorded at the same time. If the user also needs sound, the sound data since the last request is first transmitted to him and then image data of the associated time. This ensures synchronicity.

Landscapes

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

Abstract

L'invention concerne un procédé permettant de réduire des données de séquences d'images. Ce procédé consiste à mettre à disposition des informations de classement de zones d'images par ordre de priorité, à réaliser un classement des zones d'images par ordre de priorité au moyen de ces informations, puis à transmettre les zones d'image présentant un ordre de priorité suffisant.
EP03813911A 2002-12-23 2003-12-23 Procede de reduction de donnees Ceased EP1588564A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10261501 2002-12-23
DE2002161501 DE10261501A1 (de) 2002-12-23 2002-12-23 Verfahren zur Datenreduktion
PCT/EP2003/014795 WO2004059981A1 (fr) 2002-12-23 2003-12-23 Procede de reduction de donnees

Publications (1)

Publication Number Publication Date
EP1588564A1 true EP1588564A1 (fr) 2005-10-26

Family

ID=32519470

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03813911A Ceased EP1588564A1 (fr) 2002-12-23 2003-12-23 Procede de reduction de donnees

Country Status (4)

Country Link
EP (1) EP1588564A1 (fr)
AU (1) AU2003296719A1 (fr)
DE (1) DE10261501A1 (fr)
WO (1) WO2004059981A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10310636A1 (de) 2003-03-10 2004-09-30 Mobotix Ag Überwachungsvorrichtung
DE10310635A1 (de) 2003-03-10 2004-09-23 Mobotix Ag Überwachungsvorrichtung
DE102009021974A1 (de) 2009-05-19 2011-03-03 Mobotix Ag Digitale Videokamera

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5426513A (en) * 1989-06-16 1995-06-20 Harris Corporation Prioritized image transmission system and method
DE4138254C1 (fr) * 1991-11-21 1993-06-24 Grundig E.M.V. Elektro-Mechanische Versuchsanstalt Max Grundig Hollaend. Stiftung & Co Kg, 8510 Fuerth, De
DE4402779C2 (de) * 1994-01-27 1997-05-28 Mannesmann Ag Tankstellenbeobachtungssystem
EP0925689B1 (fr) * 1996-09-12 2002-07-03 University Of Bath Systeme video oriente objet
US5953506A (en) * 1996-12-17 1999-09-14 Adaptive Media Technologies Method and apparatus that provides a scalable media delivery system
JPH10304334A (ja) * 1997-04-25 1998-11-13 Canon Inc 通信方法、通信装置、送信装置、受信装置、通信システム、及び記憶媒体
JP3905969B2 (ja) * 1998-01-30 2007-04-18 株式会社東芝 動画像符号化装置および動画像符号化方法
GB2350512A (en) * 1999-05-24 2000-11-29 Motorola Ltd Video encoder
JP3926572B2 (ja) * 2001-03-02 2007-06-06 株式会社日立製作所 画像監視方法、画像監視装置及び記憶媒体

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2004059981A1 *

Also Published As

Publication number Publication date
WO2004059981A1 (fr) 2004-07-15
AU2003296719A1 (en) 2004-07-22
DE10261501A1 (de) 2004-07-15

Similar Documents

Publication Publication Date Title
DE69516139T2 (de) Komprimierter digitaler bildüberlagerungskontroller und methode
DE69422208T2 (de) Filmbilderkennung in einer Videosequenz
DE69229773T2 (de) Statistischer Multiplexer für ein Multikanal-Bildkomprimierungssystem und Demultiplexer
DE69514177T2 (de) System für audiovisuelle vorführung
DE69823168T2 (de) Verfahren und gerät zur kodierung und formatierung von daten eines videoprogramms zur erzeugung sich mehrfach überlappender darstellungen des videoprogramms
DE69837081T2 (de) Videopufferspeicher zur nahtlosen verbindung von mpeg-strömen
DE69515337T2 (de) Bereitstellung von Videorekorder-Trickfunktionen in einem Videoverteilsystem
DE69414899T2 (de) Bildsignalverarbeitung
DE69515647T2 (de) Schnittstelle für videokamera und intra / inter-frame kodierer
DE69511570T2 (de) Verfahren und gerät zur kodierung und formatierung von videoprogrammdaten zur bereitstellung sich mehrfach überlappender videoprogramme
DE69917971T2 (de) Verfahren und Vorrichtung zur Verarbeitung von komprimierten Videodatenströmen
DE69408838T2 (de) Videoschnittsystem
DE69835211T2 (de) Umschaltung zwischen komprimierten videobitströmen
EP1371229B1 (fr) Procede de compression et de decompression de donnees video
DE69630297T2 (de) Weiterentwickeltes fernsehsystem
DE69421449T2 (de) Kodierer zur adaptiven Kodierung von Videobilddaten getrennt nach der ihnen zugeordneten Priorität
DE112010004844T5 (de) Videocodierung unter Verwendung von Pixeldatenströmen
EP0985320B1 (fr) Dispositif de multiplexage de signaux videos
WO2004059981A1 (fr) Procede de reduction de donnees
DE69530875T2 (de) Datenaufnahme-/-wiedergabevorrichtung und -verfahren
DE19908082C2 (de) Lokales ringförmiges Netzwerk
WO2018210485A1 (fr) Procédé de traitement et système de traitement de données vidéo
DE102009021974A1 (de) Digitale Videokamera
EP0336510A2 (fr) Codeur predictif d'image immobile
DE19717453C2 (de) Verfahren zum Einblenden eines neuen Bildabschnittes an einer vorbestimmten Stelle eines datenreduzierten Video-Datenstromes

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20050725

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB LI

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
APBK Appeal reference recorded

Free format text: ORIGINAL CODE: EPIDOSNREFNE

APBN Date of receipt of notice of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA2E

APBR Date of receipt of statement of grounds of appeal recorded

Free format text: ORIGINAL CODE: EPIDOSNNOA3E

APAF Appeal reference modified

Free format text: ORIGINAL CODE: EPIDOSCREFNE

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: MOBOTIX AG

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

APBT Appeal procedure closed

Free format text: ORIGINAL CODE: EPIDOSNNOA9E

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20191009