Abstract: A framework is provided for describing multimedia content and a system in which a plurality of multimedia storage devices employing the content description methods of the present invention can interoperate. In accordance with one form of the present invention, the content description framework is a description scheme (DS) for describing streams or aggregations of multimedia objects, which may comprise audio, images, video, text, time series, and various other modalities. This description scheme can accommodate an essentially limitless number of descriptors in terms of features, semantics or metadata, and facilitate content-based search, index, and retrieval, among other capabilities, for both streamed or aggregated multimedia objects.

Abstract: Apparatus and method for generating a view element representation of multiple-attribute tabular data are provided, including converting tabular data into a multidimensional lattice form whereby each functional attribute of the relational data is mapped to a dimension in the lattice, and each cell in the lattice corresponds to an aggregation over records in the data table. The mechanism further provides for generating a view element representation of multidimensional lattice data comprising decomposing the multidimensional data into view elements such that the view elements retain sufficient information to reconstruct the original lattice data. Alternatively, the mechanism for generating a view element data representation including iterative decomposition of the lattice data into aggregated and residual view elements or by spatially partitioning the lattice data.

Abstract: Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards.

Abstract: Disclosed is a method and apparatus for querying stored multimedia data in a computer system, comprising receiving into an intermediate level a high-level concept from a user describing data to be retrieved, translating, in said intermediate level, said high-level concept into low-level queries by using system pre-defined high-level concepts, transferring said low-level queries to a low level comprising one or more search engines; said one or more search engines performing a query of the stored multimedia information using said low-level queries. A matching algorithm for use with the invention is also disclosed.

Abstract: A computer-based technique is provided for retrieving one or more items from a database in response to a query specified by a user via one or more example sets. Preferably the example sets include multiple positive and negative example sets. The method comprises the following steps. First, a scoring function is constructed from the one or more example sets. The scoring function gives higher scores to database items that are more closely related to the query than to database items that are not as closely related to the query. The scoring function is operable for use with a multidimensional indexing structure associated with the database. Then, the one or more database items that have the highest score as computed using the scoring function are retrieved via the multidimensional indexing structure.

Abstract: Techniques are provided for enabling an electronic information marketplace. Broadly, sellers and buyers can exchange information goods. The buyers request information goods and the sellers offer suitable information goods. One or more matches may occur between the requested and offered information goods. The information goods may be priced through any of a number of techniques, which include fixed and dynamic pricing methods. Importantly, requests and offerings can be annotated to help the matchmaking process. Additionally, concepts can be determined from the requested and offered information goods, which also facilitates the matchmaking. The matchmaking process itself can also determine inferences during matchmaking, which further improves the matchmaking.

Abstract: Techniques are provided for automatically replenishing inventory by exploiting the use of electronic marketplaces. In one aspect of the invention, a system for automatically controlling an inventory of items comprises one or more sensors operative to automatically obtain information relating to a status associated with an inventory item. Preferably, the sensors are embedded in the equipment containing the inventory that they are monitoring. The system also comprises one or more computer systems (referred to herein as “brokers”) which are operatively coupled to the one or more sensors and which receive the status information from the one or more sensors. Each broker is further operative to automatically access one or more electronic marketplaces in order to determine one or more optimal parameters, based on the collected status information, to be used for replenishing an inventory item in accordance with one or more providers of the item via the one or more electronic marketplaces.

Abstract: Methods and apparatus for providing a multi-tier object-relational database architecture are disclosed. In one illustrative embodiment of the present invention, a multi-tier database architecture comprises an object-relational database engine as a top tier, one or more domain-specific extension modules as a bottom tier, and one or more universal extension modules as a middle tier. The individual extension modules of the bottom tier operationally connect with the one or more universal extension modules which, themselves, operationally connect with the database engine. The domain-specific extension modules preferably provide such functions as search, index, and retrieval services of images, video, audio, time series, web pages, text, XML, spatial data, etc. The domain-specific extension modules may include one or more IBM DB2 extenders, Oracle data cartridges and/or Informix datablades, although other domain-specific extension modules may be used.

Abstract: An object tracking technique is provided which, given: (i) a potentially large data set; (ii) a set of dimensions along which the data has been ordered; and (iii) a set of functions for measuring the similarity between data elements, a set of objects are produced. Each of these objects is defined by a list of data elements. Each of the data elements on this list contains the probability that the data element is part of the object. The method produces these lists via an adaptive, knowledge-based search function which directs the search for high-probability data elements. This serves to reduce the number of data element combinations evaluated while preserving the most flexibility in defining the associations of data elements which comprise an object.

Abstract: Similarity measure has been one of the critical issues for successful content-based retrieval. Simple quadratic forms of distance is inadequate as it does not necessary correspond to perceived similarity nor is it adaptive to different applications. This patent application describes a new sequential query processing algorith for evaluating content-based composite object queries. The composite objects consist of spatial and temporal arrangements of simple objects. The simple objects are defined in terms of spatial, temporal, feature and semantic attributes. The query method defines a process for executing a best-first search for the matches to the query, while providing a flexible framework for broadening the search space as required. The query method guarantees that there are no false dismissals of the candidate composite objects.

Abstract: A method and apparatus for encoding knowledge using a multimedia network. A multimedia network represents semantic concepts and their relations using multimedia content. A multimedia network associates words and multimedia content with the semantic concepts in order to illustrate and exemplify the semantic concepts as well as describe lexical, semantic, and perceptual relations. The multimedia network can be searched, browsed, or summarized for purposes of information discovery. The multimedia network can also be used for personalizing multimedia content or for querying a multimedia information repository by expanding a query to include related concepts encoded in a Multimedia network.

Abstract: The invention provides a next generation decision support system that includes highly adaptive sensors, transport, and models to enable time critical decision making. The decision support model of the system is progressive so that not all input parameters need to be available to produce model prediction output. Input parameters of the model with the largest first order derivative values are given highest priority in data acquisition and transmission. The parameters acquired at the sensors are stored in progressive data representation formats, which later on are progressively transmitted to the decision support server. Progressive data representation, progressive transmission, and progressive model are thus three key elements that need to be integrated together. The present invention presents a method and an apparatus that form an optimized process including the three elements subject to the decision making utility function.

Abstract: Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards.

Abstract: Linear optimization queries, which usually arise in various decision support and resource planning applications, are queries that retrieve top N data records (where N is an integer greater than zero) which satisfy a specific optimization criterion. The optimization criterion is to either maximize or minimize a linear equation. The coefficients of the linear equation are given at query time. Methods and apparatus are disclosed for constructing, maintaining and utilizing a multidimensional indexing structure of database records to improve the execution speed of linear optimization queries. Database records with numerical attributes are organized into a number of layers and each layer represents a geometric structure called convex hull. Such linear optimization queries are processed by searching from the outer-most layer of this multi-layer indexing structure inwards.

Abstract: A method of adapting multimedia content to a client device, wherein the multimedia content includes one or more items and the client device has capabilities and resources associated therewith, is provided. The method includes transcoding the multimedia content into a plurality of transcoded content versions, wherein the plurality of transcoded content versions have different modalities and resolutions associated therewith. Next, the transcoded content versions that are not compatible with client device capabilities are filtered out. Then, at least a portion of the resources associated with the client device are allocated among the one or more items of the multimedia content. Lastly, one or more of the transcoded versions of the multimedia content are selected to generate a customized content based on allocation of the client device resources.

Abstract: An apparatus and method for representing and retrieving multi-dimensional data such as large satellite images. Images are stored in forms that allow them to be rapidly browsed and retrieved by remote client applications in a drill-down fashion. The data can be represented and retrieved using a view element data structure that includes node elements and transition elements between nodes. The data is decomposed (in space or spatial-frequency to construct a tree-based or graph-based data structure) into view elements. A set of view elements is selected, compressed and stored without adversely impacting image view extraction or generation speed. View elements are placed into the node elements of the data structure and the transition elements indicate the processing to generate other view elements in the data structure. In a server-side view construction, the view elements are selectively retrieved from storage, decompressed, and processed to generate the views of the data.

Abstract: An unreliable training set is modified to provide for a reliable training set to be used in supervised classification. The training set is modified by determining which data of the set are incorrect and reconstructing those incorrect data. The reconstruction includes modifying the labels associated with the data to provide for correct labels. The modification can be performed iteratively.

Abstract: A system and method for uniformly describing space and frequency views of multi-dimensional lattice data, including regions, tilings and hierarchical decompositions of image, video, audio content, and time series data in space, time, frequency and resolution. The space and frequency view description scheme provides a way to specify regions in space, time, frequency and resolution in term of space and frequency views. This allows specification of concepts such as “half resolution”, “upper right quadrant” or “high pass band”, such as when referring to views of an image. The space and frequency view description scheme also provides for SFTilings comprising non-redundant sets of views and SFPartitionings which are SFTilings which completely cover the space, as well as SFHierarchical decompositions comprising hierarchies of SFViews where there are processing dependencies among views.

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction also can be applied to the entire database as a first step of the index generation.

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction can also be applied to the entire database as a first step of the index generation.