Display of media previews

[0002] This application claims benefit of the following co-pending U.S. Provisional Applications:

[0003] 1) Method and Apparatus for Processing Context and Content of Multimedia Files When Creating Searchable Indices of Multimedia Content on Large, Distributed Networks; Serial No.: 60/018,312; Filed: May 24, 1996;

[0004] 2) Method and Apparatus for Display of Results of a Search Queries for Multimedia Files; Serial No.: 60/018,311; Filed: May 24, 1996;

[0005] 3) Method for Increasing Overall Performance of Obtaining Search Results When Searching on a Large, Distributed Database By Prioritizing Database Segments to be Searched; Serial No.: 60/018,238; Filed: May 24, 1996;

[0006] 4) Method for Processing Audio Files to Compute Estimates of Music-Speech Content and Volume Levels to Enable Enhanced Searching of Multimedia Databases; Serial No.: 60/021,452; Filed: Jul. 10, 1996;

[0007] 5) Method for Searching for Copyrighted Works on Large, Distributed Networks; Serial No.: 60/021,515; Filed: Jul. 10, 1996;

[0008] 6) Method for Processing Video Files to Compute Estimates of Motion Content, Brightness, Contrast and Color to Enable Enhanced Searching of Multimedia Databases; Serial No.: 60/021,517; Filed: Jul. 10, 1996;

[0009] 7) Method and Apparatus for Displaying Results of Search Queries for Multimedia Files; Serial No.: 60/021,466; Filed: Jul. 10, 1996;

[0010] 8) A Method for Indexing Stored Streaming Multimedia Content When Creating Searchable Indices of Multimedia Content on Large, Distributed Networks; Serial No.: 60/023,634; Filed: Aug. 9, 1996;

[0011] 9) An Algorithm for Exploiting Lexical Proximity When Performing Searches of Multimedia Content on Large, Distributed Networks; Serial No.: 60/023,633; Filed: Aug. 9, 1996;

[0012] 10) A Method for Synthesizing Descriptive Summaries of Media Content When Creating Searchable Indices of Multimedia Content on Large, Distributed Networks; Serial No.: 60/023,836; Filed: Aug. 12, 1996.

[0013] 1. Field of the Invention

[0014] The present invention relates to the field of networking, specifically to the field of searching for and retrieval of information on a network.

[0015] 2. Description of the Related Art

[0016] Wouldn't it be nice to be able to log onto your local internet service provider, access the worldwide web, and search for some simple information, like “Please find me action movies with John Wayne which are in color?” or “Please find me audio files of Madonna talking?”, or “I would like black and white photos of the Kennedy assassination”. Or, how about even “Please find me an action movie starring Michael Douglas and show me a preview of portions of the movie where he is speaking loudly”. Perhaps, instead of searching the entire worldwide web, a company may want to implement this searching capability on its intranet.

[0017] Unfortunately, text based search algorithms cannot answer such queries. Yet, text based search tools are the predominate search tools available on the internet today. Even if text based search algorithms are enhanced to examine files for file type and, therefore, be able to detect whether a file is a audio, video or other multimedia file, little if any information is available about the content of the file beyond its file type.

[0018] Still further, what if the search returns a number of files. Which one is right? Can the user tell from looking at the title of the document or some brief text contained in the document as is done by many present day search engines? In the case of relatively small text files, downloading one or two or three “wrong” files, when searching for the right file, is not a major problem. However, when downloading relatively large multimedia files, it may be problematic to download the files without having a degree of assurance that the correct file has been found.

[0019] It is desireable to provide a search engine which is capable of searching the internet, or other large distributed network for multimedia information. It is also desirable that the search engine provide for analysis of the content of files found in the search and for display of previews of the information.

[0020] FIG. 1 illustrates an overall diagram of a media search and retrieval system as may implement the present inventions.

[0021] FIGS. 2A-C illustrates a flow diagram of a method of media crawling and indexing as may utilize the present inventions.

[0022] FIG. 3A illustrates an overall diagram showing analysis of digital audio files.

[0023] FIGS. 3B, 3C and 3D illustrates waveforms.

[0024] FIG. 3E-H illustrate a flow diagram of a method of analyzing content of digital audio files.

[0025] FIG. 4A illustrates a user interface showing search results.

[0026] FIG. 4B illustrates components of a preview.

[0027] FIG. 4C-4E illustrate a flow diagram of a method of providing for previews.

[0028] For ease of reference, it might be pointed out that reference numerals in all of the accompanying drawings typically are in the form “drawing number” followed by two digits, xx; for example, reference numerals on FIG. 1 may be numbered 1xx; on FIG. 3, reference numerals may be numbered 3xx. In certain cases, a reference numeral may be introduced on one drawing and the same reference numeral may be utilized on other drawings to refer to the same item.

[0029] What is described herein is a method and apparatus for searching for, indexing and retrieving information in a large, distributed network.

[0030] 1.0 Overview

[0031] FIG. 1 provides an overview of a system implementing various aspects of the present invention. As was stated above, it is desirable to be provide a system which will allow searching of media files on a distributed network such as the internet or, alternatively, on intranets. It would be desirable if such a system were capable of crawling the network, indexing media files, examining and analyzing the media file's content, and presenting summaries to users of the system of the content of the media files to assist the user in selection of a desired media file.

[0032] The embodiment described herein may be broken down into 3 key components: (1) crawling and indexing of the network to discover multimedia files and to index them 100; (2) examining the media files for content (101-105); and (3) building previews which allow a user to easily identify media objects of interest 106. Each of these phases of the embodiment provide, as will be appreciated, for unique methods and apparatus for allowing advanced media queries.

[0033] 2.0 Media Crawling and Indexing

[0034] FIGS. 2A-2C provides a description of a method for crawling and indexing a network to identify and index media files. Hypertext markup language (HTML) in the network is crawled to locate media files, block 201. Lexical information (i.e., textual descriptions) is located describing the media files, block 202 and a media index is generated, block 203. The media index is then weighted, block 204 and data is stored for each media object, block 205. Each of these steps will be described in greater detail below.

[0035] 2.1 Crawl HTML to locate media files

[0036] The method of the described embodiment for crawling HTML to locate media files is illustrated in greater detail by FIG. 2B. Generally, a process as used by the present invention may be described as follows:

[0037] The crawler starts with a seed of multimedia specific URL sites to begin its search. Each seed site is handled by a separate thread for use in a multithreaded environment. Each thread parses HTML pages (using a tokenizer with lexical analysis) and follows outgoing links from a page to search for new references to media files. Outgoing links from an HTML page are either absolute or relative references. Relative references are concatenated with the base URL to generate an absolute pathname. Each new page which is parsed is searched for media file references. When a new site is found by the crawler, there is a check against the internal database to ensure that the site has not already been visited (within a small period of time); this guarantees that the crawler only indexes unique sites within its database, and does not index the same site repeatably. A hash table scheme is used to guarantee that only unique new URLs are added to the database. The URL of a link is mapped into a single bit in a storage area which can contain up to approximately ten million URLs. If any URL link which is found hashes to the same bit position, then the URL is not added to the list of URLs for processing. As the crawler crawls the web, those pages which contain media references receive a higher priority for processing than those pages which do not reference media. As a result, pages linked to media specific pages will be visited by the crawler first in an attempt to index media related pages more quickly than through conventional crawler techniques.

[0038] When entering a new site, the crawler scans for a robot exclusion protocol file. If the file is present, it indicates those directories which should not be scanned for information. The crawler will not index material which is disallowed by the optional robot exclusion file. On a per directory basis, there is proposed to be stored a media description file (termed for purposes of this application the mediaX file). The general format of this file for the described embodiment is provided in Appendix A. This file contains a series of records of textual information for each media file within the current directory. As will be discussed in greater detail below, the crawler scans for the media description file in each directory at a web site, and adds the text based information stored there into the index being created by the crawler. The mediaX file allows for storage of information such as additional keywords, abstract and classification data. Since the mediaX file is stored directly within the directory where the media file resides, it ensures an implicit authentication process whereby the content provider can enhance the searchable aspects of the multimedia information and can do so in a secure manner.

[0039] The crawler can be constrained to operate completely within a single parent URL. In this case, the user inputs a single URL corresponding to a single web site. The crawler will then only follow outgoing links which are relative to the base URL for the site. All absolute links will not be followed. By following only those links which are relative to the base URL, only those web pages which are within a single web site will be visited, resulting in a search and indexing pass of a single web site. This allows for the crawling and indexing of a single media-rich web site. Once a single web site has had an index created, then users may submit queries to find content located only at the web site of interest. This scheme will work for what is commonly referred to as “Intranet” sites, where a media-rich web site is located behind a corporate firewall, or for commercial web sites containing large multimedia datasets.

[0040] 2.1.1 Scan page for predetermined HTML tag types

[0041] Each HTML page is scanned for predetermined types of HTML tags, block 211. In this embodiment, the following tags are scanned for:

[0042] tables (single row and multi-row)

[0043] lists (ordered and unordered)

[0044] headings

[0045] java script

[0046] client side image maps

[0047] server side image maps

[0048] header separators

[0049] 2.1.2 Determine if there is a media URL

[0050] If there is a media uniform resource locator (URL), block 212. If there is a media URL, then the media URL is located and stored. However, in the described embodiment, certain media URL's may be excluded. For example, an embodiment may choose not to index URLs having certain keywords in the URL, certain prefixes, certain suffixes or particular selected URLs.

[0051] 2.1.3 Locating relevant lexical information

[0052] Next, relevant lexical information (text) is selected for each URL. Often a web page which references a media file provides significant description of the media file as textual information on the web page. When indexing a media file, the present invention has recognized that it would be useful to utilize this textual information. However, certain web pages may reference only a single media file, while other web pages may reference a plurality of media files. In addition, certain lexical information on the web page may be more relevant than other information to categorizing the media for later searching.

[0053] It has been observed that relevant textual information may be directly surrounding the media reference on a web page, or it may be far from the media reference. However, it has been found that more often than not, the relevant text is very close (in lexical distance) to the media reference. Therefore, the following general rules are applied when associating lexical information with a media file:

[0054] 1) if the media file reference is found within a table, store the text within the table element as associated with the media file;

[0055] 2) if the media file reference is found within a list, store the text within the list element as associated with the media file;

[0056] 3) store the text in the heading as associated with the media file. In addition, in some embodiments, the text within higher level headings may also be stored.

[0057] 4) if there is javascript, store the text associated with the javascript tag;

[0058] 5) for client and server side image maps, if there is no relevant text, store only the URL. In addition, the image maps may be parsed to obtain all unique URLs and these may also be stored.

[0059] In some embodiments, a special tag may be stored within the indexed text where the media reference occurs in the web page. When queries are posed to the full-text database of the stored HTML pages which reference media, the distance of the keyword text from the media reference tag can be used to determine if there is a relevant match. The standard distance from media reference to matching keyword utilized is ten words in each direction outwards from the media reference. The word distance metric is called “lexical proximity”. For standard web pages where text surrounding media is generally relevant this is an appropriate value.

[0060] If the results of a search using lexical proximity are not satisfactory to a user, the user needs a mechanism by which to broaden or narrow the search, based on the relevance which is found by the default lexical proximity. Users can employ an expand and narrow search button to change the default lexical proximity. The expand function will produce more and more search results for a given query, as the lexical proximity value is increased. A typical expand function will increase the lexical proximity value by a factor of two each time it is selected. When the expand function is used, more text will be examined which is located near the media reference to see if there is a keyword match. Expanding the search repeatedly will decrease precision and increase recall.

[0061] The narrow search button will do the reverse, by decreasing the lexical proximity value more and more. A typical narrow function will decrease the lexical proximity value by a factor of two each time it is selected. The narrow search button will reduce the number of search results, and hone in on that text information which only surrounds the media reference directly. Narrowing the search will increase precision and decrease recall. The relevance of all resulting queries should be quite high, on average, as a search is narrowed using this method.

[0062] When a database is limited in depth of entries, and is generated with a fixed lexical proximity value, a search query may often produce a search result list with zero hits. In order to increase the number of search results for the case of zero hits with fixed lexical proximity, a method is employed which will iterate on the lexical proximity value until a set of ten search results are returned. The algorithm is as follows:

[0063] perform the search query

[0064] look at the number of returned hits

[0065] if the number of returned hits is less than ten, then

[0066] perform a new search with the lexical proximity value doubled

[0067] continue the above process until ten search results are returned

[0068] Users should be able to specify the usage of lexical proximity to enhance the indexing of their search material. For example, if the web page author knows that all words which are ten words in front of the media reference are valid and relevant, then the author should specify a lexical proximity value which is only negative ten (i.e., look only in the reverse direction from the media URL by ten words). If the web page author knows that all words which are ten words after the media reference are valid and relevant, then the author should specify a lexical proximity value which is only positive ten. Finally, if the web author knows that both ten words ahead, and ten words behind the media reference are relevant, then the lexical proximity value should be set to positive/negative ten. Similarly, if the web author knows that the entire page contains relevant text for a single media file, then the lexical proximity value should be set to include all text on a page as relevant.

[0069] In addition to the above-described processes for locating relevant lexical information, in the described embodiment, certain information is generally stored for all media URL's. In particular, the following information is stored:

[0070] the name of the media file

[0071] URL of the media file

[0072] text string which is associated with the media file anchor reference

[0073] title of the HTML document containing the media file

[0074] keywords associated with the HTML document

[0075] URL for the HTML document containing the media file reference

[0076] keywords embedded in the media file

[0077] textual annotations in the media file

[0078] script dialogue, closed captioning and lyric data in the media file

[0079] auxiliary data in the media file (copyright, author, producer, etc.)

[0080] auxiliary data located within the media reference in the HTML document

[0081] auxiliary data located in an associated media description file

[0082] 2.1.4 Streaming files

[0083] Media content of files may be stored as downloadable files or as streaming files. Downloadable content is indexed by connecting to an HTTP server, downloading the media file, and then analyzing the file for the purposes of building a media rich index.

[0084] In the case of streaming, multimedia content, block 214, an HTTP server stores, not the content itself, but instead a reference to the media file. Therefore, the process of indexing such a file is not as straightforward as for a downloadable file which is stored on the HTTP server and may be downloaded from the server.

[0085] In the case of streaming media files certain information is gathered, block 215, as will be described with reference to FIG. 2C.

[0086] Below is described a method for indexing streaming files to index audio content and to index video content:

[0087] download the media file reference corresponding to the correct streaming media type

[0088] for each URL listed in the media file reference, perform the following operation:

[0089] connect directly to the media file on the media server where it resides, block 221

[0090] commence streaming of the media on the appropriate TCP socket, block 222

[0091] query the streaming media to obtain appropriate content attributes and header data, block 223

[0092] add all relevant content attributes and header information into the media rich index, block 224 (header information to be queried and indexed includes title, author, copyright; in the case of a video media file, additional information indexed may also include duration, video resolution, frame rate, etc.)

[0093] determine if streaming text or synchronized multimedia information, is included, block 225.

[0094] if it is, then stream the entire media clip, and index all text within the synchronized media track of the media file

[0095] if possible, store the time code for each block of text which occurs with the streaming media

[0096] This method can be applied to any streaming technology, including both streaming sound and video. The media data which is indexed includes information which is resident in the file header (i.e., title, author, copyright), and which can be computed or analyzed based on information in the media file (i.e., sound volume level, video color and brightness, etc.).

[0097] The latter category of information includes content attributes which can be computed while the media is streaming, or after the media has completed streaming from a server. It should be noted that once the streaming media has been queried and received results back from the server, the streaming process can conclude as the indexing is complete.

[0098] 2.2 Generate and weight a media index

[0099] As the network is crawled, a media index is generated by storing the information which has been discussed above in an index format. The media index is weighted to provide for increased accuracy in the searching capabilities. In the described embodiment, the weighing scheme is applied factoring a weight factor for each of the following text items:

[0100] In other embodiments, alternative weighting factors may be utilized without departure from the present invention.

[0101] 2.3 Store data for each media object

[0102] Finally, data is stored for each media object. In the described embodiment, the following data is stored:

[0103] Relevant text

[0104] HTML document title

[0105] HTML meta tags

[0106] Media specific text (e.g., closed captioning, annotations, etc.)

[0107] Media URL

[0108] Anchor text

[0109] Content previews (discussed below)

[0110] Content attributes (such as brightness, color or B/W, contrast, speech v. music and volume level. In addition, sampling rate, frame rate, number of tracks, data rate, size may be stored).

[0111] Of course, in alternative embodiments a subset or superset of these fields may be used.

[0112] 3.0 Content analysis

[0113] As was briefly mentioned above, it is desirable to not only search the lexical content surrounding a media file, but also to search the content of the media file itself in order to provide a more meaningful database of information to search.

[0114] As was shown in FIG. 1, the present invention is generally concerned with indexing two types of media files (i) audio 102 and (ii) video 103.

[0115] 3.1 Video Content

[0116] The present invention discloses an algorithm used to predict the likelihood that a given video file contains a low, medium or high degree of motion. In the described embodiment, the likelihood is computed as a single scalar value, which maps into one of N buckets of classification. The value associated with the motion likelihood is called the “motion” metric. A method for determining and classifying the brightness, contrast and color of the same video signal is also described. The combination of the motion metric along with brightness, contrast and color estimates enhance the ability of users to locate a specific piece of digital video.

[0117] Once a motion estimate and brightness, contrast and color estimate exist for all video files located in an index of multimedia content, it is possible for users to execute search queries such as:

[0118] “find me all action packed videos”

[0119] “find me all dramas and talk shows”

[0120] If the digital video information is indexed in a database together with auxiliary text-based information, then it is possible to execute queries such as:

[0121] “find me all action packed videos of James Bond from 1967”

[0122] “find me all talk shows with Bill Clinton and Larry King from 1993”

[0123] Combining motion with other associated video file parameters, users can execute queries such as:

[0124] “find me all slow moving, black and white movies made by Martin Scorcese”

[0125] “find me all dark action movies filmed in Zimbabwe”

[0126] The described method for estimating motion content and brightness, contrast and color can be used together with the described algorithm for searching the worldwide Internet in order to index and intelligently tag digital multimedia content. The described method allows for powerful searching based on information signals stored inside the content within very large multimedia databases. Once an index of multimedia information exists which includes a motion metric and brightness, contrast and color estimate, users can perform field based sorting of multimedia databases. For example, a user could execute the query: find me all video, from slow moving to fast, by Steven Spielberg, and the database engine would return a list of search results, ordered from slowest to fastest within the requested motion range. In addition, if the digital video file is associated with a digital audio sequence, then an analysis of the digital audio can occur. An analysis of digital audio could determine if the audio is either music or speech. It can also determine if the speaker is male or female, and other information. This type of information could then be used to allow a user query such as:

[0127] “find me all fast video clips which contain loud music”;

[0128] “find me all action packed movies starring Sylvester Stallone and show me a preview of a portion of the movie where Stallone is talking”.

[0129] This type of powerful searching of content will become increasingly important, as vast quantities of multimedia information become digitized and moved onto digital networks which are accessible to large numbers of consumer and business users.

[0130] The described method, in its preferred embodiment, is relatively fast to compute. Historically, most systems for analyzing video signals have operated in the frequency domain. Frequency domain processing, although potentially more accurate than image based analysis, has the disadvantage of being compute intensive, making it difficult to scan and index a network for multimedia information in a rapid manner.

[0131] The described approach of low-cost computation applied to an analysis of motion and brightness, contrast and color has been found to be useful for rapid indexing of large quantities of digital video information when building searchable multimedia databases. Coupled with low-cost computation is the fact that most video files on large distributed networks (such as the Internet) are generally of limited duration. Hence the algorithms described herein can typically be applied to short duration video files in such a way that they can be represented as a single scalar value. This simplifies presentation to the user.

[0132] In addition to the image space method described here, an algorithm is presented which works on digital video (such as MPEG) which has already been transformed into a frequency domain representation. In this case, the processing can be done solely by analyzing the frequency domain and motion vector data, without needing to perform the computation moving the images into frequency space.

[0133] 3.1.1 Degree of Motion Algorithm Details (Image Space)

[0134] In order to determine if a given video file contains low, medium or high amounts of motion, it is disclosed to derive a single valued scalar which represents the video data file to a reasonable degree of accuracy. The scalar value, called the motion metric, is an estimate of the type of content found in the video file. The method described here is appropriate for those video files which may be in a variety of different coding formats (such as Vector Quantization, Block Truncation Coding, Intraframe DCT coded), and need to be analyzed in a uniform uncompressed representation. In fact, it is disclosed to decode the video into a uniform representation, since it may be coded in either an intraframe or an interframe coded format. If the video has been coded as intraframe, then the method described here is a scheme for determing the average frame difference for a pixel in a sequence of video. Likewise, for interframe coded sequences, the same metric is determined. This is desirable, even though the interframe coded video has some information about frame to frame differences. The reason that the interframe coded video is uncompressed and then analyzed, is that different coding schemes produce different types of interframe patterns which may be non uniform. The disclosed invention is based on three discoveries:

[0135] time periods can be compressed into buckets which average visual change activity

[0136] the averaged rate of change of image activity gives an indication of overall change

[0137] an indication of overall change rate is correlated with types of video content

[0138] The indication of overall change has been found to be highly correlated with the type of video information stored in an video file. It has been found through empirical examination that

[0139] slow moving video is typically comprised of small frame differences

[0140] moderate motion video is typically comprised of medium frame differences

[0141] fast moving video is typically comprised of large frame differences

[0142] and that,

[0143] video content such as talking heads and talk shows are comprised of slow moving video

[0144] video content such as newscasts and commercials are comprised of moderate speed video

[0145] video content such as sports and action films are comprised of fast moving video

[0146] The disclosed method operates generally by accessing a multimedia file and evaluating the video data to determine the visual change activity and by algorithm to compute the motion metric operates as follows:

[0147] A. Motion Estimator

[0148] if the number of samples N exceeds a threshold T, then repeat the Motion Estimator algorithm below for a set of time periods P=N/T. The value Z computed for each period P is then listed in a table of values.

[0149] as an optional preprocessing step, employ an adaptive noise reduction algorithm to remove noise. Apply either a flat field (mean), or stray pixel (median) filter to reduce mild and severe noise respectively.

[0150] if the video file contains RGB samples, then run the algorithm and average the results into a single scalar value to represent the entire sequence

[0151] B. Motion Estimator

[0152] determine a fixed sampling grid in time consisting of X video frames

[0153] if video samples are compressed, then decompress the samples

[0154] decompress all video samples into a uniform decoded representation

[0155] adjust RGB for contrast (low/med/high)

[0156] compute the RGB frame differences for each frame X with its nearest neighbor

[0157] sum up all RGB frame differences for each pixel in each frame X

[0158] compute the average RGB frame difference for each pixel for each frame X

[0159] sum and then average RGB frame differences for all pixels in all frames in a sequence.

[0160] the resulting value is the motion metric Z. The motion metric Z is normalized by taking Z-NORMAL=Z * (REF-VAL/MAX-DIFFERENCE) where MAX-DIFFERENCE is the maximum difference for all frames.

[0161] map the value Z into one of five categories

[0162] low degree of motion

[0163] moderate degree of motion

[0164] high degree of motion

[0165] very high degree of motion

[0166] Using a typical RGB range of 0-255, the categories for the scalar Z map to:

[0167] 0-20, motion content, low

[0168] 20-40, motion content, moderate

[0169] 40-60, motion content, high

[0170] 60 and above, motion content, very high

[0171] A specific example, using actual values, is as follows:

[0172] number of video frames X=1000

[0173] sample size is 8 bits per pixel, 24 bits for RGB

[0174] average frame difference per frame is 15

[0175] the sequence is characterized as low motion

[0176] Note that when the number of video frames exceeds the threshold T, then the percentage of each type of motion metric category is displayed. For example, for a video sequence which is one hour long, which may consist of different periods of low, moderate and high motion, the resulting characterization of the video file would appear as follows:

[0177] 40%, motion content low

[0178] 10%, motion content moderate

[0179] 50%, motion content high

[0180] Once the degree of motion has been computed, it is stored in the index of a multimedia database. This facilitates user queries and searches based on the degree of motion for a sequence, including the ability to provide field based sorting of video clips based on motion estimates.

[0181] 3.1.2 Degree of Motion Algorithm Details (Frequency Domain)

[0182] The method described above is appropriate for those video files which may be in a variety of different coding formats (such as Vector Quantization, Block Truncation Coding, Intraframe DCT coded), and need to be analyzed in a uniform uncompressed representation. The coded representation is decoded and then an analysis is applied in the image space domain on the uncompressed pixel samples. However, some coding formats (such as MPEG) already exist in the frequency domain and can provide useful information regarding motion, without a need to decode the digital video sequence and perform frame differencing averages. In the case of a coding scheme such as MPEG, the data in its native form already contains estimates of motion implicitly (indeed, the representation itself is called motion estimation). The method described here uses the motion estimation data to derive an estimate of motion for a full sequence of video in a computationally efficient manner.

[0183] In order to determine if a given video file contains low, medium or high amounts of motion, it is necessary to derive a single valued scalar which represents the video data file to a reasonable degree of accuracy. The scalar value, called the motion metric, is an estimate of the type of content found in the video file. The idea, when applied to MPEG coded sequences, is based on four key principles:

[0184] the MPEG coded data contains both motion vectors and motion vector lengths

[0185] the number of non-zero motion vectors is a measure of how many image blocks are moving

[0186] the length of motion vectors is a measure of how far image blocks are moving

[0187] averaging the number and length of motion vectors per frame indicates degrees of motion

[0188] The indication of overall motion has been found to be correlated with the type of video information stored in an video file. It has been found through empirical examination that

[0189] slow moving video is comprised of few motion vectors and small vector lengths

[0190] moderate video is comprised of moderate motion vectors and moderate vector lengths

[0191] fast moving video is comprised of many motion vectors and large vector lengths

[0192] and that,

[0193] video content such as talking heads and talk shows are comprised of slow moving video

[0194] video content such as newscasts and commercials are comprised of moderate speed video

[0195] video content such as sports and action films are comprised of fast moving video

[0196] An algorithm to compute the motion metric may operates as follows:

[0197] Motion Estimator (Frequency Domain)

[0198] if the number of frames N exceeds a threshold T, then repeat the Motion Estimator algorithm below for a set of time periods P=N/T. The value Z computed for each period P is then listed in a table of values.

[0199] Motion Estimator Algorithm

[0200] determine a fixed sampling grid in time consisting of X video frames

[0201] determine the total number of non-zero motion vectors for each video frame

[0202] determine the average number of non-zero motion vectors per coded block

[0203] determine the average length of motion vectors per coded block

[0204] sum and average the number of non-zero motion vectors per block in a sequence as A

[0205] sum and average the length of non-zero motion vectors per block in a sequence as B

[0206] compute a weighted average of the two averaged values as Z=W1 * A+W2 * B

[0207] the resulting value is the motion metric Z

[0208] map the value Z into one of five categories

[0209] low degree of motion

[0210] moderate degree of motion

[0211] high degree of motion

[0212] very high degree of motion

[0213] Note that when the number of video frames exceeds the threshold T, then the percentage of each type of motion metric category is displayed. For example, for a video sequence which is one hour long, which may consist of different periods of low, moderate and high motion, the resulting characterization of the video file would appear as follows:

[0214] 40%, motion content low

[0215] 10%, motion content moderate

[0216] 50%, motion content high

[0217] 3.1.3 Brightness, Contrast and Color Algorithm Details

[0218] In order to determine if a given video file contains dark, moderate or bright intensities, it is necessary to derive a single valued scalar which represents the brightness information in the video data file to a reasonable degree of accuracy. The scalar value, called the brightness metric, is an estimate of the brightness of content found in the video file. The idea is based on two key principles:

[0219] time periods can be compressed into buckets which average brightness activity

[0220] the buckets can be averaged to derive an overall estimate of brightness level

[0221] By computing the luminance term for every pixel in a frame, and then for all frames in a sequence, and averaging this value, we end up with an average luminance for a sequence.

[0222] The same method above can be applied to determining a metric for contrast and color, resulting in a scalar value which represents an average contrast and color for a sequence.

[0223] 3.1.4 Search Results Display

[0224] Once the motion and brightness level estimates have been determined, the values are displayed to user in tabular or graphical form. The tabular format would appear as shown below:

[0225] Degree of motion: high

[0226] Video intensity bright

[0227] The end result is a simple display of two pieces of textual information. This information is very low bandwidth, and yet encapsulates an extensive processing and computation on the data set. And users can more quickly find the multimedia information.

[0228] 3.2 Audio Content

[0229] Before reviewing an algorithm used by the disclosed embodiment for analyzing audio files in detail, it is worthwhile to briefly turn to FIG. 3A which provides an overview of the process. A digital audio file is initially analyzed 301 and an initial determination is made whether the file is speech 307 or music 302. If the file is determined to be music, in one embodiment, if the file is “noisy”, a noise reduction filter may be applied and the analysis repeated 303. This is because a noisy speech file may be misinterpreted as music. If the file is music, an analysis may be done to determine if the music is fast or slow 304 and an analysis may be done to determine if the music is bass or treble 305 based on a pitch analysis. In the case of speech, an analysis might be done to determine if the speech 308 is fast or slow based on frequency and whether it is male or female 309 based on pitch. By way of example, knowing that a portion of an audio track for a movie starring Sylvester Stallone has a fast, male voice, may be interpreted by retrieval software as indicating that portion of the audio track is a action scene involving Sylvester Stallone. In addition, in certain embodiments, it may be desirable to perform voice recognition analysis to recognize the voice into text 310. In some embodiments, the voice recognition capability may be limited to only recognizing a known voice, while in other more advanced embodiments, omni-voice recognition capability may be added. In either event, the recognized text may be added to the stored information for the media file and be used for searching and retrieval.

[0230] 3.2.1 Computation of a music-speech metric

[0231] In order to determine if a given audio file contains music, speech, or a combination of both types of audio, it is disclosed in one embodiment to derive a single valued scalar which represents the audio data file to a reasonable degree of accuracy. The scalar value, called the music-speech metric, is an estimate of the type of content found in the audio file. The idea is based on three key principles:

[0232] time periods can be compressed into buckets which average amplitude activity

[0233] the averaged rate of change of amplitude activity gives an indication of overall change

[0234] an indication of overall amplitude change rate is correlated with types of audio content

[0235] The indication of overall change has been found to be highly correlated with the type of audio information stored in an audio file. It has been found through empirical examination that

[0236] music is typically comprised of a continuous amplitude signal

[0237] speech is typically comprised of a discontinuous amplitude signal

[0238] sound effects are typically comprised of a discontinuous amplitude signal

[0239] and that,

[0240] music signals are typically found to have low rates of change in amplitude activity

[0241] speech signals are typically found to have high rates of change in amplitude activity

[0242] sound effects are typically found to have high rates of change in amplitude activity

[0243] audio comprised of music and speech has moderate rates of change in amplitude activity

[0244] Continuous signals are characterized by low rates of change. Various types of music, including rock, classical and jazz are often relatively continuous in nature with respect to the amplitude signal. Rarely does music jump from a minimum to a maximum amplitude. This is illustrated by FIG. 3C which illustrates a typical amplitude signal 330 for music.

[0245] Similarly, it is rare that speech results in a continuous amplitude signal with only small changes in amplitude. Discontinuous signals are characterized by high rates of change. For speech, there are often bursty periods of large amplitude interspersed with extended periods of silence of low amplitude. This is illustrated by FIG. 3B which illustrates a typical amplitude signal 320 for speech.

[0246] Sometimes speech will be interspersed with music, for example if there is talk over a song. This is illustrated by FIG. 3D which illustrates signal 340 having period 341 which would be interpreted as music, period 342 which would be speech, period 343 music, period 344 speech, period 345 music and period 346 speech.

[0247] For sound effects, there are often bursty periods of large amplitude interspersed with bursty periods of low amplitude.

[0248] Turning now to FIG. 3E, if the audio file is a compressed file (which may be in any of a number of known compression formats), it is first decompressed using any of a known decompression algorithm, block 351. A amplitude analysis is then performed on the audio track to provide a music speech metric value. The amplitude analysis is performed as follows:

[0249] The audio track is divided into time segments of a predetermined length, block 352. In the described embodiment, each time segment is 50 ms. However, in alternate embodiments, the time segments may be of a greater or lesser length.

[0250] For each segment, a normalized amplitude deviation is computed, block 356. This is described in greater detail with reference to FIG. 3F. First, for each time segment, the maximum amplitude and minimum amplitude is determined, block 351. In the example of FIG. 3B, values range from 0 to 256 (in an alternative embodiment, the values may be based on floating point calculations and may range from 0 to 1.0). For the first interval 321, the maximum amplitude value is shown as 160, for the second interval 322, it is 158 and for the third interval 323, it is 156. Then, the average maximum amplitude and average minimum amplitude is computed for all time intervals, block 352. Again, using the example in FIG. 3B, the average maximum amplitude will be 158. Next, a value MAX-DEV is computed for each interval as the absolute value of maximum amplitude for the interval minus the average maximum, block 353. For the first interval of FIG. 3b, the MAX-DEV will be 2, for the second interval, it will be 0 and for the third interval, it will be 2. Finally, the MAX-DEV is normalized by computing MAX-DEV * (REF-VALUE/MAX) where the reference value is 256 in the described embodiment (and may be 1.0 in a floating point embodiment) and MAX is the maximum amplitude for all of the intervals. Thus, for the first interval, the normalized value for MAX-DEV will be 160−(256/160)=256. Normalizing the deviation value provides for removing dependencies based on volume differences in the audio files and allows for comparison of files recorded at different volumes.

[0251] Finally, the normalized MAX-DEV values for each segment are averaged together, block 357, to determine a music-speech metric. High values tend to indicate speech, low values tend to indicate music and medium values tend to indicate a combination, block 358.

[0252] It should be noted that if for efficiency, only a portion of the audio file may be analyzed. For example, N seconds of the audio file may be randomly chosen for analysis. Also, if the audio file contains stereo or quadraphonic samples, then run the algorithm described above may be run on each channel, and the results averaged into a single scalar value to represent the entire sequence.

[0253] Note also that when the number of samples exceeds the threshold T, then the percentage of each type of music-speech metric category may computed and displayed. For example, for a soundtrack which is one hour long, which may consist of different periods of silence, music, speech and sound effects, the resulting characterization of the audio file would appear as follows:

[0254] 40%, music content: high, speech content: low

[0255] 10%, music content: high, speech content: medium

[0256] 10%, music content: medium, speech content: medium

[0257] 10%, music content: medium, speech content: high

[0258] 30%, music content: low, speech content: high

[0259] 3.2.2 Volume Algorithm Details

[0260] In order to determine if a given audio file contains quiet, soft or loud audio information, it is disclosed to derive a single valued scalar which represents the volume information in the audio data file to a reasonable degree of accuracy. The scalar value, called the volume level metric, is an estimate of the volume of content found in the audio file. The idea is based on three key principles:

[0261] time periods can be compressed into buckets which average volume activity

[0262] the buckets can be averaged to derive an overall estimate of volume level

[0263] In general, the disclosed algorithm provides for determining the volume level of data in an audio file by evaluating the average amplitude for set of sampled signals. In particular, the disclosed algorithm comprises the steps of:

[0264] if the number of samples N exceeds a threshold T, then repeat the Volume Audio Channel Estimator algorithm, below, for a set of time periods P=N/T. The value Z computed for each period P is then listed in a table of values.

[0265] if the audio file contains mono samples, then run the algorithm on a single channel

[0266] if the audio file contains stereo samples, then run the algorithm on each channel, and average the results into a single scalar value to represent the entire sequence

[0267] if the audio file contains quadraphonic samples, then run the algorithm on each channel, and average the results into a single scalar value to represent the entire sequence

[0268] The algorithm used by the described embodiment for volume estimation is then given by FIG. 3G as follows:

[0269] if audio samples are compressed, then decompress the samples into a uniform PCM coded representation, block 361.

[0270] The audio track is mapped into X time segment buckets, 362.

[0271] determine the total number of audio samples N, block 366. The samples will get mapped into time segment buckets, block 367. The mapping is such that a single bucket represents N/X samples of sound and the N/X samples is called a compressed time sample C

[0272] Compute the average amplitude value for each bucket X, 368 by summing up all amplitude values within C and dividing to obtain an average amplitude.

[0273] compute the average amplitude A for all X buckets, block 369

[0274] the resulting value is volume estimate A

[0275] map the value A into one of five categories:

[0276] quiet

[0277] soft

[0278] moderate

[0279] loud

[0280] very loud

[0281] Using a typical maximum amplitude excursion of 100, the categories for A map to:

[0282] 0-50, quiet

[0283] 50-70, soft

[0284] 70-80, moderate

[0285] 80-100, loud

[0286] 100—above, very loud

[0287] It will be apparent to one skilled in the art that alternate “bucket sizes” can be used and the mapping may be varied from the mapping presented in the disclosed algorithm without departure from the spirit and scope of the invention.

[0288] When the number of samples exceeds the threshold T, then the percentage of each type of volume category is displayed. For example, for a soundtrack which is one hour long, which may consist of different periods of silence, loudness, softness and moderate sound levels, the resulting characterization of the audio file would appear as follows:

[0289] 30%, quiet

[0290] 20%, soft

[0291] 5%, moderate

[0292] 10%, loud

[0293] 35%, very loud

[0294] 3.2.3 Search Results Display

[0295] Once the music-speech and volume level estimates have been determined, the values are displayed to the user in tabular or graphical form The tabular format may appear as shown below:

[0296] Music content: high

[0297] Speech content: low

[0298] Volume level: loud

[0299] The end result is a simple display of three pieces of textual information. This information is very low bandwidth, and yet encapsulates an extensive processing and computation on the data set. And users can more quickly find the multimedia information they are looking for.

[0300] 3.2.4 Waveform display

[0301] A focus of the method described herein is to generate a visual display of audio information which can aid a user to determine if an audio file contains the audio content they are looking for. This method is complements the other types of useful information which can be computed and or extracted from digital audio files; the combination of context and content analysis, together with graphical display of content data results in a composite useful snapshot of a piece of digital media information.

[0302] As users need to sift through large quantities of music, sound effects and speeches (on large distributed networks such as the Internet) it will be useful to process the audio signals to enhance the ability to distinguish one audio file from another. The use of only keyword based searching for media content will prove to be increasingly less useful than a true analysis and display of the media signal.

[0303] The algorithm described herein is used to display a time compressed representation of an audio signal. The method is focused on providing some high level features visually of the time varying sound signal. The method described can allow users to:

[0304] differentiate visually between music and speech

[0305] observe periods of silence interspersed with loud or soft music/speech

[0306] observe significant changes in volume level

[0307] identify extended periods in an audio track where volume level is very low or high

[0308] Using a multimedia search engine it is possible for users to execute a query such as:

[0309] “find me all soft music by Beethoven from the seventeenth century”

[0310] The results returned might be a set of fifty musical pieces by Beethoven. If the searcher knows that the piece of music they are looking for has a very quiet part towards the end of the piece, the user could view the graphical representation and potentially find the quiet part by seeing the waveform display illustrate a volume decrease towards the end of the waveform image. This could save the searcher great amounts of time that would have been required to listen to all fifty pieces of music.

[0311] Using a multimedia search engine it is possible for users to execute a query such as:

[0312] “find me all loud speeches by Martin Luther King”

[0313] A searcher might be looking for a speech by Martin Luther King, where the speech starts out with him yelling loudly, and then speaking in a normal tone of voice. If twenty speeches are returned from the search engine results, then the searcher could visually scan the results and look for a waveform display which shows high volume at the beginning and then levels off within the first portion of the audio signal. This type of visual identification could save the searcher great amounts of time which would be required to listen to all twenty speeches.

[0314] Continuous signals are characterized by low rates of change. Various types of music, including rock, classical and jazz are often relatively continuous in nature with respect to the amplitude signal. Rarely does music jump from a minimum to a maximum amplitude. Similarly, it is rare that speech results in a continuous amplitude signal with only small changes in amplitude. Discontinuous signals are characterized by high rates of change. For speech, there are often bursty periods of large amplitude interspersed with extended periods of silence of low amplitude. For sound effects, there are often bursty periods of large amplitude interspersed with bursty periods of low amplitude. These trends can often be identified computationally, or visually, or using both methods. A method is illustrated here which derives a visual representation of sound in a temporally compressed format. The goal is to illustrate long term trends in the audio signal which will be useful to a user when searching digital multimedia content. Note that the method produces visual images of constant horizontal resolution, independent of the duration in seconds. This means that temporal compression must occur to varying degrees while still maintaining a useful representation of long term amplitude trends within a limited area of screen display.

[0315] An algorithm, as used by the described embodiment, to compute and display the waveform operates as follows:

[0316] A. Waveform Display

[0317] if the number of samples N exceeds a threshold T, then repeat the Waveform Display algorithm below for a set of time periods P=N/T. A different waveform is computed for each time period.

[0318] if the audio file contains mono samples, then run the algorithm on a single channel

[0319] if the audio file contains stereo samples, then run the algorithm on each channel, and display the results for each channel

[0320] if the audio file contains quadrophonic samples, then run the algorithm on each channel, and display the results for each channel

[0321] B. Waveform Display Algorithm

[0322] determine a fixed sampling grid in time consisting of X buckets

[0323] if audio samples are compressed, then decompress the samples

[0324] decompress all audio samples into a uniform PCM coded representation

[0325] determine the total number of audio samples N

[0326] determine the number of samples which get mapped into a single bucket

[0327] the mapping is that a single bucket represents N/X samples of sound

[0328] the N/X samples term is called a compressed time sample C

[0329] compute the minimum, maximum and average amplitude value for each bucket X

[0330] display an RGB interpolated line from the minimum to the maximum amplitude

[0331] the line passes through the average amplitude

[0332] red represents maximum amplitude

[0333] green represents average amplitude

[0334] blue represents minimum amplitude

[0335] the interpolation occurs using integer arithmetic

[0336] the line is rendered vertically from top to bottom within each bucket X

[0337] compress the resulting waveform using a DCT based compression scheme (or alternate)

[0338] Note that when the number of samples exceeds the threshold T, then a series of waveform displays are computed. For example, for a soundtrack which is one hour long, which may consist of different periods of silence, music, speech and sound effects, the resulting waveform display characterization would need to be broken up into segments and displayed separately. The ability to scan through these displays would then be under user control.

[0339] 3.2.5 Additional Processing and Analysis of Audio Files

[0340] After a digital audio file has been classified as music, speech or a combination of the two, additional processing and analysis can be applied in order to extract more useful information from the data. This more useful information can be used to enhance the ability of users to search for digital audio files.

[0341] For the case of audio files which have been classified as music, with some degree of speech content (or which have been classified as speech, with some degree of music content) one can assume that there is a speaking or singing voice within the audio file accompanied with the music. A conventional speech recognition algorithm can then be applied (also called speech to text) which can convert the speech information in the audio file into textual information. This will allow the audio file to then be searchable based on its internal characteristics, as well as the actual lyrics or speech narrative which accompanies the music.

[0342] For the case of audio files which have been classified as speech, one can assume that there is a reasonable certainty of a speaking voice within the audio file. A conventional speech recognition algorithm can then be applied (also called speech to text) which can convert the speech information in the audio file into textual information. This will allow the audio file to then be searchable based on its internal characteristics, as well as the actual narrative which is within the audio file. The speech may correspond to closed captioning information, script dialogue or other forms of textual representation.

[0343] 3.2.6 Determining if a Given Music File contains Fast or Slow Music

[0344] When an audio file is first examined, a determination can be made if the audio data is sampled and digitized, or is completely synthetic. If the data has been digitized, then all of the processes described above can be applied. If the data has been synthesized, then the audio file is MIDI information (Musical Instrument Digital Interface). If a file has been identified as MIDI, then it is possible to scan for information in the file regarding tempo, tempo changes and key signature. That information can be analyzed to determine the average tempo, as well as the rate of change of the tempo. In addition, the key signature of the music can be extracted. The tempo, rate of change of tempo and key signature can all be displayed in search results for a user as:

[0345] tempo: (slow, moderate, fast)

[0346] rate of change of tempo (low, medium, high)

[0347] indicates if the music changes pace frequently

[0348] signature

[0349] key of music

[0350] indication of minor and major key

[0351] Note that when the number of samples exceeds the threshold T, then the percentage of each type of tempo category is displayed. For example, for a soundtrack which is one hour long, which may consist of different periods of fast, moderate or slow tempo levels, the resulting characterization of the music file would appear as follows:

[0352] 30%, slow

[0353] 20%, moderate

[0354] 20%, fast

[0355] 30%, very fast

[0356] 4.0 Previews

[0357] The described embodiment is concerned with parsing content files and building low-bandwidth previews of higher bandwidth data files. This allows rapid previewing of media data files, without need to download the entire file.

[0358] 4.1 Preview Overview

[0359] In the described embodiment, for video media files, a preview mechanism has been developed. A sample of the results of search, showing a media preview is given in FIG. 4A. The preview is explained in greater detail with reference to FIG. 4B. FIG. 4B illustrates a preview 410. The preview comprises a first sprocket area 411 at the top of the preview and a second sprocket area at the bottom of the preview, a image area having three images of height IH 412 and width IW 413. The preview itself is of height FH 414 and width FW 415. In addition, in certain embodiments, the preview may include a copyright area 416 for providing copyright information relating to the preview and certain embodiments may contain an area, for example in the upper left hand corner of the first sprocket area 411 for a corporate logo or other branding information.

[0360] A general algorithm for generation and display of previews is disclosed with reference to FIG. 4C. Generally, after finding a media object, as was discussed above in Section 1 in connection with crawling to locate media files, the media file is examined to locate portions having predetermined characteristics. For example, portions of a video file having fast action may be located. Or, portions of a video having black and white portions.

[0361] Next, a preview of the object is generated and stored. This will be discussed in greater detail in connection with FIG. 4D. Finally, when requested by a user, for example, in response to a search, the preview may be displayed.

[0362] 4.2 Preview Generation

[0363] Turning now to FIG. 4D, the process for generation of a preview is discussed in greater detail. Initially, a determination is made of the object type, block 431. The object may be, for example, a digital video file, an animation file, or a panoramic image. In the case of digital video, as was discussed above, the file may be downloadable or streaming. And, if downloadable, the file may have table based frame descriptions or track based frame descriptions. Animation objects include animated series of frames using a lossless differential encoding scheme and hyperlinked animation.

[0364] Regardless of the media type, a preview is generated generally along the lines of the preview of FIG. 4A and 4B, block 432.

[0365] 4.2.1 Sizing of preview and images

[0366] The sizing of the preview and of images is done in the described embodiment as follows:

[0367] A) Initially, an aspect ratio is computed for the preview. The aspect ratio is computed as the width of a frame of the object divided by the height or A=W/H.

[0368] B) The target filmstrip is set with a width FW 415 and a height FH. A distance ID is set for the distance between images on the filmstrip. Next, a a sprocket height and width is set resulting in a sprocket region height (SRH 411). The particular heights and widths may vary from implementation to implementation dependent on a variety of factors such as expected display resolution. In alternative embodiment, differing sprocket designs may be utilized and background colors, etc. may be selected. In certain embodiments, it may be desirable to include copyright information 416 or a logo.

[0369] C) In any event, the target height IH 412 of a filmstrip image can be computed as IH=FH−(2 * SRH). The target width of an image can be computed as a function of the aspect ratio as follows: IW=A * IH. The number N of filmstrip images which will be displayed can them be computed as N=FW/(IW+ID).

[0370] Using the above calculations, the number, width and height of images can be determined for display of a preview.

[0371] 4.2.2 Selection of images

[0372] The selection images for use in the preview is dependent on whether the preview is being generated for a 3D media object, a digital video or animation object, or a panoramic object.

[0373] 4.2.2.1 Selection of images—Digital Video and Animation

[0374] For digital video or animation sequences, a temporal width TW is calculated, block 442, as TW=T/(N+1) where T is equal to the length (time) of the media object and N is the number of frames calculated as discussed above. N frames from the image are then decompressed to pure RGB at N fixed points in the image where the N fixed points at TW, 2*TW, 3*TW, . . . N* TW time into the media image. This process reduces the need to decompress the entire video file. Scanning to the particular ones of the N frames is accomplished by using the table based frame description, the track based frame description or by streaming dependent on the media source file. An objective of choosing N frames spaced TW apart is to develop a preview with frames from various portions of the media file so that the user will be given an opportunity to review the various portions in making a determination if the user wishes to access the entire file.

[0375] The decompress process may utilize intraframe, predictive decoding or bilinear decoding dependent on the source file. In the described embodiment, a color space conversion is then performed from RGB to YUV. Optionally, an adaptive noise reduction process may be performed.

[0376] Each of the N frames are then analyzed to determine if the frame meets predetermined criteria for display, block 444. Again, an objective is to provide the user with a quality preview allowing a decision if the entire file should be accessed. In the described embodiment, each of the N frames are analyzed for brightness, contrast and quality. If the frames meet for the criteria, block 445, then the frame is scaled, block 447 from its original width W and height H to width IW and height IH using interpolation. Linear interpolation is utilized and the aspect ratio is maintained.

[0377] Each frame is also analyzed for a set of attributes, block 448. The attributes in the described embodiment include brightness, contrast (luminance, deviation), chrominance, and dominant color. Brightness indicates the overall brightness of digital video clip. Color indicates if the video clip is in full color or black and white, and contrast indicates the degree of contrast in the movie. These high level content attributes tend to be more meaningful for the typically short video sequences which are published on the Internet and Intranet. The computation for each of the attributes is detailed below. This information can then be used for enhanced searching. For example, chrominance can be used for searching for black and white versus color video. In addition, embodiments may provide for optionally storing a feature vector for texture, composition and structure. These attributes can be averaged across the N frames and the average for each attribute is stored as a searchable metric. In addition, optionally, the contrast of the frames may be enhanced using a contrast enhancement algorithm.

[0378] We will now briefly describe computation of the chrominance, luminance and contrast values. The maximum chrominance is computed for the selected N frames in the video sequence. The maximum chrominance for the set of frames is then determined by finding the maximum chrominance for each frame by finding the maximum chrominance for all pixels in each frame. This maximum chrominance value for the set of selected frames is then compared against a threshold. If the maximum chrominance for the sequence is larger than the threshold, then the sequence is considered in full color. If the maximum chrominance for the sequence is smaller than the threshold, then the sequence is considered in black and white.

[0379] The luminance is computed for the selected N frames in the video sequence. The luminance is then averaged into a single scalar value.

[0380] To determine contrast, luminance values are computed for each frame of the digital video sequence. The luminance values which fall below the fifth percentile, and above the ninety-fifth percentile are then removed from the set of values. This is done to remove random noise. The remaining luminance values are then examined for the maximum and minimum luminance. The difference between the maximum and minimum luminance is computed as the contrast for a single frame. The contrast value is then computed for all frames in the sequence, and the average contrast is stored as the resulting value.

[0381] Finally, audio and video clips may be associated with each frame, block 449. For audio, a standard audio segment may be selected or alternatively an audio selection algorithm may be applied which finds audio which meets predetermined criteria, such as a preset volume level. For video, a video track of duration VD is selected. The video selection may be a standard video segment or the video segment may be selected using a video selection algorithm which selects video segments meeting a predetermined criteria such as video at a predetermined brightness, contrast or motion.

[0382] Going back to analysis of the frames, if one of the N frames does not meet the criteria, block 445, a frame iterator algorithm is applied to select a new frame. The frame iterator algorithm of the described embodiment selects another frame by iteratively selecting frames between the frame in question and the other frames until a frame is found which meets the criteria or until a predetermined number of iterations have been applied. If the predetermined number of iteration are applied without successfully finding a frame which meets the criteria, the originally selected frame is used. The algorithm starts with the original frame at TW (or, 2*TW, 3*TW . . . N* TW) and selects, first, a frame at TW−(TW/2) (i.e., a frame halfway between the original frame and the beginning). If this frame does not meet the criteria, a frame at TW+(TW/2) is selected and iteratively frames are selected according to the pattern:

[0383] ((TW−(TW/2)), (TW+(TW/2), (TW−(TW/4)), (TW+(TW/4), . . . (TW−(TW/X)), (TW+(TW/X)).

[0384] 4.2.2.2 Selection of images—Panoramic

[0385] Interactive panoramic images are often stored as multimedia files. Typically these media files are stored as a series of compressed video images, with a total file size ranging from 100 to 500 Kbytes. The described embodiment provides a method which creates a low bandwidth preview of a panoramic picture. A preview, in the described embodiment utilizes approximately 10 Kbytes in storage size which is only 1/10th to 1/50th of the original panoramic storage. The preview provides a high-quality, low bit rate display of the full panoramic scene. In the described embodiment, the method for creating the panoramic preview, block 450, may be described as follows:

[0386] 1) extract all information from the header of the media file to determine the width, height and number of tiles for the panoramic scene. Create an offscreen buffer to generate the new panoramic picture preview.

[0387] 2) For each tiled image on the media file, decode the image using the coding algorithm which was used to encode the original tiles. The decoded files are converted to pure RGB and then to YUV. The tiles are scaled from (W, H) to (IW, IH) similar to as discussed above. In other embodiments, as a next step, the image may be scaled by a factor of two in each direction.

[0388] 3) Re-orient the tile by rotating it 90 degrees clockwise.

[0389] 4) For each scaled and rotated tile, copy the image (scanning from right to left) into the offscreen buffer.

[0390] 5) In the case of embodiment which scales by the factor of two, when all tiles have been processed, examine the resulting picture size after it has been reduced by a factor of two. If the image is below a fixed resolution then the process is complete. If the image is above a fixed resolution, then reduce the picture size again by a factor of two, until it is less than or equal to the fixed resolution.

[0391] 6) Composite the reconstructed panoramic picture with filmstrip images on the top and bottom of the picture to create a look and feel consistent with the filmstrip images for video sequences.

[0392] 7) Any of a number of known compression algorithms may be applied to the reconstructed and composited panoramic picture to produce a low bandwidth image preview. Coding schemes can include progressive or interlaced transmission algorithms.

[0393] 4.2.2.3 Selection of images—3D

[0394] For 3D images, a top view, bottom view, front view and rear view are selected for images to display, block 441.

[0395] 4.3 Interactive Display of Search Results

[0396] When returning search results from a user's multimedia query to a database, it is disclosed to generate appropriate commands to drive a web browser display to facilitate interactive viewing of the search results. Depending on the position a user selects (for example with a mouse or other cursor control device) within a preview of the media content shown in the search result, the user will begin interaction with the content at different points in time or space. The end result is a more useful and interactive experience for a user employing a multimedia search engine.

[0397] For example, if a user searches for videos of a car, then the web server application can return a series of HTML and EMBED tags which setup a movie controller, allowing a user to interact with the videos of cars. When the low bandwidth preview (a filmstrip showing select scenes of the video clip) is presented to a user, the position of the mouse that is active when a user clicks within the preview will drive the resulting EMBED tags which are created and then returned from the server. For example:

[0398] if a user clicks down in frame X of a filmstrip, then an in-line viewer is created which will begin display and playback of the movie at frame X. In an alternative embodiment, a snipet or short segment of a video or audio file may be stored with the preview and associated with a particular portion of the preview. This method avoids the need to access the original file for playback of a short audio or video segment.

[0399] if a user clicks down at pan angle X, tilt angle Y and fov Z within a panorama filmstrip, then an in-line viewer is created which will begin display of the panorama at those precise viewing parameters.

[0400] if a user clicks down within a select viewpoint of a 3D scene within a filmstrip, then an in-line viewer is created which will begin display of the 3D scene at that viewpoint.

[0401] if a user clicks down within an audio waveform at time T, then an in-line viewer is created which will begin begin playback of the sound at that particular time T.

[0402] By allowing users to drive the points in time or space where their display of interactive media begins, users can more precisely hone in on the content they are looking for. For example, if a user is looking for a piece of music which has a certain selection which is very loud, they may observe the volume increase in the graphical waveform display, click on that portion of the waveform and then hear the loud portion of the music. This takes them directly to the selection of interest.

[0403] 4.4 Use of Media Icons to illustrate search results

[0404] When returning search results from a user's multimedia query to a database, the described embodiment provides for both a text and visual method for showing that the search results are of different media types. For example, when executing a search for the word “karate”, it is possible that numerous search results will be returned, including digital video, audio, 3D, animation, etc. Video may show karate methods, sound might be an interview with a karate expert, 3D could be a simulation of a karate chop and animation a display of a flipbook of a karate flip. In order to enable a viewer to rapidly scan a page and distinguish the different media types, an icon which is representative of each type of media is employed.

[0405] By using a universal set of icons as shown in the figures for media types, it enhance the ability of users to scan a page of search results and quickly jump to those responses which are most relevant. In addition, the use of media icons can transcend barriers of language and culture, making it easier for people from different cultures and speaking different languages to understand search results for multimedia queries.

[0406] 4.5 Selection of basic, detailed or visual results

[0407] In the described embodiment, users can select basic, detailed or visual search results. If a user selects visual search results, then only visual images, filmstrips or waveforms are presented to users as search results. The visual search results are typically displayed as a set of mosaics on a page, usually multiple thumbnail images per row, and multiple filmstrips (usually two) per row. Clicking on images, waveforms or filmstrips then takes users to new web pages where more information is described about the media content. This allows users to rapidly scan a page of visual search results to see if they can find what they are looking for.

[0408] 4.5 Timecode based display

[0409] Text keywords may be found within certain multimedia files (e.g., the content of the file). For example, movie and other video files sometimes contain a movie text track, a closed caption track or a musical soundtrack lyrics track. For each text keyword which is found in one of these tracks, a new database is created by the process of the present invention. This database maps keywords to [text, timecode] pairs. This is done so that it is possible to map keywords directly to the media file and timecode position where the media file text reference occurs. The timecode position is subsequently used when producing search results to viewers, so that viewers can jump directly to that portion of the media sequence where the matching text occurs.

[0410] There are, of course, alternatives to the described embodiment which are within the reach of one of ordinary skill in the relevant art. The present invention is intended to be limited only by the claims presented below.