US20030012443A1 - Method and apparatus for encoding and decoding images - Google Patents
Method and apparatus for encoding and decoding images Download PDFInfo
- Publication number
- US20030012443A1 US20030012443A1 US10/160,628 US16062802A US2003012443A1 US 20030012443 A1 US20030012443 A1 US 20030012443A1 US 16062802 A US16062802 A US 16062802A US 2003012443 A1 US2003012443 A1 US 2003012443A1
- Authority
- US
- United States
- Prior art keywords
- transform
- decoding
- inverse
- block
- encoded
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
- G06T9/005—Statistical coding, e.g. Huffman, run length coding
Abstract
Description
- This application claims priority from U.S. Provisional Patent Application No. 60/020,776, filed Jun. 28, 1996, and said Provisional Patent Application is incorporated herein by reference.
- This invention relates to compression of image-representative signals and, more particularly, to a method and apparatus for encoding and decoding image-representative signals.
- Image-representative signals (e.g. video signals) can be digitized, encoded, and subsequently decoded in a manner which substantially reduces the number of bits necessary to represent a decoded reconstructed image without undue or noticeable degradation in the reconstructed image. Coding methods that use transforms, for example discrete cosine transform (“DCT”) or wavelet transforms, are well known and in widespread use. Video compression standards such as JPEG, MPEG-1 MPEG-2, H.261 and H.262 typically employ DCT-based techniques.
- Techniques employing vector transform (VT) coding (see, for example, U.S. Pat. No. 5,436,985) can provide substantial improvements in coding efficiency over DCT-based methods used in the above referenced standards. In VT coding, an image (e.g. a video frame, a segmented video frame, or a motion compensated difference frame) is sub-sampled into multiple small images. Each small image is converted into a different format by using a transform such as the discrete cosine transform or a wavelet transform. The corresponding transform coefficients from the small images are grouped together to form vectors. Vector quantization is used to quantize and code those vectors.
- Although techniques such as VT coding are advantageous, service providers can be faced with the problem of needing to retain hardware for encoding DCT-based and wavelet-based signals to serve those users who only have decoder equipment for such signals, while also investing in equipment that can encode the signals of more advanced techniques such as VT coding in order to serve those users who have the more advanced decoder equipment. The problem is analogous from a user standpoint, where a user having only DCT-based and/or wavelet based decoder hardware will be limited in capability of decoding signals encoded with more advanced techniques such as VT coding, whereas purchasers of VT decoding equipment will also want to be able to decode the signals encoded with DCT-based and wavelet-based encoders that will remain in use, but without having to purchase additional equipment for doing so.
- It is among the objects of the present invention to provide improvements in encoding and decoding techniques and apparatus that are responsive to the problems just summarized. It is also among the objects of the invention to provide improved coding options and to provide an improved technique and apparatus for entropy coding.
- FIG. 1 is a block diagram of an apparatus which can be used to practice embodiments of the invention.
- FIG. 2 is a flow diagram of a routine that can be utilized to program the encoder processor in accordance with an embodiment of the invention.
- FIG. 3 is a flow diagram of a routine that can be utilized to program the decoder processor in accordance with an embodiment of the invention.
- FIG. 4 is a flow diagram of an embodiment of a routine for adaptive entropy coding.
- FIG. 5 is a flow diagram of an embodiment of a routine for adaptive entropy decoding.
- Referring to FIG. 1, there is shown a block diagram of an apparatus which can be used in practicing embodiments of the invention for encoding and decoding
images 100. Avideo camera 102, or other source of video signal, produces an array of pixel-representative signals that are coupled to an analog-to-digital converter 103, which is, in turn, coupled to theprocessor 110 of anencoder 105. When programmed in the manner to be described, theprocessor 110 and its associated circuits can be used to implement embodiments of the invention. Theprocessor 110 may be any suitable processor, for example an electronic digital processor or microprocessor. It will be understood that any general purpose or special purpose processor, or other machine or circuitry that can perform the functions described herein, electronically, optically, or by other means, can be utilized. Theprocessor 110, which for purposes of the particular described embodiments hereof can be considered as the processor or CPU of a general purpose electronic digital computer, such as a Model Ultra-1 sold by Sun Microsystems, Inc., will typically includememories 123, clock andtiming circuitry 121, input/output functions 118 andmonitor 125, which may all be of conventional types. In thepresent embodiment blocks block 131 represents a digital cosine transform function that can be implemented using commercially available DCT chips or combinations of such chips with known software, and theblock 133 represents a wavelet transform that can be implemented using commercially available wavelet transform chips, or combinations of such chips with known software. Theblock 135 represents a vector transform function that can be implemented in accordance with the routines set forth in U.S. Pat. No. 5,436,985 (incorporated herein by reference) or hardware equivalents. As described in said '985 patent, vector quantization (represented by block 136) is employed as part of the VT coding. The vector quantization can be lattice VQ, for example of the type described in copending U.S. patent application Ser. No. 08/733,849, filed Oct. 18, 1996, and copending U.S. patent application Ser. No. 08/743,631, filed Nov. 4, 1996, both assigned to the same assignee as the present application, and both incorporated herein by reference. A transformed VQ (represented by block 137) is described hereinbelow. - With the processor appropriately programmed, as described hereinbelow, an encoded
output signal 101 is produced which is a compressed version of theinput signal 90 and requires less bandwidth and/or less memory for storage. In the illustration of FIG. 1, the encodedsignal 101 is shown as being coupled to atransmitter 135 for transmission over a communications medium (e.g. air, cable, fiber optical link, microwave link, etc.) 50 to areceiver 162. The encoded signal is also illustrated as being coupled to astorage medium 138, which may alternatively be associated with or part of theprocessor subsystem 110, and which has an output that can be decoded using the decoder to be described. - Coupled with the
receiver 162 is adecoder 155 that includes a similar processor 160 (which will preferably be a microprocessor in decoder equipment) and associated peripherals and circuits of similar type to those described in the encoder. These include input/output circuitry 164,memories 168, clock andtiming circuitry 173, and amonitor 176 that can display decodedvideo 100′. Also provided areblocks counterparts block 181 represents an inverse digital cosine transform function that can be implemented using commercially available IDCT chips or combinations of such chips with known software, and theblock 183 represents an inverse wavelet transform function that can be implemented using commercially available inverse wavelet transform chips, or combinations of such chips with known software. Theblock 185 represents an inverse vector transform function that can be implemented in accordance with the routines set forth in the above-referenced U.S. Pat. No. 5,436,985 or hardware equivalents. As described in said '985 patent, inverse vector quantization (represented by block 186) is employed as part of the inverse VT coding. The inverse vector quantization can be inverse lattice VQ, for example of the type described in the above referenced copending U.S. patent application Ser. Nos. 08/733,849 and 08/743,631. An inverse transformed VQ (represented by the block 187) is described hereinbelow. - In order to provide a more universal approach to encoding/decoding wherein, for example in the present embodiment, VT coding is made compatible with the DCT-based and wavelet-based compression techniques, three parameters are introduced and are described as follows:
- Level of Decomposition (LD):
- This parameter takes an integer value from 0 to MAXLD and indicates the level of wavelet decomposition. When LD=0, it indicates that the DCT is used instead of a wavelet transform. For example, if the maximum level of decomposition is chosen to be MAXLD=7, three bits are needed for coding this parameter as follows:
LD value LD code meaning 0 000 use the DCT 1 001 use 1 level of wavelet decomposition 2 010 use 2 levels of wavelet decomposition 3 011 use 3 levels of wavelet decomposition 4 100 use 4 levels of wavelet decomposition 5 101 use 5 levels of wavelet decomposition 6 110 use 6 levels of wavelet decomposition 7 111 use 7 levels of wavelet decomposition - Factor of Subsampling (FS):
- This parameter takes an integer value from 0 to MAXFS. 2FS indicates the factor of subsampling used for vector transform. When FS=0, 2FS=1 indicates no subsampling is performed. For example, if the maximum FS value is chosen to be MAXFS =7, three bits are needed for coding this parameter as follows:
FS value Fs code meaning 0 000 no subsampling 1 001 subsampling by a factor of 2 2 010 subsampling by a factor of 4 3 011 subsampling by a factor of 8 4 100 subsampling by a factor of 16 5 101 subsampling by a factor of 32 6 110 subsampling by a factor of 64 7 111 subsampling by a factor of 128 - Method of Quantization (MQ):
- In the present example, this parameter takes a value of either 0 or 1 as shown in the following table:
MQ value meaning 0 use lattice VQ 1 use transformed lattice VQ - As an example, a description of an 8×8 transformed Z lattice vector quantization (VQ) technique can be summarized as follows:
- each 8×8 vector is transformed into a different coordinate system so that the distribution boundary comes rectangular. For example, an 8×8 DCT transform can be used;
- the transformed vector is quantized using a Z64 lattice;
- the coordinate values of the closest Z64 lattice point is ordered into a 1-D sequence according to a zig-zag scan;
- the 1-D sequence is runlength and entropy coded;
- the coded bitstream becomes the index of the 8×8 vector.
- A combination of the three above-described parameters indicates a particular coding method. For example, the following coding methods can be covered:
- DCT-Based Coding as Used in the Current Standards:
- Set LD=0, FS=0, and MQ=0. The DCT is used instead of wavelet because LD=0. No subsampling is performed because FS=0. Lattice VQ becomes uniform scalar quantization when vector dimension becomes 1. Therefore, MQ=0 means uniform scalar quantization when FS=0 (2FS=1)
- Wavelet-Based Coding:
- The only difference between this case and the previous one is to set LD=a non-zero integer. For example, a 3-level wavelet decomposition plus uniform scalar quantization would have LD=3, FS=0, and MQ=0.
- Vector Wavelet Coding Using Λ16 Lattice VQ:
- In this case, LD is still a non-zero integer and FS also becomes a non-zero integer. Because Λ16 lattice VQ is used, FS should be set to 2 so that subsampling of 4×4 is performed. For example, a 3-level vector wavelet decomposition plus Λ16 lattice VQ would have LD=3, FS=2, and MQ=0.
- Vector Wavelet Coding Using Transformed Z Lattice VQ:
- This case is the same as the previous one except lattice VQ is replaced with transformed lattice VQ. For example, a 3-level vector wavelet decomposition plus 8×8 transformed lattice VQ would have LD=3, FS=3, and MQ=1.
- Vector DCT Coding Using Transformed Z Lattice VQ:
- This case is the same as the previous one except wavelet is replaced with DCT. For example, if an 8×8 transformed lattice VQ is still used, the parameters should be LD=0, FS=3; and MQ=1.
- FIG. 2 is a flow diagram of a routine that can be utilized to program the encoder processor in accordance with an embodiment of the invention. The
block 203 represents the inputing of operator selected control parameters, that is, the selected values of the parameters LD, FS, and MQ, as described above. A digital control word or signal, in this case seven bits (3 bits for LD, 3 bits for FS, and 1 bit for MQ) is generated as representing the control parameters (block 205). The control bits can then be output (block 207), such as to an output register, for inclusion such as in the header of the bit stream. - Inquiry is then made (decision block210) as to whether FS is 0. If so, in this example, vector transform (VT) coding is not being used, and the
block 215 is entered directly. If not, theblock 212 is entered and subsampling is implemented at the factor FS. Inquiry is then made (decision block 215) as to whether LD is 0. If so, digital cosine transform (DCT) is being used and theblock 217 is entered for implementation of DCT. If not, theblock 220 is entered, this block representing implementation of wavelet transform using a number of levels of wavelet decomposition determined by LD. - Inquiry is then made (decision block225) as to whether FS is 0. If so, as previously noted, VT coding is not being used, quantization (block 227) and run length coding (block 228) are implemented and the
block 260 is then entered. If not, theblock 230 is entered, this block representing vector grouping in accordance with FS. Inquiry is then made (decision block 240) as to whether MQ is 0. If so, lattice VQ is implemented, as represented by theblock 245. If not, transformed lattice VQ, which involves, in the context of vector transform, DCT of the grouped vectors (which have already been DCTed or wavelet transformed), followed by quantization (e.g. scalar quantization using Z-lattice) and run length coding, these functions being represented by theblocks block 270. In the present embodiment, adaptive entropy coding is employed, as described in conjunction with the routine of FIG. 4. - Referring to FIG. 3, there is shown a flow diagram of an embodiment of a routine that can be utilized to program the decoder processor in accordance with an embodiment of the invention. The
block 305 represents recovering the control bits from the received data, and theblock 310 represents entropy decoding on the received bit stream. In an embodiment hereof, the entropy decoding can be adaptive entropy decoding as described in conjunction with the routine illustrated in the flow diagram of FIG. 5. Inquiry is made (decision block 313) as to whether FS is 0. If so, vector transform (VT) was not implemented at the encoder, runlength decoding (block 314) and inverse quantization (block 315) are implemented and theblock 350 is then entered. If not, thedecision block 316 is entered and inquiry is made as to whether MQ is 0. If so, inverse lattice VQ is implemented, as represented by theblock 320. If not, an inverse of transformed lattice VQ is implemented as represented by theblocks blocks block 340. - Inquiry is then made (decision block350) as to whether LD is 0. If so, inverse DCT is implemented, as represented by the
block 355. If not, inverse wavelet transform is implemented, at a level determined by LD, as represented by theblock 360. Inquiry is then made (decision block 370) as to whether FS is 0. If so, VT has not be employed, and theblock 385 is entered directly. If not, theblock 380 is entered, this block representing the interleaving (the inverse of subsampling) at a factor determined by FS, whereupon theblock 385 is entered. Theblock 385 represents outputing of the now recovered data, such as for video display and/or recording. - FIG. 4 is a flow diagram of a routine for controlling the encoder processor to implement the optional adaptive entropy encoding in accordance with an embodiment of the invention. The
block 402 represents making any desired initial settings, for example setting of initial matched entry counts for data indices in an encoder table and also setting any initial non-access times (or cycle counts) for entries in the table. Next, for a received index of the data stream to be encoded, the entropy coding table is searched (block 405), and determination is made (block 407) as to whether a matched entry is found (i.e., whether there is a stored code for this index). If so, the code is output (block 410) for ultimate receipt by the decoder. Then, the count of matched entries for that code (or index) is increased by one (block 415) and the non-access time (or cycle count) of the matched entry is set to zero (block 418). Also, the non-access time (or cycle count) of other entries in the table are increased by one, as represented by theblock 420. The next index of the input stream of indices is then awaited (block 475). - If a matched entry was not found, an escape code (which is a predetermined code that tells the decoder that the symbol will not be found in its table) is output (block432), followed by outputing of the index itself (block 435). The index is then entered into the table with a matched entry count of one-and a non-access time (or cycle count) of zero (block 438). The non-access time (or cycle count) of other entries in the table are then incremented by one (block 440). Inquiry is then made as to whether the table size is greater than a predetermined maximum size (decision block 450). If not, the
block 475 is entered and the next index is awaited. If so, an entry is deleted from the table (block 460), namely, the entry with the largest non-access time (or cycle count). When there is more than one (that is, a tie), the one with the smallest matched entry count is selected for deletion. Theblock 475 is then entered. - FIG. 5 shows a flow diagram of a routine for programming the decoder processor to implement the optional adaptive entropy decoding. The
block 502 represents any necessary table initialization for correspondence with the encoder coding table. As will be described further, the procedure in the decoder maintains correspondence between the decoder coding table and the encoder coding table. A code word of the stream of index-representative code words is received, and determination is made (decision block 505) as to whether the code word is an escape code. If not, the corresponding index is fetched from the table and output (block 512). Next, operations are performed as represented byblocks - If it is determined that the received code word is an escape code, the index that follows it is received and output (block542). The index is then entered in the table with a matched entry count of one and a non-access time (or cycles count) of zero (block 545). Then, the non-access time (or cycles count) of the other entries of the table are increased by one (block 548). Determination is then made (decision block 550) as to whether the predetermined maximum table size has been reached. If not, the
block 525 is entered and the next code word is awaited. If so, an entry is deleted from the table in accordance with the previously described deletion rules, as represented by theblock 560. Theblock 525 is then entered.
Claims (6)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/160,628 US6654499B2 (en) | 1996-06-28 | 2002-06-03 | Method and apparatus for encoding and decoding images |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US2077696P | 1996-06-28 | 1996-06-28 | |
US08/884,440 US6144771A (en) | 1996-06-28 | 1997-06-27 | Method and apparatus for encoding and decoding images |
US09/645,240 US6400847B1 (en) | 1996-06-28 | 2000-08-24 | Method and apparatus for encoding and decoding images |
US10/160,628 US6654499B2 (en) | 1996-06-28 | 2002-06-03 | Method and apparatus for encoding and decoding images |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/645,240 Continuation US6400847B1 (en) | 1996-06-28 | 2000-08-24 | Method and apparatus for encoding and decoding images |
Publications (2)
Publication Number | Publication Date |
---|---|
US20030012443A1 true US20030012443A1 (en) | 2003-01-16 |
US6654499B2 US6654499B2 (en) | 2003-11-25 |
Family
ID=26693850
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/884,440 Expired - Lifetime US6144771A (en) | 1996-06-28 | 1997-06-27 | Method and apparatus for encoding and decoding images |
US09/645,240 Expired - Lifetime US6400847B1 (en) | 1996-06-28 | 2000-08-24 | Method and apparatus for encoding and decoding images |
US10/160,628 Expired - Lifetime US6654499B2 (en) | 1996-06-28 | 2002-06-03 | Method and apparatus for encoding and decoding images |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/884,440 Expired - Lifetime US6144771A (en) | 1996-06-28 | 1997-06-27 | Method and apparatus for encoding and decoding images |
US09/645,240 Expired - Lifetime US6400847B1 (en) | 1996-06-28 | 2000-08-24 | Method and apparatus for encoding and decoding images |
Country Status (1)
Country | Link |
---|---|
US (3) | US6144771A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20190049854A1 (en) * | 2017-08-09 | 2019-02-14 | Boe Technology Group Co., Ltd. | Exposure device and exposure method thereof |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6144771A (en) * | 1996-06-28 | 2000-11-07 | Competitive Technologies Of Pa, Inc. | Method and apparatus for encoding and decoding images |
JP3471366B2 (en) * | 1997-07-30 | 2003-12-02 | 三菱電機株式会社 | Image compression / expansion method and image compression / expansion device |
US6185258B1 (en) * | 1997-09-16 | 2001-02-06 | At&T Wireless Services Inc. | Transmitter diversity technique for wireless communications |
EP1808969B1 (en) * | 1997-10-31 | 2014-01-01 | AT & T Mobility II, LLC | Maximum likehood detection of concatenated space-time codes for wireless applications with transmitter diversity |
US6459740B1 (en) * | 1998-09-17 | 2002-10-01 | At&T Wireless Services, Inc. | Maximum ratio transmission |
US6421464B1 (en) * | 1998-12-16 | 2002-07-16 | Fastvdo Llc | Fast lapped image transforms using lifting steps |
US20020089587A1 (en) * | 2000-05-18 | 2002-07-11 | Imove Inc. | Intelligent buffering and reporting in a multiple camera data streaming video system |
US20080075377A1 (en) * | 2003-07-29 | 2008-03-27 | Topiwala Pankaj N | Fast lapped image transforms using lifting steps |
TWI240560B (en) * | 2003-12-03 | 2005-09-21 | Via Tech Inc | Control device, system and method for reading multi-pixel |
US7558870B2 (en) * | 2005-02-22 | 2009-07-07 | Alcatel Lucent | Multimedia content delivery system |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4589142A (en) * | 1983-12-28 | 1986-05-13 | International Business Machines Corp. (Ibm) | Method and apparatus for character recognition based upon the frequency of occurrence of said characters |
JPH05346970A (en) * | 1991-04-04 | 1993-12-27 | Fuji Xerox Co Ltd | Document recognizing device |
KR0134871B1 (en) * | 1992-07-17 | 1998-04-22 | 사또오 후미오 | High efficient encoding and decoding system |
JPH08502865A (en) * | 1992-09-01 | 1996-03-26 | アプル・コンピュータ・インコーポレーテッド | Improved vector quantization |
US5436985A (en) | 1993-05-10 | 1995-07-25 | Competitive Technologies, Inc. | Apparatus and method for encoding and decoding images |
US5748780A (en) * | 1994-04-07 | 1998-05-05 | Stolfo; Salvatore J. | Method and apparatus for imaging, image processing and data compression |
US5659631A (en) * | 1995-02-21 | 1997-08-19 | Ricoh Company, Ltd. | Data compression for indexed color image data |
US5883981A (en) * | 1995-10-20 | 1999-03-16 | Competitive Technologies Of Pa, Inc. | Lattice vector transform coding method for image and video compression |
US5799110A (en) * | 1995-11-09 | 1998-08-25 | Utah State University Foundation | Hierarchical adaptive multistage vector quantization |
US5889891A (en) * | 1995-11-21 | 1999-03-30 | Regents Of The University Of California | Universal codebook vector quantization with constrained storage |
US6144771A (en) * | 1996-06-28 | 2000-11-07 | Competitive Technologies Of Pa, Inc. | Method and apparatus for encoding and decoding images |
-
1997
- 1997-06-27 US US08/884,440 patent/US6144771A/en not_active Expired - Lifetime
-
2000
- 2000-08-24 US US09/645,240 patent/US6400847B1/en not_active Expired - Lifetime
-
2002
- 2002-06-03 US US10/160,628 patent/US6654499B2/en not_active Expired - Lifetime
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20190049854A1 (en) * | 2017-08-09 | 2019-02-14 | Boe Technology Group Co., Ltd. | Exposure device and exposure method thereof |
Also Published As
Publication number | Publication date |
---|---|
US6144771A (en) | 2000-11-07 |
US6654499B2 (en) | 2003-11-25 |
US6400847B1 (en) | 2002-06-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10045034B2 (en) | System and method for using pattern vectors for video and image coding and decoding | |
Wu et al. | Rate-constrained picture-adaptive quantization for JPEG baseline coders | |
CA2134681C (en) | Apparatus and method for encoding and decoding images | |
US6654419B1 (en) | Block-based, adaptive, lossless video coder | |
EP0580454B1 (en) | Coding and decoding of digital data | |
US6757438B2 (en) | Method and apparatus for video compression using microwavelets | |
US7061410B1 (en) | Method and/or apparatus for transcoding between H.264 CABAC and CAVLC entropy coding modes | |
US6947600B1 (en) | Information processing method, apparatus and storage medium for receiving and decoding a code sequence obtained by encoding an image | |
US5714950A (en) | System for variable-length-coding and variable-length-decoding digitaldata | |
US6400847B1 (en) | Method and apparatus for encoding and decoding images | |
US6968088B2 (en) | Modification of detected quantization step size from the encoded bitstream based on a region of interest (ROI) bitmask | |
US5822000A (en) | Video encoding using rearrangement of transform coefficients and inter-block correlation | |
GB2325584A (en) | Reversible embedded wavelet transform system implementation | |
JPH09200757A (en) | Encoder, decoder and data transmitter | |
EP0784407B1 (en) | Transform coefficient select method and apparatus for transform coding system | |
Yoo et al. | Constrained bit allocation for error resilient JPEG coding | |
KR100320454B1 (en) | apparatus and method for compression of video data, and apparatus for decompression of video data | |
EP0806870A2 (en) | Image encoding using object shape information | |
JPH05260308A (en) | Static image coding device | |
Deutermann et al. | Compression techniques for video telemetry | |
JPH0686077A (en) | Hierzrchical image compressing system | |
JP2003163931A (en) | Image-compressing apparatus and image-decoding apparatus |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FEPP | Fee payment procedure |
Free format text: PAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
REFU | Refund |
Free format text: REFUND - SURCHARGE, PETITION TO ACCEPT PYMT AFTER EXP, UNINTENTIONAL (ORIGINAL EVENT CODE: R2551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: COMPETITIVE TECHNOLOGIES, INC., CONNECTICUT Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:COMPETITIVE TECHNOLOGIES OF PA, INC.;REEL/FRAME:019331/0539 Effective date: 20020710 |
|
AS | Assignment |
Owner name: COMPETITIVE TECHNOLOGIES, INC., CONNECTICUT Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:COMPETITIVE TECHNOLOGIES OF PA, INC.;REEL/FRAME:019477/0136 Effective date: 20020710 |
|
AS | Assignment |
Owner name: LOT 17 ACQUISITION FOUNDATION, LLC, DELAWARE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:COMPETITIVE TECHNOLOGIES, INC.;REEL/FRAME:020723/0440 Effective date: 20070419 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
FPAY | Fee payment |
Year of fee payment: 12 |
|
AS | Assignment |
Owner name: CUFER ASSET LTD. L.L.C, DELAWARE Free format text: MERGER;ASSIGNOR:LOT 17 ACQUISITION FOUNDATION, LLC;REEL/FRAME:037378/0917 Effective date: 20150812 |
|
AS | Assignment |
Owner name: HANGER SOLUTIONS, LLC, GEORGIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTELLECTUAL VENTURES ASSETS 161 LLC;REEL/FRAME:052159/0509 Effective date: 20191206 |
|
AS | Assignment |
Owner name: INTELLECTUAL VENTURES ASSETS 161 LLC, DELAWARE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CUFER ASSET LTD. L.L.C.;REEL/FRAME:051873/0365 Effective date: 20191126 |