text:
|Publication number
|Publication type
|Application number
|Publication date
|Dec 26, 2000
|Filing date
|Aug 12, 1997
|Priority date
|Dec 10, 1996
|Fee status
|Also published as
|Publication number
|Haoping Yu, Barth Alan Canfield, Billy Wesley Beyers, Jr., Wai-Man Lam
|Original Assignee
|Thomson Licensing S.A.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (21), Non-Patent Citations (13), Referenced by (9), Classifications (24), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
This application claims priority of a provisional application, Ser. No. 60/032,997, filed Dec. 10, 1996 by Yu et al.
This invention concerns a digital video processor. Specifically, the invention concerns a system for efficiently transferring overhead data associated with compressed video data.
The efficient use of memory is important in the design and operation of image processors. For example, consumer products such as television systems may use image processors including MPEG-2 signal processing. The MPEG (Motion Picture Experts Group) signal compression standard (ISO/IEC 13181-2, May 10, 1994) is a widely accepted image processing standard which is particularly attractive for use with satellite, cable and terrestrial broadcast systems employing high definition television (HDTV) processing among other forms of image processing. Products using high definition displays require 96 Mbits or more of memory to temporarily store MPEG decoded frames prior to display. An MPEG processor requires these frames for motion estimation and compensation to reconstruct accurate images for display.
Systems which reconstruct images from MPEG decoded picture elements (pixels or pels) typically employ Differential Pulse Coded Modulation (DPCM). In DPCM processing a processor generates a prediction which anticipates the next pixel value. A summation network subtracts the prediction from the actual pixel value resulting in a difference which anticipates the next pixel value. This difference, known as prediction error, is generally smaller than the original pixel or prediction values, and processing the difference rather than the original pixel value reduces system bandwidth requirements. Ang et al., "Video Compression Makes Big Gains," IEEE Spectrum, October 1991, describes an MPEG encoder and decoder.
Memory efficient image processors use less memory to store image frames by recoding (recompressing) the block data prior to storage. In the spatial domain, reducing the number of bits per pixel used to store the image frames adversely affects the picture quality if the pixels can not be accurately reconstructed to their original bit size. Artifacts may occur, especially in smooth areas of the image. Memory reduction image processors should accurately quantize and dequantize the MPEG decoded signal as efficiently and economically as possible.
The present inventors recognize the desirability of providing an efficient data reduction system employing minimal hardware and software which will minimize artifacts the system introduces into the reconstructed data. A system according to the present invention satisfies these objectives.
In accordance with the principles of the present invention, an image processor determines the minimum pixel value and the range of pixel values for an image block. The processor selects a best-fit between the range and a set of predetermined ranges. Each predetermined range has an associated set of predetermined minimum values, and the processor selects a best-fit between the pixel block minimum value and the predetermined minimum values associated with the predetermined range selected. The processor encodes the selected predetermined range and the selected predetermined minimum value with a reduced-bit code, and stores the encoded values in memory with the compressed block data.
FIG. 1 is a block diagram of a pixel block processor which includes a system according to the present invention.
FIG. 2 shows details of the compression portion of the FIG. 1 system.
FIG. 3 depicts a packetized data format suitable for use by a system according to the present invention.
FIG. 4 is a flow chart showing an indexing process according to the present invention.
FIG. 5 shows details of the decompression portion of the FIG. 1 system.
FIG. 6 is a flow chart of a processing method including the present invention.
FIG. 7 is a block diagram of an MPEG compatible television system employing the present invention.
In an exemplary embodiment of the invention, a television receiver includes an MPEG decoder. A data reduction network quantizes a decoded and decompressed MPEG signal representing image blocks prior to storage in frame memory, and reconstructs the image blocks when needed for an image display. A display device displays image information derived from frame memory.
To maintain data integrity through the data reduction network, the network scans a pixel block and determines the range of image pixel values and the minimum pixel value. The network performs a best-fit analysis between the range and a set of predetermined ranges. Except for the smallest and largest predetermined range, each predetermined range has a set of predetermined minimum values. The network performs a best-fit analysis between the pixel block minimum value and the predetermined minimum values associated with the predetermined range selected.
The selected predetermined range and the selected predetermined minimum value are each indexed with a representative three-bit code. For the smallest predetermined range the network retains the actual eight-bit minimum value, and for the largest predetermined range the network selects the value of zero which requires no bits.
The indexed representations for the range and minimum values are stored in frame memory with the quantized pixel block. Storing representative values instead of the actual eight-bit values makes memory available for storing quantized pixel values. Quantized pixel values are efficiently represented with less than eight bits per representation, because the block specific range and minimum pixel values facilitate reconstruction.
In FIG. 1, an MPEG decoder provides a block of MPEG decoded pixel data to input 10 of a memory reduction processor including compressor 12. Compressor 12 includes a predictor 18, a quantizer 20, and a combiner 22. The pixel block is in the spatial domain, and comprises an 8�8 block of image pixels, for example. Predictor 18 employs well known principles and may be of the type described in Jain, A., Fundamentals of Digital Image Processing, Prentice-Hall, Inc., p. 484 (1989), for example.
Quantizer 20 provides a data reduced pixel block to memory 14. When a display processor (not shown) accesses the reduced data block in memory 14 to display an image, decompressor 16 reconstructs the original data block. Decompressor 16 includes predictor 24 and dequantizer 26 to retrieve reduced data from memory 14 and to reconstruct the reduced data block. Quantizer 20 and dequantizer 26 are arranged according to the principles of the present invention as will be discussed. Predictor 24 is similar to predictor 18.
Input 10 of compressor 12 receives a pixel block from an MPEG decoder (shown in FIG. 7). Input 10 supplies the pixel block data to a non-inverting input of combiner 22 and to quantizer 20. Predictor 18 supplies pixel prediction data to an inverting input of combiner 22 and to quantizer 20. Combiner 22 combines its signals from inverting and non-inverting inputs and provides the difference to quantizer 20. Quantizer 20 outputs reconstruction level values to predictor 18 and encoded pixel difference values to memory 14 for storage.
FIG. 2 illustrates quantizer 20 of FIG. 1 in greater detail. Throughout the specification, the same reference numbers identify common elements in the Figures. Specifically, quantizer 20 includes prediction error processor 27, quantization mapper 28, coding controller 29, min-max-range processor (MMRP) 30, first pixel (reference pixel) processor 31, and multiplexer 32. Input 10 provides block pixel data to MMRP 30, which scans the pixel block and determines the minimum pixel value, the maximum pixel value, and the range for the block. MMRP 30 selects a predetermined range from a set of predetermined ranges as a function of the actual range, and exchanges the selected predetermined range for the actual range for subsequent use within the network. MMRP 30 also identifies a predetermined minimum pixel value using information from the selected predetermined range to represent the pixel block in place of the actual minimum pixel value. MMRP 30 compresses the predetermined minimum pixel and range block parameter values and transfers them to multiplexer 32.
The selected predetermined minimum pixel value and the range are also transferred to first pixel processor 31, and the predetermined range is transferred to prediction error processor 27, as will be discussed. Prediction error processor 27 receives prediction error data from combiner 22 and biases negative values with the selected predetermined range. Quantization mapper 28 receives biased and unbiased prediction error values from prediction error processor 27. These values are quantized and encoded and sent to multiplexer 32. Quantization mapper 28 also sends reconstruction level values to predictor 18 which uses the values to calculate prediction data. Multiplexer 32 sends block parameters - the compressed minimum pixel value, range and reference pixel value--and the quantized data to memory 14 under timing and control which will be discussed later. The block parameters represent overhead data which are stored in memory 14 within a parameter field associated with the quantized pixel block. The parameter field and the quantized data together form a packet which consolidates all of the information needed by decompressor 16 to access appropriate dequantization tables and to reconstruct the pixel block. Coding controller 29 oversees the transfer of block parameters and compressed data, as well as the selection of quantization tables for individual pixel representative values.
First pixel processor 31 receives the pixel block from input 10, and identifies a predetermined reference pixel value. The block minimum pixel value received from MMRP 30 facilitates compression of the reference pixel independently of other block pixels. The compressed reference pixel is represented with sufficient bits for dequantizer 26 to reconstruct its original value in a lossless or near lossless manner. First pixel processor 31 passes the compressed reference pixel value as a block parameter to multiplexer 32 which transfers block parameters, including the reference pixel value, and the quantized data to memory 14. Dequantizer 26 uses the reference pixel as a prediction value for the quantized block pixels during pixel reconstruction. Since the first value (the reference pixel value) used in the prediction network during decompression is independent, a given pixel block can be decompressed without information from other pixel blocks. This value is also accurate, which eliminates a propagating prediction error from the reconstructed data.
The reference pixel is compressed using the pixel block minimum value as a predictor for deriving the compressed value. The selected predetermined minimum value is subtracted from the reference value and the difference is divided by two. The result is stored in memory 14 with one less bit than is necessary for a binary representation of the predetermined range. The predetermined range defines the number of bits used to store the compressed reference pixel value because, when using block pixel values as predictors for other values in the same pixel block, the difference between any two block pixel values, such as the reference and minimum pixel values, will fall within the domain of the range. The compressed reference value uses one bit less than is necessary to represent the range because the difference is a positive number which is divided by two, which reduces the number of bits required for a binary representation by one bit.
Quantizer 20 and dequantizer 26 access quantization and dequantization tables respectively which are optimized to each block. The quantization and dequantization tables include values based on a predetermined range of the pixel block. MMRP 30 receives an input data block and scans it to determine the minimum pixel value and the maximum pixel value. MMRP 30 then subtracts the minimum from the maximum and adds one (max-min+1) to calculate the range for the pixel block.
Quantizer 20 and dequantizer 26 compare the calculated range to a set of predetermined ranges, at least one of which is greater than or equal to the calculated range, select a predetermined range, and access quantization and dequantization tables respectively derived from the predicted range. The predetermined range is selected by a best-fit analysis that determines which predetermined range is the smallest of the set which is larger than or equal to the actual calculated range. The quantization and dequantization tables are customized to include values within the domain of the selected predetermined range, and therefore include values of the entire actual range. Quantizer 28 employs DPCM processing and produces difference values which are prediction errors, and these prediction errors lie in the domain of the actual range. The actual range is often significantly less than 256 (the maximum value of an 8-bit pixel value). Table levels derived from this range provide better resolution than table levels derived from 256, because the selected predetermined range is generally close in value to the actual range and may be represented by less than eight bits. Therefore, system accuracy and efficiency increase by customizing the table levels to the range.
To reconstruct the input block data, dequantizer 26 must know which predetermined range quantizer 28 used to access the quantization table employed when quantizing the pixel block. Representations of the range and other pixel block parameters are stored in memory 14 within a parameter field with the quantized pixel block as a payload. Together the parameter field and payload form a compressed data packet. By storing a block parameter representation in memory 14 along with the quantized pixel block, dequantizer 26 may access the proper dequantization table and reconstruct the pixel block efficiently and accurately. FIG. 3 illustrates one possible configuration of parameter field 33 and compressed data payload 35. In this embodiment, parameter field 33 is arranged as a header of a data packet containing compressed data payload 35.
In this embodiment, memory 14, which stores image frames needed by a display processor, is reduced in size by fifty percent. For an eight-bit pixel, which is assumed for the purposes of this embodiment, a fifty percent reduction provides an average of four bits in memory 14 to store each pixel representation after compression. The overhead information represented by the block parameters in parameter field 33 require space in memory 14. Every bit used to store the parameter field decreases the memory available for storing quantized pixels. The overall effect is to reduce the resolution available for quantized data because memory capacity is held constant at its predetermined reduced size. Increasing the memory size to compensate for the overhead information causes undesirable increases in manufacturing costs because memory is generally only available in fixed block sizes from manufacturers. These are significant costs considering there are 32,640 8�8 pixel blocks in a HDTV image frame, as specified by the Grand Alliance specification. Three eight-bit words add 783,360 bits per frame to the memory requirements of each television receiver using this system. Also, system reliability decreases because the extra memory requires additional hard-wire connections, each one of which is a potential failure point.
A system using the present invention decreases the number of bits required to store two of the block parameters, namely the range and minimum value, from eight bits to three bits for each parameter for most cases. This saves ten bits in memory per pixel block, which translates to 326,400 bits saved for each image frame stored in memory. Once quantizer 20 determines the actual range and minimum pixel value, these values are quantified and indexed, as follows.
The actual range is compared to a set of predetermined ranges to determine a best-fit. The predetermined range becomes the value used to represent the range for the pixel block then being processed. The predetermined range is larger than the actual range to ensure that all pixel values within the pixel block are represented, as will be discussed in association with FIG. 4. The set of predetermined ranges include seven values. Since the set is available to both quantizer 20 and dequantizer 26, the predetermined range may be represented in the parameter field by one index value. The index requires only three bits for a binary representation because there are only seven predetermined ranges to represent.
The system handles the minimum pixel value in a similar manner. For five of the seven predetermined ranges, the system accesses a predetermined set of eight minimum pixel values unique to the selected predetermined range. Quantizer 20 compares the actual minimum pixel value to the predetermined set and selects the largest predetermined minimum value which is less than or equal to the actual minimum value. The predetermined minimum then becomes the value used to represent the minimum pixel for the pixel block being processed. The set is available to both quantizer 20 and dequantizer 26, so the predetermined minimum may be represented in the parameter field by one index value. This index also requires three bits for a binary representation because there are only eight predetermined minimum pixel values to represent.
As stated previously, each index value requires three bits, which results in six bits being stored in each parameter field instead of sixteen bits. The saved bits preserve memory for storing quantized pixels. This increases the resolution of the quantized pixel data, because the bits saved by encoding the block parameters allow finer quantization (resolution) of pixel data.
The following expression defines the set of predetermined ranges and their selection. Rs is the selected predetermined range from the set, and Ri is the range represented by the index value i, where i is the index value for the selected range to be represented by three bits in the parameter field. R is the actual range value of the pixel block.
Rs=MINi {Ri|Ri>=R, Ri=16, 32, 64, 96, 128, 192, 256; 0<=i<=6}(1)
MIN{f(x)} indicates that the selected range, Rs, is the smallest value of the set which satisfies the condition Ri>=R. The expression f(x) within the brackets is representative of any expression, such as the one in equation (1), upon which the function MIN operates. For example, if R is 73, equation (1) produces 96 as the resulting value for Rs. Any value of R from 65 to 96 produces the same result.
The seven predetermined ranges of equation (1) are derived from the binary progression of numbers in general, and by the predetermined average number of bits available in a particular system to represent a compressed and decompressed pixel. Since memory is reduced by fifty percent, an eight-bit pixel (the largest for this example) compresses to four bits on average. Therefore, 16 (four bits) and 256 (eight bits) are the smallest and largest values within the set of predetermined ranges. Values such as those shown which occur at 2n increments are natural selection breaks for the set of predetermined ranges because each increment or decrement in n requires one more or one less bit for a binary representation of the range. The exponential expression 2n provides five values, 16, 32, 64, 128, and 256. A three-bit index provides for up to eight ranges and allows other predetermined ranges to be added in the gaps to increase resolution. For this embodiment, the gap-added predetermined ranges are 96 and 192.
The set of eight predetermined minimum pixel values for five of the seven ranges are defined by equation (2) below. The five ranges to which equation (2) applies are 32, 64, 96, 128, and 192. The equation provides a constant linear step beginning with zero.
Qmin(Rs,i)=INT{i((256-Rs)/7)}; 0<=i<=7. (2)
In this equation i is the index value for the selected minimum pixel value to be represented by three bits in the parameter field. INT {f(x)} indicates that only the integer portion of the resulting value is used. The expression f(x) within the brackets is representative of any expression, such as the one in equation (2), upon which the function INT operates.
Equation (3) below selects the predetermined minimum pixel value from the set which is substituted for the actual minimum pixel block value. MAXi{f(x)} indicates that the maximum value of i which satisfies the condition within the brackets is to be used to generate Qmin.
Qmin=MAXi {Qmin(Rs, i)|Qmin(Rs, i)<=Xmin; 0<=i<=7}(3)
Equation (4) states the necessary and sufficient condition for selecting valid block parameters to enable accurate representation during quantization. The selected predetermined range and minimum value must together satisfy the condition of equation (4). If they do not, another set of values which satisfy the condition must be chosen as will be discussed below. Qmin(Rs) is the result of equation (3) above.
Rs+Qmin(Rs)>Xmax (4)
Two ranges, 16 and 256, are special cases and are treated differently. The range of 256 is special because it represents the maximum value which eight bits can represent. If the range is the 256, then the minimum pixel value defaults to zero because all positive eight-bit values occur within zero to 256. No bits are needed or used in the parameter field to represent this value which provides three more bits for storing quantized data.
The predetermined range 16 is also a special case because it is smaller than the linear step between the associated set of minimum values as is defined by equation (2). If a set of eight predetermined minimum values were used for this range, the constant step between each minimum value would be approximately 34. The value 34 is more than twice the range of 16. It is possible to select a predetermined minimum pixel value for the predetermined range of 16, add the predetermined range to the selected minimum, and not even have the actual minimum value. For example, if the predetermined range of 16 is selected, and the actual block minimum pixel value is 90, equation (3) produces a selected minimum pixel value of 68. Whereas the actual pixel values may be from 90 to 102, the system would generate pixel values from 68 to 84 upon reconstruction. It is likely that the error resulting from this example would cause noticeable distortion in the displayed image. This occurs on reconstruction of the quantized pixel block because the prediction network of dequantizer 26 employs the minimum pixel value as a constant offset for all reconstructed pixel block values. Furthermore, quantizer 20 will recognize that the actual values will not be represented and select the next largest range which will represent all actual values. Therefore, when the predetermined range of 16 is selected the actual eight-bit minimum pixel value is stored in the parameter field.
Sixteen (16) is the smallest predetermined range of the set because this embodiment reduces memory by fifty percent. This reduction requires eight-bit words to be represented by four bits on average. With a range of 16, only the values 0 to 15 need be represented and four bits allows lossless quantization. Therefore, a range smaller than 16 has no additional benefit. For a flat image without motion, for example a cloudless sky, small quantization errors produce noticeable artifacts when reconstructed. Flat images, however, are where the range of 16 is most likely to occur precisely because there is little or no variation of color or motion.
This analysis of what minimum predetermined range value to select for a particular system may be used for any memory reduction percentage. For example, a twenty-five percent reduction in memory requires six bits for each quantized pixel on average. The associated minimum predetermined range is therefore 64.
To reconstruct the original pixel block data, dequantizer 28 must know what range quantizer 30 used to construct the quantization table employed when quantizing the pixel block. The encoded representation of the predetermined range and minimum pixel values are stored in memory 14 in the form of a parameter field 33 associated with the quantized data payload 35 (FIG. 3). Other pixel block parameters included in the parameter field may be, for example, the maximum pixel block value or a reference pixel block value. Again, FIG. 3 illustrates one possible configuration of parameter field 33 as a header prefacing the compressed data payload 35.
Equations (1) and (3) may select block parameters which do not satisfy equation (4), because the selected predetermined minimum value is less than the actual minimum value. For example, if in a given pixel block the minimum pixel value is 100 and the maximum pixel value is 140, then the selected predetermined range is 64. The selected predetermined minimum pixel value resulting from equation (2) is 82. The result of adding the selected minimum to the selected range is 146 which is greater than the actual maximum pixel value. Therefore, all of the values of the pixel block will be represented by the selected predetermined values. However, if the maximum pixel block value is instead 160, the selected predetermined values will remain the same but not completely represent the domain of the pixel block. In this case, quantizer 28 detects this problem and selects the next higher predetermined range of 96 and the predetermined minimum value of 91. The summation of 91 and the predetermined range of 96 is 187, which is greater than the actual maximum pixel block value of 160. Therefore, the quantization and dequantization tables selected from this range will provide levels for all of the pixels in the block.
FIG. 4 is a flow chart showing the index selection process to ensure the range chosen incorporates all pixel values relative to the predetermined minimum. This process is not used for the predetermined ranges of 16 and 256, as explained above. In step 74, the actual range for input pixel values XMIN and XMAX is calculated, and then the predetermined range is selected to accommodate the actual range as described by equation (1) above. In step 76, the predetermined minimum block pixel value QMIN is selected by equation (2). The two selected predetermined values for the range and minimum block pixel are added together, as is seen in step 78, and compared to the actual maximum block pixel value. If the summation in step 78 is greater than the actual maximum block pixel value, the selected predetermined values will include the actual pixel values in the pixel block being processed and the process is finished. If the summation in step 78 is less than or equal to the actual maximum pixel block value, then the predetermined range and minimum block pixel values are discarded and the next greater predetermined range value is chosen. A new predetermined minimum block pixel value associated with the new predetermined range is determined. Once the proper predetermined range and minimum pixel value are chosen, their indices are stored in parameter field 33 (FIG. 3) and the quantization table is selected using the predetermined range value.
FIG. 5 shows the arrangement of a min-max-range decoder (MMRD) 38, a dequantizer processor 36, and a demultiplexer 34 within decompressor 26. Demultiplexer 34 receives the packet including the quantized data and parameter field from memory 14 and sends the parameter field to MMRD 38. MMRD 38 adds the quantized minimum block pixel value from the range to calculate the maximum block pixel value, and sends all block parameters together with quantized data to dequantizer processor 36. Dequantizer processor 36 also receives prediction data from predictor 24 (FIG. 1). Dequantizer processor 36 reconstructs the pixel block to match its original bits-per-pixel size relative to input 10, and outputs the reconstructed data to an output network (FIG. 7).
Referring back to FIG. 1, memory 14 stores the quantized pixel block and the parameter field until they are no longer needed for pixel reconstruction and display. During the time the data reside in memory 14, they may be accessed and decoded by a subsequent display processor via decompressor 16 under the control of a microprocessor using a common data bus. Compressor 12 and decompressor 16 reside in a common integrated circuit and exhibit similar design and construction to simplify the integrated circuit. Memory 14 advantageously resides outside the integrated circuit, thereby allowing the size of memory 14 to be selected as needed to accommodate the signal processing requirements of a particular system. This results in manufacturing cost savings, e.g., in the case of a reduced cost consumer television receiver using a reduced resolution display requiring less frame memory for the MPEG decoder. Also, saved storage area is typically usable by other system components which increases overall system capability.
FIG. 6 exemplifies a flow chart of a data quantization/dequantization network including to the present invention. In step 80, an MPEG compatible receiver supplies a pixel block to the network. The pixel block has been decompressed and is eight-bit chroma or luma data, for example. In step 82, the network evaluates the data and determines the range and minimum (MIN) pixel values within the block. Once the actual range is determined, the network performs a best-fit analysis in step 84 between the actual range and a set of predetermined ranges. The smallest predetermined range from the set which is greater than or equal to the actual range replaces the actual range for the remainder of the process. A set of predetermined minimum values exists for the selected predetermined range. A best-fit analysis is also performed between the actual minimum pixel value for the block and the set to select a representative value. Step 86 ensures that all actual block pixel values are included within the domain which the selected predetermined range and minimum pixel values define. The upper limit of the domain is the summation of the predetermined range and minimum pixel values. If this result is not greater than the actual maximum pixel value, the process returns to step 84 and the next larger predetermined range is selected, as is a new predetermined minimum value. Step 88 encodes the selected predetermined range and minimum pixel values to three bit binary index representations. The indexed representations are stored in memory with the quantized pixel block in step 90. The quantization processing portion of the network then retrieves the next decompressed pixel block and processes it in the same manner, beginning at step 80.
When the output network requires data, the three-bit index representations are retrieved with the quantized pixel block from memory in step 92. The network decodes the three-bit index representations of the selected predetermined range and minimum pixel values in step 94. The network then uses these values to facilitate reconstruction of the quantized pixel block in step 96. The reconstructed data is sent to an output network in step 98. The dequantization processing portion of the network begins again at step 92 to decode indexed representations and reconstruct subsequent pixel blocks in the same manner.
FIG. 7 exemplifies portions of a practical digital signal processing system in a television receiver, including apparatus according to the present invention as discussed previously. The digital television receiver system of FIG. 7 is simplified so as not to burden the drawing with excessive detail. For example, not shown are FIFO input and output buffers associated with various elements, read/write controls, clock generator networks, and control signals for interfacing to external memories which can be of the extended data out type (EDO), synchronous type (SDRAM), rambus DRAM (RDRAM), or any other type of RAM.
Common elements in FIG. 1 and FIG. 7 have the same identifier. Elements in signal processor 72, except for unit 70, correspond to elements found in the STi 3500A MPEG-2/CCIR 600 Video Decoder integrated circuit commercially available from SGS-Thomson Microelectronics.
Briefly, the system of FIG. 7 includes microprocessor 40, bus interface unit 42 and controller 44 coupled to an internal control bus 46. In this example, microprocessor 40 is located external to the integrated circuit containing MPEG decoder 72. A 192 bit wide internal memory bus 48 is a conduit for data to and from compressor 12, similar decompressors 16 and 50, and external frame memory 14. Units 12, 16 and 50 receive compression and decompression factor control signals from microprocessor 40 via controller 44, along with enable control signals. Also included is a local memory control unit 52 which receives Request inputs and provides Acknowledge outputs as well as memory Address outputs, Read Enable and Write Enable outputs. Memory control unit 52 generates real time address and control signals for controlling memory 14. Memory control unit 52 also provides output clock signals Clock Out in response to input clock signals Clock In from a local clock generator (not shown). Microprocessor 40 partitions memory 14 into bit buffers, video frame storage sections and frame storage buffers for MPEG decoding, and display processing and on-screen display maps.
Display processor 54 includes horizontal and vertical resampling filters as needed to convert a decompressed image format to a predetermined common format for display by an image reproducing display device 56. For example, the system may receive and decode image sequences corresponding to formats such as 525 line interlaced, 1125 line interlaced or 720 line progressive scan. A television receiver will likely use a common display format for all receiver formats.
External interface networks 58 convey control and configuration information between the MPEG decoder and external microprocessor 40 in addition to input compressed video data for processing by the MPEG decoder. The MPEG decoder system resembles a compressor-processor for microprocessor 40. For example, microprocessor 40 issues a decode command to the MPEG decoder for each frame to be decoded. The decoder locates the associated header information, which microprocessor 40 then reads. With this information microprocessor 40 issues data for configuring the decoder, e.g. with respect to frame type, quantization matrices, etc., after which the decoder issues appropriate decode commands. Technical specification materials for the SGS-Thomson STi 3500A integrated circuit device noted above provide additional information concerning such manner of MPEG decoder operation.
Microprocessor 40 conveys mode control data, programmed by the receiver manufacturer, to memory controller 52 for controlling the operation of multiplexer 32 (FIG. 2) and demultiplexer 36 (FIG. 5), and for establishing the compression/decompression factors for units 12, 16, and 50 as required. The disclosed system can be used with all profiles and levels of the MPEG specification in the context of various digital data processing schemes, as may be associated with terrestrial broadcast, cable and satellite transmission systems, for example.
FIG. 7 also depicts a portion of a digital video signal processor 72 such as may be found in a television receiver for processing an input high definition video signal. Signal processor 72 may be included in an integrated circuit which includes provisions for receiving and processing standard definition video signals via an analog channel (not shown). Signal processor 72 includes a conventional MPEG decoder constituted by blocks 60, 62, 64, 66, 68, and 70, including frame memory 14. For example, Ang et al. "Video Compression Makes Big Gains," cited above, describes the operation of an MPEG encoder and decoder.
Signal processor 72 receives a controlled data stream of MPEG coded data from a preceding input processor (not shown), e.g., a transport decoder which separates data packets after input signal demodulation. In this example, the received input data stream represents high definition image material (1920�1088 pixels) as specified in the Grand Alliance specification for the United States high definition terrestrial television broadcast system. The input data stream is in the form of a layered data stream representing a sequence of images which have been compressed using the MPEG compression standard. Periodically, these images are compressed and coded as intraframe and interframe information. The intraframe information comprises I-frame anchor frames. The interframe information comprises predictive motion coded residual information representing the image difference between adjacent picture frames. The interframe motion coding involves generating motion vectors representing the offset between a current block being processed and a block in a prior reconstructed image. The motion vector which represents the best match between the current and prior blocks is coded and transmitted. Also, the difference (residual) between each motion compensated 8�8 block and the prior reconstructed block is discrete cosine transformed (DCT), quantized and variable length coded (VLC) before being transmitted. Various publications, including Ang, et al. above, describe motion compensated coding processes in greater detail.
Buffer 60 accepts the input compressed pixel data blocks before being variable length decoded by variable length decoder (VLD) 62. Buffer 60 exhibits a storage capacity of 1.75 Mbits in the case of a main level, main profile MPEG data stream. Inverse quantizer 64 and inverse discrete cosine transformer (IDCT) 66 decompress decoded compressed data from VLD 62. Output data from IDCT 66 is coupled to one input of adder 68.
A signal from buffer 60 controls the quantization step size of inverse quantizer 64 to assure smooth data flow. VLD 62 provides decoded motion vectors to motion compensation unit 70 as will be discussed. VLD 62 also produces an inter/intra frame mode select control signal as known (not shown for simplification). The operation performed by units 62, 64, and 66 are inverse corresponding operations of an encoder located at a transmitter.
By summing the residual image data from unit 66 with predicted image data provided from the output of unit 70, adder 68 provides a reconstructed pixel based on the contents of video frame memory 14. When signal processor 72 has processed an entire frame of pixel blocks, frame memory 14 stores the resulting reconstructed image. In the interframe mode, motion vectors obtained from VLD 62 give the location of the predicted blocks from unit 70.
The image reconstruction process involving adder 68, memory 14 and motion compensation unit 70 advantageously exhibits significantly reduced memory requirements due to the use of block compressor 12 prior to data storage in frame memory 14. The size of frame memory 14 may be reduced by up to fifty percent (50%), for example, when a 50% compression factor is used. Unit 50 performs the inverse function of unit 12, and is similar to decompressor 16 described above. Decompressor 50 reconstructs the image block so motion compensator 70 may function as described above. Compressor 12 and decompressors 16 and 50 are constructed in accordance with the principles of the present invention. FIGS. 1, 2 and 5 illustrate details within units 12, 16 and 50.
|Cited Patent
|Filing date
|Publication date
|Mar 16, 1989
|Feb 20, 1990
|Canon Kabushiki Kaisha
|Image information signal transmission apparatus
|Jul 10, 1991
|Nov 2, 1993
|Matsushita Electric Industrial Co., Ltd.
|Method of quantizing, coding and transmitting a digital video signal
|Mar 11, 1993
|Apr 26, 1994
|Mitsubishi Denki Kabushiki Kaisha
|Coding apparatus
|Nov 19, 1991
|Apr 26, 1994
|Matsushita Electric Industrial Co., Ltd.
|High-efficiency coding apparatus for compressing a digital video signal while controlling the coding bit rate of the compressed digital data so as to keep it constant
|Nov 4, 1991
|Mar 7, 1995
|Siemens Aktiengesellschaft
|Process for adaptive quantization for the purpose of data reduction in the transmission of digital images
|Nov 10, 1992
|Jul 23, 1996
|Adobe Systems, Inc.
|Method and apparatus for processing data for a visual-output device with reduced buffer memory requirements
|Jun 7, 1995
|Apr 1, 1997
|Sony Corporation
|Apparatus and method for data compression and expansion using hybrid equal length coding and unequal length coding
|Jul 23, 1996
|Dec 30, 1997
|Sony Corporation
|Information signal encoding system and method for adaptively encoding an information signal
|Jan 25, 1996
|Mar 24, 1998
|Thomson Multimedia, S.A.
|Quantization circuitry as for video signal compression systems
|Mar 11, 1994
|Mar 31, 1998
|The Trustees Of Columbia University In The City Of New York
|JPEG/MPEG decoder-compatible optimized thresholding for image and video signal compression
|Mar 14, 1996
|May 12, 1998
|Sony Corporation
|Method for quantizing compressed video signals
|Sep 10, 1992
|Oct 13, 1998
|Canon Kabushiki Kaisha
|Image processing apparatus
|Jun 19, 1996
|Oct 20, 1998
|Thomson Consumer Electronics, Inc.
|MPEG system which decompresses and recompresses image data before storing image data in a memory and in accordance with a resolution of a display device
|Nov 1, 1996
|Aug 3, 1999
|Samsung Electronics Co., Ltd
|Method and circuit for determining quantization interval in image encoder
|Dec 10, 1993
|Jun 15, 1994
|Sony Corporation
|Adaptive dynamic range encoding method and apparatus
|May 20, 1994
|Dec 7, 1994
|Matsushita Electric Industrial Co., Ltd.
|Apparatus for further compressing and recording encoded digital video data streams
|Jun 2, 1995
|Dec 13, 1995
|SICAN, GESELLSCHAFT F�R SILIZIUM-ANWENDUNGEN UND CAD/CAT NIEDERSACHSEN mbH
|Method for coding and decoding a data stream
|Title not available
|Title not available
|Title not available
|Jun 4, 1997
|Dec 11, 1997
|Philips Electronics N.V.
|Method and device for decoding coded digital video signals
|"Fundamentals of Digital Image Processing", by Anil K. Jain, pp. 476-498, Prentice-Hall International, Inc.
|"Video compression makes big gains", by Peng H. Ang, Peter A. Ruetz, and David Auld--LSI Logic Corp., IEEE Spectrum-- Oct., 1991, pp. 16-19.
|Fundamentals of Digital Image Processing , by Anil K. Jain, pp. 476 498, Prentice Hall International, Inc.
|Kondo T. et al., "Adaptive Dynamic Range Coding Scheme For Future HDTV Digital VTR", Signal Processing of HDTV, 3, Turin, Sep. 4-6, 1991, pp. 43-50.
|Kondo T. et al., Adaptive Dynamic Range Coding Scheme For Future HDTV Digital VTR , Signal Processing of HDTV, 3, Turin, Sep. 4 6, 1991, pp. 43 50.
|Monet P. and Dubois E.: "Block Adaptive Quantization of Images", IEEE Transactions on Communications, vol. 41, No. 2, Feb. 1993, pp. 303-306.
|Monet P. and Dubois E.: Block Adaptive Quantization of Images , IEEE Transactions on Communications, vol. 41, No. 2, Feb. 1993, pp. 303 306.
|Patent Abstracts of Japan, vol. 018, No. 577, (E 1625), Nov. 4, 1994.
|Patent Abstracts of Japan, vol. 018, No. 577, (E-1625), Nov. 4, 1994.
|Patent Abstracts of Japan, vol. 095, No. 006, Jul. 31, 1995.
|Patent Abstracts of Japan, vol.095, No. 009, Oct. 31, 1995.
|PCT Search Report (Note:Not every reference listed above on PCT Search Report.).
|Video compression makes big gains , by Peng H. Ang, Peter A. Ruetz, and David Auld LSI Logic Corp., IEEE Spectrum Oct., 1991, pp. 16 19.
|Citing Patent
|Filing date
|Publication date
|Jul 9, 1999
|Sep 9, 2003
|Ati International Srl
|Motion compensation device
|Oct 28, 2002
|Oct 10, 2006
|Hewlett-Packard Development Company, L.P.
|System and method for estimating motion between images
|Sep 21, 2010
|Thomson Licensing
|Low noise encoding and decoding apparatus and method
|Jul 12, 2011
|Nvidia Corporation
|Low dynamic range 3-channel color decompression
|Aug 7, 2012
|Altek Corporation
|Image compression method with variable quantization parameters and variable coding parameters
|Oct 28, 2002
|Apr 29, 2004
|Andrew Patti
|System and method for estimating motion between images
|Dec 15, 2004
|Sep 1, 2005
|Haoping Yu
|Low noise encoding and decoding appratus and method
|Dec 29, 2011
|Altek Corporation
|Image compression method with variable quantization parameters and variable coding parameters
|Sep 26, 2001
|Apr 2, 2003
|Chih-Ta Star Sung
|Video encoding or decoding using recompression of reference frames
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Aug 12, 1997
Owner name: THOMSON CONSUMER ELECTRONICS, INC., INDIANA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YU, HAOPING;CANFIELD, BARTH ALAN;BEYERS, BILLY WESLEY, JR.;AND OTHERS;REEL/FRAME:008665/0443;SIGNING DATES FROM 19970703 TO 19970808
|May 4, 2004
|Fee payment
Year of fee payment: 4
|May 8, 2008
|Fee payment
Year of fee payment: 8
|May 3, 2012
|Fee payment
Year of fee payment: 12


text:
The fanciful scrolling on our wooden Keeping Room Shelf adds a touch
of detail to please the eye. Designed with a plate rail and bottom dowel
to hold your favorite table square or antique textile. Distressed Black
over Red Finish. 25"w by 23½"h by 7"d.
This item ships directly from our vendor's workshop. Please allow up to 4-6 weeks for delivery.
***Proudly made in the USA exclusively for Circa Home Living.***
Also shown:
Pewter Plates found here.

subset: commoncrawl


text:
Sabye Bangkok Hotel Accommodation & Rooms
- Free breakfast and free WiFi
Main amenities
- 22 guestrooms
- Restaurant
- Airport pick-up service
- Childcare
- 24-hour front desk
- Coffee/tea in a common area
- Air conditioning
- Daily housekeeping
- Front desk safe
- Laundry service
- Free newspapers in the lobby
- Luggage storage
For families
- Babysitting or childcare
- Babysitting or childcare (surcharge)
- Rollaway/extra beds (surcharge)
- Free toiletries
- Hydromassage showerhead
- Daily housekeeping
What's around
- In Banglamphu
- Khao San Road (0.5 mi / 0.9 km)
- Temple of the Emerald Buddha (1.1 mi / 1.8 km)
- Grand Palace (1.2 mi / 2 km)
- Wat Pho (1.6 mi / 2.6 km)
- Wat Ratchanadda (0.7 mi / 1.2 km)
- Bangkok (DMK-Don Mueang Intl.) 28-min drive; 17 miles/27.4 km
- Bangkok (BKK-Suvarnabhumi Intl.) 45-min drive; 25.8 miles/41.5 km
- Bangkok Chitrlada Station 11-min drive; 2.7 miles/4.4 km
- Bangkok Samsen Station 12-min drive; 3.3 miles/5.2 km
- Bangkok Railway Station 12-min drive; 3 miles/4.8 km
- Airport pick-up service
Sabye Bangkok Hotel Accommodation & Roomsfrom ZAR 317
- Superior Double or Twin Room
- Deluxe Double Room
- Superior Triple Room, Balcony
- Superior Double or Twin Room, Balcony
Recommended hotels
At a glance
Key facts
Hotel size
- This hotel has 22 rooms
- This hotel is arranged over 2 floors
- Check-in time 2 PM-2 AM
- Check-out time is noon
- Express check-in/out
Required at check in
- Credit card or cash deposit required
- Government-issued photo ID required
Travelling with others
- One child (10 years old and younger) stays free when occupying the parent or guardian's room, using existing bedding, but may not be eligible for free breakfast
- No cribs (infant beds)
- Babysitting/childcare *
- No pets or service animals allowed
- Free WiFi in public areas
- Free WiFi in rooms
Nearby Three Star Bangkok hotels
In the hotel
- Free breakfast
- Restaurant
- Coffee shop/café
- Coffee/tea in a common area
- 24-hour front desk
- Tours/ticket assistance
- Dry cleaning/laundry service
- Laundry facilities
- Free newspapers in lobby
- Luggage storage
- Number of buildings/towers - 1
- Year Built 2012
- Safe-deposit box at front desk
- Designated smoking areas
In the room
- Air conditioning
- Coffee/tea maker
- Blackout drapes/curtains
- Individually furnished
- Rainfall showerhead
- Free toiletries
- 32-inch LCD TV
- Pay movies
- Satellite TV channels
- Free WiFi
- Free bottled water
- Daily housekeeping
Top Bangkok hotels
Recently reviewed hotels in Bangkok
- Holiday Inn Express Bangkok SathornFrom
"Location close to BTS-Siloam Line; so easy to get around. 3min walk to Chong Nonsi BTS & 2 stops away from the riverside ferry terminal & 3 stops to the Siam shopping area.…"Oct 19, 2016
- Navalai River ResortFrom
"Location is fantastic. River boat pier is right on your door step which gives you access to the entire river and BTs system."Oct 16, 2016
- Compass Skyview HotelFrom
"I had a wonderful stay at Compass View hotel. The staff were incredibly friendly, welcoming and courteous throughout my visit. The view from my 22nd floor room was spectacular.…"Oct 14, 2016
- Amara BangkokFrom
"My stay at Amara was peaceful and after a tough day shopping Amara was a convenient place to relax. The hotel was clean and the staff were extremely helpful. The swimming areas…"Oct 14, 2016
Sabye Bangkok Hotel Accommodation & Rooms's small print
Also known as
- Hotel Sabye Bangkok
- Sabye
- Sabye Bangkok
- Sabye Bangkok Hotel
- Sabye Hotel
- Sabye Hotel Bangkok
Noise-free guestrooms cannot be guaranteed.
The name on the credit card used at check-in to pay for incidentals must be the primary name on the guestroom reservation.
Mandatory fees
Cash deposit: THB 1000 per stay
Optional extras
Late check-out can be arranged for an extra charge of THB 500
Refrigerators are available for an additional charge
Rollaway beds are available for THB 600 per night
Babysitting/childcare is available for an extra charge
Airport shuttle service is offered for an extra charge of THB 1500 per vehicle
We have included all charges provided to us by this hotel. However, charges can vary, for example, based on length of stay or the room you book.
More great choices
Recent reviews
Good 3.5 /5 from 37 reviews
Extremely unfriendly and unhelpful staff, many better hotels at cheaper prices, would not stay here again
Sabye Bangkok is right in the heart of Banglamphu, minutes away from Khao San road and down two local streets with an abundance of delicious street food, massage parlors, and other local shops. Being centrally located, it offers a quick walking access to most major attractions (20 mins to either the Golden Mount or Grand Palace) without the added noise at night. It's not a five star hotel by any means, but for the price you absolutely cannot beat it.
Great value for money. Comfortable and clean and good service. Little in the way of air conditioning and the breakfast is not much to speak of, but for an economy hotel - this is a great pick.
I felt very welcome the whole time I was there, the staff are exceptional and I must thank the lady on reception for helping me with my Thai. Breakfast was very good and was served up until 10.30 which is great if you have trouble waking up. The hotel itself, although not close to the subway, is in an interesting location, if you like to see the local people and how they live, this is a great place to be, also there are lots of places to get local food and, if you want it, western food. The room was very comfortable and surprisingly big, with all the conveniences you need, including a safe and a kettle/tea and coffee. I had a very pleasant stay here and I would definitely return.
The hotel is a little past it's prime, but the location is fantastic. A few minutes walk from Khao San Road, but on a quiet street. The breakfast was lovely.
Is the description of this hotel not correct? Tell us


text:
Tanner Interviews Girl Meets World's Sabrina Carpenter About Her EVOLution TourCheck out Tanner's interviews Sabrina Carpenter about her EVOLution tour. In the interview they talk about The Dallas Cowboys, Whataburger, Her EVOLution tour, and 'Girl Meets World'. Tanner even asked her questions tweeted in by Sabrina's fans!
Katy Perry Responds To A Fan Who Said Her Career Is OverKaty Perry isn't shy about calling people out. We know that from all the Taylor Swift drama.
Drake And Future's Tour Bus Robbed Of $2 Million Worth Of JewelryHow does something like this happen!
Spice Girls And Backstreet Boys Tour Isn't Happening After All!This breaks our hearts!
Justin Bieber Breaks Down And Cried On Stage The Other NightJustin Bieber shed a few tears during a performance of his song "Purpose" during a concert at Philadelphia's Wells Fargo Arena on Saturday, May 7.
What Hit Song Will Selena Gomez Will Not Perform on Tour
Another Tour Cancelled Stop in North Carolina
It Looks Like The Spice Girls Are Going To Have A Reunion Tour
Report: Gwen Stefani Visits Blake Shelton's New Lake Texoma HomeBlake Shelton's new home on the Texas-Oklahoma border is almost finished and that new girlfriend Gwen Stefani has received a tour. It's multi-level with a view of Lake Texoma and only an hour away from his hometown of Ada, Oklahoma.
YES!! The Dixie Chicks Have Announced Their First U.S. Tour In 10 Years!!
EXCLUSIVE: Bea Miller Discusses Her New Album And Her Dream CollaborationShe's coming to town Aug. 5th with Fifth Harmony!
Katy Tiz Is Personally Inviting You To Her Dallas Show Tomorrow!Join us for a poolside performance!


text:
This weekend, Arizona is scheduled to have six official visitors in town and one of the headliners will be 6-foot-0, 226-pound Los Angeles Leuzinger inside linebacker Uona Kavienga.
UCLA commit to visit Arizona this weekend
Premium Content
Subscribe today to read the full article and get everything Rivals has to offer.
- Member-only message boards
- Exclusive highlights and recruiting interviews
- Exclusive coverage of Rivals Camp Series
- Breaking recruiting news


text:
I recently received an email from a reader, J.W., who wanted to know why the tracking error on some popular Vanguard international equity ETFs were so high in 2014. He noted, for example, that the Vanguard FTSE Developed ex North America (VDU) lagged its benchmark index by 1.62% last year, far more than one would expect.
An index fund's tracking error is the difference between the performance of the fund itself and that of its benchmark. If the index returns 10% on the year and the fund delivers 9.8%, the tracking error is 0.20%, or 20 basis points. But what could possibly cause a fund to show a tracking error of 162 basis points?
Any time you see a surprising number like this, it's important to determine the reason: otherwise you risk making a bad decision because you're working with inaccurate or misleading information. If an index were to lag its benchmark by more than 1.6% because it was badly managed, then you should look for a better alternative. But Vanguard has a long record of tight tracking error, so something else has to be going on here—and indeed it is.
Back on track
To understand VDU's large tracking error—and why it's not as bad as it looks—let's look at the reasons its performance deviated so far from the index.


text:
Religion & Spirituality, ChristianityFollow
Koinonia House Podcast
January 5th, 2015
Episode 133 of 234 episodes
January 05, 2015 - Faithfulness vs. Unfaithfulness - khouse.org
You'll need to sign in to write a comment.
Jessica Helfand and Michael Bierut explore how design works within complex organizations to shape decisions, ideas, products, and more. Guests include clients from many industries and designers in many fields. Recorded at the Yale School of Management.


text:
MLB Games
AL Division Series: New York Yankees at Baltimore Orioles
122 of 180 | Show all photos
Baltimore Orioles' Matt Wieters, center, celebrates with teammates after hitting a grand slam in the tenth inning of a baseball game against the Tampa Bay Rays on Thursday, April 18, 2013, in Baltimore. Baltimore won 10-6 in ten innings. (AP Photo/Patrick Semansky)


text:
Vic Fangio's defense has presented plenty of new concepts for rookie linebacker Corey Lemonier. Used to putting his hand in the dirt, the 49ers third-round pick is learning how to take pass drops, make pre-snap reads and be able to adjust on the fly. Making the transition from defensive end to outside linebacker has been difficult, but Lemonier has embraced his new role...
Lemonier Embraces Position Change
From 49ers.com
Use your ← → (arrow) keys to browse more stories
Jason O. Watson/Getty Images


text:
Can I use a 3D map without installing a 2D map, or they just work together?
Ok ., now I tested for you.
Left(Gmapdem only) - Right (Gmapdem with CNEU 2011.20 )
In which file contains the 3D buildings?
Last edited by pipo99; 15th December 2010 at 04:44 PM.
You have to navigate to get to the good.
[Only registered and activated users can see links. ] Password for my files: gpspower.net
Please don't flood my pm box with questions you can post on forum!! You won't hear back from me.
Galaxy S5 Kitkat 4.4.2 / Nuvi1200->1250 / Nuvi3790T->34xx / Nuvi 2200 / Nuvi 66 / Oregon 600


text:
September 26, 2016
| Video
NAILS Next Top Nail Artist S. 4 challenge #3 sponsored by Gel II asked contestants to show us what they treasured most. Here is Tracy Vinson's entry. Click here to see all 10 entries.
September 11, 2016
| Blog Post
Rosa Vargas, Palm Springs, Fla.
July 1, 2016
| Video
Bana (@banicured_) shows a compilation of simple 4th of July nail art designs.
July 1, 2016
| Nail Bytes
O Canada!
July 1, 2016
| Blog Post
Delee Dennison, Simplicity by Design, Terrace, British Columbia, Canada
June 29, 2016
| Nail Bytes
Get ready for some fireworks.
June 22, 2016
| Video
Here's an easy polka dot design using a dotting tool with Essie polish.
July 4, 2015
| Video
Probelle shows how to create splattered paint nails in red and a negative space ripped jeans effect in white and blue to celebrate a laid-back 4th of July weekend.
Robin Moses shows how to create a nail art design perfect for the 4th of July.
July 3, 2015
| Video
Julie Ventura shows an intricate Independence Day nail art design.
June 30, 2015
| Blog Post
Follow this Fourth of July step-by-step by nail tech Kimberly Harr.
May 25, 2015
| Blog Post
Share your patriotism with client's by offering a stars and stripes design.
May 26, 2014
| Blog Post
Patriotic nail art for Memorial Day 2014.
July 4, 2013
| Step By Step Demo
Tanaira Carrington creates this gel nail that's full of red, white, blue, and bling.
June 13, 2013
| Article
LCN educator Gail Eddy created this fun patriotic nail design to celebrate Independence Day featuring gels, stamps, and free-hand brushing techniques.
Kym Lee, a Look Back in Pictures14 photos
Celebrity Nails: Awards Season 201652 photos
Learn More
What are reasonable terms for a non-compete contract?
How do I announce to my clients that I will be moving to a new salon?
The new products I'm using are adding time to each appointment. How do I adjust my schedule?
Why isn't my Gelish application curing properly?
What's the cause of the pinkish-red oval area on the pad of my client's toes?
Featured Products & Promotions | Advertisement
How big is the U.S. nail business? $7.3 billion. What's the average service price for a manicure? Dig into our decades' deep research archives.
View All
VietSalon is a Vietnamese-language magazine and the sister publication to NAILS. Click the link below to sign up for a FREE one-year subscription.
Get a free preview issue and a Free Gift
Subscribe Today!


text:
Tufts in the News
Publication date: Thursday, October 20, 2016
Associated Press
Tufts and the U.S. Army have co-founded the Center for Applied Brain and Cognitive Sciences, which opened on Oct. 18.
Publication date: Thursday, October 20, 2016
Washington Post
This opinion piece references a recent CIRCLE survey that found Democratic presidential candidate Hillary Clinton leads among young voters.
Publication date: Thursday, October 20, 2016
Huffington Post
Nutrition expert Patrick Webb co-wrote a report that found poor diets pose a greater "health risk than unsafe sex, alcohol, drugs and tobacco use combined."
Publication date: Thursday, October 20, 2016
The Conversation
Sameer Sonkusale from the School of Engineering writes about newly developed smart threads that can be stitched into body tissue to gather real-time diagnostic data.
Publication date: Wednesday, October 19, 2016
Boston Globe
Television journalist David Gregory is teaching a seminar this fall at Tufts as a Tisch College professor of the practice.
Publication date: Wednesday, October 19, 2016
The Conversation
The Fletcher School's Jonathan Brookfield writes this piece advising Western firms how to invest and succeed in China.
Publication date: Tuesday, October 18, 2016
Boston Globe
GDAE"s Anne-Marie Codur discusses Massachusetts ballot Question 2, which focuses on the expansion of charter schools.
Publication date: Monday, October 17, 2016
New York Times
Room for Debate blog
Tisch College's Peter Levine writes about the value of civics education.
Publication date: Sunday, October 16, 2016
Washington Post
Tufts Medical Center's Helen Boucher talks about artificial joints.
Publication date: Sunday, October 16, 2016
Boston Magazine
Nutrition expert Alice Lichtenstein offers advice on digesting the continuous release of nutritional information due to research.


text:
Annexation of the Crimea to Russia to not affect oilseeds production in Ukraine – expert
Annexation of the Crimea to the Russian Federation will not significantly affect the production volumes of the major oilseeds in Ukraine because the reporting region usually produced nearly 1% of the general harvest of Ukrainian sunflower seed, 1.2% of Ukrainian soybeans, and 0.7% of Ukrainian rapeseed, forecasted Yuri Lupenko, Director of the National Scientific Center Institute of Agrarian Economics, on March 26.
Also, Y.Lupenko forecasted that in 2014 the planted areas under oilseeds in Ukraine will remain at the previous year level.
At the same time, it is expected that sunflower seed planted areas in the current year will decrease to 4.95 mln ha, as opposed to 5.089 mln ha last year. In such terms the harvest of sunflower seed will decrease by 5.9% to 10.4 mln tonnes, against 11.1 mln tonnes in 2013, said the expert.
He added that in terms of the optimistic scenario (with the average yield of 2.21 t/ha) the harvest of sunflower seed will reach 10.9 mln tonnes, or remain almost at the level of 2013 (98.9%). In terms of the pessimistic scenario in 2014 Ukraine will not produce more than 9.9 mln tonnes of the oilseed (89.3% compared with 2013).
In the current year the planted areas under soybeans in Ukraine will increase to 1.477 mln ha, against 1.351 mln ha in 2013. At the same time, the production volumes will grow by 9.7% - to 3 mln tonnes. There is not expected increasing of rapeseed production in 2014. According to the forecast, the oilseed production in Ukraine will total 2.3 mln tonnes, down 2.6% compared with 2013, summed Y.Lupenko.
You should be authorized to post comment
In January-August, Ukrainian agricultural exports exceeded 9 bln USD – Ministry of Agrarian Policy
Yesterday, 17:40
Ukrainian port terminals have significant resources for further development – expert
Yesterday, 16:45
In 2016/17 MY, Ukraine to keep its leading positions in the global production and exports of sunflower oil – Ukroliyaprom
Yesterday, 12:40
Session part of the conference "Fat-and-Oil Industry - 2016" started in Odessa
Yesterday, 11:20
"Fat-and-Oil Industry - 2016" started with opening of a new tank complex at LLC NE Terminal UPSS
Yesterday, 10:05


text:
Data starting to roll in now for 12/31/2012. Acadian bought another 194k shares.
Sentiment: Buy
Board is so quiet...
DLS Capital upped their ownership to 2.4M shares, another 5% increase in position. Good to see that the big holders are still adding.
quiet before the storm?
Sentiment: Strong Buy
Isn't it early for this to come out? Nice to see Acadian adding.
Haven't seen this mentioned, but Winbond, the number #3 customer for IMOS has seen its stock limit up 2 days in a row. DRAM is on fire which bodes very well for 1Q with 2 of IMOS' largest customers (MU ought to come back strong).
Hopefully update on the listing soon, and coverage from Cowen. Stock won't stay quiet, or cheap, indefinitely.
I bet we'll see more institutional holdings when there's more coverage.
I have been assuming that DRAM shipments right now are still relatively weak, but that they'll grow significantly through 2013. A lot of the price improvement has been constrained supply, but demand can't be too bad with these kinds of increases. What really excites me though, regarding Micron, is the increased sources of chips. Of course in the long term there's the possibility of business from Elpida and Rexchip when those mergers happen, but Inotera is new business that may be happening now, or very soon. Micron is starting to take all of Inotera's supply, when before they were taking something like half.
Also in the first and/or second quarters we'll be seeing WLCSP revenue from AKM, and may already be seeing more testing. The beginning part of the year will still be weaker due to seasonality, but I'm hoping that it's less weak than one would typically expect.


text:
Wednesday, June 25, 2014
Chris Sokoloski/South Strand News
Campers and counselors show off their art work at the Beck Recreation Center on June 19. Georgetown County Parks and Recreation hosts weekly summer camps at its recreation centers. The theme for the campers artwork was Under the Sea.
© 2016 South Strand News an Evening Post Industries company. All Rights Reserved.
Registration on or use of this site constitutes acceptance of our Terms of Service, Privacy Policy and Parental Consent Form.


text:
Like most websites Channel 4 uses cookies. In order to deliver a personalised, responsive service and to improve the site, we remember and store information about how you use it. This is done using simple text files called cookies which sit on your computer. These cookies are completely safe and secure and will never contain any sensitive information. They are used only by Channel 4 or the trusted partners we work with. How to manage cookies
In order to deliver an optimised service, Channel 4 uses cookies. These are simple text files which sit on your computer, and are only used by us and our trusted partners. To find out about managing cookies, please see our Cookies Policy.
Hi — we're nearly there! To complete your registration with us, please verify your email address.
Not you? Sign in or create an account
The mentors sample the cooking of 25 hopefuls - ranging from talented amateurs to professionals from some of Britain's best restaurants
1 min 45
1 min 46
1 min 40
1 min 32
2 mins 01
1 min 11
Inspired by Portuguese and Indian flavours
Cooks rustic Indian food with big flavours
Cooks unpretentious, seasonal local food
Cooks British dishes with an Asian twist
Prepares eclectic, generous food
Prepares rustic, wholesome soul food
Food blogger specialising in Malaysian cooking
A modern international style with a classic twist
Makes 'delicious food that is perfectly done'
Cooks food full of fresh, clean flavours
Has an experimental edge to his cooking
Cooks Modern British food with a twist
9 Episodes
30 Episodes
6 Episodes
30 Series, 1190 Episodes


text:
Product News: Electronic Components & Devices
FFC/FPC Connectors enable high-speed transmission.
Press Release Summary:
May 15, 2012 - Supporting high-speed serial interface technology for picture transmission and Next-Gen chip V-by-One® HS by THine, right-angle FH41 and vertical FH48 have ground terminal design, impedance-matched shielded FFC ground contacts, and transmission rates to 3.75 Gbps max using differential impedance of 100 ohm ±10%. Both 0.5 mm pitch, 2.5 mm above-the-board connectors come with ground terminals, are available for connection with impedance control and shielded FFC, and share common FPC layout.
Hirose Electric USA, Inc. - Simi Valley, CA
Original Press Release
Hirose FH41 and FH48 Series Enable High-Speed Transmission for Shielded FFC
Press release date: May 3, 2012


text:
Comment Re:Reading comprehension fail (Score 3) 31
China has claimed basically all the South China Sea, including parts that are within the Exclusive Economic Zones of other countries. So China has territorial disputes with Vietnam, Philippines, Brunei, Malaysia, Indonesia, as well as any nation sending its navy through "Chinese" waters. The China-Philippines dispute is the most prominent one due to the Philippines recent win against China at the Permanent Court of Arbitration as well as the 2012 Scarborough Shoal standoff where a Philippine Navy ship directly encountered "Maritime Surveillance" ships from China. China seems to come into conflict the most with the Philippines, probably in part due to the Philippines having a woefully ill-equiped military that is by far the weakest in the region.


text:
{"error":"Error In Input Values","msg":"The Town Name not in our Database"}
About us
Welcome Swayam Krishi Modern Farm
Swayam Krishi modern farm was started in 2004 with only 20 breeding rabbits. Initially it was only an experiment about Raring, Breeding and Marketing. We didn't have any great ambition about Rabbitry but once we started, the rabbits didn't give a chance to look back.
When we started Farming we didn't had any training or support. At that time we were very simple and didn't have any big investment. We wanted to start an animal husbandry with small investment and wanted to make the common man to earn little money as a side income.
By 2005 we understood maximum knowledge about Rabbit Farming and we started giving training. Slowly people were showing good interest about Rabbit Farming, we started delivering the breeding rabbits and assuring the people about marketing (buy back) then we started buying and exporting.
Today we are having a big network of Rabbit Farms and now our breeders are exceeding 250 members in 15 districts all over Karnataka.
Swayam Krishi modern farm is situated in Davanagere district head quarters. Everyday many people are getting information and training. People are visiting our Farm from all over South India.
We provide all kind of co-operation and guidance for those people who are interested in Rabbit Farming.
Rabbit Farming is a business which is related to agriculture and it is approved by the central Government.
powered by


text:
transcodingThe process of converting a media file or object from one format to another. Transcoding is often used to convert video formats (i.e., Beta to VHS, VHS to QuickTime, QuickTime to MPEG). But it is also used to fit HTML files and graphics files to the unique constraints of mobile devices and other Web-enabled products. These devices usually have smaller screen sizes, lower memory, and slower bandwidth rates. In this scenario, transcoding is performed by a transcoding proxy server or device, which receives the requested document or file and uses a specified annotation to adapt it to the client.
Stay up to date on the latest developments in Internet terminology with a free weekly newsletter from Webopedia. Join to subscribe now.
Webopedia's student apps roundup will help you to better organize your class schedule and stay on top of assignments and homework. Read More »List of Free Shorten URL Services
A URL shortener is a way to make a long Web address shorter. Try this list of free services. Read More »Top 10 Tech Terms of 2015
The most popular Webopedia definitions of 2015. Read More »
Java is a high-level programming language. This guide describes the basics of Java, providing an overview of syntax, variables, data types and... Read More »Java Basics, Part 2
This second Study Guide describes the basics of Java, providing an overview of operators, modifiers and control Structures. Read More »The 7 Layers of the OSI Model
The Open System Interconnection (OSI) model defines a networking framework to implement protocols in seven layers. Use this handy guide to compare... Read More »


text: Ghost Writers on the Page Posted on Jan 26, 2016 Years ago, I wrote this parody of the old Vaughn Monroe/Sons of the Pioneers song, 'Ghost Riders in the Sky." A great song deserves a parody, I figure, and here it is: https://youtu.be/0Z4kdQ34PoQ Just posted on YouTube. Great fun. Go comment! Posted in Language & Writing Humor {{Title}} Remove Change Death Politics Christmas Education Conservatives/Liberals Crime Movies Humor Mysteries Graduation Aging & Birthdays Predictions alcohol Arts Health Romance/Love Hot Button Issues Battle of Sexes Reviews Travel Censorship Political Limericks satire Cedar Valley Chronicles Satire Meth Reviews Aging and Birthdays Recipes and cooking Religiosity Language & Writing Nostalgia Personalities Death Holidays Recipes and cooking Music Done Donald Trump for President Posted on Aug 02, 2015 Here's this morning's Courier column--my take on Donald Trump and why he would make a great president. Satire, anyone? +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Universal agreement is as rare as humility these days, but lately seems to have emerged from pundits and politicians alike. All agree: Trump will never serve as our 45th President. No Air Force Trump/One. No White House with "TRUMP" emblazoned above it in 20-foot neon letters. No parade of Trump-ettes as First Ladies. Even the GOP, not known for its rational and level-headed candidates, agrees that their party is not suicidal enough to nominate him. He's never held office, he has no real political allies, he doesn't seem to know how to delegate, his power stems from wealth, not respect, they cluck. Picky, picky, picky. Come on, people. Trump would make a great American President. Why? Let me count the ways: (1) He's the loudest candidate ever. He doesn't talk so much as bellow. A typical American, let's face it. Or rather, stereotypical. Travelers in every country I've visited, and I've visited plenty, comment on how Americans raise noise levels. I've noticed it myself. Enter around a quiet bistro in Paris, a sedate pub in London, a street corner in Munich, and if there's a group of people shouting, laughing, hollering, and goofing off—who will they be? Invariably, Americans. We're the world's noisiest people, and Trump's the loudest of all. We deserve a President who's more like us than we are. (2) He shoots from the hip, or in his case, the lip. Again, that's America at its core: shoot first, ask questions later. The cowboy mentality is the most beloved and most common image of America we project, from the Marlboro man to Billy the Kid to Jesse James—outlaws and rogues all, and folk heroes to boot. All action, no reflection. They're cousins to gangsters, another American type who provoke the world's envy and anxiety—an unbeatable combination when it comes to grabbing headlines. That's where Trump usually resides. A gangster cowboy President. Yeeehaah. (3) He's richer than Croesus, the ancient billionaire Greek king who was eventually burned alive. Never mind, that won't happen to President Trump. Americans admire wealth, they seek it, they consider themselves millionaires-in-waiting. They're sure that really smart people who work hard get rich. The richer they get, the smarter and more hard-working they must be. Hence, they love Trump, and a Trump presidency would represent American wealth-worshippers perfectly. How much is Trump worth? Depends on who's counting. Trump says at least ten billion, whereas real accountants say fewer than three billion. That's still real wealth, no matter who's counting. (4) He answers to no one, thanks to his billions. As his campaign proves, he can say whatever he wants, whenever he wants, to whomever he wants, and not worry about going broke or to jail. Billionaires live in an ego bubble where everyone tells them what they want to hear. Those who question him get bullied off his stage, immediately, with name-calling and semi-false assertions spoken as full truth. We'd have a true bully-pulpit President. (5) Finally, and the best reason: Full-bore, all-out pride. Donald Trump, without doubt, is probably the proudest Presidential candidate in history. He trumpets his wealth, his accomplishments, his intelligence, his certainty that he's right. What a relief and contrast he presents to Obama, the diffident consensus-seeker. That alone will make him attractive to Obama haters. Of course some will object that pride means hubris, and that's the deadliest of the Seven Deadly Sins. Pooh-pooh. Pride is what made America exceptional, and Trump's pride will infuse America with a powerful national ego, a new insistence that we're the best, the most, the richest, the smartest, the utter center of the universe. If the GOP wakes up and actually nominates him, he'd likely win based on pride alone. President Trump would then make America grate again. Go comment! Posted in Humor satire Politics Hot Button Issues {{Title}} Remove Change Death Politics Christmas Education Conservatives/Liberals Crime Movies Humor Mysteries Graduation Aging & Birthdays Predictions alcohol Arts Health Romance/Love Hot Button Issues Battle of Sexes Reviews Travel Censorship Political Limericks satire Cedar Valley Chronicles Satire Meth Reviews Aging and Birthdays Recipes and cooking Religiosity Language & Writing Nostalgia Personalities Death Holidays Recipes and cooking Music Done


text:
Super Freeze
Univcoda AS
- August 18, 2011
( 73)
Andy's Breakout(block, brick breaker, arkanoid) is not just a classic breakout-style game. It is based on box2d physics engine, which makes game play more dynamic. It's great fun watching and crushing ice swings and other constructions in arkanoid game style.
New levels will come with next updates. I'm wating for your opinions and prompts how to make it even more fun!
Galaxy S I am loving this game. The levels are much more challenging than I had expected.
Asus Transformer Infinity ABSOLUTELY THE BEST Arkanoid-like game on the android market! Works seamlessly on my tablet and is so fun to play. And the sounds... AWOOOOOOOOOOOO
Can't see full screen Razr droid maxx ics
Engaging Needs some graphic polishing, but the gameplay is smooth and the concept is sound!
Lags out my phone very badly unlike any other app I've used. Would be nice to have an option to control w buttons since touch isn't always responsive.
Need to make it where u can start from the level u last played. Starting all over is stupid.
What's New
Minor bug fixed.


text:
Red Hot Chili Peppers' drummer Chad Smith has revealed that the group are set to play festivals again in 2011.
Speaking to Music Radar, the sticksman said that the group are halfway through recording a new album and they already have plans for live dates next year.
He said: "The Peppers have festival dates booked for the summer of 2011 already". Smith didn't specify when they were or whether they're in the UK.
Their last major festival appearance in the UK was at Reading and Leeds Festivals in 2007 to mixed reviews.


text:
The Worst Jobs in History (TV1, 11.00am). A number of UK comedians have developed second lives making documentaries, including Pythons Terry Jones and Michael Palin and, here, Tony Robinson, formerly known as Baldrick in Blackadder. His latest trick was debunking The Da Vinci Code, but he calls this series from 2004 his "light-bulb moment", one that gave him a way of explaining social history from the point of view of ordinary people doing the hard graft. He's since made another series, written a book, made a Christmas episode and has even taken the idea on the road. He starts with the Dark Ages (coin thralls, whatever they are, monks and guillemot egg collectors, whatever they are) and ends with the Victorians (tanners, navvies and mudlarks). At a more accessible timeslot, this would be great family viewing, so set the VCR.
Trent's Wildcat Adventures (TV2, 7.00pm). The guy from The Zoo has got his own show, in which he gads about South Africa getting close to wild cats. Tonight, he meets animal wranglers at a country lodge that is a location for film and TV.
Shortland Street (TV2, 7.00pm). Unfortunately for Amanda Billing, Shortland Street's storyliners have turned her character, Sarah Potts, into a self-absorbed witch with a "b". Fortunately for us, she does a mean drunk and gets to embarrass herself heaps, which means a lot of sucking up to do this week after a disastrous staff party. In other plot developments, Mark and Tania have been getting close again, but mum Yvonne is suspicious of Mark, and Alice's mum has been
Final 24 (TV1, 8.30pm). Final 24 picks over the bones of punk icon Sid Vicious, who died from a heroin overdose in 1978 following his release from Rikers Prison in New York on bail for the murder of girlfriend Nancy Spungen. A theory is put forward in the doco that it wasn't a self-administered overdose – it was his mother that did it. Eek.
Coronation Street (TV1, 7.30pm). Fiz punches Kirk. Fiz punches Molly. Nathan punches Ashley. And Cilla gets time away from the chippy to go to the registry office with Les. Ee, there'll be a lot of
skriking on the Street tonight.
Honey, We're Killing the Kids (TV3, 7.30pm). Bad parents! Bad! Nothing like being lectured on national TV to make you change your dietary habits. The BBC format that shows parents images of their kids as grown-up fatties comes to New Zealand. Pies now means heart disease and obesity later, so Dr Louise Schofield is on hand to sort out their lifestyles.
Bad Girls (TV1, 8.30pm). A typically melodramatic ending for the series that is, apparently, a favourite of real New Zealand prisoners. That and Prison Break, we suppose. Over the two-hour finale, a new villain comes to Larkhall – an interior design goddess called (no, not Martha) Catherine Earlham, who manipulates Darlene. Meantime, in a coincidentally topical storyline, Julie S is fighting to get Herceptin.
Freestyle: The Art of Rhyme (C4, 8.30pm). More fun for hip-hop fans, a 2000 film that documents the art of improvisational rap from the early 1980s to quite recently. It's described as a "short, scrappy documentary" by the New York Times, which praised it for being a celebration of verbal artistry and not nasty gangstas. Kevin Fitzgerald, aka DJ Organic, spent seven years on the project, linking freestyling to (isn't this where everything started?) the church as well as jazz maestros such as John Coltrane and Thelonious Monk. The film contains many "battle" scenes, à la 8 Mile, where those who can compose "off the dome". In other music TV news, C4 is extending its hours, starting at 9.00am on Saturday and beginning at the earlier time of 2.00pm on weekdays.
bro'Town (TV3, 8.00pm). The Morningside crew say goodbye tonight with, appropriately, a barbie at the beach. Aw.
Prison Break (TV3, 9.30pm). This year's most implausible show? Maybe, but it still saw off The Sopranos in this time- slot. The show's title might be a giveaway as to how the season ends but, of course, the fun is in the journey. After seeing the breakout last week, we get to find out who makes it to the big wide world, which is a great set-up for season two.
America's Hardest Prisons (National Geographic, 9.30pm). Cameras follow inmates and officers in the maximum security Wabash Valley Correctional Facility, Indiana, where violence bubbles continually among some of the worst criminal offenders in the US. During this episode, officers investigate the stabbing of a child killer in the yard, there's a weightlifting competition and an inmate is overpowered by guards when he refuses to return to his cell. Scary stuff.
The West Wing (TV1, 11.15pm). A funny little meta-narrative about how TV uses guest stars to bolster ratings, in much the same way that politicians like to be seen with celebrities. In tonight's episode, the Santos campaign meets up with Rock the Vote and Jon Bon Jovi guest stars.