HIERARCHICALLY RANGE ADAPTIVE CODING METHOD FOR SIGNALS, ESPECIALLY SUITABLE FOR PICTURE ANALYSIS AND CODINGS

Abstract: Signal quantities form a relief. The smaller the segments or blocks IK(n) of this INFORMATION SOLID IK are, the less become their (dynamic) ranges between their minimum and maximum. This forms range adaptively reduced code lengths CL for a range reduced PCM (RRPCM). Using hierarchically more and more narrow nestings of the space given by addresses and functional values, especially TRUE/FALSE-codes for CL-reduction/division, minimal CL(n) are obtained for a blockwise RRPCM. Depending on cumulations, composed RPCM-codes of variable lengths will result by exclusion. All IK(n) coded by RPCM, make IK reconstructable without informations about extremes (!), utilizing overlappings or differences at the border, especially along CORRELATION LINES. Overhead reduction: 81 % ! The possible punctual exactness allows range reduced application of other methods. Activity dependent, exactness becomes reducible within components step by step, enabling (non-) linear interpolations. In static areas the temporal mean value is codable.

Description: H I E R A R C H I C A L L Y R A N G E A D A P T I V E C O D I G M E T H O D F O R S I G N A L S , E S P E C I A L L Y S U I T A B L E F O R P I C T U R E A N A L Y S I S A N D C O D I WG S . A B S T R A C T State of art Samples of a signal transmitted by PULSE CODE MODULATION (PCPl) are usually coded within a whole absolute scale, e.g. as one of 256 values represented by one byte. The caused tremendous data stream may be reduced by preceding the extremes MIN, MAX of a block by two Bbit-codes. Each pel within the black is codable exactly between such precoded ("pre-dicted") ranges by a RANGE REDUCED PCPl (RRPCM), The basic problem: Coming down to average block sizes of less than 6x6 the overhead for prεcodes still prevents to achieve steady bit rate reductions by steady range reductions (CONVERGENCE): The increasing (divergent) pel-specific overhead is no more compensated by statistically decreasing (convergent) ranges R between PUN and MAX. The basic idea: Convergence is achieved by diminishing the overhead of those PREC0DE5 to a NEAR ZERO VALUE: Like the well ordered elements of a segmented (broken) ceramic are recαnstructable without any precodes, using the SURFACE INFORMATION only, it must be possible to reconstruct a comparable INFORMATION SOLID by its surface information, at least with few overhead only, being able to utilize CONVERGENTLY DIMINISHED RANGES, being often distributable upon multiple dimensions. Summary of the solution In first, still uπoptimized tests, the method has reached the state of art or was even better. Optimized versions, utilizing 3D-spaces should reach an average bit rate of less than 1 bit/pel and very small faults, still remaining below the signal noise ratio of video recorder systems (meaning to be quite exact). To enable convergence, the block overhead has been reduced from 16 to 2.9 bit! The automatic system specific RELEVANCE AND IRRELEVANCE SELECTION is very useful for COMPUTER VISION and every kind of advantageous SIGNAL PREPROCESSING, being predestined for HIGH SPEED PARALLEL PROCESSING, reducing data rates until a size of 1 pel (activity of 2 pels) only! I_ i _ I > £2 , t o d_ * t_ i i £ n . In Octocer BΞ, a first experimental digital S m-consurner Video was presentee, by SONY Corp., Tckyc, compressing a 215-Mbos signal to a bandwith of 25Mbp= "without visible degradation", called ADAPTIVE DYNAMIC RANGE CODING /5/. ADRC utilizes a PRECDOI G f the minimum and the maximum to obtain reduced block ranges, allowing an exact, but RANGE REDUCED PCM. A range acaptively fins or coarse quantization diminishes that reduced bit rate again,w.-.ile codin the picture and changed areas to a subsεcuεnt picture. Still,the extremes MIN, AX are precoded by two S it words, liπitino the rentable block size of a plane to DxBpel. A HIERARCHICALLY RANGE ADAPTIVE COOING METHOD will be described here, overcoming those size limits, given by the tremendous overhead of 15bit/block. By reducing the overhead step by step, a furthermore significantly reduced bit rate is reached. Sines the codes become distributable within multidimensional spaces, a bit rats below 1bit/pel will be achievable coding more exact. AOVICE: Ths main procedure will be detailled in chapter 111,3! I III- ££ S C I P T I 0 N O F T H E M H 0 D 1. Basic rulss The new method is based upon same fundamental rules, partly of statistical nature, reproduced hers briefly: R1 : Any limited area contains its extremes, the minimum (MIN) and the maximum (MAX), a conr-iαπ principle indicated by UEIERSTRA55 (FIG. 1). R2: The smaller an area is, the smaller the range of a seals becc ss between its 2 extremes. This was already indicated by CAUCHY for exactly continuous areas but may always be utilized as a statistical fact. R3: Ths smaller the scales, the less the average bit rate to code the areas separately by RANGE REDUCED PCM (RRPCM). ( tt ) FIG. 1 PA : Segments, coded by RRPCM ars recoπstructable like segments of a broken solid, especially utilizing ths SURFACE INFORMATION by offset minimization or even the knowledge based block specific offset code of the area. 2. Detaining those rules R1 to R3 must be detailed to be suitable for optimized SIGNAL 5EG"£.\'TATIGN. Ths range of an area is definable alternatively by the following parameter sets : 1. I*IA ; MIN 2. MIN; MAX - miN = KIN; RANGE R = MIN; MAXIMAL OFFSET OFM 3. MIN'; CODE LENGTH CL of R = MIN; CL(OFM) Cf coarse, MIN and R may be rsplacsd by MAX and -R (inverted scale direction!). Knowing only one of these parameter sets, a RANGE REDUCED SCALE is risfinεd to achieve an exact but RANGE REDUCED PCM (RRPCM-) coding of each signal area. This is already mentioned in rεf. /7 a/, page 9 (4.1.2). ( *•* ) FIG. 2 a) According to version 1., ths most simple realization of defining a RANGE is the prseoding and transmission of both extremes MIN and MAX of a defined area (e.g. fixed block). Patent applications of SONY Corp. as mentioned in rsf. /5/, are based upon this principle. The RANGE REDUCED or RANGE ADAPTIVE coding cf ref./5a,b/ is called thεre ADAPTIVE "DYNAMIC" RANGE CODING (ADRC). But, since stored quantities of signal points are known "STATIC" SIGNAL QUANTITIES, this slight correction till help to utilize some aspects of STATIC FIELDS /1/ for the new method, to enable furthermore considerably reduced bit rates. b) According to version 2., the maximal offset, OFM = KAX-MIN = R, defines ths RANGE of scale necessary to cods every point of an area and any partial sector of ths area as an offset to MIN (equivalent: deviation +/-D from a mean value, or a negative offset to MAX). This range R ' defines the absolute code length, necessary for a RANGE REDUCED PCM scale to code the value v(j) of each point ' P(j) of the area, with j=1,2,3... - At first sight R sεε s to nesd 8 bit and the prεcoded set (MIN, R) would have no advantage compared with (KIN, MAX): c) The RRPCM (range reducible POM) code length CL(i) for each range R(i) cf blocks, e.g. of 32x22, 15x15, 8x8, 4x4, 2x2 (and even rεctangulars as 2x1) pel, is continuously diminishing according to rule R2. Knowing R(i), this is usable to code the blocks B(i) independently by values v(i,j) within CL(i) by RRPCM. d) Using only R instead of MIN and MAX, an important information is lost: Without knowing MIN εxplicitely, RRPCM remains a relative coding for each block. Thereby coded blocks arε similar to well ordered puzzle segments where a pointwise RRPCM coding of the blocks B(i) within R(i), i=1,2,3..., produces ths puzzle segments. Their SYNCHRONIZATION PR03LEM is solvable according to R4. 2.1. Basic rsflεctions about the reduction of the overhead a) According to 2c) the (dynamic) range of a sεcarately coded block decreases continuously. Utilizing only their preceded range R(i), all blocks 5(i) are codable sεcarately point by pont. Ξincs they sεsmed to be irreconstructablε wi ncut Kit:, ths ovεrhead for prscoding two parameters by 15 bit/block still prevented to exploit ths CONVERGENCE PRINCIPLE (R2) for significant bit rate reductions. Thersfcre, according to ref. /5b/+/5/ the "rentable" block size B5 in planes of single pictures was statistically determined to lie near 5x5 pels In smalisr blocks, the constant block overhead DV=1Sbit, distributed upon all picturε elε. * nents(pels) in bit/pel, is no more comoensataSle by the convergence according to R2. The object of the nsw method is to minimize that overhead to a rate as near as possible to * ZERO. - An analogy will be helpful: b) Like a sεgmented real (physical) solid, the RRPCM-coded segments should be reconstructabls to the complete signal without MIN: The signal relief will now be considered as the surface of an INFORMATION SOLID SI. The blocks (cr any kind of signal areas) are considered as 5EGMENTS 5I(i) of ths complete 51. c) Information sets equivalent to (MIN, P.) would also reduce the code lengths. Any kind of direct or indirect RANGE PRECODING, even ths confirmation (or nsgation and additional correction) of a RANGE PREDICTION within EXTREf'Ξ MARGINS EM(i) by one bit, enables detailed reconstruction of all elements by - punctual RRPCM codes within predefined areas (segments, blocks), especially - within nssted PARTIAL RANGES, placed within ths primarily given reduced scale. d) According to R2, a successive proceeding may be used in every PARTIAL AREA,* ε.g. 32x32, (32x15,) 15x15, (15x3,)...2x2 pεl, with εuccεssively reduced scales. Thus in the hierarchical stage h+1 of a NESTING h = 1, 2, 3..., the values of MIN(h+1), MAX(h+l) and R(! * H*1 ) are codable within the (normally already reduced) scale R( ) = MAX(h) - MIN(h) = EM(i,h) of the stage h, as shown in FIG. 2. s) Constant areas are coded comolεtεlv by the single information "MIN", meaning, that R = 0 and MIN = MAXI - Normally this is prevented by signal noise. Nevertheless, areas with small ranges demand only small scales and code lεncths for all contained points, as shown in FIG. 2. f) As in pel by pel codings, also decreasing exactness of RANGE PRECODING is subjεctively alloued, if R only contains MIN and MAX. On the other sids, any ovεrhεad ϋ\l becomes bsttεr distributablε within polydi εnsicnal soaces . 2.2. Approaching the aim O ject cf the method is to utilize a CONVERGENCE of the ωhols resulting bit rats b consisting of their co oonεπts, utilizing hiεrarchical nεstings. a) Using (r.IN, R), the bit ratε b (in bit/pεl) consists of b = bmin + br + bp, with bmin = BlIN/n pεl for the P1IN, br = BR/n pel for the RANGE and bp for the pcintii'ise RRPCT1 code (BNIN.BR: bits/block of π pels for the informations filN.R). b) Reducing the NINIF.AL BLOCK SIZE from 9x9 to 5x5 and 2x3, the RRPCM component bo was measured by the FTZ,Darmstadt,l.Germaπy/B/(p.66), extrapolated (approx.) nεrs for 2x2, 2x1, shoωing the following statistical characteristics: 2 i H I ^ ( FTZ ) J. £££i,JE££££ ' B5: 9x9 = 81pel 5x5 = 25pel 3x3 = 9psl ! (2x2 = 4psi) 2pel....1pel bo: ~~ . lt 5.B 5.0 ! (4 bit ?) (2.7 ?)...0 (!) dbp (-difference): -0.6 -0.3 (-1.0 ?) (-1.3 ?) c) According to 2.1d) each value KI\'(h+k), k=0,1,2..., is already codable within CL(h) of a block of any highεr hiεrarchy (h) instεad of B bits! Thus ths value bmin = BNIN / π pel reachεs thε following componεπts: BS: 8x3(9x9) 4x4(5x5) 2x2(3x3) bp = CL (= BMIN!): 6.4 5,3 5,0 bmin co putεd by SNIN/S5: 0.10 0.35 1.25 bmin as measured by thε FTZ: 0.099 0.35 1.2 Unfortunately, thε institute (FTZ) measured R ωithiπ the next highεr sizε (in brackets), ωhεn testing thε method according to /7c/, pp.19. This overlapping border of 1 εl thickness is highly redundant, rεsulting in nrroπg conclusions! An overlapping of 1pεl absolutε according to /7c/ is quite sufficient to get far better rεsults! Nevertheless, thε table shous clearly the exactnεss of the basic idea, already reducing the overhead for F1IN to 62.5% (5.0 / 8.0). d) Even R must not be coded by 3 bit: The code length CL=8 is codable with the bit number BN of CL, meaning a maximum of 3bit for the lengths 1...3 of CL. By this ωay, the second overhεad BR=3R1 is reduced from CL=B to BN(CL =3bit/block, meaning to ~ i ~ %) Utilizing thε later entionεd hierarchical algorithm, a further reduction is possible, its result, as sasurεd by the FTZ, already shown here: B5: 8x3 4x4 2x2 br1 = 3R1/BS computεd in bit/block: 0.047 0.153 0.75 (absclutε values) br2 by hiεrarchical method as measured: 0.032 0.13 0.55 (mean value) Tnus. the comolsts ovεrhead f * IN,R has already been halvened bv ths methods c.d! 2.3. Primary hiεrarchical relevance selection According to 2.1d and 2.2d as much stages h as useful should be reached, sines any halving of scales results in one bit oain for every PCfl-cosfficieπt of any codino method of any signal component. Any loωer number of bit (B ) for ths cods length CL, precodsd by method 2.2d,means a further halvening of thε scale. Preliminary considerations are helpful to understand the hierarchical rules: a) Rule R2 is locally valid, ωhεrεver no great local alternations occur. Invεrting the principle, hierarchically unreducible scales may indicate EDGES, in planes represented by CONTOURS. Especially near contours, the mentioned convergence is locally disturbed, since contours discriminate 2 NATURAL AREAS. Their ranges R are treatable like those of the mentioned (fixed) blocks1 b) Regarding only one coordinate (x-axis) of thε luminance function, a CONTOUR becomes a linear EDGE, as shoωn in FIG.2,3: Using hiεrarchical linear division, smaller and largsr (EXPECTIVE) QUANTITIES of points are selεctεd uithiπ scales R as defined urithin EXTREHE MARGINS EM(i), i = 1,2,3... According to 2.1d they ars nestable. Vertically thεy indicate rangεs R(i) for LIMITED QUANTITIES OF SIGNAL VALUES v(i,j) of horizontally accumulated LIMITED QUANTITIES OF POINTS S(j). c) Using thε inverss orinciolε, any fixed (prεsεlectsd) scale R dεfinεs a run length t, addrεssing thε points t(i), i = 1,2,3..., ωhere the predefined range is TRUE/FALSE, (FIG. 3): Each value t(i) may also define one sidε of a square! - Any measurablε time constant T shows ths dεlay fault as caused by thε system, uhεn transmitting an idεal edge (small FIG. ): The idεal εdgε is characterized by sharp CUMULATION POINTS HP1 , HP2. Transmitted or unideal edgεs dεgεneratε to * functional distributions within Effi21 , Ef'122 along ths ordiπatε f(t). Such CUMULATION FUNCTIONS(DISTRIBUTIONS) characterize more or less εach arεa(FIG.3). Thεir denεitiεs and widths are measurable like T and HP along all coordinates. Especially the y may be utilized for variable leπohts codings (HUFNANN CODES). (*) FIG. 3 d) Using such a SCALE or a fixed code length CL instead, a cumulated quantity of points is searched,ωhεre CL is valid for. In a plane, asking in every valid point x for the valid range y as ωell (e.g. valid for CL=4), tωo run length codes (x,y) are selectable to define rectangular areas cr simple squares. (*) FIG. 4 ε) A prεdicted or arbitrary fixed scale (code length CL=4) is chosen to select RELEVANT and IRRELEVANT blocks (R/I) by subsequent nεsting. That single method as shoωn in FIG.4 is used now for a PICTURE ANALYSIS in corrεspondancs ωith FIG. sεlectin noi 2D-blocks f ff επ f) If ths statistical probability for a certain raπgε is high, 1bit may cede,if an estimated R or set of EM(i,h) is TRUE/FALSE. If FALSE, the STATISTICAL RANGE PREDICTION is correctable by direct RANGE PRECODING, as defined by MIN and MAX of a given area. Tne word PRE-DICTION is ussd by ths invsntor in that extensive sεnss, meaning svsry kind of imoiicite (statistical) and explicits PRΞ-CGDING! 2.4. Hcu to acnisvs bloc:-; synchronization (nearly) without MIN-informaticn a) ficrs than 50 cf the range orscode R_ (to MAX) became rsdundant by orscαdiπς CL with 3 bit only. If CL=1 is sufficient, a further bit may tell, if CL=0 is TRUE (meaning that thε uhols area is already codεd by a transmission of MIN).' Tns last stsp alrεady contains ths the basic idea for HIERARCHICAL CL-RΞDUCTIOfi. Any crscodiπo cf CL(h) uill enable exact codinos of all relative offset (OFR) by reduced PCM-codεs RRPCM(h,j) within ths seals givεn and prscodsd by CL(h)! b) In thε next stεp thε overhead of MIN will bε reduced furthermore: In the first step the problem was reduced to pure RRPCM coding of separated blocks! L'sll ordered, those blocks, coded by RRPCM, represent the sεg εnts SI(i) of a solid SI. Likε thε reconstruction of reliefs of sεgmεntεd physical solids doss not nssd MIN-information, using ths SURFACE INFORMATION only, to rsconstruct an 51 by a minimization of ths block to block offset until zero! This method, as described now, is suitable to synchronize big and medium sized blocks (small blocks are advantageously synchronized by method 3.3): c) A possible minimization of the block to block αffsεt is achieved by well known athematic algorithms, utilized for the method, especially using: - 1. CORRELATION LINES, indicating ths place of a local difference dp at the border cf each SI(i) even using UELL DIRECTED CDRRELATONS (vectors) and/or: - 2. A PREDICTION of each BLOCK.-DIFFERENCE D9 along a border for each point, by - utilizing the mean value dpm of (at least) two bidirectional!v neighbouring right and left differences ripr, dpi, with: dpi = 1/2 * (dprl + dpH ) - each estimated difference dp(j) wεightened reciprocal to its amount to obtain a mean value dpm of all differences: dpm = a * dp + b * dp2 + c * dp3... - to result in the REPRESENTATIVE ESTIMATION dpm = DB of the differsncs betωeεπ the blocks B(i) and B(i+1), - or another kind of: - 3. Otr.er f * *INI"IZATIC ALGORITHMS (CF THE SECOND DIFFERENTIAL) near the bcrder, - 4. Even combined with an exact HUFFMAN-CODE CF THE FAULT for ELCCK SYNCHRONIZATION. 3. The best solution ; A si ole and highly efficiεnt hiεrarchical method /7c/ 3.1. Block range πrecαding ωitπ automatic relevance selection In 2.2., a hierarchical nesting was described, resulting in reduced scales P. for * ~ I't (and MAX) and a recucsd CL-coding as shown in the tables cf 2.3. FIG. 5 shows a hierarchical plaπε division (DUAD TREE) as ussd by ERIT. TΞLECGM fcr its metnod RECURSIVE BINARY NESTING ( Sfi) /2/. The basic oriπciple will he ccmoinεb with R2 to result in a successive hierarchical division of tne arεa, resulting now in sucessivε code length reductions (fcr planes and 3D-spaces): (*) FIG. 5 a) One transmitted bit informs the rεcεiver if a block, e.g. of 64x54 pel (or even a whole frame!), dhly needs a PCM-scale codable by less than S bits. b) Tne binary value TRUE is followed by (an)othεr bit(s), informing whether a certain block needs a scale given by less than CL=7, (thεn: 6, 5,...1) bits. c) Any binary value FALSE causes a programmed geometric division of the initial block, e.g. in square subblocks of BS = 32x32, 16x15...2x2 pel. d) The proceedings b) and c) will continue, until CL or BS (thε blocksize) reaches a predefined value CLO or BSD (e.g. 2x2) or a stop sign, e.g.: e) Sefαrs(after) step c(d) an INTERRUPT CODE (1 it) informs the receiver of the result of an ANALYSIS, made by the transmittεr, if thε optimum is reached. - This results in a BLOCK AND RANGE ADAPTIVE SUITCHING OFF of the procedure. Far all steps of the inverted B5-hisrarchy of 4x4, 8x5, 15x15... a minimal size of BS=2x2 will be reached then with a bit rate of only be = 1/(4*4) + 1/(8*3) + 1/(16*16)... = 1/15 + 1/64 + 1/255... = 0.0834 bit/pel - As the transmittεr knows the optimum of each region by the defined analysis, this SUITCHING OFF still gives, region adaotively, far better results. f) Of course the (quasi-)binary treεs defined by thε procedures are codable in quite arbitrary (programmed) sequences and steps remaining recαnstructable! g) Variants, using 2bit steps of CL or x-, y-, or z-division will be dsscribεd without leaving the basic principle, even when utilizing exact DELTA CODES: h) Instead of absolute values, smaller (point-to-point) differences may be used, i) If high CL-rεductions are estimated, a 2 cr 3-bit reduction code may rεplacε b. k) If high activity is esti atεd, (additionally) a lowεr initial BS may be chosen. 3.2. Preliminary result: The hierarchical CL reduction a) Thε orεli inary result is an unsynchronized HIERARCHICAL CODE LENGTH REDUC¬ TION' (HCLR) enabling to code each block in its reducεd scale by RRPCM as an b) ' A needed ELCCK SYNCHRONIZATION will =e enabled by method 2.4 or method 3.3. HCLR causes an automatic SELECTION CF RELEVANCE CHAINS along contours,suitable for ARTIFICIAL VIEWING, since many remaining small blocks will need mere bits tr-an their environment (FIG. 4). - That CGNTCUR SELECTION, may be accomplished by a CCNTGL'R (better new: CORRELATION LINE-) PREDICTION, as given by Z5CHUNKE /4/, for ELCCK SYNCHRONIZATION according to 2.4c. Since such relevance chains ' .-ray also be selected in the next cicture of a sscuence, the RANGE CORRELATION CF CL is advantageously measurable: Effects like flickering water or fade cuts, preventing movement detections, still have correlations in the luminance FANG ! c) Including thε temporal dimension of the mentioned plane blocks a further dimension may still be divided in ccπron (or separately along the z-axis) by such (Ibit-)cccss, deoeπding on ths dεςrss of (z-)changament within a 3D-block, containing several pictures. Since a sum cf all elementary differences caused by noise is ZERO, thε mean value along z may be coded to obtain static plane blocks, noiseless codes bein g distributable ucon all blockwiss static pictures. 3.3. Ξlcck synchronization by including one overlapping point (one difference!) a) For great blocks the methods 2.4. are suitable, enabling a NEAR ZERO FAULT along the bordεrs, correctable by a,now RANGE LIfllTED AND CUMULATION DEPENDENT HUFFMAN CODE. That kind of DIFFERENCE MINIMIZATION along block borders is comparable to the reconstruction of a ceramic, segmented by falling down. The smaller tne blocks, the greater the average faults (differences to be coded). b) For snail blocks a simple efficient way is given by an overlapping algorithm: Only one Minimum MIM1 of a (first) block 31 must be precoded now by one PCM- n-αrd of S bit. CL is already preceded for each block according to 3.1 ! Then, thε first block is codable with its RRPCPl-codes OFR within CL1. Thε othεr blocks arε computεd subsequently by a CONTINUATION, as described now: c) It can be supposed that a (left) neighbouring block B1 is already coded! A second adjacent (right) block 32 will be chosen. Method 3.1. has already reduced their scales, e.g. down to CL1=3 and CL2=2 bits, seε FIG. 5 (+FIG. 4). Onε common point P12 (ε.g. thε right uppεr corπεr of thε precoded block 31) is chosen at the border cf those neighbouring blocks. Thε distance P12 - MIN2 defines a REFERENCE UCRD RU(12). Previously, the (PCPl value Rb of the) point P12 must be included in both scales (dynamic rangεs) defined by CL1=3 and CL2=2. d) Tne value R-J of thε common point PI2 was ceded by a 3 bit RRPCM-wαrd C1 fcr its offset to MINI to comoute its exact 3 bit-PCM value RU, using CL1=3 within the block BI . Tnus R' is known new! According to the (even vectorial) equaticr, R'*.'fP12l = W I ÷ Cl - fll Z * Z2 the value R'J may be ceded as well using a ccsitive 2-bit-word C2 within CL2 from tne still unkπcwn P1IN2. - Tnus C2 is kπcun and f!IN2 may be calculated as an exact PC " ! value within 62 (t e address of ?ZV.2 in 82 sπculd also be cctisόl ) . All otner points P2(j) cf S2 are codable new as a pure positive offset to ,1IN2. " Since eac. * r cciπt ?l(j) of 01 is cπcosable as RL', it nay even be MINI itself! e) ~". .'2 is ccπoutsd as its PCT-Vucrd and all points of 32 as an offset, to "IN2. Tne same mstrrcd may oe used to cbtain T1IN3, I1IN4, MI..-5, P1INΞ.., using points ? included within CL cf ths blocks 82 and 83, S3 and Bi..., as shown in F13. 5. f) SLCC SYNCHRONIZATION cf the single segments SI(i) of SI is also possible prior to the RRPCr-! codes since that εthsmatic problem is solvable separately! Each FUNCTION PLANE, as clockwise DIFFERENTIAL CHAINS of point to point offsets inregrablε to thε CRIGINPL FUNCTION, or the DIFFERENCE FUNCTION to a PREDICTOR FUNCTION, is codable quite exactly by such a HIERARCHICAL FRPCI-1 (HRRPCn). 3.4. Preliminary 20-test: Comparing bit rates using quits exact codings a) i-ihiis ceding thε INTRAFRAi LII-11MANCE FUNCTION of standardized sequences quite exact, ths FTZ measurεd the following results by combining the methods 3.1 a,b,c (using uπoctimized fixed limits cf ES and CL) and 3.3c, but still coding RIN = ZERO twice per block Instead of its (vsctαrial) address, /ό/,p,55: bits/pel ENTROPY SONY/***/ HRRPCfl-1 HRRPCfl-2 ! Gain ORIGINAL FUNCTION: 5.73 5.B3 5.53 5.21 ! 12...235 PREDICTOR FUNCTION: 4.51 5.34 5.DO 4.51 ! 0...14? Versicn 1 (HRRPCH-1 ) is a direct coding, version 2 uses HUFFMAN CODES. Still, the tested version only reaches a SO -OVERHEAD REDUCTION as mentioned in 2.2d. b) Those first results demonstrate, that already a very unoptimizsd HRRPG-1 is at least equivalent or evεπ significantly bettsr than other methods: Unfortunately, thε less active point-to-point differεncεs were net measured! Furthermore, thε lowest possible code lεπgth was fixed to CL=3bit, according to prior tests with highly redundant overlapping borders, as mentioned in 2.2c. Sucoosing a correct test rεoort /Ξ/, uπεfficiεπt minimal block sizes BS = SxS were used to segment the PREDICTION PLANE, while the ORIGINAL was segmented in minimal blocks cf 4x4, statistically determined as an cDtimuπ * (SONY: 5x5!) under those, still uncoti ized conditions. At least, the method should not be used to cede changing signs (+/-). Positive codes from HIN are always possible. I 2.5. A furtner reduction of the fπiN-overhεad a) In the cass of smaller blocks, CL is often high, dus to the above mentioned RELEVANCE SELECTION. In this case LOCALIZATIONS CF THE ELCCK fil If-uπ are very suitable sines each M.\(i) is a relative BLCCK-ZERO! If CL is greater than the acdress cede given by the block size, WIN should be localized by the short ' address cods of a str.all block! More generally, PII.N (and TAX) are reoresenting a VECTO , localizinc a_ coiπt in the 30-soace given bv its plane block addressεs and its functional value(s) accomclished by a (logical) SIGN, according to ϋl = έ - J2UI2 = Vx; Vy; ( z); F(x,y,(z)); SIGN(F). Net) VECTOR RULES are applicable, constructing BRIDGES betuεεn R'j(i) and !*i (i), εsoecially between (snail!) adjacent blocks. - see FIG. 5. b) Thε possible gain nay be shαuπ by an examplε of very high entropy, where a tco-dcuπ coding until a minimal size BS=1x1 oel (33.6*!!) produces excεssivε relative overhead. This overhead is never co oensatable bv such sincle pels! Furthermore the (highly redundant) range of a border of 1pel thickness uias included in the measures, meaning thε rangε R(4σεl) of a 2x2 block mεasurεd for each 1 1-pel-block instead of the correct diffεrence bεt-jεεn 2 pεls only: Primary fiεld BSC=255x255 pεi: BP1IN as FUMCTI0N/6/, as VECTOR, saving SIGN GAIN BP (amount of RRPCri-cαdεs) SHIN (additional HI -codes) 93.1 1 % BR (hiεrarchical precedes) o υ e r h ε a d : bp bmin br TOTAL (Blocks = 31000) 8.50 6.33 6.34 26.3? evertheless about 6.34 bit/pel instead of 8.6 are reached as dεtailled in sεction 3.6 to 3.9. Because of redundant ovεrlappiπgs, about 5 bit/pel should be rsachεd according to 2.2b εven in that extreme situation, a further gain by ANALYTICALLY SUITCHING OFF (3.1e) for opti izεd rεduction not included! c) Thus thε second aim is rsachεd by rεduciπg the ovsrhεad for MIN to a nεar zero rate. - According to first tests, the rentable minimal block size is even reducible ncu to less than 4 pel (e.g.2x2 pεl). A stεady convergeπcε down to a 2x1 size (2oel- lcck, including 1 precoded pεl uithin R) seems to be possible. The block soeiific overhead has been reduced from 15 to 2.9 bit (91113/31000). 3.5. Detaining ths irrocrtaπt excεssivs tεst 3.5 (/S/, annex) using 1pel-blccks Sir-.cε thε bit rate sεεr-.sd to be εxcεssivsly high, thε importance of the abovε rr.snticr.ed tεst (3.5b) ωas net sssn clearly by /5/. But it should be coπsidsred as a very important CCf.l/ΞRG fiCΞ TEST for each variant of thε mεthod! Therefore ' t. ** .e results cf ths computations arε rεorc uced here, still containing ail the εoovs *** .ar,rionεd i-αerfectiαns. A field of ths TΞ5T ΞE UEMCΞ "DOLLA" ωas taken: >) Taois of thε amount of blocks of a certain CL and B5 (according to 2.5b). CL !=S(psl): 1 4 15 64 255 1024 ! total blocks 3 1 0 13 2 0 155 0 S71 4 0 4 H05 5 14 745 6 0 5363 0 834 6 ! 0 4 total:! 25 £12 4 334 541 100 10 3 I 31 000 b) Tablε of the amount of pel coded nαui uithin blocks of a csrtain CL and BS. CL 'BS(pel): 1 4 16 64 255 1024 ! total pels : ) Table of thε amount of bit when coding all pels uithin each block by RRPCM. CL ! 35 ( pεl ) : 1 4 15 64 255 1024 ! total bits 0 ! 0 0 ! 13 0 I 335 0 4 573 0 42 1=2 53 520 63 220 41 B4G 23 350 2 SCO 15 350 215 21C 55 20S 0 0 0 0 0 56 203 5 338 0 0 0 0 0 5 835 32 0 0 0 0 0 32 total:! 134 427 32 520 43 132 30203 12 8CC 15 350 ! 324 457 Tne result of the line(s) CL=5 shows clearly the excessive imcortaπcg of small blccks (sdcss) for ths resultino bit rates, herε and in all othεr tablεs! d) Table of the amount of bit ωheπ coding 1pel of each block only (e.g. SPTTi!] CL !3S(pel): 1 4 15 64 256 1024 ! total bits This is the overhead produced by the fact, that each FIIN ωas coded once as the 5LCCX SPECIFIC ZERO and a second tine as a DELTA CODE to RU, a (coded) point of the previous block. 3.7. Avoiding tne sign espεcialiy using altεrnatively PIAX and KIN Since thε fαrrer adjacent block 81 nay be supposed as coded, there is only one difference DI2=RU1-°2 to code within the mentioned 1pel-blocks, to accomplish the coding of whole blcck 32. Since there is one εddrεss only, cπε dirεctsd difference, counted from Rt. 1 , is sufficient. Normally that difference must have a 3I0r:, acccmoiished by an amount, limited by a (hierarchically) preceded CL2 cf .-.e clock 32. L'ithiπ 1pel-blocks a 1bit-SIGN is a very significant overhead fcr tne eel soecific bit ratε. Sut tne sign may be avoided: a) Sines a correctly nεasursd CL of RU12 and P2 indicates, that a halfseals as given by CLK=(CL-1) is not sufficient to code the point P2 and R"J12 from T.Z. ' 2-C (P2 cr R!i'12l), thε amount of the diffεrεnce 012 must exceed CL-1. Tnεrεfore it is sufficient to cods oπlv that cart of thε amount, which exceeds the halfscale! The DECISION-SIT (SIGN-BIT) is saved within each 1pεl-block by measuring tns rangε corrεctly without rεdundaπt ovεrlappings. b) Within blocks of more pels, the sign fait (decision bit) is also avoidable by several methods (different seaming, according to thε decisions to be made, giving the same result), e.g. using the following DECISION-SIT, if R.J12 lies nearer to P1IN2 or PΪAX2, compensatsd again by a halfseals CLK=CL-1 (case 1 or 2): - case 1: If RU12 lies nearer to F!IN2, a positive halfscale is sufficient to code the distance D12 = Rai2-mi 2, else: - casε 2: If RU12 lies πearεr to PΪAX2, a ne ativε halfseals is sufficiεnt to code thε distance D12 = F!AX2-R'12 with the effect, that P1AX2 instead of P1IK2 is determined as thε ZERO-REFERENCE for thε coding of the offsets of all other points of E2. - Or: The .offset to-TCIN is ceded in thε 2. alfscale!. Equivalent methods may use possiblε contradictions of an arbitrary sign and its rεai raπgεs R(h), R(h-1)..., to invεrt it.or even a statistical method. 3.3. The extremes WIN, flAX as a vector According to 3.7, the VALUE of one extreme (normally F!I.\', aternativεly MAX) uas precoded as a quasi sicn-frεε difference from R'J. Its VALUE would be coded redundantly twice as a RELATIVE ZERO, while the address is unknoun. If the length CA, used fcr thε addressing of thε sεlεctεd extrε ε f-SLM or FAX is lεss t an C2, thε εxtrεmε should advantagεously bs addrεssed, the co pletε code containin now the address and the difference D12. a) Tabls of thε amount cf bit according to 3.5., but coding nou one address in each block fcr one EXTREME (flL'J2, ~~ ΑX2) instead of one KI,\-code (rslatiws block-zεrαl). k-'here tne cods CIA for thε addrεss exceeds CL2, CL2 is taken (*). CL2 !CLA for SS(cel): 1(1) 2(4) 4(15) 5(54) 8(255) 10(1024) 0 * 0 * 0 ** 0 * 0 * 1 * 1 * 1 * 1 * 1 * 2 2 • 2 - *■ 2 * 2 * 2 3 * 3 « 3 * 3 * 2 ti ύ * 4 * 2 4 5 * 5 s 5 ' 2 4 7 * 7 * 2 4 8 * 8 * b) Resulting tabls of the amount of bit coding all flL'i-addressεs iπstεad of the I'UM-ualues (rεlative block-zsro!) with additional SIGN for all blocks. - At placεs (*), CL (dcubls coding of PI 'J, sεε ε) rεπains thε bettεr method. g) Ccmputed pεr pel of thε field 255x255, the above mεπtioned (3.5b) bit rates arε cbtainεd, thε range still mεasurεd within the highly redundant bordεr. Considering the total part of the HIN-codes only, it ωas reduced frα-i 153655 to 10408 bit, its local cart of the bit rate frcn 2.42 to 0.15 (reduction; n it ratε b oo ε than 3.9. Rεsults en box lεvεl and pel level a) As a rssult, ths block lεvεl must bε optimized beforε making anything en pεl lεvei! In the bad εxa-r.olε 3.5. thε remaininc one oel of Ixl-blccks ωas codεd f-fios, nor only as a FLWCTICN DIFFERENCE Ry(i)-." * l i(i) f but also as a redundant* 1Z9Z 3.5b! If pεl codings are donε beforε tπε ooti ization of ail logical correlations on clock level, an aωful increasing of the bit rate occurs. In /=/, thar important tsst 3.5b, left side, intended to demonstrate tne limits of the method. - Instsad, it shcωs clearl y defects and mistakes cf tεst variants and should become ths standard tεst for the ne'- * method! b) Optimizations are achiεved by - using LOCAL ADA P TIVE CCMTRCL COOES (ωεll defined stop bits) accorαing cα 3.1e, - msasuring R of thε REAL ELCCK SIZE only, including onε pεl of an adjacεnt block, for E5 = nxn + 1 this means: ths raπgε of nxn point-to-point diffεrεncεs(! ), εnabliπg to chose a ωell defined (suitable x-,y-) chain of DELTA CFF5ET5 instead. - regarding thε extreme(s) εs a VECTOR (address and value), evεn cass dεpεπdεπt, - AVOIDING ITS SIGN, if the amount (of thε luminance) is only uniquely (+/-) interpretabls ωithin the precoded CL (or range R), - S3 dεpεπdεnt selεctioπs bstmesn method 2.4c and 3.3 + 3.5, sometimes evsπ 2.2d, - multi-diiπεπsioπal codings utilizing corrεlatioπs, ωhεrεvεr possiblε, - all codεs should rεfer to a fHIW(i) of the function to be codεd. Codes from a mean valuε makε iπcrεass the bit rate because of further additional SIGNS! c) According to 2.4c, completely sεparatε codεd blocks (ωith a CL(i) excluding thε ovε lapping point) may also bε syπchronizεd by an εxact ELOCK DELTA CODE. If thε diffεrεnce is ωell prεdictablε, this savss bits ωithin greater blocks. d) Thε cc olεts block ovεrhead is reduced to a NEAR ZERO VALUE by the method. Then, kπoun and unknown methods of optimized codings on pel levεl may bε involvεd to obtain further reductions! Range reduced HUFFMAN CGDES may sεrvε to diminish the bit ratε furthermore, but even any othεr (nonexact) method. :.. Including other methods ύ.1. Pure boxes ωith the para εtεr sst MIN,R (no point initially codsd by RRPCM) a) Tne EOXΞΞ, defiπεd by method 3.1 and by constructing BLOCK SYNCHRONISATIONS , ωith BRIDGES only according to 3.3, even if using one point oεr block only ui h RL,v;iN(i), MIN(i) coded as a reference R'r! for fIN(i+1), thsπ πi,N(i + 1) cocsd as a rεfarεπce for l ' 1I (i+2), etc., result in PURE BOXES, by dsfiπinα nou DEFINITE RANGES for anv suitabls ccdiπo method aooliεd ωithin the rsducεd boxes defined by a ccπpletε information sεt PlIN(i), R(i) according to sεction 2! (•) FIG. S b) An additional knowledge of WAX as a regional (box-)vector, ωith block address and functional value, uill result in an additional addrεss overhead, • but offers advantages ωhile the boxes are not too small, since CORRELATIONS are easily to be found in subsεquεnt picturεs, also using CUMULATIONS. ώ.2. Sharεd ranges a) The RANGE NUMBER is precodablε by 0 or 1 (continuing ωith additional 0 or 1): Cnε bit nay precαde, if the value is part of the first or the sscond (thε residual) quantity, one εxcludiπo thε othεr. The quantities are sharable again, if suitabls. Utilizing such EXCLUSION PRINCIPLES, thε average bitrate per block may be rεducεd, e.g. coding 0..1 ωith 1bit and 2..9 ωith 3 bit (cπe added for thε range number) instead of coding 0...9 constantly ωith 4bit. b) Any kind of (indirsct) additional prεcodε for MAX alloωs to utilize SHARED RANGES: V ax(i) = MAX(i) - MIN(i) is nearly alωays advaπtagεously divisibls into tωo RHPCri codεs, one of them being codable uith tωo (or more) bits less. - The range Dmax = 0...11 is devidεd in tωo ranges of 0...7 (CL=3) and 8...11 (CL=2). ωith a prscode 0/1; 0R _ in 3 prεcodss 0/10/11 for 3 ranges of 0...3 (CL=2). - 0...9 is dsvisiblε in tωo codεs of 0...7 (CL=3) and 8...9 (CL=1). - 0...18 = 0..15 + 15..18 being more advantageously sharable in 4bit + Ebit (instead of 4+1 and 2+1) by the codes 00G0...1110 and 1111.00...1111.11 c) Knowing the extreme margins MIN(i) and PlAX(i) , redundant EMPTY RESIDUAL RANGES RE. av be excluded. Thus, if ths REAL RANGE R lies betωeen 0 and B, thε raπgε 9...15 is ccrnplεtεly rεduπdant ωithin a mεasurεd code length of CL=4. d) Such SHARED RANGES are also obtained by othεr methods, e.g. εmploying thε above επtionεd CUMULATIONS and thεir local dεπsitiεs (probabilities)! DENSITY 4.3. Exa-* * *clε: A table of usual sharεd ranges P. A ( R ) I C C D E L E G T H TRUE/! !CL/invers: S-CL! BN(CL) FALSE! d ε o i ! b i n a r y I decimal .binary Idee. bin. e.g.! dec. normal cr e.c. ! minimal maximal ! ! *.:,-, / -p', , i 1 3 I 5 ! • * • « L* 0 0 I ; C.-««1 1....2 0 1 ! 1 / 8 0/111 1 ! 2.! 4 3....5 00 11 1 2 / 7 1/110 I 1 3. ! 5 7...14 OCO 111 1 3 / 5 10/110 ! 2 10 4.! 15 * »π CG00 1111 ! 4 / 5 11/ICG ! 2 S.! 32 Ϊ1...52 Gccαo 11111 I 5 / 4100/ 11 ! 3 11 5. ! B4 i 52..125 ! coαccα 111111 ! 5 / 3101/ 10 ! 3 7.! 12= 1127..254 ! 00000001111111 ! 7 / 2110/ 1 ! 3 3. ! 255 !( 1..254)(0OOCOO0O 11111111)! 8 / 1 111/ 0 ! 3 a) According to 4.3, a scale R may consist of R2 + R3 even of R3 + RS only, if no valuε lies ωithin another RANGE NUMBER, ωhich are all defining EMPTY RANGES! In the normal scεls(col.l), εach ZERO is countεd from a local MIN=0 of a block or nou: as a ZERO of a SHARED RANGE COMPONENT, the functional coαrdinats bεiπg rεgardsd as an (also sεparatεly) 0/1-sharabis coordiπatε interval in x,y,z,..F. b) Each value ωithin 1 to 254 of col.2 lies ωithin one of seven ranges codable ωith CL=7 instead of CL=8 bit, meaning an advantageous (method adaotivεly rsdudεd) PCM seals of 254 values only using SUCCESSIVE EXCLUSIONS (monαtcπiεs) as εach kind of not rising or not falling function (subsequent address points)! c) The valuε CL=0 (MIN = MAX) may be substituted by a (nou virtual) stage CL=1 , mεaπing nou, that each possible ωitdh of a range is codable by BN(CL) = 3bit or 7 subsequent bits instead of 8, according tα 3.1b. d) Generally 3 ranges are giving thε full scale, normally Sbit: (MIN - ZERO; MAX - MIN; HIGH VALUE - MAX), each third range being a complement to the others: - If one of those CL(k), k=1,2,3, needs Sbit, ths others πeεd only 7 bit scales! - If MI is detεr inεd to be 225 and CL(R=31..64) = Bbit, MAX is codable by 4bit, countεd doωn from HIGH VALUE,e.g. 255, but valid for each limited R(i)I - Thus, an exact DELTA CODE never needs Sbit, as commonly supposed: In a continuously circular εcalε, HIGH and LOW- ALUE (ε.g. BLACK and l-riFTE) are nεighbouring values (G, 255), εach offset being codable ωith 7bit + SIGN! - The same rule ma be used noω advanta eously for each smallεr ran ε sca 5. Using constant block sizes and/or stεps of more than onε bit. Of course tne methods 2.2d, 3.1a,b and 3.3 are applicable within constant block sizes, diminishing significantly the P -ovsrhεad bmin of for-ula 2.2a. T-ε R-cverhead br, rεducεd to (less than) 3 bit, may hardly be diminished. • 5.1. Reducing CL ir.2_ bit stecs instead cf 1bit steos An initial size of 15x15 cay bε cnosεπ and initial 2bic ωill cede directly its rangs reduction B^J(CL), a modified method 3.1, as thε following examole snows: a) Initially thε range (-reduction) cf a block ωith BS=16x15 ωill be ccdεd by 2bit for thε numbers CL=S,7,S,5. The total overhead becomes: BSoel S3 2bit/πpel br ! ! addr.MI. bmin TOTAL 35255 = 15x15: br255 = 2/25S = 0.C0791 !! 8bit/255 = 0.032= 0.04 CR:SS54 = 8x5: br54 = 2/54 = 0.03125 !! 5bit/64 = 0.125 0.15S b) this may be used sucessivsly.s.g.: If CL rεachεs Ebit, the ranges (or their" reduction) of each block of a set of subblocks (e.g. cf 55=4x4 instead of 8x5) is prscodεd dirεctly uith furthεr 2 bits, rεaching until CL=3 ωith: BSoεl B5 br ! ! addr.f-iIN bmin TOTAL B515 = 4x4: br15 = 2/15 = 0.125 !! 4bit/15 = 0.25 0.375 CR:3S4 = 2x2: br4 = 2/4 = 0.5 !! 2bit/4: 0.5 1.0 Vεrsion a) or b) may bε accomplishεd by a 1bit-stεpping according to 3.1 (or εvεn a furthεr 2bit diminishing at BS=4x4), causing the additional rate: BSpel B5 br addr.NIN bmin2 TOTAL BS2 = 2x1: br2 = 1/2 = 0.5 !! 1bit/2: 0.5 1.0 TOTAL of br2 + br4 + br54 = 1.03 + bmin2 1.53 TOTAL of br2 + br15 + br256 = 0.63 + bmin2 1.13 5.2. Reducing a fixεd 2x2-pattεrπ in 3bit stεps Even taking a fixεd block size BS=2x2, each CL(i) or the reduction is codable by 8N(CL(i)) = 3bit, resulting in 0.75bit/pel. - Accomplishεd by bmin4 = 0.5bit/pεl an overhead rate of 1.25 bit/pel is reachεd. At BS=2x1 : (3+1 )bit/2pεi = 2bit/pel. 5.3. Thε break even point, proving for the best method a) A BREAK EVEN POINT is reached nou πεar 85=2x1 , ωners the overhead bo = bmin + br increases by C.75 bit/pel from B5 = 2x2 to 2x1, according to 5.2 and thε • comcor.εr't bo c ' εcrεasss by aooroximatεly the same value, according to tabls 2.2b. TΓS S, tne mεtnod reaches a nearly STEADY CCWERGE'-iCE until 55=2x1. b) Lisino a constant block size 85, a_ small constant plane must be ccdabls ωith b2 (2x1) b4 (2x2) b1S (4x4) 5.1: 1.53 (rπeth. 3.1 about 1.3) 1.G 0.37 5.2: 2.0 ' 1.25 0.44 c) Ccmared ωith known OPTIMAL CODPiG METHODS, Ϊ to os seen, that tne methoc becorεs superior to any other method, at least until BREAK EVEN POINT! - Since any non-constant function F appears as an OFFSET FUNCTION' Fl to a CCN5TAMT F0, codable by the same exact method hεrε as thεrε, the formula F = F0 + F1 shcωs, that this stated advantage of the πeω εthcd must rεmεiπ, at least until a rπεasurabis break even point, ωhere an AUTOMATIC SWITCHING is possible. d) Coming doωn to a code lεπgth for BS1=1x1 (+1pεl), the overhead br is no more distributable on a plurality of points, resulting in rsincrεasinς rates! Measuring the local differεπcεs instead of the absolute values, the ACTIVITY cf 2 subsequent pels (meaning one relative differεncε bεtωεεn 2 points) is far isss tnan thε absαlutε values of 2 points (2 diffεreπcεs to PIIN). Uithin a 4x4-blαck, 3 DELTA-CODES (ε. . forming a ωay likε an U or C) are accomplishεd by a 4th cods to a pεl (e.g. the last right upper corner) of a former adjacεnt block. This results in a similar HIERARCHICALLY RANGE REDUCED DELTA rcODULATICN. ε) Of coursε thε mεπtionεd planar bay (U) may contiπuε in thε z-axis urithiπ a 3D-block, advantageously along spatial CORRELATION LINES as dεscribsd later: The ωay of SIGNIFICANT POINTS (their nεu addrεss) is advantagsously detεrminεd ωithi.* * ; 3 soacial coordinates x,y,z like thε mentioned "addresses" of fuctional values in 3 coordinates x,y,F(x,y). For εach planar block, a most significant point (according to predefined criteria), coded ωithin PURE BOXES (4.1.) alreary allows tα find the spatial ωay of a coint ωithin a 3D-picturε sεquεπce. f) Codings such very significant points PS, a kind cf framework αr skeleton is obtained, enabling to code less significant points tco-dcωn betωεen them until thε available bit rate stops the procedure, still enabling to interpolate then. 5. Statistical ranςe orediction, bottom-up correction codes, range reduced HUFF'A.'* codes 5.1. Bottcm-uD nesting a) All kind of possible ranges are implicitely (statistic estimation) and exoiici^eiy co abis, even DISPLACEMENTS. /3/ is already mentioning a too-down r.εsti- ** : of DIS?LACE. rr iEiT5, statistically pra-dictiπg tne range, li/iae address rarcss are cncssn to orεvεr.t the worst case,the disolacsnεnt not bεiπg codaolε i'ithin tne s azis ically predicted ADDRESS RA'.Gt. This is of course avoided by DIRECT P-^ECGDI G as utilized by SONY /5/ according to 2., in order to obtain a "HICH E"ICIE::CY COOI'.'G APPARATUS'VSd/, still having to amortize the overhead cf tnε fll.N-tfAX-precodεs and without reaching such very small boxes. ' b) According to /7 b/, both methods are usable. But, if a pre-dicted range R is wrong there, a BQTTCf-T-UP-NESTING of the mentioned boxes is chosen, exactly invsrti.-.ς method 3.1., also applisd nou ωith ranees of displacements: c) If a predicted ranee is FALSE (too smalD.it may be εxtsπded (ε.o. doublεd) subsacuently bv 1bit-codes, until the UNEXPECTED EVENT is codabis ωithin. Thus, method 3. and the components of εquation 2.2a are cptimizablε for all kind cf disolacsmeπts, measurabls likε points in a ccmbinsd FUNCTION-ADDRESS SPACE, dynamic blocks being selεctablε new along nonlinear correlation . lines within a multidimensional space to rεsult often in a quasi static problem, to be solved like this (seε chapter 8.). 5.2. Using (range reducεd) HUFFMAN codεs according to pre-dictεo cumulations According to a DISTRIBUTION PR03AaiLITY (FIG.3), PR08ABLE HUFFMAN- or RANGE- C0DES(4.2) of short lsπght arε rεsεrved for CUPIULATIDNS, longer words for less dεnsε sections, even approximately quasi EfPTY RANGES R(i,j,k...) of a domain. 7. Implioite and εxplicitε coding of ε pty rangεs (empty scaiεs, holεs) 7.1. Saving the eπtioπεd εxcεssivs bit rates at a (sharp) contour Rεai objects contain sharp contours. An idεal contour selεcts two quantitiss, e.g. a quantity of white and a quantity of black points. In this case, thεrε is no valuε existing bεtωεsn black and white! The whole range in bεtweεn is an E.TPTY RESIDUAL QUA TITY(ERQ), because evεry valuε in bεtωeen is not a rεal onε! a) As t.-e falsifiεc values will lie within the intsrvall T (see FIG.3: ERO=R." * L) tπey are correctable by raki.-s tr.e-n white or black. In rεality already thε first point diverging relevantly frcrπ cne quantity, belongs to the other one! Conventionally unexact SUBJECTIVELY ADAPTIVE CPCI-predictors have the bast coding exactness witnin that £=C, according to the ION VALUE of tne -CN, causing faults like "εccε businεss" and "slopε αvεrload". o! The _ .~L_Z.-.TI_N cf an ERG is acniaved by rπetr-.cd 3.1. resulting in s.tail CHAINS ~~ RELEVANT ELGCK≤, indicating thε high EDGE DIFFERENCE along contours. c; _itπiπ those blocks cf high relevance cnly, a 1/0-pattern localizes t e e αε. Thus, the ne-*.' rpεtnod cedes far every oaiπt by 1bit/pei if it bεloπcs to the "left" or tne "right" side cf ths sdςe. In greatεr blccks, ε.g. of 3x2 pel, tnat 1 it/pel-iπformation would εvεπ be reducible by hierarchical block codings, e.g. one block containing 2x2 or 2x1 pels with that SIGN (LEFT/RIGHT). d) Each bit indicates, if ths point is element of the RIGHT or LEFT QUANTITY. Instead of a coded value, thε nearest RIGHT or LEFT point may be supposed to be thε true function value (A-prεdiction). Each PREDICTION, made by a surroun¬ ding, εvaπ DIRECTED to the edgε, might prεvεnt a kind of too abrupt jerkεyness. s) The procεdure may be done as a com p letely independent coding of two AREAS, segmented bv a_ contour chain as detεctεd by c,d and algorithm 3.1. Likε SLOCKS, such NATURALLY SEPARATED AREAS are SYNCHRONIZED bv one 6RI0GE V = R'.-WIM) only. f) Thε transmitter is able to codε a mεasured range of such an ERQ in thε same way as ths mentioned real ranges when using the LOCAL GRADIENT! Whenever such an ERO is εsti atεd from thε codεd past (ε.g. along the contour!), a binary value codes ths εvεnt as TRUE or FAL5E, followεd by implicit or explicit range codes, R or CL even bεino estimated along the contour to code exact local diffεreπces! If thε (not too small) estimated CL is FALSE, a simple bottom-up extεntion is madε until thε rεal (difference-) offset is enclosed to code it. g) Since such an ERQ is effεctivε for a whole block, it reduces the quantity of possible values (the scale!) fcr ths rest of thε block, according to FIG. 3: For the whole initial block (t1 to th) the DGUBLE RANGE Ei-12 and EP22 is valid after the exclusion of ERO (=R."-.) by thε time constant T along the edge. h) After having eii.-i atεd cr ceded ths RELEVANCE CHAIN, residual cuantities of valuεs (of points) are codable likε having no εdgεs (ssε 4.3as R = R3 + RΞ). 7.2. Saving bit rates at (block-included) sharp and less sharp contours a) Each E Q is seme KIND CF HOLE in multidimensional solids,givsn by unrieterminate (e.g. black/whits) function and/or address values (where a CONSTANT VALUE or a SHARP EDGE is cbtainεo cr.° by thε otnsr by a 90 degreε rotation). Such uncoded holes,obtained wnsn ceding tne SHARED OG^AIMS (ses FIG.,: INTER.NAL and EXTERNAL REGION) as ssc**ratεd by a CONTOUR (also: FIG. 3), and one synchronizing BRIDGE between them, will save data for usually coding all edge offsets, this tvoe of EDGE ADAPTIVE coding being more exact than commonly linear distributed samolss. b) Detecting less sharp contours (rising part longer tnan T) one or mora acditioπal bits will aporoximats better the contour than eqidistant samolss /5b/. - Using a circls as a seals, wherε black and white or the two grey values SI and S2 of an edge oεco e adjacent values, the principle gets very clear: - Eacn halfseals is directed to the othεr value, thε highεst dεnsitiεs near 51, 52. sines small deviations only will be probable from each CUMULATION POINT HP selecting the direction of the other HP - (see FIG. 3) , inverting the SIGN. - Tnε surrounding of ths edgε is codεd lεss dεπse when leaving a point HP. c) In moπoton (rising/falling) functions, already codεd (addressed) areas may be excluded to obtain a smaller address range for a furthεr CL-rεduction. - If any K0N0TCN CUΛNTITY is coded within a HALF RANGE, ths addresses of the following points are codable with 1bit less (like in a plane addrεss block). - This may bε succεssivεly dαnε. - Rising/Falling εd es are also representing such menotoπ functions (FIG. 7). (*) FIG. 7 7.3. Eliminating transmission errors by redundant bridgεs To eliminate faults, 2 redundant additional exact DELTA CODES at the border of grεater blocks are to be used: If the computed result of onε path differs from the result of all others, an ε ' rror is dεtεctεd and corrεctable, presumed the existence of at least 3 paths, values having to become equal for εach path! 7.4. Prefix to chapter B: Multidimensional spaces (*) FIG. B As mentioned in 3.3d, thε valuεs of a plane ccntaining addressss and function values may be regarded as VECTORS, having 3 cαordiπatss. This is suitabls for dL (i) and :iAX(i), while the other vectors, as a set of parallels, arε codable subsequently by making adcrsss information redundant (cεgeneratεd vectors). In equivalence, in a 30-address spacε, 4 (reducible) components arε to be coded. 6. New ob j ect: How to reach 1bit/oel in multi-dimensional soaces a) Static 30-blocks are selectablε by known methods (z-sum of diffsrεπcεs = 0). A suocαsed bit rate ef 4 it/pel is distributable uoon a 30-blcck of at least 4 SLBSEC -'.T STATIC PICTURE PLANES comiπo down _to a_ bit. rate cf_ Ibit/oel. Iπ- tr.ε pass cf noise, tne mean value of 4 oicturss is ccmouted along tne z-axis. z ] Zr. D N MIC REGIONS known and unknown methods are aooliεd: All i.-!C of DISPLACEMENT VECTORS may bε measured normally as known frc~* frar**s to frarts, resulting in virtual CORRELATION LINES (FIG. S). The blccks may now bε estimated,their range being reprεsεnted by an angle: often bεcominc smaller if tne estimation is true (TRUE: ths point has bεεπ found within) and widεr, if not, until TRUE. Thus tne address range of all cαmooπents may bs minimized. (') FIG. 9 c) Anotner mεthod works completεly too-down: A ccrrεlaticn point may bε found again within subsaqusnt picturss to compose a GREAT BOX CF SEVERAL SUBSEQUENT PICTURES (FIG.10), nestable in analogy to 3.1. Gsπεrεlly thε highest deviation defines the sizε (CL!) of an initial "big bgx". Smaller, CURVED AREAS are selectable likε edges (FIG.5) or bεtwεeπ correlation lines, as shown by the black arrows (boxes/areas) all treatable according to 3, since their components are quite normal signal functions, RANGE PRE-DICTIONS being applicable far εvεry block-function,treating componεnts like a luminance. Such a measured (or even statistically) pre-dicted RANGE (30X) OF SUBSEQUENT PICTURES is mentioned in /5d/,prior /7b/. Now (nεw) thε EVENT of FIG. 10 is also ac ' vantagsαusly nestable according to 3, FIG. 5 (FIG. 2, 3, 4) and FIG. 9! (*) FIG. 10. d) In ACTIVE REGIONS, PCM-exactness is reducible, as known by the SONY-methcd /5b,c/ cr is locally interpolated as known by RΞN of ERITISH TELECGfl /2/. But, wheras those mεthcds still produce more noise, by diminishing only planar (spatial) or functional exactness /5/, pp.13-22 (SONY at BS-BxS and 2.2bit/ρel; 3?.Sc3 - RSfJ at BS(min)=3x3 and 6.43 bit/oel: 42.SdS), the new BOXES allow a n-dimεnsional DISTRIBUTION OF IN-/DECREASIMG EXACTNESS on all components x,y,z,F. - Utilizing thε prεdεfinεd SOXES according to 2.1 and 4., the new method is able to reduce exactnεss in subsεqusπt coordiπatεs (components) bit by bit: - Reducing the FUNCTION EXACTNESS by 1bit, the X-EXACTNESS by 1pel and the Y-EXACT,\E≤5 by 1pel, using intεrpolation bεtwεεπ all such points, dεfiπεd in the 30-matrix, the aim of 1bit/oel is certainly reached with minimal noisε, since the maximal distortion rεmains smaller tπan in the mεntioπed methods. - In the worst casε interpolations between boxes (flIN(i) and PTAX(i)) may suffice. Uithin 2 pictures, (πcn)liπεar intεrpolaticn or TRANSPCRT CF FORMS CF THE PAST S. Ne 1 - ob j ect: How to reach 1bit/oel in multi-dimensional spaces a) Static 3D-blocks are selectable by known metnσds (z-sum of differences = 0). A supposed bit rate of 4bit/pel is distributable upon a 30-blcck of at lsast A SUBSEQUENT STATIC PICTURE PLANES comin g doun to a. bit rate o_f * lbit/oel. In t.ne ease cf noise, the mean value of A pictures is computed along the z-axis. t) In DYNAMIC REGIONS known and unknown methods arε applied: All κir,d of DISPLACEMENT VECTORS may bε measured normally as .known from frame to frame, resultin in virtual CORRELATION LINES (FIG. 9). The blccks may now be estimated,their ranee being presented by an angle: oftsn becoming smaller if tne estimation is true (TRUE: the point has been found within) and wider, if not, until TRUE. Thus the address range of all components may be miniπizεd. ( •*■ ) FIG. 9 c) Another method works completely top-down: A correlation point may be found again within subsequent pictures to compose a GREAT EOX OF SEVERAL SUBSEQUENT PICTURES (FIG.10), nestable in analogy to 3.1. Generally the highest deviation defines the size (CL!) of an initial "big box". Smaller, CURVED AREAS are selectable likε edges (FIG.5) or betuesn correlation lines, as shewn by the black arrows (boxes/are3s) all treatable according to 3, since their components are quits normal signal functions, RANGE PRE-DICTIONS being applicable for every block-function, reating components like a luminance. Such a measured (or even statistically) ore-dieted RANGE (30X) OF SUBSEQUENT PICTURES is mentioned in /5d/,oricr /7b/. Now (new) thε EVENT of FIG. 10 is also advantageously nestable according to 3, FIG. 5 (FIG. 2, 3, A) and FIG. 9! (*) FIG. 1C. d) In ACTIVE REGIONS, PCI»Vexactness is reducible, as known by thε SCNY-method /5b,c/ or is locally iπtsrpolatεd as known by RBN of BRITISH TELECOM HI . But, uheras those methods still produce more noise, by diminishing only planar (spatial) or functional exactness IS/, pp.1B-22 (SONY at BS=6x6 and 2.2bit/oel: 37.Bd3 - RBN at BS(min)=3x3 and 6.A3 bit/pel: A2,SdB), the nεu BOXES allow a n-dimeπsioπal DISTRIBUTION OF IN-/DECREASING EXACTNESS on all components x,y,z,F. - Utilizing the predefined BOXES according to 3.1 and A., thε new method is able to reduce exactness in subsequent coordinates (components) bit by bit: - Reducing the FUNCTION EXACTNESS by 1bit, thε X-EXACTNESS by 1pεl and thε Y-EXACTNESS by 1pel, using interpolation betwεεn all such points, dεfined in thε 30-matrix, thε aim of 1bit/oel is certainly reached with minimal noise, since the maximal distortion remains smaller than in thε mentioned εthods. - In thε worst case interpolations between boxes (πiN(i) and FlAX(i)) may suffice. -,'i hin 2_ pictures, (non)linear interpolation or TRANSPORT OF FORπS CF THE PAST e) A nesting of 23- cr 3D-searss is easy. But if the past indicates, that only one coordinate is relevantly changing (estimation!), this may be utilized now to diminish the pel soscifio overhead, dividing then that one coordinate only. Sines IR/RELEVANCE is automatically selectable, RELEVANCE CHAINS may localize no'-' imolicitεly the displacements instead of former exolicite codings. f) A valid BCX FOR ALL COMPONENTS, as FIG.10, is pre-dictablε (by precodes or =s ** .irr.2 ** .ions -.'ith correction if FALSE) to use method 3, also meaning subsequent NESTINGS OF ALL ~~ ~ ~ Z DIFFERENCES, then cf SI GLE FRAWE-TO-FRAPE DI F FERENCES! g) ijJ ils'3 separate vεctor comoonents, e.g. V = (20,5,10) still need a set of CL = (5,3,A) = 12 bits, its V0LIT£ (2x5x10) contains 1000 points, each point within being codable with only CL=1Q bits. Its CL is also precodable by A bit. h) COLOUR VECTORS are treatable like displacements now, according to 3. Using displacements, an exact but Isss dynamic, sometimes a quasi static information should be obtained according to FIG. 9 and/or FIG. 10. But the method discriminates other kinds of correlations: 5.1. New correlation types, obtained by the method a) In DYNAf-IC REGIONS thε pure block specific RANGE INFORMATIONS (3.1) result in CL-C0RRELATI0N INFORMATION (CLC). To find correlations (points), CLC is a simple but efficient (first) reference. PURE 30XE5 (4.1) may already be used! b) Utilizing specific HIERARCHICAL CL-RELATI0N5 of CL(h), CL(h+1)...CL(h+n), . meaning to comoute their coefficients by dividing one by the next, give a kind of SPECIFIC PATTERN, characterizing the region. c) CUrπULATIONS are measurable thereby or by knoωn methods, according to FIG. , enabling an apparatus to find a same caracteristic ωithiπ subsequent pictures. They are found as SORTED HIGH DENSITY F-C0RRELATI0NS of even different places cf small function differences. A fine black-white-grey pattern has such points, without having small local x-y-diffεrεnces! A discorrelation indicates singularities: Distortions cr even defects of an element cf the rεcorder, coarse distributions to bε found within an ERQ cf an edge, producing excessive bit rates, should be eliminated (interpolated) before transmissions. d) Utilizing also niN(i) and/cr T,AX(i), even if they are coded within PURE 30XES as single points, very exact references are obtained within a sequence. Ξ. Coding generalized gradient functions within nested deviation rangεs 2.1. Boxes of higher dimension a) All kind of differences in a scacε given by functions and addresses will be called here a GENERALIZED GRADIENT /7b/, a normal gradient cf adjacent points as wsll εs a local (= correlational) or function displacem e nt (= εdgs!). In suossαuent planes, x-(y-) cr z-gradiεnts (DIFFERENTIAL AREAS) are apclied to apoly method 3., sines thε ooint-to-ooint differences need lεss bits than absolute values. Sut all ostεctεd small or great disolacsnsnts are diminished hierarchically within the ore-dieted RANGE OF THE BOXES containing then /7b/, method 3. being also applicable to codε a DIFFERENCE TO A PREDICTION (=surfacε). b) L'i hin a plane, HIGH RELEVANCE nay os given by a SET CF ABRUPT DIFFERENCES (offsets DFR), selecting contours of natural areas for an ARTIFICIAL VIEWING as ωell εs fcr future RA.'.'GΞ PREDICTION by defining a FUNCTION * CODE LENGTH CLF as fell as an ADDRESS CODE LENGTH CLA(x.y) for "displacements", defining BOXES. - The primary boxes may be devidεd in all (threε spatial and fucticn) ax=s (comooneπts), using (togεthεr or separately) thε rules R1 to R3 (FIG. 5). 9.2. 5εparate relevancε dεpendεnt hiεrarchical division of components a) In every coordinate, relevancε may be πsasurεd sεparεtely, indicating thε RELEVANCE DEPENDENT NEED of (a dsgrεe of) division. Such separate (axial case dεpsπdεnt) dεviding cf εach address coordinatε εnd/cr function coπoonεnt is advaπtacεous, ωhεrsvsr axial parallel structures occur (e.g. static regions along the z-axis). Since axial irrelevance is indicated fcr the ωholε OBJECT by 1 bit (division = FALSE) for a cεrtain RUN LENGTH (indirectly by CL) in a certain coordinate, this avoids ths nεed to dsvidε along that coordinatε! b) PREDICTED CODE LENGTHS CL(x,y,z; i,j,k) may be taken εs FIRST REFERENCES for DISPLACEMENTS, being corrεctablε bottom-up as ωell as precisablε top-down, defining (hierarchically nεstεd) BOXES to contain all possible values! c) If a picture fades in or out, already relatively extrεne valuss of CL give a good refεrεncε for a defined object, especially combined with Cl LLATIQf.'S, as mentioned above, uhile the conventionally dεfinεd correlation may εvεn indicate maximal z-differεnce (meaning maximal disccrrslationl ) at thε same place, e.g. uhεn detecting a light which fades out within a dark plane. Llhile i agss cf flickering reflecting waves cr firε prεvent to obtain rεsults by direct correlation measurement, the C -CORRELATION method will still succeed. U £ £. Ξ. £ — ϋ £ £ JL IM CL'SCHE ADALBERT: Vcrlssungen ϋbεr hchεre Mathematik, Band 2, Soriπgεr- Veriaς 'jJien, 1953, pp. 32-34. 12.' ' JO 35/04757: International patεπt application by ΞRITISH TELECOM. 12 ΞIERLING T,. , THOπA .Ϊ notion compεπsatiπg fiεld iπtεrpαlaticn using a Hierarchically structured disπlacεment estimator, SIGNAL PROCESSING 11/55 oc. 337-404, /ii. ' ISCHUf.'KE fcllLLMUT: OPCM picture coding with adaptive prediction, IEEE TRANSACTIONS ON'COr- lUrilCATIDNS, Vol. Corn-25, No. 1, 1977, p D .12S5-13G1 Description cf contour predictions: pp. 1295, 1297 IW/ SONY cublications by T.KONDO et al.: a) Adaotivε Dynamic Range Coding Schεmε (ADRC). - Picture coding symposium 1985: Range reduction by RIM and RAX. b) T.KONDO: Adaptive Dynamic Range Coding Scheme for Futura Consumer Diαitai VTR, - Source unknown, published (intεrnally?) by SG'JY Cαrp.,Tokio, - 10/1938 ?) 1. Range reducing by MIN and MAX: p.21S, chapter 1 2. Compressing data from 216 to 25 Mops: p.223, by 3. Reducing exactness (of thε functional corπooπεπt only) p.222 c) I) HIGH EFFICIENCY TECHIGUE FOR CODING A DIGITAL VIDEO SIGNAL, SONY patent US-4703352, application filed 17.12.85, prior.: 19.12 (2x) and 21.12.84. 1. ADCR: Rangε reducing by MIN and MAX: 2, line 1S ff. by also 2. Reducing exactness 2, line 1 ff. II) HIGH EFFICIENCY CODING APPARATUS, US-pat. 4,722,003 (2S.1.S3, priα. 19.11.36) 1. Utilizing PIIN and RANGE: Summary, 3, line 25 ff. 2. Maximal distortion for decision: 3, line 38 ff. 3. Evaluation of 4 frames: 4, 18 ff, Range number: 6, 55ff for uπεxact code. d) HIGH EFFICIENCY CODING APPARATUS, pat. aoplicaticn (EP-0269189 prio. 29.05.87): 1. 30-AORC ranges incl.time axis: SUMMARY of the invεntion, p.1ff. - claim 1 2. Utilizing thε frame-to-frεmε diffεrence (= z-gradieπt!), pp. 2,3 - movement detections in a picture block inci. time: cl. 1 , Her, oaoe 2 I ' M J. PI.'JDER: Datεπrεduzierende Codiεrung von Videosignalεn curc lokaiadaotive Reduction des Dyπamikbεreichs. - THD (U.Zschunke) and FTZ Darmstadt, 3.2.S3 111 '. EHLER, patεnt applications for SIGNAL-RAfiGE ADAPTIVΞLY REDUCED CODING: a) EP-0031S79-A1 , 20.0-i.1932 (tP-Pat.-Wo. 0091379-B1: sεe claims): Bεreichs- pradiktives Code Modulations lεrfaπrεπ mit sicnaladaptiv rscuziεrtεr Sitrats. 1. Multidimensional αomaiπs ωith limited QUANTITY CF SIGNAL VALUES: p.3,S. 2. Object of the invention: "Centering" the QUANTITY bεtωεeπ MIN and IW: p.3, under 4.1.2. (thε introduction ωas placed at p.S by the EPO) determining an expectivε rangε for εxpεcted values to prε-dict thε range. 3. Centering by at least 2 values: p.3,(3.1), distribution range: p.4. 4. Reducing code lengths according to the range: p.7 (111,5.). 5. Succεssivεly achiεving (cεπtεrεd) range reduction: p.S, (III, 4.). b) EP-0244S50-A2, publishεd 11.11.S7 (prio. 10.4.85): Rεlsvanz- und irrεlεvaπz- aπalytisch bεrεichspradiktivεs Code-flodulations-Vsrfahrεn. 1. Genεrεlizεd multidi επsional gradiεπts and displacements: p.10 (1b), p.13,20 - dsfined in thε spacε of 3ddrεss and function valuss p.3 (5g) - utilizing the planar x (y-) and temporal (z-) gradient information, p.7. - uith a "prediction" used as direct and/or statistical prscoding p.2 (5a), 2. Too-doωn reduced ranges and displacements: e.g. p.5 - Scttcm-up extendεd ranges (prediction = FALSE): p.3 (5g), p.16. 3. Hierarchical nesting p.3 (5e). - of displace επts: p.B (5.5, 2. εεction), p.13 (3c) 4. Succεssivε CL rεduction p.5 (5.5d). c) PCT/EP-01021 (=EP-88-118356), publishεd 18.05.83, priority claimεd: GENERALISIERT BEREICHSPRfiDIKTIVES CODE NODULATIONSVERFAHREfJ, 1. Codε length coding: p.15, 15. - Special succεssivs CL rεduction p.13 2. Hierarchical relεvance sεlεction (p.14, 2a), uith block synchronization by overlapping (p.19, 20) and searching correlations (p.28 ff.) 3. Sharsd rangεs: p.15 to 13 tabls) example rangε reduced HUFFP1A * . 1 , p.21 (3.). 4. CL-correlation: p.32 - Empty rangεs: p. 17, 32 5. Succεssivεly coding multidimεπsional sharper (or coarsεr): p.32 (7.). - l' ^. L l . L 2. H /S/ U.KEHLER: b'ISSEN'SSASIERTE SIGNALANALYSE UMD -CODIERUfJG HIT SEREICHSPRSDI - TIVER CODETOULATIGr-J, TZ-ARCHIV 3/83, VDE-Vεrlag, Bεrlin, published: 21 .07.33. P Ϊ £ t i , £ e_ 5_ FIGURE 1 : Range of a planar area betuεeπ its extrε εs MINIMUM and MAXIMUM. FIGURE 2: Typical linεar luminance function of 3n edge: A simple linεar_ division ssiscts s allεr and largεr scalεs for thε quantities EM(ij). according to "dynamic" ranges of thε luminance function of a ohαto. FIGURE 3: An acdrsssing t(i), i = 1,2,3... may sεlsct thε acrεss ranges for previously definεd larger and s allεr scales. The delay, caused by the system uhsπ transmitting an idsal edge (small picture) is given by T. The CUMULATION POINTS HP(i) result in DISTRIBUTIONS EM(ij). FIGURE ir A givεπ cede iεngth, ε.g. CL=4 for thε range of 15 PCfl-values, is chosen to select thereby RELEVANT and IRRELEVANT blocks (R/I). Each time at least one common point P1 of at least two blocks should be includεd to build BRIDGES for the BLOCK SYNCHRONIZATION. FIGURE 5: Hierarchical plaπε division of an area, by BRITISH TELECOM ( odifiεd). called QUAD TREE or RECURSIVE BINARY NESTING (Irπagε encoding by 5T). The CONTINUATION PRINCIPLE is utilizing punctual valuεs on thε borders. FIGURE 5: Block ωith positions of MIN and MAX in the 3D-FUNCTI0N+ADDRESS SPACE. CR: Advantageous SPATIAL ADDRESS ELOCK ωith a largε quantity of points. FIGURE 7: Within moπotαπuously (not) rising or falling function valuss or address spaces or at an EDGE, a coded spacs (function part) may be εxcludεd. Thε remaining address spacs is continuously diminishing. FIGURE B: Different kinds of volumes, the first one shaming the extremes MIN,MAX and miπ,max of tuo vector components. FIGURE S: Following an object using its scalεs definεd by CL and/or DISTRIBUTIONS of its CUMULATION POINTS uithin bottom-up and top-down varying anglεs (planεs): If a statistically predictεd rangε (box, angle) is FALSE, thε angle (box, range) is uidened, othεrωise hierarchically diminished. FIGURE 10: Image sequence ωith static and dynamic areas (uhitε and dark arrows). All disolacsments must remain uithin a box being mεasursd and precoded cr even statistically predictεd and confirmed as TRUE, hierarchically di iπisha le accordin to FIG.4, 5 and 5.

Claims: 1. RANGE ADAPTIVE CODING METHOD (RAC) for the range adaptive coding cf LIMITED PARTS cf = SIGNAL, these SIGNAL SEGMENTS (domains, sections, reαions, fields, blccks, parts, samoles) dεfinεd by (subseαuεntly) limited (multidimensional) scacss containing their relative FUNCTION VALUES and/cr thsir relative ADDRESS VALUES, their extrε εs nsing ussd for CODINGS and OΞCCOINGS OF THE RANGES to define thsrεoy (suoseαusn * :) INTERVALS or SOXES for the reconstruction cf ths sεcmenτ.ed signal, the said method coraorising: 1.1. DIRECT PRECODING OF RANGES or thεir CODE LENGTHS CL(i) only, according to tπs dstar ir.sd (mεasured) rangss R(i) and/or thsir HIERARCHICAL COOING (step by steo top-down, bottom-uo nested codings) of predεfined (ir.αlicitely/εxplicitεly prεcodεd) ranges, the raπgεs being defined by thεir minimum and maximum, 1.2. 3ITUIΞE and/cr multi-bituise explicite or implicite CODINGS cf, evεn subsequent, CONFIRMATIONS or NEGATIONS of ranges or its code lengths or by codings of predefined NUMBERS of predεfinεd ranges, - having nou precoded those defined BOXES (ranges) implicitely or explicitεly to 1.3. CODE (evεπ subsequently finer nested) SAMPLES or all values contained in thε box, by knoun mεthcds, εven succεεεivεly orε and morε εxact (coarsεr, thεπ finer), to rεcoπstruct thε signal, εspecially by 1.3.1. hierarchically codε-length-dεfined CODES OF SIGNAL VALUES according to obtainεd diminishsd cods lengths, especially rangε reduced codes of one or more EXTREMES (minimum, maximum), εspecially for INTERPOLATION, 1.3.2. RANGE REDUCED PULSE CODE MODULATION (RRPCM), or CUMULATION ADAPTIVELY SELECTED scales or other sampling methods. - escεcially accomplished by a 1.4. SYNCHRONIZATION cf thε BOXES and/or thεrεby nou CODED SIGNAL PARTS or SEGMENTS to rεconstruct them to the complεtε or samplsd SIGNAL by 1.4.1. ESTIMATING SURFACE DIFFERENCES TO OPTIMIZE ERROR CODES according to thε givεn surfacε information of thε signal segments, to RECONSTRUCT THE COMPLETE SIGNAL by its ueil crdεred πcu ceded signal sεgmεπts according to thε result, especiall b CODING THE DEVIATION of the estimation to the real difference, 1.4.2. COOING BRIDGES between samples of the coded signal segments as offsets (differεπcεs) Between at least tωc codεd points of differεnt sicnal sec-tents, sscscially using an 1.5. ADJUSTING cf tha ccmαletely coded signal or signal parts, as sec επts, ωith 1.5.1. at least ens exact (DELT -/PCM-) codε, especially a minimum cr a maximum: ascaciaiiy in a raπgs adaptiveiy rsducεd cccs length, 1.5.2. a sucsacuεnt SELF ADJUSTING by cαrrsctiαπ of impossible aosciuta values union xcΞsύ thε absolute or the rsducsα " scales cr their cαc ' ε lengths, 1.5.3. a s cεεquεnt SELF ADJUSTING by correcting those imcossibls aosolutε values which εxcεεd the possible extremal values, thε points 1.1, 1.2, 1.3, 1.4, 1.5, being aoplicated separately cr combined, ths method being also aoolisd for multiple components of a signal, εscsciallly VECTORS ωith its componεnts, including DIFFERENCES like DISPLACEMENTS, ωith its code lengths to bε also valid to define run lengths in coordinates (components). 2. RANGE ADAPTIVE COOING METH0O (RAC) for the range adaptive coding of LIMITED PARTS cf a SIGNAL, those SIGNAL SEGMENTS defined by limited spaces containing their relative FUNCTION VALUES and/or their relative AD0RES5 VALUES, their extremes being used for CODINGS and DECGDINGS OF THE RANGES to defiπε thereby INTERVALS cr BOXES for thε reconstruction of thε sε mεnted signal, comprising: - CODINGS and DECGDINGS OF THE RANGES to define subsequent INTERVALS (run lengths, even defined indirectly by CL), BOXES and SUB30XES fcr the reconstruction cf the segmented signal especially by: - SHARINGS OF PREDEFINED RANGES(BOXES) to obtain at least tωo PARTIAL RANGES, to obtain PARTIAL RANGE REDUCTIONS for CODE LENGTH REDUCTIONS cf codes, preceding the (number or group of numbers of the) partial range for its values, ths values especially to be coded ωithin partly formerly reduced cods lengths of the partial ranges (ωithin highεr hiεrarchiεs). 3. Method according to claim 1. cr 2., cc orising : combinations onε ωith εachother, and/cr ωith other coding εthccs, as PCM, DPCM, TRANSFORM CODING and othsr raπgε adaπtive and not range adaptive codings, especially uith subjectively and/cr cacacity dependent subjεctivεiy ccarsεr or finer quantization and/cr sampling of thε ccints cf thε soars, given by addresses and vaiuεs as points cf a ultidimεrsicnal soacs, and/or

Inventors: KEHLER WALDEMAR, KEHLER, WALDEMAR
Applicants: KEHLER WALDEMAR, KEHLER, WALDEMAR
Application year: 1989
Main classification: H04N7
IPC codes: H04N7