Abstract: Apparatus, systems and methods for recognizing and classifying events in a venue based on a wireless signal are disclosed. In one example, a disclosed system comprises a first transmitter, a second transmitter, at least one first receiver, at least one second receiver, and an event recognition engine, in the venue. The first transmitter transmits a training wireless signal through a wireless multipath channel impacted by a known event in the venue in a training time period associated with the known event. Each first receiver receives asynchronously the training wireless signal, and obtains, asynchronously based on the training wireless signal, at least one time series of training channel information of the wireless multipath channel between the first receiver and the first transmitter. The second transmitter transmits a current wireless signal through the wireless multipath channel impacted by a current event in a current time period associated with the current event.

Abstract: The present teaching relates to wireless Internet of Things. In one example, a time reversal client is disclosed. The time reversal client comprises a processor, a memory communicatively coupled with the processor, and a set of instructions, when executed by the processor based on the memory, that cause the time reversal client to perform the following steps: communicatively coupling with a time reversal server through a network, obtaining a set of channel state information (CSI), wherein the set of CSI is captured when at least one probing signal is sent from the wireless transmitter to the wireless receiver through a wireless multipath channel associated with a space, and causing the set of CSI to be sent to the time reversal server through the network.

Abstract: Methods, apparatus and systems for object motion detection are disclosed. In one example, a system having at least a processor and a memory with a set of instructions stored therein for detecting object motion in a venue is disclosed.

Abstract: Method, apparatus and systems for object tracking are disclosed. In one example, a disclosed method includes obtaining at least one time series of channel information (CI) of a wireless multipath channel using: a processor, a memory communicatively coupled with the processor and a set of instructions stored in the memory. The at least one time series of channel information is extracted from a wireless signal transmitted between a Type 1 heterogeneous wireless device at a first position in a venue and a Type 2 heterogeneous wireless device at a second position in the venue through the wireless multipath channel. The wireless multipath channel is impacted by a current movement of an object in the venue. The method also includes determining a spatial-temporal information of the object based on at least one of: the at least one time series of channel information, a time parameter associated with the current movement, and a past spatial-temporal information of the object.

Abstract: The present teaching relates to collecting and processing location-specific wireless waveforms for use in wireless communication, components, methods, apparatuses, servers, and systems. In one embodiment, a disclosed system comprises a first wireless transceiver of a first device, and at least one second wireless transceiver of at least one second device. The first wireless transceiver of the first device is wirelessly coupled to the at least one second wireless transceiver through a wireless multipath channel associated with a space. The first device with the first wireless transceiver comprises a processor and a memory, which are configured to obtain a set of channel information (CI) and perform a task associated with the space based on the set of channel information.

Abstract: A time-reversal wireless system comprising a first wireless transceiver of a time-reversal client, one or more second wireless transceiver and/or a time-reversal client with the first wireless transceiver. The first wireless transceiver of the time-reversal client is wirelessly coupled to the one or more second wireless transceiver through a wireless broadband multipath channel associated with a space. The time-reversal client contains the first wireless transceiver. The time-reversal client also contains a processor and a memory configured to obtain a set of channel state information (CSI) in a channel probing phase, and/or to obtain a set of location-specific signatures based on the set of CSI and/or a time reversal operation in a channel probing phase.

Abstract: Stream-switching techniques are applied in a content delivery system. A merge frame is generated as a function of bit-rates, distortion, and a piecewise constant operator. Parameters of the piecewise constant operator are selected to optimize the merge frame. Data streams are switched based on bandwidth requirements, switch requests, and throughput of a network. Images are reconstructed based on the merge frames and prediction frames. Reconstructed images are identically reconstructed for any prediction frame based on the merge frame.

Abstract: Provided is sub-block motion estimation that includes a full search with a reduced search area around a motion vector predictor. Also provided are a single (or unified) motion vector predictor and a function similar to a rate-distortion cost function. Also provided is a scanning order that can reduce or substantially eliminated redundant data loading and/or that can achieve different data re-use ratio. Further, provided herein is a reconfigurable multi-resolution motion vector re-use hardware architecture based on a single motion vector predictor and a function similar to a rate-distortion cost function. Further, through utilization of the disclosed aspects, only a small number of past motion vectors are propagated and the disclosed aspects can be reconfigured for video with different spatial resolution.

Abstract: A method and a computer-readable medium containing computer program for simultaneously performing rate control and video denoising for video corrupted by noise are presented. Video data includes original video data and noise data. A variance of the noise data for each macroblock within a frame is estimated. Based on the estimated noise variance, a low bound quantization parameter is generated. The video data are reconstructed such that the distortion between the original video data and reconstructed video data is minimized over each macroblock within a frame. The minimization of the distortion between the original video and reconstructed video data is implemented using a quantization parameter that is equal to or larger than the low bound quantization parameter.

Abstract: Stream-switching techniques are applied in a content delivery system. A merge frame is generated as a function of bit-rates, distortion, and a piecewise constant operator. Parameters of the piecewise constant operator are selected to optimize the merge frame. Data streams are switched based on bandwidth requirements, switch requests, and throughput of a network. Images are reconstructed based on the merge frames and prediction frames. Reconstructed images are identically reconstructed for any prediction frame based on the merge frame.

Abstract: Systems, methods, and apparatus for adaptively zeroing out transform coefficients utilizing a bit-stealing parameter are presented herein. A partitioning component can be configured to separate an image into blocks of video data. Further, a frequency transform component can be configured to transform pixels of a block of the blocks into transform coefficients. Furthermore, a bit-stealing quantization component configured to predefine quantization intervals. Moreover, the bit-stealing quantization component can modify a size of a quantization interval of the quantization intervals based on a variable bit-stealing parameter. Further, the bit-stealing component can quantize a transform coefficient of the transform coefficients, based on the quantization interval, to a quantized coefficient value of quantized coefficient values.

Abstract: Methods and systems for denoising embedded digital video decoding. Prediction and residue block of a current frame are obtained from motion vector. Variance of residue block is calculated using prior reference blocks, and a causal temporal linear minimum square error estimator is used to calculate a filter coefficient. The residue block is modified using the filter coefficient, and an output digital bitstream of blocks of pixels of the current frame is produced using the modified residue block and prior denoised prediction value of prior frames.

Abstract: Scalable Video Coding is recently attracting attentions due to its high flexibility. The current H.264/AVC scalable extension has adopted the Motion Compensated Temporal Filter (MCTF) framework to provide temporal scalability. In this paper, described is another fast motion estimation (ME) algorithm based on the MCTF framework. Simulation results show that the herein described algorithm can reduce the encoding complexity significantly while maintaining similar bit rate and PSNR, comparing with existing fast ME algorithms implemented in the reference software.

Abstract: Method, systems and software are proposed for obtaining for blocks of a first image similar blocks of a second image (the “reference image”). The blocks of the first image are processed sequentially, for each block trying out a number of candidate locations in the second image and evaluating a cost function for each. Each candidate location in the second image is displaced by a respective motion vector from the block of the first image. In a first aspect of the invention the cost function is a function of a predicted motion vector for future blocks of the first image (i.e. blocks of the first image which have not yet been processed). In a second aspect of the invention the motion vectors are given by location values which are not all whole pixel spacings, halves of the pixel spacing, or quarters of the pixel spacing.

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: Described herein is a novel transcoding technique called lossless inter frame transcoding (LIFT) for improving the error resilience of video streaming. According to various embodiments, conventional coded blocks are selectively transcoded into new transcoded blocks. At the decoder, the transcoded blocks can be transcoded back to the conventional coded blocks when prediction is available and can also be robustly decoded independently when prediction is unavailable. According to another embodiment, an offline transcoding and online composing technique is provided for generating a composite frame using the transcoded and conventional coded blocks and adjusting the ratio of the transcoded blocks, thereby achieving error robustness scalability.

Abstract: Systems, methods, and apparatus for sampling images using minimum mean square error subpixel-based down-sampling (MMSE-SD) are presented herein. A partition component can receive a first array of pixels, and divide the first array of pixels into two-dimensional (2-D) blocks of pixels. Further, a sampling component can diagonally down-sample subpixels of a block of the 2-D blocks, and generate a second array of pixels based on the down-sampled subpixels. The sampling component can alternately sample subpixels of adjacent pixels of the block in a diagonal direction, and generate the second array of pixels based on the subpixels. A reconstruction component can create a virtual image based on, at least in part, the second array of pixels. A MMSE-SD component can determine an optimal low resolution image based on, at least in part, respective color components of the virtual image and a high resolution image associated with the first array of pixels.

Abstract: Systems, methods, and apparatus for sampling images using edge detection are presented herein. A gradient component can calculate at least one gradient of a luminance of a block of pixels based on at least one direction; and select a minimum gradient of the at least one gradient of the luminance. Further, a direction component can determine a direction of the block based on a direction of the minimum gradient of the at least one gradient of the luminance. Moreover, a sampling component can alternately select subpixels of the block based on the direction of the block. In addition, a filter component can calculate at least one gradient of a color of a subpixel of the subpixels based on the at least one direction; determine a direction of the subpixel based on the at least one gradient of the color; and filter the subpixels based on the direction of the subpixel.

Abstract: Systems, methods, and apparatus for sampling images using minimum mean square error subpixel-based down-sampling are presented herein. A partition component can be configured to divide a first array of pixels into two-dimensional (2-D) blocks of pixels. A sampling component can be configured to receive a query from a device including information associated with a display of the device; diagonally down-sample subpixels of a block of the 2-D blocks and generate a second array of pixels based on the down-sampled subpixels and the query. The sampling component can communicate at least a portion of the second array to the device based on the query. The information associated with the display can include a dimension associated with the display. Further, sampling component can be associated with a web browser; and the query can include an internet based query.

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.