[0001] DESCRIPTION OF THE INVENTION:

[0002] The following specification particularly describes the invention and the manner in which it is to be performed:

[0003] Technical field of the invention

[0004] The present invention relates to a system and method for image compression and is particularly related to 100% numerically lossless reconstruction of the digital image.

[0005] Background of the invention

[0006] Digital images, video technology are an essential and inherent part of the present day. Application of digital images, video technology in mobile and hand¬held devices and over internet is immense. Most of the industries such as entertainment industry with animation and live action requirement, defense, broadcasting, medical imaging, surveillance, astronomy, robotics and computer graphics require soaring high on quality and performance with ever demanding needs of lossless image compression technique.

[0007] Existing professional video players provide a way to playback sequence of images or video from a compressed source which is lossy. Playing a sequence of uncompressed hi-resolution image-frames requires large RAM capacity. Commercially available hard-disk speed is not sufficient to transfer enormous amount of image data to the computer. For a 2K (2048x1024) image sequence of 800 frames, one would require 5033164800 Bytes (4.6875 GB) of RAM to playback 33.33 seconds of smooth playback at lossless quality. Hence there is a need of a system that provides lossless compression technique that allows the end user to be able to seamlessly playback video without frame-count limitations and thereby overcoming the constraint on RAM.

[0008] Hence what is needed is a compression/decompression method that provides 100% numerically lossless reconstruction of the image as compared from its uncompressed source and also the decompression system that should be extremely fast so as to read the compressed image data [and decompress] at 24 FPS losslessly.

[0009] Summary of the invention

[0010] The present invention relates to a system and method that provides 100% numerically lossless reconstruction of the image as compared to its uncompressed source. For this purpose, the method in accordance to one or more embodiment of the present invention compresses the pixel (Pc), only if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using any one of the methods (m01 - ml 6).

[0011] In accordance to one or more embodiment of the present invention, the method that compresses the Red-Green-Blue (RGB) data from a digital image comprises the steps of identifying the pixel (Pc) to be compressed, identifying the neighboring pixels (PN) preceding the pixel (Pc) to be compressed wherein the neighboring pixels (PN) are taken within a cycle of four reference neighboring pixels preceding the pixel (Pc) to be compressed. The method further comprises the steps of checking if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB component of the neighboring pixels (PN) by using any one of the methods (mOl - ml6) and compressing the pixel (Pc) only if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB component of the neighboring pixels (PN) else retaining the pixel (Pc) if the RGB component of the pixel (Pc) is not predictable using the RGB component of the neighboring pixels.

[0012] In accordance to one or more embodiment of the present invention, the method of the present invention may be implemented on any personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, an iPod.RTM, a video player, a DVD writer/player, a television and a home entertainment system.

[0013] Brief description of the drawings:

[0014] The foregoing and other features of embodiments will become more apparent from the following detailed description of embodiments when read in conjunction with the accompanying drawings. In the drawings, like reference numerals refer to like elements.

[0015] FIG 1 illustrates the method of identifying the neighboring pixels (PN) preceding the pixel (Pc) to be compressed in accordance to one embodiment of the invention.

[0016] FIG 2 illustrates the method of compressing a digital image in accordance to one embodiment of the invention.

[0017] FIG 2a illustrates the compression method mOl of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0018] FIG 2b illustrates the compression method m02 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0019] FIG 2c illustrates the compression method m03 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0020] FIG 2d illustrates the compression method m04 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.
[0021] FIG 2e illustrates the compression method m05 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0022] FIG 2f illustrates the compression method m06 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0023] FIG 2g illustrates the compression method m07 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0024] FIG 2h illustrates the compression method m08 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0025] FIG 2i illustrates the compression method m09 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0026] FIG 2j illustrates the compression method m10 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0027] FIG 2k illustrates the compression method m11 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0028] FIG 21 illustrates the compression method ml2 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0029] FIG 2m illustrates the compression method ml3 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0030] FIG 2n illustrates the compression method ml4 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0031] FIG 2o illustrates the compression method mis of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0032] FIG 2p illustrates the compression method ml6 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention.

[0033] Detailed description of the invention:

[0034] The present invention overcomes the drawback of prior art by providing a system and method that provides 100% numerically lossless reconstruction of the image as compared from its uncompressed source.

[0035] The term 'Pc' is used herein to represent any pixel to be compressed and the term 'PcRed, PcBlue and PcGreen' is used herein to represent the Red, Green and Blue component of the pixel 'Pc' to be compressed.

[0036] The term 'PN' is used herein to represent the neighboring pixels preceding the pixel (Pc) to be compressed and the neighboring pixels (PN) are taken within a cycle of four reference neighboring pixels ('Pi, P2, P3 and P4') preceding the pixel (Pc) to be compressed.

[0037] The term 'PNRed, PNGreen and PNBiue' is used herein to represent the Red, Green and Blue components of the neighboring pixel 'PN'.

[0038] The term 'Neighbor Map' is used herein to represent the bit wise binary representation of each neighboring pixel 'PN' that is used for predicting the RGB component of the pixel 'Pc' to be compressed. For instance, the bit wise binary representation of ('P1, P2, P3 and P4) is as follows
P1 - 00
P2 - 01
P3 - 10
P4 - 11

[0039] The term 'Pind' is used herein to represent the index values of the neighboring pixels 'PN'. The index value of the neighboring pixels is as follows

[0040] The term 'method map' is used herein to represent the bit wise binary representation of method (m01 - ml 6) denoting how each pixel 'Pc' is related to its neighboring pixel 'PN\ The bit wise binary representation of the methods (m01 -ml6) is as follows:

[0041] The term 'component difference map' is used herein to represent the bit wise binary representation of the difference between the RGB components of the pixel (Pc) to be compressed and the RGB components of the neighboring pixels (PN). The bit wise binary representation of the component difference map is as follows:

[0042] The term 'sign bit map' is used herein to represent the bit wise binary representation of the difference between the comparisons, whether the comparison is positive or negative. If the result of the comparison is positive, the sign bit map is updated to one, else the sign bit map is updated to zero.

[0043] FIG 1 illustrates the method of identifying the neighboring pixels (PN) preceding the pixel (Pc) to be compressed in accordance to one embodiment of the invention. For each pixel (Pc) to be compressed, neighboring pixels (PN) are taken within a cycle of four reference neighboring pixels preceding the pixel (Pc) to be compressed. As shown in Figure 1 for each pixel (Pc) to be compressed, four neighboring pixels (P1, P2, P3 and P4) are identified preceding the pixel (Pc) to be compressed.

[0044] FIG 2 illustrates the compression method configured for compressing a digital image in accordance to one embodiment of the present invention. The compression method for compressing a digital image acquired/stored in the device comprises the steps of identifying the RGB components of the pixel (Pc) to be compressed as PcRed, PcGreen and PcBlue (wherein PcRed is the red component of the pixel (Pc) to be compressed, PcGreen is the green component of the pixel (Pc) to be compressed and PcBiue is the blue component of the pixel (Pc) to be compressed) in step 201, identifying the RGB components of the neighboring pixels (PN) preceding the pixel (Pc) to be compressed as PNRed, PNGreen and PhBlue (as shown in Figure. 1, wherein PNRed is the red component of the neighboring pixel of (Pc) to be compressed, PNGreen is the green component of the neighboring pixel of (Pc) to be compressed and PNBlue is the blue component of the neighboring pixel of (Pc) to be compressed,) in step 202. In step 203, checking if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB component of the neighboring pixels (PN) by using any one of the methods (m0l-ml6) (here the control is transferred to step 203al in Figure. 2a to step 203a75 in Figure. 2p to check if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using any one of the methods (mOl - ml6)) and compressing the pixel (Pc) in step 204 if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels by using any one of the methods (m0l-ml6) else retaining the pixel (Pc) in step 205 if the RGB component of the pixel (Pc) is not predictable by using any one of the methods m01- ml 6.

[0045] FIG 2a illustrates the compression method mOl of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method mOl for compressing a digital image further comprises the steps of checking if PcRed = PNRed and PcGreen = PNGreen and PcBiue = PNBlue and the indices of the neighboring pixels (PN) are equal in step 203a 1 (therefore only two bits is used for identifying the neighboring pixel (PN) for all the RGB components that matches the condition in step 203al) then updating the neighbor map with corresponding neighboring pixel (PN) (binary value of the neighbor pixel (PN) is added to the neighbor map), and updating the method map with method mOl (binary value of method mOl (0000) is added to the method map) in step 203a2, else transferring the control to step 203a3 in Figure. 2b (here the control is transferred to step 203a3 to check if the RGB component of the pixel Pc to be compressed is predictable using method m02).

[0046] FIG 2b illustrates the compression method m02 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method m02 for compressing a digital image further comprises the steps of identifying PAvgRed, PAvgGreen, PAvgBiue, Pind in step 203a3, wherein PAvgRed, PAvgGreen, PAvgBiue are calculated as PAvgRed = average of the red component of the neighboring pixels (PN) and PprevRed (wherein PprevRed is the red component of the previous pixel of PN along the horizontal scan line), PAvgGreen = average of the green component of the neighboring pixels (PN) and PprevGreen (wherein PprevGreen is the green component of the previous pixel of (PN) along the horizontal scan-line), PAvgBiue = average of the blue component of the neighboring pixels (PN) and PprevBiue (wherein PprevBiue is the blue component of the previous pixel of (PN) along the horizontal scan-line) and Pind = index value of the neighboring pixels (PN).

[0047] In Step 203a4 Checking if Pc-Red = PAvgRed + Pind, Pc-Green = PAvgGreen + Pind
and Pc-Biue = PAvgBlue + Pind and the indices of the neighboring pixels (PN) are equal (therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203a4) then updating the sign bit map with one (here the sign bit map is updated with one to denote the sum of the average and index value), updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m02) (binary value of method m02 (0001) is added to the method map) in step 203a5. Else Checking if Pc-Red = PAvgRed - Pind, Pc -Green — PAvgGreen -Pind and Pc-Blue — PAvgBIue-Pind and the indices of the neighboring pixels (PN) are equal in step 203a6 (therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203a6) and if the condition holds true updating the sign bit element with zero, updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method m02 (binary value of method m02 (0001) is added to the method map) in step 203a7, else the control is transferred to step 203a8 in Figure. 2c (here the control is transferred to step 203a8 to check if the RGB component of the pixel Pc to be compressed is predictable using method m03).

[0048] FIG 2c illustrates the compression method m03 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method m03 for compressing a digital image further comprises the steps of checking if PcRed = PNRed + Pind and PcGreen = PNGreen + Pind and PcBiue = PNBlue + Pind and the indices of the neighboring pixels (PN) are equal in step 203a8 (since the indices of the neighboring pixels (PN) are equal, therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203a8), then updating the sign bit map with one (here the sign bit map is updated with one to denote the sura* between the RGB components of the neighboring reference pixel PN and its indelf $ value), updating the neighbor map with the corresponding neighboring pixel (PN) , updating the method map with method 3 (m03) in step 203a9.

[0049] If the condition as discussed in step 203a8 holds false then checking if PcRed = PNRed - Pind and PcGreen = PNGreen - Pind and PcBiue = PNBiue - Pind and the indices of the neighboring pixels (PN) are equal (therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203a 10) in step 203a 10, then updating the sign bit map with zero (here the sign bit map is updated with zero to denote the difference between the RGB components of the neighboring reference pixel PN and its index value), updating the neighbor map with the corresponding neighboring pixel (PN), updating the method map with method (m03) (binary value of method m03 (0010) is added to the method map) in step 203all. If the condition as discussed in step 203al0 holds false the control is transferred to step 203al2 in Figure. 2d (here the control is transferred to step 203al2 to check if the RGB component of the pixel Pc to be compressed is predictable using method m04).

[0050] FIG 2d illustrates the compression method m04 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method (m04) for compressing a digital image further comprises the steps of identifying PAvgRed, PAvgGreen, PAvgBiue in step 203al2 wherein PAvgRed = average of the red component of the neighboring pixels (PN) and PPrevRed (wherein PprevRed is the red component of the previous pixel of PN along the horizontal scan line), PAvgGreen = average of the green component of the neighboring pixels (PN) and PprevGreen (wherein PprevGreen is the green component of the previous pixel of (PN) along the horizontal scan-line), PAvgBiue = average of the blue component of the neighboring pixels (PN) and PPrevBlue (wherein PPrevBlue is the blue component of the previous pixel of (PN) along the horizontal scan-line).

[0051] Calculating PDiffRed, PDiffGreen and PDiffBiue in step 203al3, wherein:
PDiffRed = PNRed - PPrevRed; PDifiGreen = PNGreen - PPrevGreenJ PDiffBiue = PNBlue - PPrevBlue;

[0052] In Step 203al4, Checking if PcRed = PAvgRed + PDiffRed and PcGreen = PAvgGreen
+ PDiffGreen and PcBiue = PAvgBiue + PDiffBiue and the indices of the neighboring pixels (PN) are equal (therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203ai4) and if the condition holds true in step 203al4 updating the sign bit element with one (here the sign bit element is updated with one to denote the sum of the average and difference value), updating the method map with method (m04) (binary value of method m04 (0011) is added to the method map) and updating the neighbor map with the corresponding neighboring pixel (PN) that matches the above condition in step 203al5. Else if the condition holds false in step 203al4, checking if PcRed = PAvgRed - PDiffRed and PcGreen = PAvgGreen - PDiffGreen and PcBIue = PAvgBlue – Pdifffilue and the indices of the neighboring pixels (PN) are equal (therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203al6) in step 203al6 and if the condition holds true in step 203ai6 then updating the sign bit map with zero (here the sign bit element is updated with zero to denote the differences between the Average and difference value), updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m04) (binary value of method m04 (0011) is added to the method map) in step 203al7, else the control is transferred to step 203a 18 in Figure. 2e (here the control is transferred to step 203al8 to check if the RGB component of the pixel Pc to be compressed is predictable using method m05).

[0053] FIG 2e illustrates the compression method m05 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method (m05) for compressing a digital image further comprises the steps of checking if PcRed = PAvgRed + PDiffRed + Pind and
PcGreen = PAvgGreen + PDiffGreen + Pind and PcBIue = PAvgBlue + PDifffilue + Pind and the
indices of the neighboring pixels (PN) are equal (therefore only two bits is used for identifying the neighboring pixel for all the RGB components that matches the condition in step 203ais) and if the condition holds true in step 203ai8, updating the sign bit map with one (here the sign bit element is updated with one to denote the sum of Average, Index Value and the difference value), updating the neighbor map with the corresponding PN and updating the method map with m05 (binary value of method m05 (0100) is added to the method map) in step 203ai9.

[0054] Else if the condition holds false in step 203ai8, checking if PcRed = PAvgRed
- PDiffRed -Pind and PcGreen = PAvgGreen - PDiffGreen - Pind and PcBIue = PAvgBlue – Pdifffilue - Pind and the indices of the neighboring pixels PN are equal (therefore only two bits is used for identifying the neighbor pixel for all the RGB components that matches the condition in step 203a2o) in step 203a2o and updating the sign bit map with zero (here the sign bit element is updated with zero to denote the difference between the Average, Index Value and the difference value), updating the neighbor map with the corresponding neighboring pixel PN and updating the method map with method 5 (m05) (binary value of method m05 (0100) is added to the method map) in step 203a21. Else if the condition holds false in step 203a20, the control is transferred to step 203a22 in Figure 2f (here the control is transferred to step 203a22 to check if the RGB component of the pixel Pc to be compressed is predictable using method m06).

[0055] FIG 2f illustrates the compression method m06 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method m06 for compressing a digital image further comprises the steps of calculating DNRed, DNGreen and DNBiue in step 203a22, wherein: DNRed = PcRed - PlMRed; DNGreen = PcGreen — PNGreen; DNBiue = PcBlue - PNBlue;

[0056] In step 203a23, checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between 1 and 8 and if the condition in step 203a23 holds true then updating the sign bit map with one (here the sign bit map is updated with one to denote the difference as positive), updating the component difference map with DNRed, updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m06) (binary value of method m06 (0101) is added to the method map) in step 203a24.

[0057] Else if the condition holds false in step 203a23, checking if DNRed = DNGreen and DNRed = DNBlue and the value of DNRed lies between -1 and -8 in step 230 and if the condition holds true in step 203a25, updating the sign bit map with zero (here the sign bit element is updated with one to denote the difference as negative), updating the component difference map with DNRed, updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m06) (binary value of method m06 (0101) is added to the method map) in step 203a26. Else if the condition holds false in step 203a25, the control is transferred to the step 203a27 in Figure. 2g (here the control is transferred to step 203a27 to check if the RGB component of the pixel Pc to be compressed is predictable using method m07).

[0058] FIG 2g illustrates the compression method m07 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method m07 for compressing a digital image further comprises the steps of calculating DNRed, DNGreen and DNBiue in step 203a27, wherein: DNRed = PcRed - PAvgRed + Pind; DNGreen = PcGreen — PAvgGreen+ Pind; DNBiue = PcBlue - PAvgBlue + Pind;

[0059] In step 203a28, checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between 1 and 8 and if the condition in step 203a28 holds true then updating the sign bit map with one (here the sign bit map is updated with one to denote the difference as positive), updating the component difference map with DNRed, updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m07), binary value of method m07 (0110) is added to the method map) in step 203a29.

[0060] Else if the condition holds false in step 203a28, checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between -1 and -8 in step 203a30 and if the condition holds true in step 203a30, updating the sign bit element with zero (here the sign bit element is updated with zero to denote the difference as negative), updating the component difference map with DNRed , updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m07) in step 203a31. Else if the condition holds false in step 203a30, then the control is transferred to the step 203a32 in Figure. 2h (here the control is transferred to step 203a32 to check if the RGB component of the pixel Pc to be compressed is predictable using method m08).

[0061] FIG 2h illustrates the compression method m08 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method m08 for compressing a digital image further comprises the steps of identifying PPrevRed, PPrevGreen and PPrevBIue in step 203a32, wherein: PprevRed = red component of the previous pixel of PN along the horizontal scan line; PprevBiue = blue component of the previous pixel of PN along the horizontal scan line; PprevGreen = green component of the previous pixel of PN along the horizontal scan line;

[0062] In step 203a33, checking if PcRed = PprevRed + Pind and PCG reen — PPrevGreen + Pind and PcBiue = PprevBiue + Pind and the indices of the neighboring pixels (PN) may not be equal (therefore 2 Bits for identifying each component of the neighbor pixel for each RG&B components which matches the condition in step 203a33), then updating the sign bit map with one (here the sign bit map is updated with one to denote the difference as positive), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method m08 (binary value of method m08 (0111) is added to the method map) in step 203a34.

[0063] Else if the condition holds false in step 203a33, checking if PcRed = PPrevRed - Pind and PCGreen = PPrevGreen - Pind and PcBiue = PprevBiue - Pind and the indices of the neighboring pixels PN may not be equal in step 203a35 (therefore 2 bits for identifying each component of the neighbor pixel for each RG&B components which matches the condition in step 203a35) and then updating the sign bit map with zero (here the sign bit map is updated with one to denote the difference as positive), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) (that holds true for the condition in step 203a35) and updating the method map with method m08 (binary value of method m08 (0111) is added to the method map) in step 203a36.

[0064] Else if the condition holds false in step 203a35, the control is transferred to the step 203a37 in Figure. 2i (here the control is transferred to step 203a37 to check if the RGB component of the pixel Pc to be compressed is predictable using method m09).

[0065] FIG 2i illustrates the compression method m09 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method (m09) for compressing a digital image further comprises the steps of checking if PcRed = PprevRed + Pind + PDifmed and PcGreen = PPrevGreen + Pind+ PDiffGreen and PCBlue = PPrevBlue + Pind+ PDiffBlue and the indices of the neighboring pixels PN may not be equal in step 203a37 (therefore 2 Bits for identifying each component of the neighbor pixel for each RG&B components which matches the condition in step 203a37) then updating the sign bit element with one (here the sign bit map is updated with one to denote the sum between Previous Pixel of the current pixel and the Index value and the sum of difference), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method m09 (binary value of method m09 (1000) is added to the method map) in step 203a38. Else Checking if PcRed = PPrevRed - Pind - PDiffRed and PcGreen = PPrevGreen - Pind - PDiffGreen and PcBiue = PprevBiue - Pind - PDiffBlue and the indices of neighboring pixels identifying each Red, Green and Blue component may not be equal in step 203a39 and updating the sign bit map with zero (here the sign bit map is updated with zero to denote the difference between Previous Pixel of the current pixel and the Index value and the sum of difference), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method m09 (binary value of method m09 (1000) is added to the method map) in step 203a40. Else if the condition holds false in step 203a39, the control is transferred to the step 203a41 in Figure. 2j (here the control is transferred to step 203a41 to check if the RGB component of the pixel Pc to be compressed is predictable using method mlO).

[0066] FIG 2j illustrates the compression method mlO of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method mlO for compressing a digital image further comprises the steps of checking if PcRed = PNRed + Pind and PcGreen = PNGreen + Pind and PcBiue = PNBiue + Pind and the indices of the neighboring pixels (PN) may not be equal in step 203a41 (therefore 2 Bits for identifying each component of the neighbor pixel for each RG&B components which matches the
condition in step 203a41) then updating the sign bit map with one (here the sign bit element is updated with one to denote the sum between neighboring Pixel and the Index value), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN), updating the method map with method mlO (binary value of method mio (1001) is added to the method map) in step 203a42. Else if the condition in step 203a41 holds false, checking if PcRed = PNRed - Pind and PcGreen = PNGreen - Pind and PcBiue = PNBiue - Pind and the indices of the neighboring pixels may not be equal in step 203a43 (therefore 2 Bits for identifying each component of the neighbor pixel for each RG&B components which matches the condition in step 203a43) then updating the sign bit element with zero (here the sign bit element is updated with zero to denote the sum between neighboring Pixel and the Index value), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method mlO (binary value of method mio (1001) is added to the method map) in step 203a44. If the condition holds false in step 203a43, the control is transferred to the step 203a45 in Figure. 2k (here the control is transferred to step 203a45 to check if the RGB component of the pixel Pc to be compressed is predictable using method mil).

[0067] FIG 2k illustrates the compression method mil of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method (mil) for compressing a digital image further comprises the steps of identifying PNPrevRed, PNPrevGreen and PNPrevBiue in step 203a45 wherein: PNPrevRed = P (NRed - Pind); PNPrevGreen = P (NG reen - Pind); PNPrevBiue = P (NBIue - Pind);

[0068] In Step 203a46, Checking if PcRed = PNPrevRed + Pind and PcGreen = PNPrevGreen
+ Pind and PcBiue = PNPrevBiue + Pind and the indices of the neighboring pixels (PN) may not be equal (therefore 2 Bits for identifying each component of the neighbor pixel for each RG&B components which matches the condition in step 203a46) then updating the sign bit map with one (here the sign bit map is updated with one to denote the sum between the previous pixels of the neighboring Pixel and the index value), updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method mil (binary value of method mil (1010) is added to the method map) in step 203a47. If the condition in step 203a46 holds false then further checking if PcRed = PNPrevRed - Pind and PcGreen = PNPrevGreen - Pind and PCBlue = PNPrevBlue - Pind and the indices of the neighboring pixels (PN) may not be equal (therefore 2 Bits for identifying each component of the neighbor pixel for each RG&B components which matches the condition in step 203a48)in step 203a48 and then updating the sign bit element with zero updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method mil in step 203a49. Else transferring the control to step 203a50 in Figure. 21, (here the control is transferred to step 203a50 to check if the RGB component of the pixel Pc to be compressed is predictable using method ml 2).

[0069] FIG 21 illustrates the compression method ml2 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method ml2 for compressing a digital image further comprises the steps of identifying Pcprevred, Pcprevgreen, PcPrevbiue in step 203a50 wherein: PcPrevred = red component of the previous pixel of Pc; PcPrevgreen = green component of the previous pixel of Pc; PcPrevbiue = blue component of the previous pixel of Pc;

[0070] In Step 203a51, Calculating DcPrevDifmed, DcPrevDiffBiue and DcPrevDiffGreen,
Wherein DcPrevDiffRed = PcRed - PcPrevred; DcPrevDifffllue = PcBlue - PcPrevbiue; DcPrevDiffGreen = PcGreen- PcPrevGreen;

[0071] Checking if DcPrevDiffRed, DcPrevDiffBiue and DcPrevDiffGreen lies between 1 and 8 in step 203a52 and updating the sign bit map to one (here the sign bit map is updated with one to denote the differences in step 256 is positive), updating the Component difference map With DcPrevDiffRed, DcPrevDiffBiue and DcPrevDiffGreen, updating the method map with method ml2 (binary value of method ml2 (1011) is added to the method map) in step 203a53. If the condition in step 203a52 holds false then checking if DcPrevDiffRed, DcPrevDiffBiue and DcprevDiffGreen lies between -1 and -8 in step 203a54 and then updating the updating the sign bit element to zero, updating the component difference map with DcPrevDiffRed, DcprevDifraiue and DcPrevDiffGreen, updating the method map with method ml2 (binary value of method ml2 (1011) is added to the method map) in step 203a55 if the condition in step 203a54 holds true else the control is transferred to step 203a56 in Figure. 2m (here the control is transferred to step 203a56 to check if the RGB component of the pixel Pc to be compressed is predictable using method ml3).

[0072] FIG 2m illustrates the compression method ml3 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method ml3 for compressing a digital image further comprises the steps of calculating DDiffRed, DDiffGreen and DDiffBiue in step 203a56, wherein: DDifiRed = PcRed - PNRed + Pind; DDiffBiue = PcBlue - PNBlue + Pind; DDiffGreen = PcGreen - PNGreen + Pind;

[0073] Checking if DDifmed and DDiffBiue and DDiffGreen lies between 1 and 8 in step 203a57 and then updating the sign bit map with one (here the sign bit map is updated with one to denote the difference in step 203a57 as positive), updating the component difference map with DDiffRed, DDiffBiue and DDiffGreen and updating the method map with the corresponding method ml3 (binary value of method ml3 (1100) is added to the method map) in step 203a58. If the condition in step 203a57 holds false then further checking if DDiffRed and DDiffBiue and DDiffGreen lies between -1 and -8 in step 203a59 and then updating the the sign bit element with zero (here the sign bit map is updated with zero to denote the difference in step 203a59 as negative), updating the component difference map with DDiffRed, DDiffBiue and DDiffGreen and updating the method map with the corresponding method ml 3 (binary value of method ml3 (1100) is added to the method map) in step 203a60, else transferring the control to step 203a61 in Figure. 2n (here the control is transferred to step 203a61 to check if the RGB component of the pixel Pc to be compressed is predictable using method ml4).

[0074] FIG 2n illustrates the compression method m 14 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method ml4 for compressing a digital image further comprises the steps of calculating DAvgDiffRed, DAvgDiffGreen and DAvgDiffBlue in step 203a61, wherein:
DAvgDiffRed = PcRed - PAvgRed; DAvgDiffGreen = PcGreen - PAvgGreen; DAvgDiffBlue = PcBlue - PAvgBlue;

[0075] In step 203a62, checking if DAvgDiffRed and DAvgDiffGreen and DAvgDiffBlue lies between 1 and 8, then updating sign bit map with one (here the sign bit map is updated with one to denote the difference as positive), updating the component difference map with DAvgDiffRed, DAvgDiffGreen and DAvgDiffBlue, updating the neighbor map with the corresponding PN, updating the method map with ml4 (binary value of method ml4 (1101) is added to the method map) in step 203a63. If the condition in step 203a62 holds false then checking if DAvgDiffRed and DA vgDiffGreen and DAvgDiffBlue lies between -1 and -8 in step 203a64 and updating sign bit map with zero (here the sign bit map is updated with zero to denote the difference as negative), updating the component difference map with DAvgDiffRed, DAvgDiffGreen and DAvgDiffBlue, updating the neighbor map with the corresponding PN, updating the method map with ml4 (binary value of method ml4 (1101) is added to the method map) in step 203a65. Else transferring the control to step 203a66 in Figure. 2o (here the control is transferred to step 203a66 to check if the RGB component of the pixel Pc to be compressed is predictable using method ml 5).

[0076] FIG 2o illustrates the compression method ml5 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method ml5 for compressing a digital image further comprises the steps of calculating DNDiffRed, DNDiffGreen and DNDiffBiue in step 203a66, wherein: DNDiffRed = PcRed - PNRed; DNDiffGreen = PcGreen - PNGreen: DNDiffBlue = PcBlue - PNBIue;

[0077] In step 203a67, checking if DNDifmed and DNDiffGreen and DNDiffBlue lies between 1 and 8 and then updating the sign bit map with one (here the sign bit map is updated with one to denote the difference as positive), updating the component difference map with DNDifmed and DNDiffGreen and DNDiffBlue, updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN), updating the method map with method ml5 (binary value of method ml5 (1110) is added to the method map) in step 203a68. If the condition holds false in step 203a67, checking if DNDiffRed and DNDiffGreen and DNDiffBlue lies between -1 and -8 in step 203a69 then updating the sign bit element with zero (here the sigh bit map is updated with zero to denote the difference as positive), updating the component difference map with DNDiffRed and DNDiffGreen and DNDiffBlue, updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN), updating the method map with method ml5 (binary value of method ml5 (1110) is added to the method map) in step 203a70. Else transferring the control to step 203a71 in Figure. 2p (here the control is transferred to step 203a71 to check if the RGB component of the pixel Pc to be compressed is predictable using method ml6).

[0078] FIG 2p illustrates the compression method ml6 of the present invention in detail for compressing the digital image in accordance to one embodiment of the present invention. The compression method ml6 for compressing a digital image further comprises the steps of calculating DNDifmed, DNDiffGreen and DNDiffBlue in step 203a71 as: DNDiffRed = PcRed - PNRed + Pind; DNDiffGreen = PcGreen - PNGreen + Pind; DNDiffBlue = PcBlue - PNBIue + Pind;

[0079] Checking if DNDiffRed and DNDiffGreen and DNDiffBlue lies between 1 and 8 in step 203a72 and updating the sign bit map with one (here the sign bit map is updated with one to denote the difference as positive), updating the component difference map with DNDiffRed, DNDiffGreen and DNDiffBlue, updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN) and updating the method map with method ml6 (binary value of method ml6 (1111) is added to the method map) in step 203a73, if the condition in step 203a72 holds true. Else checking if DNDifmed and DNDiffGreen and DNDimiue lies between -1 and -8 in step 203a74 and updating the sign bit element with zero (here the sign bit map is updated with one to denote the difference as negative), updating the component difference map with DNDiffRed, DNDiffGreen and DNDifraiue, updating the neighbor map with each Red, Green and Blue component of the neighboring pixel (PN), updating the method map with ml6 (binary value of method ml6 (1111) is added to the method map) in step 203a75. If the condition in step 203a74 also holds false, then the pixel (Pc) is retained as shown in step 205 in Figure 2. Else if the RGB component of the pixel (Pc) to be compressed is predictable using any of the above method (m01 - ml6), the pixel (Pc) is compressed as shown in step 204 in Figure. 2.

[0080] In accordance to one embodiment of the invention, the method also comprises the steps of tracking the method id (if method mOl is used for predicting Pc, then the method id is 01) of Pc and comparing it with the method id of the previous pixel of Pc and updating the previous method map to one, if the method id of Pc and the previous pixel of Pc are same else the previous method map is updated to zero. For instance, if method id used for predicting Pc and previous pixel of Pc is m05 then the previous method map is updated to one (which requires only one bit), instead of updating the compression method map which requires four bits.

[0081] Thus the system and method of the present invention overcomes the drawback of prior art by providing 100% numerically lossless reconstruction of the image as compared from its uncompressed source. Also the system and method of the present invention may be implemented in any of the industries such as entertainment industry with animation and live action requirement, defense, broadcasting, medical imaging, surveillance, astronomy, robotics and computer graphics to allow the end users to seamlessly playback video/ hi-resolution image-frames without frame-count limitations.

[0082] The present invention has been described in terms of specific embodiments incorporating details to facilitate the understanding of principles of construction and operation of the invention. Such reference herein to specific embodiments and details thereof is not intended to limit the scope of the claims append hereto. It will be readily apparent to one skilled in the art that other various modifications may be made in the embodiment chosen for illustration without departing from the spirit and scope of the invention as defined by the claims.

[
0083] Claims:

[0084] I claim:

1. A method that compresses the raw Red-Green-Blue (RGB) data from a digital image comprises the steps of:

a) identifying the pixel (Pc) to be compressed;

b) identifying the neighboring pixels (PN) preceding the pixel (Pc) to be compressed;

c) checking if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB component of the neighboring pixels (PN);

d) compressing the pixel (Pc) if the RGB component of the pixel (Pc) to be compressed is predictable using the RGB component of the neighboring pixels (PN), else - retaining the pixel (Pc) if the RGB component of the pixel (Pc) to be compressed is not predictable using the RGB component of the neighboring pixels (PN).

2. The method as claimed in claim 1, wherein the method provides lossless reconstruction of the image when applied to a digital image.

3. The method as claimed in claim 1, wherein the RGB component of the pixel (Pc) to be compressed is predictable using the RGB component of the neighboring pixels (PN) by using any one of the methods (mOl - ml6).

4. The method as claimed in claim 1, wherein the method for predicting the RGB component of the pixel (Pc) to be compressed by using any one of the methods (m01-ml6) further comprises the steps of:

a) identifying the RGB components of the pixel (Pc) to be compressed as PcRed, PcGreen and PcBlue wherein: PcRed = red component of the pixel (Pc) to be compressed, PcGreen = green component of the pixel (Pc) to be compressed, PcBlue = blue component of the pixel (Pc) to be compressed;

b) identifying the RGB components of the neighboring pixels (PN) to be compressed as PNRed, PNGreen and PNBiue wherein: PNRed = red component of the neighboring pixel of (Pc) to be compressed, PNGreen = green component of the neighboring pixel of (Pc) to be compressed, PNBiue = blue component of the neighboring pixel of (Pc) to be compressed;

c) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using the method mOl, wherein the method mOl further comprises the steps of: - Checking if PcRed = PNRed and PcGreen = PNGreen and PcBlue = PNBiue and the indices of the neighboring pixels (PN) are equal, then

- updating the neighbor map with corresponding neighboring pixel (PN);

- updating the method map with the corresponding method (mOl), else

d) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m02, wherein the method m02 further comprises the steps of: identifying PAvgRed, PAvgGreen, PAvgBiue, Pind wherein: PAvgRed = average of the red component of the neighboring pixels (PN) and PprevRed, wherein PprevRed is the red component of the previous pixel of (PN) along the horizontal scan line, PAvgGreen = average of the green component of the neighboring pixels (PN) and PPrevGreen, wherein PprevGreen is the green component of the previous pixel of (PN) along the horizontal scanline, PAvgBlue = average of the blue component of the neighboring pixels (PN) and PprevBiue, wherein PprevBlue is the blue component of the previous pixel of (PN) along the horizontal scanline, Pind = index value of the neighboring pixels (PN); - Checking if PcRed = PAvgRed + Pind, PcGreen = PAvgGreen + Pind and PcBiue = PAvgBiue + Pind and the indices of the neighboring pixels (PN) are equal; then

- updating the sign bit map with one;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m02), else

- Checking if PcRed = PAvgRed - Pind, Pc-Green = PAvgGreen -Pind and Pc-Blue = PAvgBiue - Pind and the indices of the neighboring pixels (PN) are equal; then

- updating the sign bit map with zero;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m02); else

e) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m03, wherein the method m03 further comprises the steps of: Checking if PcRed = PNRed + Pind and PcGreen = PNGreen + Pind and PcBiue = PNBiue + Pind and the indices of the neighboring pixels (PN) are equal, then

- updating the sign bit map with one;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (mo3), else

- Checking if PcRed = PNRed -Pind and PcGreen = PNGreen

- Pind and PcBiue = PNBiue - Pind and the indices of the neighboring pixels (PN) are equal; then

- updating the sign bit map with zero;

- updating the method map with method (m03) and updating the neighbor map with the corresponding neighboring pixel (PN), else

f) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m04, wherein the method m04 further comprises the steps of: identifying PAvgRed, PAvgGreen, PAvgBlue; calculating PDiffRed, PDiffGreen and PDiflBiue, wherein: PDiffRed = PNRed - PprevRed, PDiffGreen = PNGreen — PprevGreen, PDiffBlue = PNBiue - PPrevBlue; Checking if PcRed = PAvgRed + PDiffRed and PcGreen = PAvgGreen + PDiffGreen and PcBiue = PAvgBlue + PDiflBiue and the indices of the neighboring pixels (PN) are equal; then

- updating the sign bit map with one;

- updating the method map with method (m04) and updating the neighbor map with the corresponding neighboring pixel (PN), else

- Checking if PcRed = PAvgRed - PDiffRed and PcGreen = PAvgGreen - PDiffGreen and PcBiue = PAvgBlue - PDiffBlue and the indices of the neighboring pixels (PN) are equal; then

- updating the sign bit map with zero;

- updating the method map with method (m04) and updating the neighbor map with the corresponding neighboring pixel (PN);

g) else checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m05, wherein the method m05 further comprises the steps of:

- Checking if PcRed = PAvgRed + PDi ffRed + Pind and PcGreen — PAvgGreen + PDiffGreen + Pind and PcBlue = PAvgBlue + PDiffBlue + Pind and the indices of the neighboring pixels (PN) are equal; then

- updating the sign bit map with one;

- updating the method map with method (m05);

- updating the neighbor map with the corresponding neighboring pixel (PN), else

- Checking if PcRed = PAvgRed - PDifTRed - Pind and PcGreen = PAvgGreen - PDiffGreen - Pind and PcBlue = PAvgBlue - PDiffBlue - Pind and the indices of neighboring pixels (PN) are equal, then

- updating the sign bit map with zero;

- updating the method map with method (m05) and updating the neighbor map with the corresponding neighboring pixel (PN);

h) else checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m06, wherein the method m06 further comprises the steps of: calculating DNRed, DNGreen and DNBiue, wherein:
DNRed = PcRed - PNRed, DNGreen = PcGreen — PNGreen, DNBiue = PcBlue - PNBlue; -checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between 1 and 8; then

- updating the sign bit map with one;

- updating the component difference map with DNRed;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m06), else

- checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between -1 and -8; then

- updating the sign bit map with zero;

- updating the component difference map with DNRed;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m06), else

i) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m07, wherein the method m0 comprises the steps of: Calculating DNRed, DNGreen and DNBiue wherein. DNRed = PcRed - PAvgRed + Pind, DNGreen = PcGreen - PAvgGreen+ Pind, DNBiue = PcBlue- PAvgBlue + Pind;

- checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between 1 and 8;

- updating the sign bit map with one;

- updating the component difference map with DNRed;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m07); or else

- checking if DNRed = DNGreen and DNRed = DNBiue and the value of DNRed lies between -1 and -8;

- updating the sign bit map with zero;

- updating the component difference map with DNRed;

- updating the neighbor map with the corresponding neighboring pixel (PN) and updating the method map with method (m07), else

j) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m08, wherein the method m08 further comprises the steps of: identifying PPrevRed, PPrevGreen and PPrevBlue wherein: PprevRed = red component of the previous pixel of PN along the horizontal scanline,
PprevGreen = green component of the previous pixel of PN along the horizontal scanline,
PprevBiue = blue component of the previous pixel of PN along the horizontal scanline; Checking if PcRed = PPrevRed + Pind and PcGreen = PprevGreen + Pind and PcBiue = PprevBiue + Pind and the indices of the neighboring pixels (PN) are not equal; then

- updating the sign bit map with one;
- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m08, else

- Checking if PcRed = PPrevRed - Pind and PcGreen = PprevGreen

- Pind and PcBiue = PprevBiue - Pind and the indices of the neighboring pixels (PN) are not equal;

- updating the sign bit map with zero;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m08, else

k) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method m09, wherein the method m09 further comprises the steps of: Checking if PcRed = PPrevRed + Pind + PDiffRed and PcGreen = PprevGreen + Pind+ PDiffGreen and PcBiue = PprevBiue + Pind+ PDiffBlue and the indices of the neighboring pixels (PN) are not equal then;

- updating the sign bit map with one;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m09;or else

- Checking if PcRed = PprevRed - Pind - PDiffRed and PcGreen = PPrevGreen - Pind - PDiflGreen and PcBlue = PPrevBlue - Pind - PDiftBiue and the indices of the neighboring pixels (PN) are not equal then;

- updating the sign bit map with zero;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m09; else

1) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method mio, wherein the method mlO further comprises the steps of:

- Checking if PcRed = PNRed +Pind and PcGreen = PNGreen + Pind and
PcBlue = PNBiue + Pind and the indices of the neighboring pixels (PN) are not equal then;

- updating the sign bit map with one;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red,
Green and Blue component;
- updating the method map with method mlO, or else

- Checking if PcRed = PNRed - Pind and PcGreen = PNGreen – Pind and PcBlue = PNBiue - Pind and the indices of the neighboring pixels (PN) are not equal then;

- updating the sign bit map with zero;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m 10, else

m) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method mil, wherein the method mn further comprises the steps of identifying PNPrevRed, PNPrevGreen and PNPrevBiue wherein:
PNPrevRed = P(NRed - Pind), PNPrevGreen = P(NG reen - Pind), PNPrevBiue = P(NBlue - Pind); Checking if PcRed = PNPrevRed + Pind and PcGreen = PNPrevGreen + Pind and PcBiue = PNPrevBiue + Pind and the indices of the neighboring pixels (PN) are not equal then;

- updating the sign bit map with one;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method mil, else

- Checking if PcRed = PNPrevRed - Pind and PCGreen = PNPrevGreen - Pind and PcBiue = PNPrevBiue - Pind and the indices of the neighboring pixels (PN) are not equal then;

- updating the sign bit map with zero;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method mil; else

n) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method ml2, wherein the method ml2 further comprises the steps of:

- identifying PcPrewed, Pcprevgreen, PcPrevbiue, wherein: PcPrevred = red component of the previous pixel of Pc, PcPrevgreen = green component of the previous pixel of Pc, PcPrevbiue = blue component of the previous pixel of Pc; Calculating DcPrevDiffRed, DcPrevDiffBlue and DcPrevDifTGreen wherein: DcPrevDiffRed = PcRed - PcPrevred, DcPrevDiffBlue = PcBlue - PcPrevblue, DcPrevDiffGreen = PcGreen- PcPrevGreen; Checking if DcPrevDiffRed, DcPrevDiffBlue and DcPrevDiffGreen lies between 1 and 8; then

- updating the sign bit map with one;

- updating the component difference map with DcPrevDiffRed, DcPrevDiffBlue and DcPrevDiffGreen;

- updating the method map with method ml2, or else
- Checking if DcPrevDiffRed, DcPrevDiffBlue and DcPrevDiffGreen lies between -1 and -8 then

- updating the sign bit map with zero;

- updating the component difference map with DCPrevDifiRed, DcPrevDiffBlue and DcPrevDiffGreen;

- updating the method map with method m 12, else

o) Checking if the RGB components of the pixel (Pc) to be compressed are predictable using the RGB components of the neighboring pixels (PN) by using method mn, wherein the method mi3 further comprises the steps of:

- calculating DDiffRed, DDifiGreen and DDiffBiue, wherein: DDiffRed = PcRed - PNRed + Pind, DDiffBiue = PcBlue - PNBlue + Pind, DDifiGreen = PcGreen - PNGreen + Pind;

- checking if DDiffRed, DDiffBiue and DDifiGreen lies between 1 and 8;

- updating the sign bit map with one;

- updating the component difference map with DDiffRed, DDiffBiue and DDiffGreen;

- updating the neighbor map with the corresponding neighbor pixel (PN);

- updating the method map with the corresponding method ml3, else

- checking if DDiffRed, DDiffBlue and DDiffGreen lies between -1 and -8;

- updating the sign bit element with zero;

- updating the component difference map with DDitmed, DDiffBIue and DDiffOreen;

- updating the neighbor map with the corresponding neighbor pixel (PN);

- updating the method map with the corresponding method ml3, else

p) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method ml4, wherein the method ml4 further comprises the steps of: calculating DAvgDiffRed, DAvgDiffGreen and DAvgDiffBiue, wherein: DAvgDiffRed = PcRed - PAvgRed, DAvgD iffGreen = PcGreen — PAvgGreen, DAvgDiffBiue = PcBlue - PAvgBlue;

- checking if DAvgDiffRed and DAvgDiffGreen and DAvgDiffBiue lies between 1 and 8;

- updating the sign bit map with one;

- updating the component difference map with DAvgDiffRed, DAvgDiffGreen and DAvgDiffBiue;

- updating the neighbor map with the corresponding neighboring pixel (PN);

- updating the method map with method ml4, else

- checking if DAvgDiffRed and DAvgDiffGreen and DAvgDiffBiue lies between -1 and -8;

- updating the sign bit element with zero;

- updating the component difference map with DAvgDiffRed, DAvgDiffGreen and DAvgDiffBiue;

- updating the neighbor map with corresponding neighboring pixel (PN);

- updating the method map with method m 14, else

q) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method mi5, wherein the method mis further comprises the steps of: calculating DNDiffRed, DNDiffGreen and DNDiffBiue, wherein:
DNDiffRed = PcRed - PNRed, DNDiffGreen = PcGreen - PNGreen, DNDiffBiue = PcBlue - PNBlue;

- checking if DNDiffRed and DNDiffGreen and DNDiffBiue lies between 1 and 8;

- updating the sign bit map with one;

- updating the component difference map with DNDifme and DNDiffGreen and DNDiffBiue;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m 15; or else

- checking if DNDiffRed and DNDiffGreen and DNDiffBiue lies between-1 and-8;

- updating the sign bit map with zero;

- updating the component difference map with DNDiffRed and DNDiffGreen and DNDiffBiue;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method m 15, else

r) checking if the RGB components of the pixel (Pc) to be compressed is predictable using the RGB components of the neighboring pixels (PN) by using method ml6, wherein the method ml6 further comprises the steps of: Calculating DNDiffRed, DNDiffGreen and DNDiffBiue as: DNDiffRed = PcRed - PNRed + Pind, DNDi ffGreen = PcGreen - PNGreen + Pind, DNDiffBiue = PcBlue - PNBlue + Pind;

- checking if DNDiffRed and DNDI ffGreen and DNDiffBiue lies between 1 and 8;

- updating the sign bit map with one;

- updating the component difference map with DNDiffRed, DNDiffGreen and DNDiffBiue",
- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method (m 16), else

- checking if DNDiffRed and DNDiffGreen and DNDiffBiue lies between-1 and-8;

- updating the sign bit element with zero;

- updating the component difference map with DNDiffRed, DNDiffGreen and DNDiffBiue;

- updating the neighbor map with the corresponding neighboring pixel (PN) for each Red, Green and Blue component;

- updating the method map with method (m 16).

5. The method as claimed in claim 4, wherein the method further comprises the steps of updating the compression map with one, if the RGB component of the pixel (Pc) to be compressed is predictable using any one of the methods (m01-mi6), else updating the compression map with zero.

6. The method as claimed in claim 4, wherein the neighboring pixels (PN) are taken within a cycle of four reference neighboring pixels preceding the pixel (Pc) to be compressed.

7. The method as claimed in claim 4, wherein the neighbor map is the bit wise binary representation of each neighboring pixel 'PN' that is used for predicting the RGB component of the pixel 'Pc' to be compressed.

8. The method as claimed in claim 4, wherein the method map is the bit wise binary representation of method (m01 - ml6) denoting how each pixel Pc to be compressed is related to its neighboring pixel 'PN9.

The method as claimed in claim 4, wherein the sign bit map is the bit wise binary representation of the difference between the comparisons used in method (moi-m 16).

10. The device as claimed in claim 4, wherein the component difference map is the bit wise binary representation of the difference between the RGB components of the pixel (Pc) to be compressed and the RGB components of the neighboring pixels (PN).

11. The method as claimed in claim 1, wherein the method is implemented in a personal computer, a laptop computer, a computer workstation, a server, a mainframe computer, a handheld computer, a personal digital assistant, a cellular/mobile telephone, a smart appliance, a gaming console, a digital camera, a digital camcorder, a camera phone, a iPod.RTM, a video player, a DVD writer/player, a television or a home entertainment system.