Abstract: A framework is provided for reducing the number of locations modified when hiding data, such as a digital watermark, in binary data. The framework complements data hiding techniques, such as digital watermarking techniques. After determining potential embedding locations according to an underlying technique, a data structure is created with values associated with those locations. A parity calculation is performed on the values in the data structure. The calculated parity is compared with hidden data to determine locations for modifications. Manipulations are then performed to reduce the total number of modifications needed to represent the hidden data. Modifications are made to the binary data according to the underlying technique. During decoding of the hidden data, the same locations can be determined, the same data structure can be created with the modified values, and a parity calculation is then performed to decode the hidden data.

Abstract: Gain Saturation (GS) for MRFME is where searching in more previous frames offers very limited or even no performance gain. Similarly, gain aggregation (GA) is where significant gain can be obtained by searching more frames. By dynamically determining, while encoding, if either condition applies, and changing the search range accordingly, complexity is reduced and speed can be increased.

Abstract: A novel decentralized protocol for constructing a tree-based P2P live video streaming network with the Interior-Node-Disjoint (IND) multi-tree structure with the special Link-Level-Homogeneous property. The IND multi-tree structure recycles the wasted uploading capacities of leaf nodes in the tree-based P2P networks. The IND multi-tree structure also enhances the robustness of the tree-based P2P networks. Moreover, the special Link-Level-Homogeneous property eliminates the bottlenecks in the video delivery paths by ensuring that each downloading link in the network has identical bandwidth reserved. This special designed architecture greatly improves the downloading performance.

Abstract: Joint erasure marking and list Viterbi algorithm (JELVA), decoder schemes, methods, and systems are provided which perform robust trellis decoder techniques and do not require an estimate of the impulsive noise distribution. Joint Erasure marking and Viterbi Algorithm (JEVA) is integrated with the list Viterbi algorithm (LVA) to form two-dimensional joint erasure marking and list Viterbi technique (2D JELVA) and switched JELVA technique. By combining the respective strengths of the JEVA and the LVA, the integrated decoding schemes are able to achieve significant performance gains over JEVA and achieve a wide range of performance-complexity-delay tradeoffs, according to system design considerations. The disclosed details enable various refinements and modifications according to decoder and system design considerations.

Abstract: Motion estimation (ME) optimizations are provided for video encoding and compression processes that efficiently share data processing between host and graphics processing models. The optimizations take into account block level dependencies introduced by a corresponding encoding model, such as dependencies introduced by H.264/AVC among adjacent blocks. Arithmetic intensity of the graphics processing is adjustable to the underlying graphics hardware for further optimization, resulting in improved, real-time encoding of video data.

Abstract: A system and methodology for encoding or decoding hidden data, such as a digital watermark, in raster media is provided in delta domain, a domain that creates a high-pass version of the raster media. Hidden data, such as a watermark, can be embedded in the general smooth region (low variance region) while a strong edge is preserved. A Mean-Square Error (MSE) reduction can be obtained by embedding the watermark in the delta domain. Using checkerboard-pattern watermark sequences and the delta domain, at least half of the total pixels in the image remain unchanged after watermark embedding. In order to recover the hidden data, some side information can be conveyed, in-band or out-of-band, to a decoder, such as various parameters used when performing the method. If protection from attacks, such as a JPEG encoding attack is desired, a location map can be provided to assist with hidden data recovery.

Abstract: Systems and methodologies for lossless visible watermarking of images are provided herein. The provided systems and methodologies can utilize a Pixel Value Mapping Algorithm (PVMA), wherein a watermark can be embedded into an image by transforming respective intensities of areas of the image corresponding to the watermark using a bijective mapping function. Additionally and/or alternatively, a Pixel Position Shift Algorithm (PPSA) can be used to embed a watermark into an image by shifting the position of pixels in the image corresponding to the watermark over a specified shift distance. Further, provided systems and methodologies can facilitate enhanced watermarking security by embedding a visible watermark into an image based on a secret key.

Abstract: System and methodologies are provided herein for reconstructing a video signal from multiple video streams. Various aspects described herein can utilize a least square estimate (LSE) algorithm to jointly decode multiple video bitstreams that are generated from a common original video sequence at different bit rates. As described herein, the LSE algorithm can reconstruct an original video sequence by determining and computing a weighted sum of collocated video information reconstructed from different video bitstreams. The weights applied can be adaptively determined to minimize the mean square error (MSE) of the reconstructed video sequence as compared to the original.

Abstract: Based on maximum a posteriori (MAP) estimates, video denoising techniques for frames of noisy video are provided. With the assumptions that noise is similar to or satisfies Gaussian distribution and an a priori conditional density model measurable by bit rate, a MAP estimate of a denoised current frame can be expressed as a rate distortion optimization problem. A constraint minimization problem based on the rate distortion optimization problem is used to vary a lagrangian parameter to optimize the denoising process. The lagrangian parameter is determined as a function of distortion of the noise.

Abstract: A system and methodology for channel equalization are provided. According to one aspect, a receiver structure for a MIMO system is provided that employs frequency domain equalization (FDE) with noise prediction (FDE-NP). The FDE-NP structure may include a feedforward linear frequency domain equalizer and a group of time domain noise predictors (NPs), which may operate by predicting a distortion corresponding to a given linearly equalized data stream based on previous distortions of all linearly equalized data streams.

Abstract: A non-pervasive modification to radio frequency identification (RFID) tag antennas is provided that can double the tag's reading range distance. Parasitic elements, such as a reflector and one or more directors, are added at appropriate separations to form a Yagi antenna. As a result, the antenna's gain is increased and consequently so is the RFID tag's reading range. The tag antenna's gain can be achieved without directly connecting to or modifying the existing RFID tag. However, since directionality is increased, multiple RFID tags can be attached to an object so that the tagged object can be read from multiple directions.

Abstract: Antisense oligonucleotides that inhibit expression of human replication- initiation protein as well as methods of preventing or treating hyperproliferative conditions using said oligonucleotides are disclosed. One aspect provides an antisense oligonucleotide that inhibits the expression of human replication-initiation protein and has a sequence complementary to at least a portion of a target sequence encoding a human replication-initiation gene. By administering a therapeutically effective amount of an antisense oligonucleotide or by contacting the hyperproliferating cells with an effective amount of one or more antisense oligonucleotides, expression of replication-initiation protein is inhibited. Methods of screening and testing active antisense oligonucleotides for their ability to inhibit gene expression are also disclosed.

Abstract: Improved systems and methods for error concealment of multiple description coding (MDC) encoded streams are provided based on a three loop interpolation of lost frames. Error concealment of the present invention can be combined with the error resilience provided by MDC to reconstruct lost frames, such that the propagated error to the following frames is reduced.

Abstract: A system and methodology for encoding or decoding hidden data, such as a digital watermark, in visual raster media is provided. The lossless data hiding methodology uses multiple predictors to choose an embedding location to be either a low variance region or a high variance region. Bijective mirror mapping is used to encode hidden data at an embedding location and bijective pixel value shifting is performed to ensure reversibility back to the original image without additional information. The system and methodology can be used either in the spatial domain or the wavelet domain. The Peak Signal to Noise Ratio and the payload capacity are relatively high with the methodology.

Abstract: A system and methodology for concealing an error in a video signal is provided. In accordance with one aspect of the present invention, the system and methodology employ a Spatio-Temporal Boundary Matching Algorithm, which utilizes a distortion function that takes into account both the spatial and temporal smoothness properties of a video sequence. Further, the methodology for concealing an error in a video signal comprises receiving a video signal having an erroneous frame, creating a candidate set of motion vectors, selecting a motion vector from the candidate set of motion vectors that best keeps temporal and spatial continuity through the erroneous frame, and reconstructing the erroneous frame using the selected motion vector.

Abstract: An exponential charge pump uses a number of identical or similar charging stages, each having a first and second capacitor. During a first clock phase, the first capacitor of each stage is charged by the second capacitor of the preceding stage, and, during a complementary second clock phase, the positive plate of the first capacitor of each stage is pushed to an increased voltage by the first capacitor of the preceding stage and charges the second capacitor of the next stage to the increased voltage at the same time. A similar mechanism occurs to the second capacitors in each stage, but with complementary timing. The increased voltage of the first capacitor of the last stage is pumped to an output capacitor during the second clock phase, and the increased voltage of the second capacitor of the last stage is pumped to an output capacitor during the first clock phase.

Abstract: The invention provides a system and a method for evaluating a programming process. The programming evaluating system includes a programming module, a determining module, a recording module, and an evaluating module. A user can program a program via the programming module. The determining module is used for determining whether the program has passed a test to generate a determination. The recording module is used for recording a programming history during the programming process of the user and a program testing history during the testing process of the program. When an evaluator wants an evaluated result of the program, the evaluating module generates the evaluated result based on the programming history, the program testing history, and the determination.

Abstract: Cooperative concatenated coding techniques are provided for wireless communications between at least two users and a base station. A network system employing cooperative concatenated coding includes cooperating user devices each configured to encode and transmit at least a portion of a joint message. The joint message includes at least a portion of a first message from a first cooperating user device and at least a portion of a second message from a second cooperating user device. An embodiment includes encoding a first message from a first cooperating user, receiving a second message from a second cooperating user and decoding the second message. The methodology also includes re-encoding at least a portion of the decoded message with at least a portion of the first message to form a combined message, and then transmitting at least a portion of the combined message.

Abstract: A method for encoding video includes receiving data, and encrypting the data using at least four Huffman trees. A method for encoding video includes receiving data, and encrypting the data such that an internal state of a stream cipher is independent of plaintext and ciphertext. A video encoding system for encoding video in a computing environment includes means for accessing data, and means for encrypting the data such that there are approximately 2106 possibilities.

Abstract: For cognitive radio systems, the transmit power of a cognitive radio device is controlled so that the cognitive, unlicensed radio device does not interfere with the use of a shared spectrum by a primary, licensed device. Controlling the transmit power includes determining a distance, or a function of the distance, between a primary transmitter of the primary device and the cognitive radio device based on sensing information from a spectrum sensing process. The maximum transmit power of the cognitive radio device is then dynamically controlled based on the distance, or the function of the distance, while considering a worst case scenario of an underlying cognitive radio model, to guarantee a quality of service requirement of the primary device.