WO2000025429A1 - Procede de compression de donnees et dispositifs compressibles - Google Patents

Procede de compression de donnees et dispositifs compressibles Download PDF

Info

Publication number
WO2000025429A1
WO2000025429A1 PCT/AU1999/000913 AU9900913W WO0025429A1 WO 2000025429 A1 WO2000025429 A1 WO 2000025429A1 AU 9900913 W AU9900913 W AU 9900913W WO 0025429 A1 WO0025429 A1 WO 0025429A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
numbers
patterns
characters
predetermined
Prior art date
Application number
PCT/AU1999/000913
Other languages
English (en)
Inventor
Gregory Michael Orme
Original Assignee
Gregory Michael Orme
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
Priority claimed from AUPP6660A external-priority patent/AUPP666098A0/en
Priority claimed from AUPP9781A external-priority patent/AUPP978199A0/en
Priority claimed from AUPQ3360A external-priority patent/AUPQ336099A0/en
Application filed by Gregory Michael Orme filed Critical Gregory Michael Orme
Priority to AU11410/00A priority Critical patent/AU1141000A/en
Priority to EP99971162A priority patent/EP1121758A1/fr
Publication of WO2000025429A1 publication Critical patent/WO2000025429A1/fr

Links

Classifications

    • 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
    • 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/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
    • H04N19/37—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability with arrangements for assigning different transmission priorities to video input data or to video coded data
    • 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/90—Methods 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

Definitions

  • the present invention relates to transmission of any data over a transmission medium.
  • the present invention relates to transmission of video data over the internet .
  • the amount of video data which can be transmitted over a transmission line is limited by the bandwidth of the transmission line and the amount of other data which is being transmitted at the same time. Accordingly to reduce the amount of data which is being transmitted it is common to compress the data so that the bandwidth required for its transmission is reduced.
  • the problem associated with compression of data is that it can result in loss of information or distortion.
  • Another example is in the transmission of music where data representing the music is compressed and transmitted with a certain redundancy allowable because information which is lost during transmission does not overly affect the quality of the music which is received and audible to a persons ear.
  • audio and video data is transmitted by firstly converting the data into a binary form, that is a series of zeros and ones, data is then transmitted as a sequence of binary numbers and at the receiver is reconstituted or demodulated and processed back into a form closely resembling its original form prior to transmission.
  • the transmission of video data is achieved by first representing each icon in a picture by a binary number and transmitting each of the binary numbers forming the picture as a continuous stream of binary numbers. Accordingly if millions and millions of icons are required to form a picture a consequently large stream of binary numbers are required to be transmitted to transmit the image represented by the combination of all the icons.
  • Even with conventional compression techniques a considerable amount of time, on an electronic scale is required to transmit video data and accordingly this results in a moving picture which appears to be discontinuous, because the time between transmissions is able to be picked up by the human eye.
  • the present invention provides an alternative method of compressing data, including video data, which is aimed at improving the rate at which data can be transmitted and the amount of data which may be transmitted in a unit of time.
  • a method of compressing data for transmission over a transmission medium including the steps of providing a first package of data, calculating the binary number representative of the package of data, processing the binary number using a mathematical equation to minimise the number of characters by which the binary number may be presented and converting the minimised number to a binary form for transmission over a transmission medium. It is preferred that the method includes the step of storing the first package of data and processing the first package of data to produce a single binary number representative of the first package, wherein the single binary number is the binary number. It is preferred that the method includes providing a first package of video data which is representative of a two-dimensional or three-dimensional image at a first unit of time.
  • the method preferably also includes the step of presenting the package of video data as an array in a first memory, and processing the data stored in the array to a sequential binary number. It is preferred that the method includes transmitting the converted minimised number over a transmission medium, receiving the minimised number at a receiver, processing the received minimised number to convert the minimised number to the binary number representative of the package of data and processing the binary number to produce the first package of data in memory for display on a display means.
  • the equation splits the binary number into first and second components which when multiplied together substantially equal the binary number. It is preferred that the method includes the step of determining the number of icons forming an image of transmission as video data, giving each icon a value zero or one, determining the binary number representing the value of all of the icons when expressed in a predetermined sequential manner and storing the binary number in memory.
  • the binary number is square rooted to the nth power until a number less than a predetermined number is achieved.
  • the predetermined number is less than 10 but greater than 1.
  • the video data may include redundant data which is predetermined.
  • the redundant data may form part of an image which is not viewed.
  • the redundant data may be chosen to produce a binary number which is easily able to be minimised in size in a manner previously described.
  • the video image to be transmitted may be divided into a plurality of areas with each area having a predetermined number of icons .
  • Each area may be processed to identify the number of icons and to form a binary number representing the icons of that area.
  • Each binary number of each area may be minimised to create a minimised number and each minimised number may be transmitted as part of the package of data. It is preferred that the binary number is expressed as an integer to a base determined by the number of characters required to represent the binary number.
  • a system for transmitting a moving picture including the steps of dividing an image at a first time into a first plurality of portions each portion having an associated priority for transmission with respect to another portion, storing each of the first portions making up the image at the first time, transmitting to a receiver each of the portions making up the image at the first time, dividing the image at a second time into a second plurality of portions having an associated priority for transmission with respect to another portion, storing each of the second plurality of portions making up the image at the second time, transmitting the second plurality of portions having a priority above a predetermined value and repeating the above steps for succeeding times within a predetermined time interval .
  • the associated priority is determined based on the clarity of each portion.
  • the clearer portions preferably are given a higher associated priority. It is preferred that portions of the image determined to be most important for viewing are given the higher associated priority over other portions.
  • the associated priority is based on a scale of one to ten.
  • the system includes a receiver for receiving transmitted portions.
  • the system includes a display means for displaying the portions which have been transmitted.
  • the system includes receiving and storing low priority portions and displaying the same low priority portions until those portions are transmitted to the receiver with an increased associated priority above a predetermined priority value.
  • the present invention includes a processor for monitoring an image, the processor including a dividing means for dividing video data representing an image at a particular time into a plurality of portions which are segregated based on the importance of one portion with respect to another portion, assigning each portion a priority value according to its importance and storing all of the portions making up the image at a particular time in a first memory location, retrieving those portions from the first memory location which have an associated priority above a predetermined value and transmitting those retrieved portions to a second memory location from which those portions can be transmitted to a destination for display on a display means.
  • a method of compressing data including the steps of providing a first package of data, ordering the package into a plurality of groups of data comprising a plurality of numbers, performing a mathematical operation on each group to produce a plurality of patterns of numbers, identifying predetermined patterns of numbers from the plurality of patterns of numbers, storing the location of each predetermined pattern of numbers in memory, performing a further mathematical operation on the plurality of patterns of numbers to produce a further plurality of patterns of numbers, identifying further predetermined patterns of numbers from the further plurality of patterns of numbers, storing the location of each further predetermined pattern of numbers in memory and producing a second package of data including the location of stored predetermined patterns of numbers and further predetermined patterns of numbers and the mathematical operations and the order in which they occurred.
  • the method includes the step of representing each predetermined pattern by a symbol of reduced number of
  • the method may include the step of removing each predetermined pattern of numbers from the plurality of patterns of numbers and storing each predetermined pattern of numbers as a symbol with an associated address and associated number representing the number of mathematical operations that occurred prior to the predetermined pattern of numbers being removed.
  • the method includes the step of storing the predetermined pattern of numbers that are produced after each mathematical operation in a look-up table.
  • the method may include the step of providing a storage array for storing different types of predetermined patterns produced over a predetermined period of mathematical operations.
  • the method includes the step of storing the location of each predetermined pattern in the plurality of patterns of numbers each time it occurs after a mathematical operation.
  • the mathematical operation preferably includes the step of subtracting a predetermined number from each group of numbers .
  • the mathematical operation includes the step of dividing a predetermined number into group of numbers .
  • the mathematical operation includes the step of comparing each group of numbers with a predetermined number and producing a number that is the difference.
  • the mathematical operation may include the step of removing a predetermined pattern of numbers within each group of numbers .
  • the further mathematical operation includes the step of sorting each group of numbers after predetermined patterns of numbers have been stored, the sorting being in accordance with a predetermined criterion.
  • the method preferably includes the step of shuffling the plurality of groups of numbers to produce predetermined patterns of numbers .
  • the further mathematical operation may include the step of shuffling numbers within the plurality of groups of numbers to produce predetermined patterns of numbers.
  • the package of data is preferably stored as a sequence of numbers in memory and after each mathematical operation numbers are reorganised in accordance with a predetermined transformation.
  • the package of data may be stored as a sequence of numbers in memory and after each mathematical operation numbers and symbols may be reorganised in accordance with a predetermined transformation.
  • the method preferably includes producing a new package of data including data regarding each mathematical operation required to reverse the sequence of steps and produce the first package of data.
  • the predetermined transformation may include regrouping numbers in accordance with a specific sequence of locations.
  • the transformation may include the step of grouping numbers at even number locations together and numbers at odd number locations together.
  • the transformation may include grouping numbers less than a predetermined number together and other numbers greater than the predetermined number together.
  • a method of compressing data including the steps of providing a first package of data, ordering the package of data into a plurality of groups of data comprising a plurality of characters, performing a mathematical operation on each plurality of groups to produce a plurality of patterns of characters, identifying predetermined patterns of characters from the plurality of patterns of characters, storing the location of each predetermined pattern of characters in memory, performing a further mathematical operation on the plurality of patterns of characters to produce a further plurality of patterns of characters, identifying further predetermined patterns of characters from the further plurality of patterns of characters, storing the location of each further predetermined pattern of characters in memory, processing each mathematical operation performed with the location of stored predetermined patterns and further predetermined patterns and producing a second package of data of a reduced number of characters which second package of data includes the number and type of mathematical operations performed, the location of stored predetermined patterns and further predetermined patterns and after which mathematical operation they occurred, whereby the first package of data is retrievable from the second package of data.
  • an apparatus for compressing data including an ordering means for ordering a package of data into a plurality of groups of data comprising a plurality of numbers, a mathematical operation means for performing a mathematical operation on each group to produce a plurality of patterns of numbers, a comparator for identifying predetermined patterns of numbers from the plurality of patterns of numbers, memory for storing the location of each predetermined pattern of numbers in memory, wherein the mathematical operation means is adapted to conduct a plurality of mathematical operations on the plurality of patterns of numbers to produce further pluralities of patterns of numbers and the comparator is adapted to identify further predetermined patterns of numbers from the further plurality of patterns of numbers and a processor is adapted to store the location of each further predetermined pattern of numbers in memory and produce a second package of data including the location of each stored predetermined pattern of numbers and further predetermined pattern of numbers and data relating to the mathematical operations and the sequence in which they occurred.
  • a method of encrypting data including the steps of providing a first package of data, ordering the package of data into a plurality of groups of data comprising a plurality of numbers, performing a mathematical operation on each group of data to produce a plurality of patterns of numbers, identifying predetermined patterns of numbers from the plurality of patterns of numbers and storing the location of each predetermined pattern of numbers in memory, performing a further mathematical operation on the plurality of patterns of numbers to produce a further plurality of patterns of numbers, identifying further predetermined patterns of numbers from the further plurality of patterns of numbers, storing the location of each further predetermined pattern of numbers in memory and producing a second package of data including the location of each stored predetermined pattern of numbers and further predetermined pattern of numbers, data relating to each mathematical operation and the sequence in which each mathematical operation occurred.
  • the encryption method includes any one of the preferred method steps associated with the method of compressing data.
  • the picture can be scanned by a scanning device which reduces the picture to a digital equivalent consisting of a series of zeros and ones.
  • the picture is thus transformed into a series of binary digits which represent graphics data.
  • the picture is two-dimensional, if it is assumed that icons represent the colour of the image at each point on the picture, the picture can be considered an array of icons .
  • each of these icons is represented by a binary code which is stored in memory when the picture is scanned by a scanning device.
  • the stored picture is represented by an array of binary numbers each at a different memory location or alternatively the array of binary numbers can be written as a continuous stream of binary numbers in a memory storage device.
  • the video data In order to transmit the video data representing the picture to a computer terminal somewhere on the internet the video data must be modulated so that it can be transmitted down a communication line such as a hardware transmission line to the ultimate receiver. At the receiver the video data is demodulated as it is received and can then be displayed or stored as required. As part of the transmission process the binary number for each icon is transmitted separately over the transmission line. Consequently if there is 100 million icons making up the picture then 100 million binary numbers must be transmitted each representing a particular icon.
  • the time taken to transmit each of the binary numbers representing each of the icons is therefore at least 100 multiplied by how many characters make up each binary number multiplied by the time it takes to transmit each binary number separately. Furthermore additional time is required in the modulation process and in other data which must be transmitted at the same time in order to ensure the integrity of the transmitted data.
  • a compression procedure be introduced in order to reduce the amount of data which needs to be transmitted in order to allow the picture to be reconstituted at the receiver end of the transmission line.
  • the picture which is being transmitted must be analysed to determine a single binary which represents it . This step can be achieved quite easily because when the picture is scanned by a scanning device and is thus being digitised, the picture is then stored as a sequence of binary numbers . Therefore zeros or ones, which when placed sequentially one after the other can be considered a single very large binary number or possibly a series of binary numbers with each binary number representing a line of icons in the overall array making up the picture.
  • this binary number can be converted to a more manageable number mathematically by changing the base, for example to base 10.
  • base 10 there may be a remainder portion which when subtracted or added to the rest of the number which has been converted to base 10 equals the very large binary number which represents the picture.
  • a minimisation step can be introduced using a mathematical formula which has the sole purpose of reducing the number of characters required to represent the numerical value of the very large number.
  • portions of the picture can be stored in different memory locations with each portion having a designated priority value or clarity value.
  • portions of the image which are stored with a high level of clarity or priority correspond to the parts of the image which must be transmitted before others having a lower priority.
  • the portions of the picture having the higher priority value can be transmitted and the others can be disregarded altogether.
  • the amount of data sent by the above procedure could be reduced by not sending the parts of the image less noticed by the viewer who is receiving the data at the end of a communication.
  • a moving object in a video might be harder for a viewer to see its detail clearly.
  • moving objects might have some detail removed or data reduced in them in various ways as this loss of detail will be less noticed and can allow more detail to be sent of stationary and slow moving objects.
  • the eye might not notice as much detail in a part that is soon to be covered by a moving part of the image, and also might not notice as much in an area recently exposed by a moving part having left it.
  • the eye might not see details on the moving legs well, and may not see clearly the areas which the legs have just exposed, and where they will shortly obscure. Again this detail removed can allow the sending of more detail in areas where moving objects are not revealing and obscuring detail, without increasing the amount of data sent per second overall . Darker coloured areas might not be as easily discernible, as well as areas where there is little contrast or colour change.
  • any of these and other parameters can be adjusted as desired for certain effects or special subjects, such as videos that contain more nature shots or more moving parts.
  • Programs might be able to analyse video and by applying different amounts of these and other changes be able to optimise the amount of detail sent.
  • faces might be detected and their details sent more, as viewers often put a high value on facial expressions, This might be done for example by using make up of a colour detected by the camera and devices used, all of which are claimed here.
  • Contact lenses of a colour may also be worn or a hair dye or rinse to give colours the camera and devices detect to transmit with greater detail.
  • the middle image would be of intermediate details, and the high detail image of stationary sections with sudden changes of colour and shading. Each might be sent separately and reassembled into an overlay of the 3 video feeds by the receiver.
  • the total amount of data is about the same as sending one image, but sending 3 like this would improve picture quality while increasing transmission speed. Examples will now be described of different ways of implementing a system for transmitting selected parts of a picture .
  • still frames are sent, say twenty frames per second. That is, in this case there would be twenty still photos sent each second, which when viewed in sequence give the appearance of motion.
  • still frames there are many details, some more and less important to the observer to appreciate the movie. For example, it may be more important for the viewer to see facial expressions than the exact pattern of blades of grass in a lawn.
  • 00000000000 Initially one might mute some pixels, with X representing a muted pixel as shown below.
  • OXMOXOXOX0 If one now viewed the whole frame, much of the picture could still be seen even with the muted pixels.
  • the unmuted pixels remaining are here called reference pixels.
  • Each reference pixel has a value of red, green, and blue say from 0 as dark, to 127 as maximum brightness. By various values of red, green and blue most colours can be represented.
  • Each reference pixel is compared to the reference pixels closest to it, and some of course will be similar in colour to its neighbours and some will be quite different. If neighbouring pixels are similar enough in brightness or colour then the muted pixel can be left to be, for example, filled in by the receiver with a value perhaps mid way between the colours and/or brightness of the 2 reference pixels. If the reference pixels are too different then the pixel in between might be unmuted and sent as its original colour/brightness .
  • each of the muted pixels may be restored as having a colour 20% of the difference between the 2 pixels as shown in Illustration (b) .
  • the first X might have a value of Red of 1/5 of 127 say
  • the whole frame has much information removed, but the receiver may notice little difference.
  • flesh tones may be left in more than sky blue tones as the flesh tones may be conveying a higher priority detail such as facial expressions.
  • the example here is to compare frame by frame. Say then we are looking at a movie of a man walking across a lawn with tree branches waving in the background, but everything else is stationary. We might find it difficult to see details on the trousers of the man, and also perhaps leaves on the moving branches. One is also unlikely to see details in an area just before it is obscured by a moving trouser leg, and one might not also notice details just revealed by a trouser leg. Comparing then 3 frames in such a scene as shown in
  • Illustration (d) Frame 1 shows a moving trouser leg in different places in frames 2 and 3.
  • Frame 1 has details in it that will be obscured by a trouser leg in frame 2, and also has details obscured by the leg that will be revealed in Frame 2. These details may not be considered as important as details of stationary objects. Odd frames in the film are then compared, such as frame 1,3,5,7,... Frames 2,4,6,8,... are muted in this example. Illustration (d)
  • Frames are then compared with each corresponding pixel, for example each pixel in the upper left hand corner in frames 1,2, and 3. If this pixel in Frames 1 and 3 were sufficiently different in colour/brightness then it might be assumed that this difference was due to movement in the film, or some change equally suitable for our purpose. In this case then the pixel would remain muted and would be restored by the observer as say mid way between the colour/brightness values of that pixel in Frames 1 and 3. In some cases more frames may be skipped for the given corresponding pixel. For example, there may be regular change of a given pixel between frames 2 to 8 that each value of this pixel might be muted then restored according to a formula in frames 3,4,5,6, and 7
  • the muted pixels could be replaced by specialised hardware such as in a 3dfx card, according to various preferences
  • an object that comes closer to the observer may require the transmission of more pixels than when it is far away. Such might be calculated according to such criteria as distance.
  • Pixels might represent polygonal shapes rather than just squares as shown in Illustration (e) .
  • the X's might be filled in with appropriate shadings according to various criteria, by hardware and/or software.
  • Some of the devices in the transmission of the signal may be designed as follows. Once some of the pixels are muted, one essentially has parts of a line that need not be transmitted as shown in illustration
  • the X's as muted pixels need not be transmitted.
  • One example of the techniques is to reduce each series of X's to one X.
  • This muted pixel might be transmitted as for example, completely black (Red 0 Green 0 Blue 0) and all other black pixels adjusted to dark grey so as not to be confused (such as Red 1 Green 1 Blue 1) .
  • the illustration (f) might then look like this:
  • That pixel can be a signal for the receiver for a particular effect.
  • that pixel in between 2 reference pixels may mean that a particular curve gradient such as a cycloidal, logarithmic, or circular, might be used that might pass through that pixel.
  • a pixel is left in that should have been removed by the various criteria then that pixel might be a signal. Muting of pixels may be done with any criteria for any purpose.
  • Characteristics of computers and receivers used to view the pictures may be used to determine greater detail.
  • 3dfx cards in computers often build up images from sketchier information for games.
  • video could be encoded so such cards or other, even specially designed ones might add features desirable, perhaps making the video appear more as it did before encoding.
  • Such devices might be used in other transmission paths, all of which are claimed, such as video encoded on a game cd so that the 3dfx card add details perhaps making them more life like or for other effects. This would be a way of improving transfer rates of video from cd, as could all of the ways discussed here.
  • Another related aspect of the present invention utilises the philosophy of looking for recurrent and desirable patterns of data that can be substituted for smaller patterns of symbols. Having identified these patterns the objective is to minimise the data in A reversible way so that fresh patterns are created for further compression. The data can then be mixed repeatedly for as long as is desired.
  • the number 32 would be identified in the arithmetic operation as the number subtracted and could be stored in a look-up table as the first mathematical operation.
  • a number such as 11111 is compressible as (5)1.
  • the next step is to define a set of transformations on the data. For example one might have a thousand numbers in a row one wishes to compress. By using various techniques, some already known, it is possible to replace some patterns with symbols and abbreviate other patterns.
  • instructions are provided to shuffle numbers, symbols, etc.
  • the first, third, fifth, seventh.... may be reversed in order, while the second, fourth, sixth etc . numbers are placed at the end of the overall sequence of numbers thus leaving the odd numbers at the beginning of the sequence of numbers and the even numbers at the end of the sequence.
  • Another embodiment of the invention increases compression possibly at the cost of slower decompression.
  • the minimum amount to be gained from a shuffling/compression cycle is 5%.
  • On decompression this is reversible, as if on deshuffling/decompression it is found that the data does not increase in size by 5% it is assumed that cycle was omitted on compression and then one goes to the next deshuffling cycle.
  • reordering could occur with the first, fourth, seventh, tenth numbers being moved, then the second, fifth, eighth, eleventh numbers being reversed and placed at the end of the stream of characters followed by the third, sixth, ninth, twelfth numbers.
  • a comparator would then check the resultant stream of numbers for the occurrence of patterns which are stored in another location. Any patterns that occurred would be represented by a particular symbol which could then be inserted in the stream of numbers in place of the particular pattern of numbers .
  • the pattern of numbers could be removed all together and the removal of such patterns would be recorded in a look-up table so that every time a reordering of numbers occurred the patterns resulting after that reordering would be recorded in the look-up table along with their position in the sequence of numbers and the number of the reordering that has taken place. For example whether the reordering was the first reordering or the ninety ninth reordering.
  • shuffling symbols may lead to a chance arrangement of symbols denoting a compression that did not occur. In this case some special symbols may be employed to break up the wrong indicators .
  • Messages may also be inserted in the body of the data. For example if the shuffling compression is done 1000 times then after 1000 numbers a marker might be inserted indicating the cycles or a number 1000 found somewhere is set out with symbols as the cycle number.
  • shuffling patterns can be of any kind and might be tailored to various data. The best may be a simple algorithm that is stored easily and is fully reversible for decoding. These devices can also be used as a form of encryption since if one does not know the algorithm one cannot reconstruct the data .
  • the key might contain parameters for the shuffling algorithm as well as for decoding.
  • the encryption step might utilise for example available techniques such as DES or BLOWFISH.
  • the same number may give rise to more patterns if a given digit is next to more numbers.
  • 12345678902468101357 may have more patterns if written as
  • patterns may also be defined in ways analogous to techniques in for example art programs. For example a sequence 98567 reduces to 43012 (- 5) symbolises the numbers have each been reduced in size by 5, but one might imagine if each number was a unit of brightness that each has been darkened by 5 units. In another example 9753 altered to 4321 might be compared to the adjustment of contrast and brightness together. To reverse, the brightness changes back to 6543 then the contrast is increased to a change of two units instead of one to 9753.
  • the compressor/encryptor can operate so the receiver can use this information and/or (2) the decompressor/decryptor can retrieve this information to a useable state.
  • an operating system or program such as Windows or Unix that has many functions including copying, initialising programs, etc.
  • a program might be loaded on such a computer, so that it is activated by a code encryption from the manufacturer.
  • this process receives keys to do certain operations with the permission of the operating system. If this program later becomes infected it may not be able to spread the infection because it lacks authorisation keys or the virus lacks the keys to gain access, even though it has infected part of the program.
  • a file save might be encrypted with a key. If a virus attempted to change this file it would be requested to provide the key which it could not have. Such encryptions could also be used to prevent pirating of programs.
  • Codes could be protected from interception by trapdoor like techniques.
  • Program A encrypts an instruction and sends it to program B.
  • B encrypts the instruction again and sends it back to A.
  • A removes its encryption and sends it to B which decrypts it and executes the instruction.
  • At no time could an instruction be accessed uncoded nor could a key be intercepted.
  • a virus or such like attempting to access a code file would find it encrypted and would not have the key. If it did not get the key the codes would be useless to it.
  • a program may additionally interrogate the sending section not just for codes but for coded responses indicating a correct installation or a correct pathway or authorisation.
  • a program might have ten encrypted subsections to authorise an instruction. This might interrogate the process to ensure that 10 code authorisations are provided and that a virus has not inserted itself between the programs. Logs may be left of all operations. The effect is that any unauthorised instruction would fail by not having the correct key, and because it would not have the key to define a correct path of decision making to an authorised input . Systems like this would be extended to the Internet and other networks where two way communication maintains code authorisations .
  • Any macros would also contain a certificate from the original program that the receiver would use to verify the macro was intact. This certificate would contain in it an authorised code and may also have the macro encrypted and only able to operate if correctly decrypted.
  • the text of the message could be encrypted as well so it could not be possible to extract the certificate and alter it.
  • the operating system at another input may change all or part of the codes between the sections so if any virus has accessed some of the codes they would then be useless.
  • section may agree to alter codes between themselves according to randomly generated criteria, so no external output can bread the codes .
  • Such devices can be used to any depth of programs and any exchange of any data in any form.
  • each file in a program might be encrypted different to any other, so the program must know the different key to unlock each one.
  • the file once decrypted may contain a code that instructs the program to find a key n the next file it uses and so on.
  • compression could involve regarding a binary file as a large number N and to find an algebraic expression that equals N, but takes up less room.
  • the devices in this section for example enable one to find a more accurate logarithm of N and then use that to find an expression. Another application of this would be to find the factors of for example large numbers, sometimes for the purposes of breaking a code.
  • Add Logarithm a device which for convenience will be called an Add Logarithm. It is known for example how normal logarithms work, by adding the exponents together of numbers with the same base, it is equivalent to multiplying the numbers together.
  • This device is useful in factorising large numbers.
  • This number can be broken down into Add Logs to make the task easy.
  • the number is 123896467... and so on for a 1000 digits.
  • This could be written as 123 X 10 997 + 896 X 10 994 + 467 X 10 991 + and so on.
  • One might find the log of the first term to base 10 and then the Add Log of the second term, a number which added to the log of the first term gives the log of first two terms added together.
  • each of the terms in the expression are plotted to form a curve so that values for Add Logs can be determined by tables constructed using a plurality of curves covering a range of values .
  • a method is provided for preventing unauthorised copying of CD's.
  • a CD is provided with a coating having pits burnt in it to encode information.
  • part of the CD would be coated with a thin film that reading the disc slowly burns through.
  • the program when installed tests the CD by attempting to read a blank part of the CD over and over. After a time the thin coating will burn through and reading this section will result in the program determining that the section has the special film and certify the CD as genuine.
  • the program may determine the CD is a copy and reject it. Doping like this could be placed at any point on the CD so an image copy would probably put the section in the wrong place even if blank CD's like this were duplicated to pirate copies.
  • a CD might have a second coating in a particular section. This coating would have the property of being burnable by a standard CD laser, either from a single or multiple exposure.
  • a permanently sealed container having a flexible outer wall defining a partially evacuated internal chamber having a resiliently deformable member located therein.
  • the resiliently deformable member is foam.
  • the sealed container includes a fluid.
  • the resilient force of the deformable member in combination with the force applied by the pressure of fluid within the container is in equilibrium with atmospheric pressure applied to the flexible outer wall.
  • the flexible outer wall has an inner surface which surrounds and contacts the outer surface of the resiliently deformable member.
  • the combined pressure of the fluid within the container and the resiliently deformable member is sufficient to maintain the flexible outer wall in contact around the resiliently deformable member substantially without compressing the resiliently deformable member.
  • the flexible outer wall is in the form of a skin or membrane which is formed over the surface of the resiliently deformable member.
  • the sealed container includes a valve for entry or exit of fluid from the internal chamber.
  • the combined pressure of fluid within the chamber and the inherent resilience of the resiliently deformable prevents noticeable deformation of the resiliently deformable member by atmospheric pressure applied to the outer surface of the flexible outer wall.
  • the interior chamber includes a fluid in the form of air having a pressure to partially inflate the flexible outer wall.
  • the partial inflation of the flexible outer wall is sufficient to make the flexible outer wall cling to the outer surface of the resiliently deformable member.
  • compressive devices such as cushions may be made. According to one example it is desirable sometimes to create a sealed container that can be made to a degree of flexibility.
  • An inflated beach ball for example feels hard to compress because the air pressure inside rapidly increases as it is squeezed.
  • a block A if moved to either side is pulled by the opposing spring to the centre.
  • a partial vacuum created inside makes it possible to compress the beach ball as it does not meet the resistance of air pressure immediately until the pressure builds above the outside air. The ball thus feels somewhat soft as the foam compresses with resistance increasing as the foam tends to bounce back and the air pressure rises.
  • breast implants and other prosthetic devices would be able to be constructed with a more natural softness in this way.
  • the resiliently deformable member is in the form of a spring or a plurality of rubber balls.
  • a device for shock absorbing comprising a container having a deformable outer wall, a resiliently deformable means located within the container and compressible or expandable with or against the outer wall, the container also including a fluid having a predetermined pressure adapted to resist compression of the resiliently deformable member.
  • a method of encrypting data is provided.
  • the present invention aims to provide an encryption method which is difficult if not impossible to decrypt without the use of the encryption method.
  • the present invention provides a method of encrypting data which in its preferred form utilises methods for compressing data.
  • a method of encrypting data including the steps of representing the data as image data, processing the image data to produce a number representing the image data, processing the number to produce a mathematical expression which is equivalent to the number, whereby the mathematical expression is able to be converted back to the number and the number can be converted to the image data for encryption.
  • the method includes the step of encoding each variable in the algebraic expression.
  • the method includes a plurality of encryption steps.
  • the method includes one or more additional steps of converting the algebraic expression into different algebraic expressions .
  • data compression techniques can be utilised in encryption devices.
  • any image or data can be encoded. To do so one reduces the data by various techniques which are outlined above and in prior patent application no. PP9781.
  • An example A B + C D + D ⁇ + F G can represent a number which itself represents data.
  • the above encryption technique could be used for numerous applications including bank files, classified transmission and any other traditional encryption application.

Landscapes

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

Abstract

L'invention concerne un procédé de compression de données consistant à ordonner un premier paquet de données en une pluralité de groupes de données renfermant une pluralité de caractères, à soumettre chaque groupe à une opération mathématique afin d'obtenir une pluralité de modèles de caractères, à identifier les modèles de caractères prédéterminés, à stocker l'emplacement de chaque modèle prédéterminé dans la mémoire et à répéter cette opération, à traiter chaque opération mathématique effectuée avec l'emplacement des modèles prédéterminés mémorisés et les modèles prédéterminés ultérieurs afin d'obtenir un second paquet de données d'un nombre réduit de caractères. Ce second paquet contient le nombre et le type d'opérations mathématiques effectuées, l'emplacement du modèle mémorisé et les informations permettant de savoir après quelle opération mathématique ils apparaissent. Ainsi, on peut récupérer le premier paquet de données à partir du second paquet de données.
PCT/AU1999/000913 1998-10-22 1999-10-21 Procede de compression de donnees et dispositifs compressibles WO2000025429A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU11410/00A AU1141000A (en) 1998-10-22 1999-10-21 A method of compressing data and compressible devices
EP99971162A EP1121758A1 (fr) 1998-10-22 1999-10-21 Procede de compression de donnees et dispositifs compressibles

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
AUPP6660A AUPP666098A0 (en) 1998-10-22 1998-10-22 Compressible devices
AUPP6660 1998-10-22
AUPP9781 1999-04-16
AUPP9781A AUPP978199A0 (en) 1999-04-16 1999-04-16 A method of compressing and transmitting data
AUPQ3360A AUPQ336099A0 (en) 1999-10-12 1999-10-12 Compressible devices
AUPQ3360 1999-10-12

Publications (1)

Publication Number Publication Date
WO2000025429A1 true WO2000025429A1 (fr) 2000-05-04

Family

ID=27158114

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/AU1999/000913 WO2000025429A1 (fr) 1998-10-22 1999-10-21 Procede de compression de donnees et dispositifs compressibles

Country Status (2)

Country Link
EP (1) EP1121758A1 (fr)
WO (1) WO2000025429A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5499294A (en) * 1993-11-24 1996-03-12 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration Digital camera with apparatus for authentication of images produced from an image file
US5678043A (en) * 1994-09-23 1997-10-14 The Regents Of The University Of Michigan Data compression and encryption system and method representing records as differences between sorted domain ordinals that represent field values
EP0806807A2 (fr) * 1996-05-07 1997-11-12 ADC Solitra Oy Filtre coaxial
US5872597A (en) * 1994-08-26 1999-02-16 Kabushiki Kaisha Toshiba System for decoding moving picture signal multiplied and coded by DCT coefficient and additional data
US5923376A (en) * 1996-03-29 1999-07-13 Iterated Systems, Inc. Method and system for the fractal compression of data using an integrated circuit for discrete cosine transform compression/decompression

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5499294A (en) * 1993-11-24 1996-03-12 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration Digital camera with apparatus for authentication of images produced from an image file
US5872597A (en) * 1994-08-26 1999-02-16 Kabushiki Kaisha Toshiba System for decoding moving picture signal multiplied and coded by DCT coefficient and additional data
US5678043A (en) * 1994-09-23 1997-10-14 The Regents Of The University Of Michigan Data compression and encryption system and method representing records as differences between sorted domain ordinals that represent field values
US5923376A (en) * 1996-03-29 1999-07-13 Iterated Systems, Inc. Method and system for the fractal compression of data using an integrated circuit for discrete cosine transform compression/decompression
EP0806807A2 (fr) * 1996-05-07 1997-11-12 ADC Solitra Oy Filtre coaxial

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BRUCE SCHNEIER, "Applied Cryptography: Protocols, Algorithms and Source Code in C". John Wiley and Sons Inc., US, 1994, pages 187-410. *

Also Published As

Publication number Publication date
EP1121758A1 (fr) 2001-08-08

Similar Documents

Publication Publication Date Title
US5825892A (en) Protecting images with an image watermark
Bhatnagar et al. Selective image encryption based on pixels of interest and singular value decomposition
US7130442B2 (en) Protecting images with an image watermark
Lin et al. A novel hybrid image authentication scheme based on absolute moment block truncation coding
CN107481180B (zh) 基于元胞自动机和分块压缩感知的图像加密方法
Bashardoost et al. Enhanced LSB image Steganography method by using knight Tour algorithm, Vigenere Encryption and LZW compression
Chanu et al. A survey paper on secret image sharing schemes
CN108563956A (zh) 基于高位翻转预测的安全加密域可逆信息隐藏方法
CN108810555A (zh) 基于图像压缩与弹性分辨率的缩略图图像隐私保护方法
Cheddad et al. Enhancing steganography in digital images
CN107292805A (zh) 一种基于多参数分数阶离散Tchebichef变换的图像加密方法
Habibi Lashkari et al. A survey on image steganography algorithms and evaluation
Tiken et al. A comprehensive review about image encryption methods
EP1628257A1 (fr) Détection de modification frauduleuse de données numériques en utilisant un tatouage numérique fragile
Siddiqui et al. Chaos-based video steganography method in discrete cosine transform domain
Hu Grey-level image hiding scheme based on vector quantisation
WO2000025429A1 (fr) Procede de compression de donnees et dispositifs compressibles
Ting et al. Format-compliant perceptual encryption method for JPEG XT
CN112929669B (zh) 图像编码及解码方法、装置
CN107845055A (zh) 抗Facebook压缩的图像加密方法
Mizher et al. An improved simple flexible cryptosystem for 3D objects with texture maps and 2D images
KR101515040B1 (ko) 압축 이미지와 원본 이미지의 차이를 이용한 모듈식 스테고 이미지 생성방법
Parameshwaran et al. Encryption algorithms for color images: a brief review of recent trends
Samee Robust watermarking and its applications to communication problems
CN117880434B (zh) 基于双2d压缩感知融合的可逆缩略图保留加密方法与系统

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref country code: AU

Ref document number: 2000 11410

Kind code of ref document: A

Format of ref document f/p: F

AK Designated states

Kind code of ref document: A1

Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 09830007

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 1999971162

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1999971162

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWW Wipo information: withdrawn in national office

Ref document number: 1999971162

Country of ref document: EP