Yunnan Wu

6996294, Feb 7, 2006

Oct 18, 2004

10/967604

Cha Zhang - Pittsburgh PA, US
Jin Li - Princeton NJ, US
Yunnan Wu - Redmond WA, US

Microsoft Corporation - Redmond WA

G06K 9/36

382284, 382248, 345427, 345619, 348 36

Rebinning methods and arrangements are provided that significantly improve the 3D wavelet compression performance of the image based rendering data, such as, e. g. , concentric mosaic image data. Through what is essentially a selective cutting and pasting process the image data is divided into stripes that are then used to form a set of multi-perspective panoramas. The rebinning process greatly improves the performance of the cross shot filtering, and thus improves the transform and coding efficiency of 3D wavelet codecs. While the region of support after rebinning may cease to be rectangular in some cases, a padding scheme and an arbitrary shape wavelet coder can be implemented to encode the result data volume of the smart rebinning. With an arbitrary shape wavelet codec, the rebinning outperforms MPEG-2 by 3. 7 dB, outperforms direct 3D wavelet coder by 4.

7065260, Jun 20, 2006

Oct 13, 2004

10/963882

Cha Zhang - Pittsburgh PA, US
Jin Li - Redmond WA, US
Yunnan Wu - Princeton NJ, US

Microsoft Corporation - Redmond WA

G06K 9/36

382284, 382248, 382154, 348 36

Rebinning methods and arrangements are provided that significantly improve the 3D wavelet compression performance of the image based rendering data, such as, e. g. , concentric mosaic image data. Through what is essentially a selective cutting and pasting process the image data is divided into stripes that are then used to form a set of multi-perspective panoramas. The rebinning process greatly improves the performance of the cross shot filtering, and thus improves the transform and coding efficiency of 3D wavelet codecs. While the region of support after rebinning may cease to be rectangular in some cases, a padding scheme and an arbitrary shape wavelet coder can be implemented to encode the result data volume of the smart rebinning. With an arbitrary shape wavelet codec, the rebinning outperforms MPEG-2 by 3. 7 dB, outperforms direct 3D wavelet coder by 4.

7110617, Sep 19, 2006

Oct 18, 2004

10/967472

Cha Zhang - Pittsburgh PA, US
Jin Li - Redmond WA, US
Yunnan Wu - Princeton NJ, US

Microsoft Corporation - Redmond WA

G06K 9/36

382284, 382154, 348 36

Rebinning methods and arrangements are provided that significantly improve the 3D wavelet compression performance of the image based rendering data, such as, e. g. , concentric mosaic image data. Through what is essentially a selective cutting and pasting process the image data is divided into stripes that are then used to form a set of multi-perspective panoramas. The rebinning process greatly improves the performance of the cross shot filtering, and thus improves the transform and coding efficiency of 3D wavelet codecs. While the region of support after rebinning may cease to be rectangular in some cases, a padding scheme and an arbitrary shape wavelet coder can be implemented to encode the result data volume of the smart rebinning. With an arbitrary shape wavelet codec, the rebinning outperforms MPEG-2 by 3. 7 dB, outperforms direct 3D wavelet coder by 4.

7324604, Jan 29, 2008

Jun 24, 2003

10/602743

Andreas Molisch - Arlington MA, US
Yunnan Wu - Princeton NJ, US
Sun Y. Kung - Princeton NJ, US

Mitsubishi Electric Research Laboratories, Inc. - Cambridge MA

H04K 1/02

375296, 370319

A method and system shapes a spectrum of an impulse radio signal, such as an UWB signal. First, basis pulses at various frequencies and pseudo-random delays are generated. The generated set of basis pulses are then weighted and delayed, and combined linearly to conform the spectrum of the transmitted basis pulses to a spectral mask. The spectral mask can be predetermined, or the conforming can be adaptive. Furthermore, the basis pulses can be frequency-shifted before the combining.

7693939, Apr 6, 2010

May 7, 2007

11/745340

Yunnan Wu - Redmond WA, US
Saumitra M. Das - West Lafayette IN, US
Ranveer Chandra - Kirkland WA, US
Dinei Florencio - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 15/16

709203, 709238, 709241, 709242, 370400, 370351

Context-based routing in multi-hop networks involves using a context-based routing metric. In a described implementation, respective path values are calculated for respective ones of multiple paths using the context-based routing metric. A path is selected from the multiple paths responsive to the calculated path values. Data is transmitted over at least one link of the selected path. In an example embodiment, the context-based routing metric is ascertained responsive to an estimated service interval (ESI) of a bottleneck link of each path of the multiple paths. In another example embodiment, the context-based routing metric is ascertained responsive to an expected resource consumption (ERC) metric. In an example embodiment of path selection, the path is selected using a context-based path pruning (CPP) technique that involves maintaining multiple local contexts at each intermediate node, with each local context representing at least one partial path.

7760728, Jul 20, 2010

Aug 4, 2008

12/185720

Philip A. Chou - Bellevue WA, US
Yunnan Wu - Redmond WA, US
Kamal Jain - Bellevue WA, US

Microsoft Corporation - Redmond WA

H04L 12/28
H04L 12/56
H04J 3/26
H04J 3/24

370390, 370432, 370473

A system and method that can receive, buffer, and asynchronously combine data from various incoming data packets is disclosed. The system and method can do so by, first, receiving incoming packets of one or multiple generations that have incoming data and incoming metadata, with the incoming data of each of the incoming packets that are of a first generation being a combination of a first, original set of data vectors, and the incoming metadata of each of the first generation of incoming packets including an indicator for the first generation. Second, once these incoming packets are received, the system and method can buffer them based on the indicator and, asynchronously from the receiving and buffering, combine the incoming data in the buffered, first generation incoming packets into outgoing data in an outgoing packet.

7876786, Jan 25, 2011

Apr 2, 2008

12/061577

Paramvir Bahl - Sammamish WA, US
Ranveer Chandra - Kirkland WA, US
Gopala Sri Hari Narlanka - Bellevue WA, US
Yunnan Wu - Redmond WA, US
Yuan Yuan - Greenbelt MD, US

Microsoft Corporation - Redmond WA

H04J 4/00

370478, 370344, 370348, 370443, 370447

Dynamic time-spectrum block allocation for cognitive radio networks is described. In one implementation, without need for a central controller, peer wireless nodes collaboratively sense local utilization of a communication spectrum and collaboratively share white spaces for communication links between the nodes. Sharing local views of the spectrum utilization with each other allows the nodes to dynamically allocate non-overlapping time-frequency blocks to the communication links between the nodes for efficiently utilizing the white spaces. The blocks are sized to optimally pack the available white spaces. The nodes regularly readjust the bandwidth and other parameters of all reserved blocks in response to demand, so that packing of the blocks in available white spaces maintains a fair distribution of the overall bandwidth of the white spaces among active communication links, minimizes finishing time of all communications, reduces contention overhead among the nodes contending for the white spaces, and maintains non-overlapping blocks.

7929623, Apr 19, 2011

Mar 30, 2007

11/731269

Amer A. Hassan - Kirkland WA, US
Christian Huitema - Clyde Hill WA, US
Wayne Stark - Redmond WA, US
Yunnan Wu - Redmond WA, US
Philip Andrew Chou - Bellevue WA, US

Microsoft Corporation - Redmond WA

H04K 1/10

375260, 375295, 375316

A multiuser scheme allowing for a number of users, sets of user, or carriers to share one or more channels is provided. In the invention, the available channel bandwidth is subdivided into a number of equal-bandwidth subchannels according to standard OFDM practice. A transmitter transmits data on a set of OFDM subchannels that need not be contiguous in the spectrum or belong to the same OFDM channel. A receiver receives and decodes the data and detects errors on subchannels. The receiver then broadcasts the identity of those subchannels on which the error rate exceeds a specific threshold, and the transmitter may select different subchannels for transmission based on this information.