Abstract: A method for implementing multicast data exchange over a partitioned network having an encrypted domain with HAIPE devices at the edges consists of proxies running at an ingress edge and at egress edges of the encrypted domain. The proxies at the ingress edge device modify the multicast data packet to replace the destination address with the address of a proxy running on an egress edge device, such that the encrypted domain routes the packet directly to the proxy at the egress edge device without processing it as a multicast data packet. At the egress edge devices, the proxies restore the original address and send the multicast packets to the appropriate destinations.

Abstract: Methods, an apparatus, and a system for communications using multiplexed packets including payloads of the current and at least one preceding packet are disclosed. The invention is able to implement both robustness and a degree of compression while still being able to operate in environments of limited bandwidth having high rates of packet loss, such as in wireless VoIP networks.

Abstract: A system for implementing a method for searching multimedia contents uses a pictorial edit distance to compare a search query consisting of an image to a database of images to determine the ranking of matches from closest match to least closest match between the search image and the images in the database or portions of the images in the database.

Abstract: A method and system is described for determining the distance between first and second images using an enhanced P-Edit distance metric which accounts for differences in the rotation or pose of objects identified in the images.

Abstract: Reflectors having concave reflecting surfaces (e.g., parabolic reflectors) and electronically controlled beam steering elements are used for rapid, low-diversion, wide-angle and precision steering of optical beams, including laser beams.

Abstract: A system and method for searching multimedia databases using a pictorial language, input via an iconic interface and making use of trained ontologies, i.e., trained data models. An iconic graphic user interface (GUI) allows a user to specify a pictorial query that may include one or more one or more key-images and optional text input. Similarities between the query key-images and images in a multimedia database based on a pictorial edit distance are used to select the images that are the closest match to the query. The result images are returned to the user in order of their relevance to the query.

Abstract: A method and system for searching a database of graphical data are described. Embodiments of the invention use accelerated image-comparing techniques based on an adaptation of the Levenshtein algorithm for matching or searching one-dimensional data strings for use with recognizing pre-selected targets in graphical contents of 2D images.

Abstract: Reflectors having concave reflecting surfaces (e.g., parabolic reflectors) and electronically controlled beam steering elements are used for rapid, low-diversion, wide angle, and precision steering of optical beams, including laser beams.

Abstract: Reflectors having concave reflecting surfaces (e.g., parabolic reflectors) and electronically controlled beam steering elements are used for rapid, low-diversion, wide-angle, and precision steering of optical beams, including laser beams.

Abstract: A device, based on a standard router, that provides a seamless connection between real nodes and virtual, simulated nodes for the flow of both control and application traffic, such that new technologies and applications can be tested on a simulated large scale network with only a few real nodes.

Abstract: A system and method for incorporating relevance feedback into an image search. A multimedia database is first searched using a domain specific similarity matrix (DSM), resulting in a list of image results ranked by their similarity to a query key-image. The results are then reexamined using a personalized similarity matrix (PSM). The PSM includes image that have been selected by the user, either in previous searches or from lists of candidate images. Similarity scores are calculated between the domain relevant images in the PSM and the results images. The new similarity scores are combined with the original similarity scores and the images is re-ranked into a final results list. Any images selected by the user may then be used to update and/or expand the PSM.

Abstract: A system and method for comparing images by calculating an edit distance between the images using the results of matching portions of one image to the other. The first image is divided into blocks of pixels. For every block of pixels, a closest match is found in the second image. Substitution is equated to the sum of the errors in the closet matches. Deletion is equated to the percentage of the second image not involved in any of the matching. Insertion is equated to the percentage of the second image simultaneously involved in matching more than one block. The image edit distance may then be calculated as the weighted sum of the insertion, deletion and substitution. Recognition may be done by finding a minimum edit distance between an image of an unknown object and a set of reference images.

Abstract: A system and method of machine learning that uses an inverse matrix of a reference similarity matrix as a transformation matrix. The reference similarity matrix relates a reference set of objects to themselves using a distance metric such as an image edit distance. The transformation matrix is used to improve the performance of query vectors in classifying or identifying digital representations of an unknown object. The query vector is a measure of similarity between the unknown object and the members of the reference set. Multiplying the query vector by the transformation matrix produces an improved query vector having improved similarity scores. The highest improved similarity score indicates the best match member of the reference set If the similarity score is high enough, the unknown object may either be classified as belonging to the same class, or recognized as being the same object, as the best match object.

Abstract: A method and system for searching a database of graphical data are described. Embodiments of the invention use accelerated image-comparing techniques based on application of the Levenshtein algorithm for matching or searching one-dimensional data strings to recognizing pre-selected targets in graphical contents of 2D images.

Abstract: A method for mitigating traffic congestions in a communication network uses concatenated data packets to transmit information between terminals, e.g., edge proxies, of the network. Embodiments of the invention are directed to packet communications over military or commercial networks. In one application, the method is implemented in a network using High Assurance Internet Protocol Encryption (HAIPE).

Abstract: A multi-resolution texture mapping system suitable for large scale terrain rendering using commodity graphics processing units (GPU). The GPU vertex and fragment shaders are used to implement the clip-mapping functionality. The terrain texture is represented by a combination of a mip-map and a multi-level clip-map having independent origins and off-set values. The independent clip-map levels may be independently updated. The offset values allow the origins to be associated with a reference point in a scene to be rendered. The desired clip-map level to be used to render a particular fragment may be determined using the base 2 logarithm of the maximum screen-space derivative of the source texture required by the terrain geometry to be drawn. If the desired clip-map level is non-integer and lies between two clip-map levels, appropriate texel data is created by interpolating between the bounding clip-map levels. This interpolation allows a multi-resolution texture mapping to be displayed.

Abstract: A method and system for searching a database of graphical data are described. Embodiments of the invention use accelerated image-comparing techniques based on application of the Levenshtein algorithm for matching or searching one-dimensional data strings to recognizing pre-selected targets in graphical contents of 2D images.

Abstract: A system, method and apparatus for rapid, large angle, high-precision steering of one or more beams of light, and in particular, laser beams, using one or more concave reflectors to provide narrow, essentially collimated output beams. The rapid, beam steering device amplifies the angular deflection provided by a small angle steering element by means of one or more concave reflecting surfaces while controlling the divergence of the output beam using a divergence control lens, to produce an essentially collimated output beam in a field of regard that subtends +/?45 degrees on one axis and +/?50 degrees on an orthogonal axis.

Abstract: A method and system for recognizing images are described. Embodiments of the invention apply techniques of the Levenshtein algorithm for matching or searching one-dimensional strings for comparing graphical contents of 2D images.

Abstract: An apparatus for providing Quality of Service (QoS) and resource management in a network edge device of a core communication network is disclosed. The apparatus has scalable modular hardware/software architecture and adapted for receiving detachable functional units. Each functional unit may contain at least one module performing one or more pre-selected QoS and resource management functions in the network edge device.