Abstract: Embodiments of our invention describe the method for producing forbidden pattern free (FPF) codewords using an encoder-decoder (CODEC). First, the method encodes a dataword to produce a FPF codeword by mapping dataword to a Fibonacci Numeral System space. Further, the FPF codeword is transmitted via adjacent lines of a bus and decoded when received from the bus to recover the dataword to eliminate all crosstalk on the bus.

Abstract: A method for extracting an iris from an image is presented. Edges of an iris are detected in an image. Texture from the image is acquired. The edges and texture are combined to generate an inner boundary and an outer boundary of the iris. Also, to improve the accuracy of the iris boundary detection, a method to select between ellipse and circle models is provided. Finally, a dome model is used to determine mask images and remove eyelid occlusions in unwrapped images.

Abstract: A method and system selects a subset of antennas from a set of antennas to transmit user data in a wireless communication system. The user data is transmitted during a first transmission time intervals (TTI) using a first subset of antennas. Pilot tones are transmitted during a second TTI using a second subset of antennas. Corresponding channel qualities are estimated for the first subset of antennas and the second subset of antennas from the user data and the pilot tones. Then, based on the estimating, a best subset of antenna is selected from the first subset of antennas and the second subset of antennas to transmit the user data during a subsequent TTI.

Abstract: A method constructs a location model for locating and tracking sources of acoustic signals. Acoustic training signals are acquired from an acoustic training source at an unknown location in an environment with an array of microphones placed at unknown positions in the environment. From each acoustic training signal, relative acoustic features are extracted to construct a location model that is trained with the relative acoustic features.

Abstract: A method and system deblurs images acquired of a scene by a camera. A light field acquired of a scene is modulated temporally according to a sequence of ons and offs. An optimal coding pattern is selected. The modulated light field is integrated by a sensor of a camera during an exposure time to generate an encoded input image. The encoded input image is decoded according to a pseudo-inverse of a smearing matrix to produce a decoded output image having a reduced blur.

Abstract: A method processes an input image securely. An input image I is acquired in a client. A set of m random images, H1, . . . , Hm, and a coefficient vector, a=[a1, . . . , am], are generated such that the input image I is I=?i=1m?iHj. The set of the random images is transferred to a server including a weak classifier. In the server, a set of m convolved random images H? are determined, such that {H1?=?1(H1*y}i,1m, where * is a convolution operator and ?1 is a first random pixel permutation. The set of convolved images is transferred to the client. In the client, a set of m permuted images I? is determined, such that I?=?2(?i=1m?iH1?), where ?2 is a second random pixel permutation. The set of permuted image is transferred to the server.

Abstract: A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.

Abstract: A method retargets an image to a different size. An input image is segmented into regions. Selected regions are cut from the input image to construct a background image. The background image is scaled to a predetermined size, and the selected regions are pasted back into the scaled background image to produce an output image.

Abstract: A method determines a delay time between reference and data pulses in a time-hopping impulse radio system. Channel state information of a channel between two transceivers is estimated periodically. The delay time frame between the reference and data pulses is then determined according to the channel state information.

Abstract: A method models a scene. A video is acquired of the scene, and for each frame of the video, the method updates a set of background models for each pixel; a set of shadow models for each pixel; a set of shadow flow vectors for each color; and a background shadow map. Each pixel in each background model and each shadow model is represented by multiple layers. Each layer includes Gaussian distributions and each Gaussian distribution includes a mean and a covariance. The covariance is an inverse Wishart distribution and the updating is according to a recursive Bayesian estimation process.

Abstract: A method for decoding error-correcting codes normalizes messages generated by a bit node processor, and normalizes messages generated by the check node processor.

Abstract: A method classifies segments of a video using an audio signal of the video and a set of classes. Selected classes of the set are combined as a subset of important classes, the subset of important classes being important for a specific highlighting task, the remaining classes of the set are combined as a subset of other classes. The subset of important classes and classes are trained with training audio data to form a task specific classifier. Then, the audio signal can be classified using the task specific classifier as either important or other to identify highlights in the video corresponding to the specific highlighting task. The classified audio signal can be used to segment and summarize the video.

Abstract: A method communicates data between terminals in heterogeneous communications network. A coordinator broadcasts periodically a first beacon in a first signal format. The first beacon defines a start of a contention period and a start of a contention free period. The coordinator also broadcasts a second beacon in a second signal format during the contention free period. The second beacon also defines the start of the contention period and the start of the contention free period.

Abstract: A method detects a change in a stream of samples acquired by a sensor. A stream of samples acquired by a sensor over time is stored sequentially in a buffer in which an oldest samples is discarded and a newest sample is stored when the buffer is full, such that the buffer forms a window of samples sliding forward in time. For each new sample, the buffer is partitioned into all possible pairs of contiguous sub-windows of samples including a first sub-window and a second sub-window such that the newest sample is stored in the second sub-window of the pair. A difference is determined between the first and second sub-window of each pair of the contiguous sub-windows of samples, and a maximum difference is assigned as a merit score. A change in the stream of samples is signaled if the merit score is greater than a predetermine threshold. The change can be abrupt or gradual.

Abstract: A method generates a summary of a video. Faces are detected in a plurality of frames of the video. The frames are classified according to a number of faces detected in each frame and the video is partitioned into segments according to the classifications to produce a summary of the video. For each frame classified as having a single detected face, one or more characteristics of the face is determined. The frames are labeled according to the characteristics to produce labeled clusters and the segments are partitioned into sub-segments according to the labeled clusters.

Abstract: A method reduces artifacts in an input image. A variance image is generated from the input image. The input image is partitioned into a plurality of blocks of pixels. A set of classifications is defined. The set of classifications includes smooth, texture, and edge. A particular classification is assigned to each block of pixels of the input image according to the variance image, to generate smooth blocks, texture blocks, and edge blocks. A fuzzy filter is applied to each pixel of only each edge block.

Abstract: A method schedules cars of an elevator system, the elevator system including a set of cars, and a set of hall calls. For each car, a waiting time is determined independently if the hall call is the only hall call assigned to the car. For each car, a mutual delay ?W(h|g) is determined for each possible pair of unassigned hall calls h and assigned hall calls g. The waiting time and mutual delays are summed. Then, the assignments are made to the set of cars so that the sum is a minimum.

Abstract: A method indexes and retrieves documents stored in a database. A document feature vector is extracted from each document and the documents are then indexed according to the feature vectors. A spoken query is converted to an intermediate representation representing likelihoods of possible sequential combinations of terms in the spoken query. A query certainty vector is generated from the intermediate representation. Other information is acquired. The other information is combined with the query certainty vector. The query vector and the other information are then compared to each of the document feature vectors to retrieve a ranked result set of documents.

Abstract: A method determines temporal patterns in data sequences. A hierarchical tree of nodes is constructed. Each node in the tree is associated with a composite hidden Markov model, in which the composite hidden Markov model has one independent path for each child node of a parent node of the hierarchical tree. The composite hidden Markov models are trained using training data sequences. The composite hidden Markov models associated with the nodes of the hierarchical tree are decomposed into a single final composite Markov model. The single final composite hidden Markov model can then be employed for determining temporal patterns in unknown data sequences.

Abstract: A method and system transmits an input stream of data symbols in a multiple-input/multiple-output wireless communications system that includes M subgroups of transmitting antennas. A stream of data symbols is provided to a combined switch and demultiplexer. The combined switch and demultiplexer selects a subset L of the M subgroups of antennas as active, where L<M. The demultiplexer then splits the data stream into L substreams, which are fed to the L subgroups of antennas. Before transmission, each of the L substreams is adaptively modulated and coded to a maximum data rate while achieving a predetermined performance on an associated channel used to transmit the substream. Space-time transmit diversity encoding is applied to each coded substream to generate multiple output streams, one output stream for each antenna of each of the L subgroups. The selection by the switch is based on channel conditions fed back by a receiver of the output streams.