Abstract: Embodiments of the invention disclose a system and a method for determining a nearest neighbor to an input data point on a non-Euclidean manifold. The data points on the non-Euclidean manifold are clustered, projected into Euclidean sub-space nearest to the cluster and mapped from the Euclidean sub-space into a Hamming space such that neighboring data points of the Hamming space corresponds to neighboring data points on the non-Euclidean manifold. The method maps the input data point to the Hamming space corresponding to a particular Euclidean sub-space, wherein the particular Euclidean sub-space is the nearest to the input data point, and selects a data point corresponding to a nearest data point to the input data point in the Hamming space as the nearest neighbor for the input data point on the non-Euclidean manifold.

Abstract: A 3D object is represented by a descriptor, wherein a model of the 3D object is a 3D point cloud. A local support for each point p in the 3D point cloud is located, and reference x, y, and z axes are generated for the local support. A polar grid is applied according to the references x, y, and z axes a along an azimuth and a radial directions on an xy plane centered on the point p such that each patch on the grid is a bin for a 2D histogram, wherein the 2D histogram is a 2D matrix F on the grid and each coefficient of the 2D matrix F corresponds to the patch on the grid. For each grid location (k, l), an elevation value F(k, l) is estimated by interpolating the elevation values of the 3D points within the patches to produce the descriptor for the point p.

Abstract: Embodiments of the invention disclose a system and a method for generating an output video having a first temporal resolution from input videos acquired synchronously of a scene by at least three cameras, wherein each input video has a second temporal resolution, wherein the second temporal resolution is less than the first temporal resolution. The method obtains frames of each input video, wherein the frames are sampled according to a code selected such that an integration time of the corresponding camera is greater than a frame time of the output video. Next, the method combines intensities of pixels of corresponding frames in a linear system; and solves the linear system independently for each corresponding frame to generate the output video.

Abstract: A method and system recognizes an unknown speaker by directing an ultrasonic signal at a face of the unknown speaker. A Doppler signal of the ultrasonic signal is acquired after reflection by the face, and Doppler features are extracted from the reflected Doppler signal. The Doppler features are classified using Doppler models storing the Doppler features and identities of known speakers to recognize and identify the unknown speaker.

Abstract: A base station transmits a set of sounding requests to a set of mobile station (MS) in a cell, using a set of beams, wherein there is one beam for each sounding request. Qualities of sounding signals transmitted by the set of MSs in response to receiving the sounding request are measured, and the set of MSs are grouped into subsets according to the qualities, wherein there is one subset of MSs associated with each beam.

Abstract: A method filters a depth image, wherein each depth image includes an array of pixels at locations (x, y), and wherein each pixel has a depth. A moving window is applied to the pixels in the depth image, wherein a size of the window covers a set of pixels centered at each pixel. A single representative depth from the set of pixel in the window is assigned to the pixel to produce a processed depth image. Then, each pixel in the processed depth image is filtered to correct outlier depths without blurring depth discontinuities to produce a filtered depth image.

Abstract: Embodiments of the invention disclose a system and a method for determining a rank of a node in a multi-hop wireless network, wherein the network includes a gateway node, client nodes, and relay nodes, wherein a node p(i) is a default parent of the node i having a rank, and the network uses a directed acyclic graph (DAG) topology. The method comprises steps of transmitting at least one data packet from the node to the default parent node over a wireless link; counting a number of successful transmissions of most recent transmissions of data packets; determining an expected transmission time (ETX) for the wireless link based on the number of successful transmissions in the most recent transmissions; and assigning a rank R(i) to the node based on the rank of the parent node and the ETX.

Abstract: A method generates a distance field of an object, where the distance field includes a set of cells and the object includes a set of stylized strokes. Each stylized stroke includes a centerline, a set of profiles, and a set of terminals. A processor is included for performing steps of the method. A first cell of the set of cells enclosing the object is determined. An outside reconstruction method is associated with the first cell. For each stylized stroke, centerline cells of the set of cells are determined, where each centerline cell encloses a portion of the centerline of the stylized stroke. A centerline reconstruction method is associated with each centerline cell. For each terminal of each stylized stroke a terminal distance field is generated, the terminal distance field including a terminal reconstruction method. Reconstructed distances are determined using the reconstruction methods to generate the distance field of the object.

Abstract: A set of symbols is encoded using a continuous mapping function to produce corresponding encoded functions, wherein the mapping function is continuous and values of the encoded functions are real and vary continuously. The encoded functions are summed in a spatial domain to generate a summed function, which is biased so that values of a biased function are all positive and real. Then, a physical property of the object is altered according the biased function to arrange a mark on the object.

Abstract: A method performed on a processor reconstructs a distance field of an object at a sample point, where the object is a swept volume generated by moving a shape along a path. The shape is represented by a shape distance field. The path is represented by a parametric function. Distance data at the sample points is determined, where the distance data characterizes the distance field of the object at the sample point. An optimal set of parameters defining an optimal placement of the shape along the path is determined in a continuous manner. The shape distance field is transformed to the optimal placement to produce a transformed shape distance field. The distance data is determined at the sample point from the transformed shape distance field to reconstruct the distance field at the sample point.

Abstract: A method and system locates a position of a transceiver in a cooperative relay network of nodes. A primary node broadcasts a range request (RREQ) message. A target node, in response to receiving the RREQ message, broadcasts a range reply (RREP) message, wherein the RREP message includes a time difference between receiving the RREQ message and broadcasting the RREP message. A secondary node, in response to receiving the RREQ message and the RREP message, broadcasts a range data (RDAT) message, wherein the RDAT message includes a time difference between receiving the RREQ message and the RREP message. Then, a position solver can determine a location of the target node based on the time differences in the RREP message and the RDAT message.

Abstract: A multi-stage decoder decodes a block of symbols, received via a noisy channel, to a codeword. The decoder includes multiple sub-decoders connected sequentially, and wherein a next sub-decoder has a slower processing time and better word error rate than a previous sub-decoder, and wherein the next sub-decoder is only executed if the previous decoder fails to decode the block sequence of symbols, and a last sub-decoder is executed until a termination condition is reached.

Abstract: A method for verifying a similarity between a first signal and a second signal is described. The first and the second signals are encrypted homomorphically using a key. First, we acquire a set of error patterns determined by a similarity constraint. Then, each error pattern is homomorphically encrypted using the key and presented to a verifier in the setup phase. The verifier declares the first signal similar to the second signal, if any error pattern in the set of error patterns satisfies a homomorphic relationship between the first encrypted signal and the second encrypted signal.

Abstract: A location and orientation in an environment is determined by first acquiring a real omni-directional image of an unknown skyline in the environment. A set of virtual omni-directional images of known skylines are synthesized from a 3D model of the environment, wherein each virtual omni-directional image is associated with a known location and orientation. The real omni-directional image with each virtual omni-directional images to determine a best matching virtual omni-directional image with the associated known location and orientation.

Abstract: Channel state information for closed-loop transmit precoding in MIMO networks is fed back from the MSs to the BSs. The feedback is quantized using codebooks shared by the MSs and BSs to reduce overhead. The codebooks can be full-rank or rank-one. The quantized feedback is applicable to any definitions of MIMO channel covariance matrix as well as MIMO channel matrix. Since these codebooks are designed for closed-loop MIMO precoded transmissions, no additional memory is needed to store the codebooks at the BS and the MS only for the quantized feedback purposes.

Abstract: A method transmits an L bit packet in a relay network including a source node, a relay node and a destination node. The source node partitions the packet into first fragment of ?L bits and a second fragment of (1??) bits. The first fragment is transmitted from the source node to the relay node at a first data rate during a first phase. The second fragment is transmitted from the source node to the destination node at a second data rate during a second phase while the first fragment is retransmitted from the relay node to the destination node at a third data rate.

Abstract: Embodiments of invention disclose a system and a method for formation-keeping of a spacecraft in response to a displacement of the spacecraft to a displaced pose with respect to at least one direction of the displacement, wherein the spacecraft is configured to issue a compensative force by generating a command to issue a compensative force. The compensative force is determined as a function of a sum of the base force configured for maintaining the spacecraft in the displaced pose with respect to the direction of the displacement and an excess force configured for optimizing the formation-keeping with respect to the direction of the displacement of the spacecraft at the displaced pose.

Abstract: Soft decision decoding of a codeword of a Reed-Muller (RM) code by selecting an optimal decomposition variable i using a likelihood calculation. A code RM(r, m) is expressed as {(u, uv)|u?RM(r, m?1) and v?RM(r?1, m?1)}, where uv denotes a component-wise multiplication of u and v, and (u, uv)=(r1, r2). A receive codeword is separated into r1=u and r2=uv based on the optimal decomposition variable, and r2 is decoded according to the optimal decomposition variable, using a RM(r?1, m?1) decoder to obtain a decoded v and a first set of decoded bits. The decoded v is combined with r1 using (r1+r2v)/2, and (r1+r2v)/2 is decoded using a RM(r, m?1) decoder to obtain a decoded u and a second set of decoded bits.

Abstract: Channel state information in a closed-loop, multiple-input, multiple-output wireless networks is fed back from each mobile station to a base station by first determining a transmit covariance matrix R, and applying a singular value decomposition (SVD) R=U?VH, where U, V are left and right singular vector matrices, ? is a diagonal matrix with singular values. The matrix V includes column vectors V. A beamforming vector vmax=[1 exp(j?)exp(j2?) . . . exp(j?)]/?{square root over (N)}] is approximated by the column vector V having a maximum magnitude, where ? is a real number. Then, only the angle ? is fed back using a phase modulation mapping of the components exp(j?) onto the associated subcarrier.

Abstract: Embodiments of the invention describe a method for antenna selection (AS) in a wireless communication network. The network includes a base station and a transceiver, wherein the transceiver has a set of antennas, and wherein the transceiver is configured to transmit a frequency-hopped sounding reference signal (SRS) from a subset of antennas at a time. The base station determines a type of a training transmission based on a number of the subbands and a number of subsets in the set of antennas, and transmits an instruction including the type to the transceiver.