|Publication number||US7287226 B2|
|Application number||US 09/731,581|
|Publication date||23 Oct 2007|
|Filing date||6 Dec 2000|
|Priority date||6 Dec 2000|
|Also published as||US8612859, US20020097258, US20080109728|
|Publication number||09731581, 731581, US 7287226 B2, US 7287226B2, US-B2-7287226, US7287226 B2, US7287226B2|
|Inventors||David M. Maymudes, Daniel J. Miller|
|Original Assignee||Microsoft Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (118), Non-Patent Citations (4), Referenced by (18), Classifications (14), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention generally relates to processing media content and, more particularly, to a system and related interfaces facilitating the processing of media content.
Recent advances in computing power and related technology have fostered the development of a new generation of powerful software applications. Gaming applications, communications applications, and multimedia applications have particularly benefited from increased processing power and clocking speeds. Indeed, once the province of dedicated, specialty workstations, many personal computing systems now have the capacity to receive, process and render multimedia objects (e.g., audio and video content). While the ability to display (receive, process and render) multimedia content has been around for a while, the ability for a standard computing system to support true multimedia editing applications is relatively new.
In an effort to satisfy this need, Microsoft Corporation introduced an innovative development system supporting advanced user-defined multimedia editing functions. An example of this architecture is presented in U.S. Pat. No. 5,913,038 issued to Griffiths and commonly owned by the assignee of the present invention, the disclosure of which is expressly incorporated herein by reference.
In the '038 patent, Griffiths introduced the an application program interface which, when exposed to higher-level development applications, enables a user to graphically construct a multimedia processing project by piecing together a collection of “filters” exposed by the interface. The interface described therein is referred to as a filter graph manager. The filter graph manager controls the data structure of the filter graph and the way data moves through the filter graph. The filter graph manager provides a set of component object model (COM) interfaces for communication between a filter graph and its application. Filters of a filter graph architecture are preferably implemented as COM objects, each implementing one or more interfaces, each of which contains a predefined set of functions, called methods. Methods are called by an application program or other component objects in order to communicate with the object exposing the interface. The application program can also call methods or interfaces exposed by the filter graph manager object.
Filter graphs work with data representing a variety of media (or non-media) data types, each type characterized by a data stream that is processed by the filter components comprising the filter graph. A filter positioned closer to the source of the data is referred to as an upstream filter, while those further down the processing chain is referred to as a downstream filter. For each data stream that the filter handles it exposes at least one virtual pin (i.e., distinguished from a physical pin such as one might find on an integrated circuit). A virtual pin can be implemented as a COM object that represents a point of connection for a unidirectional data stream on a filter. Input pins represent inputs and accept data into the filter, while output pins represent outputs and provide data to other filters. Each of the filters include at least one memory buffer, wherein communication of the media stream between filters is often accomplished by a series of “copy” operations from one filter to another.
As introduced in Griffiths, a filter graph has three different types of filters: source filters, transform filters, and rendering filters. A source filter is used to load data from some source; a transform filter processes and passes data; and a rendering filter renders data to a hardware device or other locations (e.g., saved to a file, etc.). An example of a filter graph for a simplistic media rendering process is presented with reference to
Products utilizing the filter graph have been well received in the market as it has opened the door to multimedia editing using otherwise standard computing systems. It is to be appreciated, however, that the construction and implementation of the filter graphs are computationally intensive and expensive in terms of memory usage. Even the most simple of filter graphs requires and abundance of memory to facilitate the copy operations required to move data between filters. Complex filter graphs can become unwieldy, due in part to the linear nature of prior art filter graph architecture. Moreover, it is to be appreciated that the filter graphs themselves consume memory resources, thereby compounding the issue introduced above.
Thus, what is required is a filter graph architecture which reduces the computational and memory resources required to support even the most complex of multimedia projects. Indeed, what is required is a dynamically reconfigurable multimedia editing system and related methods, unencumbered by the limitations described above. Just such a system and methods are disclosed below.
Multi-media project editing methods and systems are described. In one embodiment, a project editing system comprises a multi-media editing application that is configured to enable a user to combine multiple different video clips into a video project. A bitmap processor coupled with the multi-media editing application receives a first bitmap that can be used to render a transition between video clips and automatically processes the first bitmap to provide a different transition between video clips. Processing of the first bitmap can include, without limitation, using the first bitmap to provide an entirely new and different second bitmap, or processing the first bitmap in a manner which renders a transition that is different from the transition defined by the first bitmap. In one embodiment, a user is able to enter one or more parameters, through a user interface (UI), with the parameters then being used to manipulate the first bitmap to provide the different transition. Processing of the first bitmap can include many different operations, among which can be included one or more of: stretching, shrinking, replication, and offsetting. In addition, the first bitmap can be processed to include, in the transition it defines, a border that is not otherwise defined by the first bitmap.
The same reference numbers are used throughout the figures to reference like components and features.
This application is related to the following commonly-filed U.S. patent applications, all of which are commonly assigned to Microsoft Corp., the disclosures of which are incorporated by reference herein:
Various described embodiments concern an application program interface associated with a development system. According to one example implementation, the interface is exposed to a media processing application to enable a user to dynamically generate complex media processing tasks, e.g., editing projects. In the discussion herein, aspects of the invention are developed within the general context of computer-executable instructions, such as program modules, being executed by one or more conventional computers. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, personal digital assistants, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. In a distributed computer environment, program modules may be located in both local and remote memory storage devices. It is noted, however, that modification to the architecture and methods described herein may well be made without deviating from spirit and scope of the present invention. Moreover, although developed within the context of a media processing system paradigm, those skilled in the art will appreciate, from the discussion to follow, that the application program interface may well be applied to other development system implementations. Thus, the media processing system described below is but one illustrative implementation of a broader inventive concept.
Example System Architecture
It is to be appreciated that computing environment 200 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the media processing system. Neither should the computing environment 200 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary computing environment 200.
The media processing system is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the media processing system include, but are not limited to, personal computers, server computers, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
In certain implementations, the system and related methods for processing media content may well be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The media processing system may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
In accordance with the illustrated example embodiment of
Bus 206 is intended to represent one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnects (PCI) buss also known as Mezzanine bus.
Computer 200 typically includes a variety of computer readable media. Such media may be any available media that is locally and/or remotely accessible by computer 200, and it includes both volatile and non-volatile media, removable and non-removable media.
Computer 200 may further include other removable/non-removable, volatile/non-volatile computer storage media. By way of example only,
The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules, and other data for computer 200. Although the exemplary environment described herein employs a hard disk 228, a removable magnetic disk 232 and a removable optical disk 236, it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROM), and the like, may also be used in the exemplary operating environment.
A number of program modules may be stored on the hard disk 228, magnetic disk 232, optical disk 236, ROM 208, or RAM 210, including, by way of example, and not limitation, an operating system 214, one or more application programs 216 (e.g., multimedia application program 224), other program modules 218, and program data 220. In accordance with the illustrated example embodiment of
A monitor 256 or other type of display device is also connected to bus 206 via an interface, such as a video adapter 244. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers and printers, which may be connected through output peripheral interface 246.
Computer 200 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 250. Remote computer 250 may include many or all of the elements and features described herein relative to computer 200 including, for example, render engine 222 and one or more development applications 216 utilizing the resources of render engine 222.
As shown in
When used in a LAN networking environment, the computer 200 is connected to LAN 251 through a suitable network interface or adapter 248. When used in a WAN networking environment, the computer 200 typically includes a modem 254 or other means for establishing communications over the WAN 252. The modem 254, which may be internal or external, may be connected to the system bus 206 via the user input interface 242, or other appropriate mechanism.
In a networked environment, program modules depicted relative to the personal computer 200, or portions thereof, may be stored in a remote memory storage device. By way of example, and not limitation,
Turning next to
The communications interface 302 is intended to represent any of a number of alternate interfaces used by operating systems to expose application program interface(s) to applications. According to one example implementation, interface 302 is a component object model (COM) interface, as used by operating systems offered by Microsoft Corporation. As introduced above, COM interface 302 provides a means by which the features of the render engine 222, to be described more fully below, are exposed to an application program 216.
In accordance with the illustrated example implementation of
In accordance with the example implementation of a media processing system, an application communicates with an instance of render engine 222 when the application 216 wants to process streaming media content. Render engine 222 selectively invokes and controls an instance of filter graph manager (not shown) to automatically create a filter graph by invoking the appropriate filters (e.g., source, transform and rendering).As introduced above, the communication of media content between filters is achieved by either (1) coupling virtual output pins of one filter to the virtual input pins of requesting filter; or (2) by scheduling object calls between appropriate filters to communicate the requested information. As shown, source filter 304 receives streaming data from the invoking application or an external source (not shown). It is to be appreciated that the streaming data can be obtained from a file on a disk, a network, a satellite feed, an Internet server, a video cassette recorder, or other source of media content. As introduced above, transform filter(s) 306 take the media content and processes it in some manner, before passing it along to render filter 310. As used herein, transform filter(s) 306 are intended to represent a wide variety of processing methods or applications that can be performed on media content. In this regard, transform filter(s) 306 may well include a splitter, a decoder, a sizing filter, a transition filter, an effects filter, and the like. The function of each of these filters is described more fully in the Griffiths application, introduced above, and generally incorporated herein by reference. The transition filter, as used herein, is utilized by render engine 222 to transition the rendered output from a first source to a second source. The effect filter is selectively invoked to introduce a particular effect (e.g., fade, wipe, audio distortion, etc.) to a media stream.
In accordance with one aspect of the embodiment, to be described more fully below, matrix switch filter 308 selectively passes media content from one or more of a scalable plurality of input(s) to a scalable plurality of output(s). Moreover, matrix switch 308 also supports implementation of a cascaded architecture utilizing feedback paths, i.e., wherein transform filters 306B, 306C, etc. coupled to the output of matrix switch 308 are dynamically coupled to one or more of the scalable plurality of matrix switch input(s). An example of this cascaded filter graph architecture is introduced in
Typically, media processed through source, transform and matrix switch filters are ultimately passed to render filter 310, which provides the necessary interface to a hardware device, or other location that accepts the renderer output format, such as a memory or disk file, or a rendering device.
As introduced above, the inputs 402 and outputs 404 of matrix switch 308 are interfaces which facilitate the time-sensitive routing of data (e.g., media content) in accordance with a user-defined development project. Matrix switch 308 has a scalable plurality of inputs 402 and outputs 404, meaning that the number of inputs 402 and outputs 404 are individually generated to satisfy a given editing project. Insofar as each of the inputs/outputs (I/O) has an associated transfer buffer (preferably shared with an adjacent filter) to communicate media content, the scalability of the input/output serves to reduce the overall buffer memory consumed by an editing project. According to one implementation, output 1 is generally reserved as a primary output, e.g., coupled to a rendering filter (not shown).
According to one implementation, for each input 402 and output 404, matrix switch 308 attempts to be the allocator, or manager of the buffer associated with the I/O(s) shared with adjacent filters. One reason is to ensure that all of the buffers are of the same size and share common attributes so that a buffer associated with any input 402 may be shared with any output 404, thereby reducing the need to copy memory contents between individual buffers associated with such inputs/outputs. If matrix switch 308 cannot be an allocator for a given output (404), communication from an input (402) to that output is performed using a conventional memory copy operation between the individual buffers associated with the select input/output.
As introduced above, the matrix switch programming grid 406 is dynamically generated by render engine 222 based, at least in part, on the user-defined development project. As will be developed below, render engine 222 invokes an instance of filter graph manager to assembles a tree structure of an editing project, noting dependencies between source, filters and time to dynamically generate the programming grid 406. A data structure comprising an example programming grid 406 is introduced with reference to
Turning briefly to
As introduced above, the filter graph is time-aware in the sense that media (source) time and project execution time are maintained. According to one implementation, matrix switch 308 maintains at least the project clock, while an upstream filter maintains the source time, converting between source and project time for all downstream filters (i.e., including the matrix switch 308). According to one implementation, the frame rate converter filter of a filter graph is responsible for converting source time to project time, and vice versa, i.e., supporting random seeks, etc. Alternatively, matrix switch 308 utilizes an integrated set of clock(s) to independently maintain project and media times.
Having introduced the architectural and operational elements of matrix switch filter 308,
According to one implementation, a matrix switch filter 308 can only process one type of media content, of the same size and at the same frame-rate (video) or modulation type/schema (audio). Thus,
In addition filter graph 600 includes a decoder filter 610 to decode the media content. Resize filter 614 is employed when matrix switch 308 is to receive content from multiple sources, ensuring that the size of the received content is the same, regardless of the source. According to one implementation, resize filter 614 is selectively employed in video processing paths to adjust the media size of content from one or more sources to a user-defined level. Alternatively, resizer filter 614 adjusts the media size to the largest size provided by any one or more media sources. That is, if, for example, render engine 222 identifies the largest required media size (e.g., 1270×1040 video pixels per frame) and, for any content source not providing content at this size, the content is modified (e.g., stretched, packed, etc.) to fill this size requirement. The frame rate converter (FRC) and pack filter 618, introduced above, ensures that video content from the multiple sources is arriving at the same frame rate, e.g., ten (10) frames per second. As introduced above, the FRC also maintains the distinction between source time and project time.
In accordance with one aspect of the present invention, filter graph 600 is depicted utilizing a single, negotiated buffer 604, 608, 612, 616, etc. between adjacent filters. In this regard, render engine 222 reduces the buffer memory requirements in support of a development project.
From the point of pre-processing (filters 602, 606, 610, 614, 618), rather than continue a linear filter graph incorporating all of the transition 620 and effect 622 filter(s), render engine 222 utilizes a cascade architecture, recursively passing media content through the matrix switch 308 to apply to the transform filter(s) (e.g., 620, 622, etc.) to complete the execution of the development project. It will be appreciated by those skilled in the art that the ability to recursively pass media content through one or more effect and/or transition filters provided by the matrix switch filter 308 greatly reduces the perceived complexity of otherwise large filter graphs, while reducing memory and computational overhead.
In block 704, render engine 222 facilitates generation of the editing project, identifying the number and type of media sources selected by the user. In block 706, based at least in part on the number and/or type of media sources, filter graph manger 222 exposes source, transform and rendering filter(s) to effect a user defined media processing project, while beginning to establish a programming grid 406 for the matrix switch filter 308.
In block 708, reflecting user editing instructions, render engine 222 completes the programming grid 406 for matrix switch 308, identifying which inputs 402 are to be coupled to which outputs 404 at particular project times.
Based, at least in part, on the programming grid 406 render engine 222 generates a matrix switch filter 308 with an appropriate number of input 402 and output 404 pins to effect the project, and assembles the filter graph, block 710.
In block 712, to reduce the buffer memory requirements for the processing project, the render engine 222 instructs the filters populating the filter graph to (re)negotiate buffer memory requirements between filters. That is, adjacent filters attempt to negotiate a size and attribute standard so that a single buffer can be utilized to couple each an output pin of one filter to an input pin of a downstream filter. An example implementation of the buffer negotiation process of block 712 presented in greater detail with reference to
Turning briefly to
In block 804, matrix switch 308 selectively removes one or more existing filter connections to adjacent filters. Matrix switch 308 then reconnects all of its pins to adjacent filters using a common buffer size between each of the pins, block 806. In block 808, matrix switch 308 negotiates to be the allocator for all of its pins (402, 404). If the matrix switch 308 cannot, for whatever reason, be the allocator for any of its input pins 402 minimal loss to performance is encountered, as the buffer associated with the input pin will still be compatible with any downstream filter (i.e., coupled to an output pin) and, thus, the buffer can still be passed to the downstream filter without requiring a memory copy operation. If, however, matrix switch 308 cannot be an allocator for one of its output pins 404, media content must then be transferred to at least the downstream filter associated with that output pin using a memory copy operation, block 810.
In block 812, once the matrix switch 308 has re-established its connection to adjacent filters, render engine 222 restores the connection in remaining filters using negotiated buffer requirements emanating from the matrix switch filter 308 buffer negotiations. Once the connections throughout the filter graph have been reconnected, the process continues with block 714 of
In block 714 (
Example Operation and Implementation(s)
The matrix switch described above is quite useful in that it allows multiple inputs to be directed to multiple outputs at any one time. These input can compete for a matrix switch output. The embodiments described below permit these competing inputs to be organized so that the inputs smoothly flow through the matrix switch to provide a desired output. And, while the inventive programming techniques are described in connection with the matrix switch as such is employed in the context of multi-media editing projects, it should be clearly understood that application of the inventive programming techniques and structures should not be so limited only to application in the field of multi-media editing projects or, for that matter, multi-media applications or data streams. Accordingly, the principles about to be discussed can be applied to other fields of endeavor in which multiple inputs can be characterized as competing for a particular output during a common time period.
In the multi-media example below, the primary output of the matrix switch is a data stream that defines an editing project that has been created by a user. Recall that this editing project can include multiple different sources that are combined in any number of different ways, and the sources that make up a project can comprise audio sources, video sources, or both. The organization of the inputs and outputs of the matrix switch are made manageable, in the examples described below, by a data structure that permits the matrix switch to be programmed.
Specifically, a user-defined editing project is shown generally at 900. Typically, when a user creates an editing project, they can select from a number of different multimedia clips that they can then assemble into a unique presentation. Each individual clip represents a source of digital data or a source stream (e.g., multimedia content). Projects can include one or more sources 902. In defining their project, a user can operate on sources in different ways. For example, video sources can have transitions 904 and effects 906 applied on them. A transition object is a way to change between two or more sources. As discussed above, a transition essentially receives as input, two or more streams, operates on them in some way, and produces a single output stream. An exemplary transition can comprise, for example, fading from one source to another. An effect object can operate on a single source or on a composite of sources. An effect essentially receives a single input stream, operates on it in some way, and produces a single output stream. An exemplary effect can comprise a black-and-white effect in which a video stream that is configured for presentation in color format is rendered into a video stream that is configured for presentation in black and white format. Unlike conventional effect filters, effect object 906 may well perform multiple effect tasks. That is, in accordance with one implementation, an effect object (e.g., 906) may actually perform multiple tasks on the received input stream, wherein said tasks would require multiple effect filters in a conventional filter graph system.
An exemplary user interface 908 is shown and represents what a user might see when they produce a multimedia project with software executing on a computer. In this example, the user has selected three sources A, B, and C, and has assembled the sources into a project timeline. The project timeline defines when the individual sources are to be rendered, as well as when any transitions and/or effects are to occur.
In the discussion that follows, the notion of a track is introduced. A track can contain one or more sources or source clips. If a track contains more than one source clip, the source clips cannot overlap. If source clips are to overlap (e.g. fading from one source to another, or having one source obscure another), then multiple tracks are used. A track can thus logically represent a layer on which sequential video is produced. User interface 908 illustrates a project that utilizes three tracks, each of which contains a different source. In this particular project source A will show for a period of time. At a defined time in the presentation, source A is obscured by source B. At some later time, source B transitions to source C.
In accordance with the described embodiment, the user-defined editing project 900 is translated into a data structure 910 that represents the project. In the illustrated and described example, this data structure 910 comprises a tree structure. It is to be understood, however, that other data structures could be used. The use of tree structures to represent editing projects is well-known and is not described here in any additional detail. Once the data structure 910 is defined, it is processed to provide a data structure 912 that is utilized to program the matrix switch. In the illustrated and described embodiment, data structure 912 comprises a grid from which the matrix switch can be programmed. It is to be understood and appreciated that other data structures and techniques could, however, be used to program the matrix switch without departing from the spirit and scope of the claimed subject matter.
The processing that takes place to define data structures 910 and 912 can take place using any suitable hardware, software, firmware, or combination thereof. In the examples set forth below, the processing takes place utilizing software in the form of a video editing software package that is executable on a general purpose computer.
For purposes of explanation, consider
In this example, the following can be ascertained from the project 908 and time line: from time t=0–4 source A should be routed to the matrix switch's primary output; from t=4–12 source B should be routed to the matrix switch's primary output; from t=12–14 there should be a transition between source B and source C which should be routed to the matrix switch's primary output; and from t=14–16 source C should be routed to the matrix switch's primary output. Thus, relative to the matrix switch, each of the sources and the transition can be characterized by where it is to be routed at any given time. Consider, for example, the table just below:
Routing for a given time
t = 0–12 (nowhere); t = 12–14 (transition); t = 14–6 (primary
t = 0–4 (nowhere); t = 4–12 (primary output); t = 12–14
(transition); t = 14–16 (nowhere)
t = 0–4 (primary output); t = 4–16 (nowhere)
t = 0–12 (nowhere); t = 12–14 (primary output); t = 14–16
The information that is contained in the table above is the information that is utilized to program the matrix switch. The discussion presented below describes but one implementation in which the information contained in the above table can be derived from the user's project time line.
Recall that as a user edits or creates a project, software that comprises a part of their editing software builds a data structure that represents the project. In the
Once a data structure representing the project has been built, in this case a hierarchical tree structure, a rendering engine processes the data structure to provide another data structure that is utilized to program the matrix switch. In the
In the example about to be described below, a specific data structure in the form of a grid is utilized. In addition, certain specifics are described with respect to how the grid is processed so that the matrix switch can be programmed. It is to be understood that the specific described approach is for exemplary purposes only and is not intended to limit application of the claims. Rather, the specific approach constitutes but one way of implementing broader conceptual notions embodied by the inventive subject matter.
The way that the grid is built in this example is that the rendering engine does a traversal operation on the tree 1200. In this particular example, the traversal operation is known as a “depth-first, left-to-right” traversal. This operation will layerize the nodes so that the leftmost track or source has the lowest priority and so on. Doing the above-mentioned traversal on tree 1200 (
At this point, the grid is in a state in which it can be used to program the matrix switch. The left side entries—A, B, C, and TRANS represent input pin numbers 0, 1, 2, and 3 (as shown) respectively, on the matrix switch shown in
As alluded to above, one of the innovative aspects of the matrix switch 308 is its ability to seek to any point in a source, without having to process the intervening content serially through the filter. Rather, matrix switch 308 identifies an appropriate transition point and dumps at least a subset of the intervening content, and continues processing from the seeked point in the content.
The ability of the matrix switch 308 to seek to any point in the media content gives rise to certain performance enhancement heretofore unavailable in computer implemented media processing systems. For example, generation of a filter graph by render engine 222 may take into account certain performance characteristics of the media processing system which will execute the user-defined media processing project. In accordance with this example implementation, render engine 222 may access and analyze the system registry of the operating system, for example, to ascertain the performance characteristics of hardware and/or software elements of the computing system implementing the media processing system, and adjust the filter graph construction to improve the perceived performance of the media processing system by the user. Nonetheless, there will always be a chance that a particular instance of a filter graph will not be able to process the media stream fast enough to provide the desired output at the desired time, i.e., processing of the media stream bogs down leading to delays at the rendering filter. In such a case, matrix switch 308 will recognize that it is not receiving media content at the appropriate project time, and may skip certain sections of the project in an effort to “catch-up” and continue the remainder of the project in real time. According to one implementation, when matrix switch 308 detects such a lag in processing, it will analyze the degree of the lag and issue a seek command to the source (through the source processing chain) to a future point in the project, where processing continues without processing any further content prior to the seeked point.
Thus, for the editing project depicted in
Step 1900 provides a matrix switch. An exemplary matrix switch is described above. Step 1902 defines a first data structure that represents the editing project. Any suitable data structure can be used, as will be apparent to those of skill in the art. In the illustrated and described embodiment, the data structure comprises a hierarchical tree structure having nodes that can represent tracks (having one or more sources), composites, transitions and effects. Step 1904 processes the first data structure to provide a second data structure that is configured to program the matrix switch. Any suitable data structure can be utilized to implement the second data structure. In the illustrated and described embodiment, a grid structure is utilized. Exemplary processing techniques for processing the first data structure to provide the second data structure are described above. Step 1906 then uses the second data structure to program the matrix switch.
Example Project with a Transition and an Effect
Consider project 2000 depicted in
As the user creates their project, a data structure representing the project is built.
In building the grid for project 2000, the following rule is employed for effects. An effect, in this example, is a one-input/one-output object that is applied to one object—in this case source B. When the effect is inserted into the grid, it looks for any one object beneath it in priority that has a desire to be routed to the primary output of the matrix switch at the same time. When it finds a suitable object, it redirects that object's output from the matrix switch's primary output to an output associated with the effect.
As an example, consider
As the render engine 222 completes its traversal of tree 2100, it completes the grid.
It will be appreciated that as the software, in this case the render engine 222, traverses the tree structure that represents a project, it also builds the appropriate graphs and adds the appropriate filters and graphs to the matrix switch. Thus, for example, as the render engine 222 encounters a tree node associated with source A, in addition to adding an entry to the appropriate grid, the software builds the appropriate graphs (i.e. collection of linked filters), and associates those filters with an input of the matrix switch. Similarly, when the render engine 222 encounters an effect node in the tree, the software obtains an effect object or filter and associates it with the appropriate output of the matrix switch. Thus, in the above examples, traversal of the tree structure representing the project also enables the software to construct the appropriate graphs and obtain the appropriate objects and associate those items with the appropriate inputs/outputs of the matrix switch 308. Upon completion of the tree traversal and processing of the grid, an appropriate matrix switch has been constructed, and the programming (i.e. timing) of inputs to outputs for the matrix switch has been completed.
Treatment of “Blanks” in a Project
There may be instances in a project when a user leaves a blank in the project time line. During this blank period, no video or audio is scheduled for play.
In the examples discussed above, sources comprising video streams were discussed. In those examples, at any one time, only two video streams were combined into one video stream. However, each project can, and usually does contain an audio component. Alternately, a project can contain only an audio component. The audio component can typically comprise a number of different audio streams that are combined. The discussion below sets forth but one way of processing and combining audio streams.
In the illustrated example, there is no limit on the number of audio streams that can be combined at any one time.
Suppose, for example, there is an audio project that comprises 5 tracks, A–E.
Grid 2700 is essentially set up in a manner similar to that described above with respect to the video projects. That is, for each track, a row is added to the grid and a grid entry is made for the time period during which the source on that track desires to be routed to the primary output of the matrix switch. In the present example, grid entries are made for sources A–E. Next, in the same way that a transition or effect was allocated a row in the grid, a “mix” element is allocated a row in the grid as shown and a grid entry is made to indicate that the mix element desires to be routed to the primary output of the matrix switch for a period of time during which two or more sources compete for the matrix switch's primary output. Note that in this embodiment, allocation of a grid row for the mix element can be implied. Specifically, whereas in the case of a video project, overlapping sources simply result in playing the higher priority source (unless the user defines a transition between them), in the audio realm, overlapping sources are treated as an implicit request to mix them. Thus, the mix element is allocated a grid row any time there are two or more overlapping sources.
Once the mix element is allocated into the grid, the grid is processed to redirect any conflicting source entries to matrix switch output pins that correspond to the mix element. In the above case, redirection of the grid entries starts with pin and proceeds through to pin 7. The corresponding matrix switch is shown in
There are situations that can arise when building an editing project where it would be desirable to apply an effect or a transition on just a subset of a particular project or track. Yet, there is no practicable way to incorporate the desired effect or transition. In the past, attempts to provide added flexibility for editing projects have been made in the form of so called “bounce tracks”, as will be appreciated and understood by those of skill in the art. The use of bounce tracks essentially involves processing various video layers (i.e. tracks), writing or moving the processed layers or tracks to another location, and retrieving the processed layers when later needed for additional processing with other layers or tracks. This type of processing can be slow and inefficient.
To provide added flexibility and efficiency for multi-media editing projects, the notion of a composite or composition is introduced. A composite or composition can be considered as a representation of an editing project as a single track. Recall that editing projects can have one or more tracks, and each track can be associated with one or more sources that can have effects applied on them or transitions between them. In addition, compositions can be nested inside one another.
Example Project with Composite
Consider, for example,
In accordance with the processing that is described above in connection with
Next, data structure 3000 is processed to provide a second data structure that is configured to program the matrix switch. Note that as the data structure is being programmed, a matrix switch is being built and configured at the same time. In this example, the second data structure comprises a grid structure that is assembled in much the same way as was described above. There are, however, some differences and, for purposes of understanding, the complete evolution of the grid structure is described here. In the discussion that follows, the completed matrix switch is shown in
When the rendering engine initiates the depth-first, left-to-right traversal of data structure 3000, the first node it encounters is track node 3004 which is associated with source A. Thus, a first row of the grid is defined and a grid entry is made that represents the time period for which source A desires to be routed to the matrix switch's primary output pin.
(Fx-noisy (A Tx-Blend B)) Tx-Blend C
Here, an effect (noisy) is applied to A blended with B, the result of which is applied to a blend with C. The composite in this example allows the grouping of the things beneath it so that the effect (noisy), when it is applied, is applied to everything that is beneath it. Notice that without the composite node, there is no node where an effect can be applied that will affect (A Tx-Blend B). Hence, in this example, operations that appear within the parenthesis are carried out on tracks that appear within the parenthesis. Those operations do not affect tracks that are not within the parenthesis.
Step 3900 defines a multimedia editing project that includes at least one composite. The composite represents multiple tracks as a single track for purposes of the processing described just below. It is important to note that, in the processing described just below, and because of the use of composites, the extra processing that is required by bounce tracks is avoided (i.e. operating on two tracks, moving the operation result to another location, and retrieving the operation result when later needed). This reduces the processing time that is required to render a multi-media project. Step 3902 defines a first data structure that represents the editing project. Any suitable data structure can be utilized. In the present example, a data structure in the form of a hierarchical tree is utilized. An exemplary tree is shown in
Video Transitions Represented by Bitmaps
Transitions from one video to another can be implemented in different ways. One popular way of implementing a transition is through the use of a bitmap and in particular, a gray scale bit map. Although a gray scale bit map is used to illustrate the inventive principles described below, it is to be appreciated that other types of bits maps, e.g. color bit maps, can be used. Typically, gray scale bitmaps, used for transitions, are individually designed by a human designer with the aid of a software application. The use of a gray scale bit map allows one video to visually replace another video in often times creative ways.
What this loop does is that it walks through the bitmap for each frame of video. If pixel values in the bitmap are less than Z for a given frame, the new video is shown. If the pixel values for a given frame are greater than Z, then the old video is shown. In the
As an example of another type of transition that can be implemented using gray scale bit maps, consider
One of the problems associated with using bitmaps for transitions and effects is that each bitmap must typically be individually designed and configured by a human designer. Thus, in the above example, a human designer was required to design both bitmaps 4000 and 4100. There are instances when it would be convenient and highly economical to assist the human designer with the task of designing bitmaps that are used for video effects. For example, assume that a designer wished to take bitmap 4100 and operate upon it in some manner to provide an entirely new derived bitmap that still has some of the characteristics of bitmap 4100. Until now, the designer would be forced to manually design the new bitmap. In the context of user-defined editing projects, it would be desirable to give the user the ability to change the wipe effect, or the manner in which a bitmap is used or processed to provide a transition or effect. It would be highly desirable to give this user the ability to manipulate transitions and effects while they are editing a project.
Consider, for example,
The bitmap processor receives as input a bit map which is designated in the drawing as “Old Bitmap”. The processor processes the old bit map and provides, from the old bit map a “New Bitmap”. This can advantageously be done “on the fly” so that a user who is editing a project can have the flexibility to modify, in a robust number of ways, multiple different bit maps that can be used for transitions and effects. The bitmap processor 4300 is configured to implement a number of different operations on a bitmap that it receives. The following operations constitute but exemplary operations and are not intended to be limiting in any way.
A stretching/shrinking module 4302 is provided and can manipulate a bitmap in different ways. For example, the module can stretch or shrink a bitmap in the x or y dimension. A replication module 4304 can replicate a bitmap any suitable number of times. An offset module 4306 can offset a bitmap. This might be done, for example, if a user wants to start a wipe effect from a different location from where the old bitmap would have originally started it. A border module 4308 is provided and can be used to provide a border, e.g. a blue-colored border, around a wipe effect. The border module does not necessarily change the bitmap itself. Rather, it changes the way in which the bitmap is processed. It will be appreciated that the illustrated modules can be used in various combinations with one another to further enhance the overall flexibility of the system.
Thus, one aspect of the described embodiment provides a user with the ability to select and adjust various parameters that are then used to process an original or old bit map. The selected parameters are imposed on the original bit map to provide a new resultant bitmap that reflects the user's parameter choices. With the new resultant bitmap, transitions can now be implemented between videos that reflect the user's creativity and design.
Here, bitmap processor 4300 receives the original bit map 4500. The original bitmap defines a dark star with lighter and lighter stars surrounding it. Suppose that a user wishes to use this bitmap, but desires to have a very thin dark star pattern for their transition. They can indicate those wishes by adjusting one or more parameters provided by a UI supported by their multi-media editing software. A simplistic algorithm might simply shrink the bitmap to define a tall thin star and provide the bitmap in an area that is half the width of the desired bitmap dimension. This is diagrammatically indicated by a smaller-dimensioned bitmap within the boundary defined at 4502. This is not very desirable as it leaves a large white area to the right of the bitmap that will be noticeable when the bitmap is used in a transition.
Alternately, the bitmap processor can do the following. Using the stretching/shrinking module 4302, the processor can take the original 300×300 bitmap 4500 and stretch it to be 300×900 as shown at 4504. Now, since the resultant bitmap must be the same size (i.e. 300×300) as the original bitmap, the center portion 4506 of the resultant bitmap can be clipped and used for the stretched star. Before, however, the clipped portion 4506 can be used as the resultant bit, a rescaling operation is implemented by bitmap processor 4300. Specifically, by removing portions of the resultant stretched bit map (i.e. those portions outside of center portion 4506), gray scale values have likely been discarded as well. Specifically, whereas before there may have been values ranging from 0–255, there may likely be only values ranging from 0–200. Thus, in this embodiment, the bitmap is programmatically operated upon to incorporate all of the 255 gray scale values. This is referred to as a re-scaling operation in which the remaining gray scale values are re-scaled so that all of the predetermined gray scale values are present in the result bitmap that is used for the user-defined transition. The re-scaling operation is desirable because if there are less than the required number of gray scale values, the new picture will be shown too early.
Bitmap processor 4300 first receives an old bitmap that is specified by the user. The user can then specify one or more parameters that are used to process the old bitmap. In this example, the user specifies parameters that cause bitmap 4600 to be copied multiple times and for the multiple copies to be assembled into an intermediate bitmap 4604 having a dimension that is larger than the dimension of bitmap 4600. Thus, if the original bitmap 4600 was a 300×300 bitmap, intermediate bitmap 4604 might be a 900×600 bitmap. To perform the replication operation, bitmap processor uses replication module 4304. Bitmap processor 4300 then uses stretching/shrinking module 4302 to reduce the dimension of intermediate bitmap 4604 so that it is constrained as a 300×300 bitmap as shown at 4602. The bitmap processor 4300 next rescales the resultant bitmap 4602, if necessary, so that a full compliment of gray scale values are present.
In accordance with one embodiment, an original or old bitmap can be processed to provide it with a border. For example,
Step 4900 defines a range of values. This step can be implemented by a user entering a range that defines a thickness of a border they desire to create. Step 4902 processes a bitmap. The processing of the bitmap, in this embodiment, can include step 4904 which determines if a bitmap gray scale value is within the defined range. If the bitmap gray scale value is not within the defined range, step 4906 provides old or new video as appropriate. If, however, the bitmap gray scale value is within the defined range, step 4908 provides a border having a thickness that is defined by the user. An exemplary border is shown in
The described embodiments can be used to provide improvements over previous multi-media editing systems. Various efficiencies are achieved that reduce the processing times and can thereby improve the user experience when using multi-media project editing software applications.
Although the invention has been described in language specific to structural features and/or methodological steps, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or steps described. Rather, the specific features and steps are disclosed as preferred forms of implementing the claimed invention.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4220823||21 Jul 1978||2 Sep 1980||Stromberg-Carlson Corporation||Selectively controlled digital pad|
|US4602286 *||10 Jan 1983||22 Jul 1986||Quantel Limited||Video processing for composite images|
|US5162904||28 Mar 1991||10 Nov 1992||Abekas Video Systems, Inc.||Video processing system having improved internal switching capability|
|US5179552||10 Jan 1992||12 Jan 1993||Bell Communications Research, Inc.||Crosspoint matrix switching element for a packet switch|
|US5187589||29 Oct 1991||16 Feb 1993||Pioneer Electronic Corporation||Multiprogram video tape recording and reproducing device|
|US5194952||28 Mar 1991||16 Mar 1993||Abekas Video Systems, Inc.||Video processing system having improved transition control and display|
|US5252953 *||22 May 1990||12 Oct 1993||American Film Technologies, Inc.||Computergraphic animation system|
|US5307456||28 Jan 1992||26 Apr 1994||Sony Electronics, Inc.||Integrated multi-media production and authoring system|
|US5327227||25 Jan 1993||5 Jul 1994||Samsung Electronics Co., Ltd.||De-interleaving method and apparatus for D2 MAC audio|
|US5359712 *||21 Feb 1992||25 Oct 1994||Apple Computer, Inc.||Method and apparatus for transitioning between sequences of digital information|
|US5377313||29 Jan 1992||27 Dec 1994||International Business Machines Corporation||Computer graphics display method and system with shadow generation|
|US5400187||24 Jan 1994||21 Mar 1995||U.S. Philips Corporation||Arrangement for recording a video signal and a corresponding audio signal in slant tracks on a longitudinal magnetic record carrier, and record carrier obtained by means of the arrangement|
|US5421016||12 Dec 1991||30 May 1995||International Business Machines Corporation||System and method for dynamically invoking object methods from an application designed for static method invocation|
|US5455599||4 Apr 1995||3 Oct 1995||Taligent Inc.||Object-oriented graphic system|
|US5481718||20 May 1994||2 Jan 1996||Fujitsu Limited||Object-oriented system having object models containing plural objects with instantiation following static classification by class relationships, dynamic classification by temporal instantiation, and causality restrictions|
|US5515512||7 Jun 1995||7 May 1996||Canon Kabushiki Kaisha||Multi-media terminal apparatus|
|US5551035||16 Mar 1995||27 Aug 1996||Lucent Technologies Inc.||Method and apparatus for inter-object communication in an object-oriented program controlled system|
|US5584006||29 Nov 1993||10 Dec 1996||Avid Technology, Inc.||Media storage and retrieval system including determination of media data associated with requests based on source identifiers and ranges within the media data|
|US5587742||25 Aug 1995||24 Dec 1996||Panasonic Technologies, Inc.||Flexible parallel processing architecture for video resizing|
|US5647047||13 Dec 1994||8 Jul 1997||Sony Corporation||System for editing video reproduced from a plurality of recording media at high speed|
|US5668639 *||21 Mar 1995||16 Sep 1997||Comunicacion Integral||Method for video editing|
|US5682326||3 Apr 1995||28 Oct 1997||Radius Inc.||Desktop digital video processing system|
|US5754180 *||11 Mar 1996||19 May 1998||Avid Technology, Inc.||Computer system and process for defining and manipulating images using structured objects with variable edge characteristics|
|US5760767||26 Oct 1995||2 Jun 1998||Sony Corporation||Method and apparatus for displaying in and out points during video editing|
|US5781188||27 Jun 1996||14 Jul 1998||Softimage||Indicating activeness of clips and applying effects to clips and tracks in a timeline of a multimedia work|
|US5790935||30 Jan 1996||4 Aug 1998||Hughes Aircraft Company||Virtual on-demand digital information delivery system and method|
|US5818542 *||10 Apr 1996||6 Oct 1998||Discreet Logic, Inc.||Processing image data|
|US5861880||10 Oct 1995||19 Jan 1999||Fuji Xerox Co., Ltd.||Editing system for multi-media documents with parallel and sequential data|
|US5877781||29 Jan 1996||2 Mar 1999||Roland Kabushiki Kaisha||Memory control device for video editor|
|US5892506||18 Mar 1996||6 Apr 1999||Discreet Logic, Inc.||Multitrack architecture for computer-based editing of multimedia sequences|
|US5896181||14 Jul 1997||20 Apr 1999||Sony Corporation||Video signal processing apparatus with matrix switching capability|
|US5898780||9 Oct 1996||27 Apr 1999||Gric Communications, Inc.||Method and apparatus for authorizing remote internet access|
|US5913038||13 Dec 1996||15 Jun 1999||Microsoft Corporation||System and method for processing multimedia data streams using filter graphs|
|US5917730||16 Aug 1996||29 Jun 1999||Gse Process Solutions, Inc.||Computer implemented object oriented visualization system and method|
|US5930446||8 Apr 1996||27 Jul 1999||Sony Corporation||Edition system|
|US5930797||15 Apr 1997||27 Jul 1999||Avid Technology, Inc.||Method and system for representing hierarchical time-based data structures and to extract information therefrom|
|US5960006||23 Sep 1996||28 Sep 1999||Lsi Logic Corporation||MPEG decoding system adjusting the presentation in a predetermined manner based on the actual and requested decoding time|
|US5961602||10 Feb 1997||5 Oct 1999||International Business Machines Corporation||Method for optimizing off-peak caching of web data|
|US5982360||30 Sep 1997||9 Nov 1999||United Microelectronics Corp.||Adaptive-selection method for memory access priority control in MPEG processor|
|US5990981||12 Feb 1998||23 Nov 1999||Sensormatic Electronics Corporation||Modular video signal matrix switcher with color-coded components|
|US5995505||17 Apr 1997||30 Nov 1999||Sony Corporation||Matrix switcher|
|US5999173 *||3 Apr 1992||7 Dec 1999||Adobe Systems Incorporated||Method and apparatus for video editing with video clip representations displayed along a time line|
|US6026439||28 Oct 1997||15 Feb 2000||International Business Machines Corporation||File transfers using playlists|
|US6038425||3 Aug 1998||14 Mar 2000||Jeffrey; Ross A.||Audio/video signal redistribution system|
|US6049829||22 Jul 1997||11 Apr 2000||At&T Corp.||Information access system and method|
|US6064670||1 Aug 1996||16 May 2000||Sgs-Thomson Microelectronics S.A.||Matrix for switching between two multiplex groups|
|US6069668 *||7 Apr 1997||30 May 2000||Pinnacle Systems, Inc.||System and method for producing video effects on live-action video|
|US6069688||11 Dec 1997||30 May 2000||Honeywell International Inc.||Method for producing continuous in-like kappa measurements for papermaking pulps|
|US6081262||4 Dec 1996||27 Jun 2000||Quark, Inc.||Method and apparatus for generating multi-media presentations|
|US6088018||11 Jun 1998||11 Jul 2000||Intel Corporation||Method of using video reflection in providing input data to a computer system|
|US6128652||13 Feb 1997||3 Oct 2000||It Innovations Pte Ltd||System for manipulating and updating data objects with remote data sources automatically and seamlessly|
|US6130676 *||2 Apr 1998||10 Oct 2000||Avid Technology, Inc.||Image composition system and process using layers|
|US6141001||20 Aug 1997||31 Oct 2000||Alcatel||Method of synchronizing the presentation of static and dynamic components of an interactive multimedia document|
|US6145002||14 Nov 1997||7 Nov 2000||Qwest Communications International Inc.||System and method for accessing an internet service provider|
|US6151627||6 Nov 1998||21 Nov 2000||3Com Technologies||Monitoring of a communication link utilizing history-based compression algorithms|
|US6167083||4 Apr 1997||26 Dec 2000||Avid Technology, Inc.||Computer system and process for capture editing and playback of motion video compressed using interframe and intraframe techniques|
|US6173336||31 Aug 1995||9 Jan 2001||Siemens Aktiengesellschaft||Method for the administration of dynamic objects in a means programmed object-oriented|
|US6173364||15 Jan 1997||9 Jan 2001||At&T Corp.||Session cache and rule caching method for a dynamic filter|
|US6205492||4 Apr 1997||20 Mar 2001||Microsoft Corporation||Method and computer program product for interconnecting software drivers in kernel mode|
|US6209041||4 Apr 1997||27 Mar 2001||Microsoft Corporation||Method and computer program product for reducing inter-buffer data transfers between separate processing components|
|US6212574||4 Apr 1997||3 Apr 2001||Microsoft Corporation||User mode proxy of kernel mode operations in a computer operating system|
|US6226642||11 Sep 1997||1 May 2001||International Business Machines Corporation||Content modification of internet web pages for a television class display|
|US6233735||10 Jul 1997||15 May 2001||Sony Corporation||Near video-on-demand system and broadcasting method therefor|
|US6237031||30 Dec 1997||22 May 2001||Intel Corporation||System for dynamically controlling a network proxy|
|US6243143 *||21 Sep 1999||5 Jun 2001||Media 100 Inc.||Effecting video transitions between video streams|
|US6243754||8 Jan 1999||5 Jun 2001||International Business Machines Corporation||Dynamic selection of network providers|
|US6253288||30 Apr 1998||26 Jun 2001||Hewlett-Packard Company||Hybrid cache/SIRO buffer system|
|US6255943||28 Jul 1998||3 Jul 2001||Cabletron Systems, Inc.||Method and apparatus for distributed object filtering|
|US6256783||10 Aug 1998||3 Jul 2001||Fujitsu Limited||Object conversion apparatus, object conversion method and program storing medium|
|US6269107||28 Jan 1998||31 Jul 2001||Lg Electronics, Inc.||Device and method for demultiplexing transport stream|
|US6269195 *||3 Feb 1998||31 Jul 2001||Avid Technology, Inc.||Apparatus and methods for selectively feathering a composite image|
|US6292187 *||27 Sep 1999||18 Sep 2001||Sony Electronics, Inc.||Method and system for modifying the visual presentation and response to user action of a broadcast application's user interface|
|US6298234||18 May 1999||2 Oct 2001||Telefonaktiebolaget L M Ericsson (Publ)||System and method for providing access to the internet via a radio telecommunications network|
|US6338070||17 Jun 1999||8 Jan 2002||Alcatel||Method of saving operating data of a network element, and controller for a network element|
|US6345279||23 Apr 1999||5 Feb 2002||International Business Machines Corporation||Methods and apparatus for adapting multimedia content for client devices|
|US6347398||8 Nov 1999||12 Feb 2002||Microsoft Corporation||Automatic software downloading from a computer network|
|US6356701||2 Apr 1999||12 Mar 2002||Sony Corporation||Editing system and method and distribution medium|
|US6362854 *||16 Nov 1999||26 Mar 2002||Media 100 Inc.||Effecting video transitions between video streams with a border|
|US6366286 *||1 Apr 1999||2 Apr 2002||Discreet Logic Inc.||Image data editing|
|US6378035||6 Apr 1999||23 Apr 2002||Microsoft Corporation||Streaming information appliance with buffer read and write synchronization|
|US6389483||20 Nov 1997||14 May 2002||Telefonaktiebolaget L M Ericsson (Publ)||System and method for reducing coupling between modules in a telecommunications environment|
|US6396421||31 Jul 2001||28 May 2002||Wind River Systems, Inc.||Method and system for sampling rate conversion in digital audio applications|
|US6400378||26 Sep 1997||4 Jun 2002||Sony Corporation||Home movie maker|
|US6411225||19 Apr 2000||25 Jun 2002||Koninklijke Philips Electronics N.V.||Sample rate converter|
|US6411338 *||25 Jan 2000||25 Jun 2002||Koninklijke Philips Electronics N.V.||Producing a series of images for display on a display device|
|US6414686||31 Mar 1999||2 Jul 2002||Eidos Plc||Multimedia editing and composition system having temporal display|
|US6421733||8 Sep 1997||16 Jul 2002||Intel Corporation||System for dynamically transcoding data transmitted between computers|
|US6442658||1 May 2000||27 Aug 2002||Macromedia, Inc.||Method and apparatus for improving playback of interactive multimedia works|
|US6462682||27 Mar 2001||8 Oct 2002||Telefonaktiebolaget Lm Ericsson (Publ)||Sample rate conversion method and apparatus|
|US6490324||8 Dec 1998||3 Dec 2002||Stmicroelectronics, Inc.||System, method and apparatus for a variable output video decoder|
|US6499059||13 May 1999||24 Dec 2002||Alcatel||Method of controlling a network element using a service profile and apparatus of the same|
|US6502137||9 Oct 1997||31 Dec 2002||International Business Machines Corporation||System and method for transferring information over a computer network|
|US6510458||15 Jul 1999||21 Jan 2003||International Business Machines Corporation||Blocking saves to web browser cache based on content rating|
|US6512468||3 Aug 2001||28 Jan 2003||Agere Systems Inc.||System and method for increasing sample rate converter filter coefficient derivation speed|
|US6518894||12 Feb 2002||11 Feb 2003||Rohde & Schwarz Gmbh & Co. Kg||Device and method for sampling rate conversion|
|US6519288||6 Mar 1998||11 Feb 2003||Mitsubishi Electric Research Laboratories, Inc.||Three-layer scaleable decoder and method of decoding|
|US6519540||4 Oct 1994||11 Feb 2003||Iris Technologies, Inc.||Signal router with cross-point view graphical interface|
|US6535920||6 Apr 1999||18 Mar 2003||Microsoft Corporation||Analyzing, indexing and seeking of streaming information|
|US6544293||13 Nov 2000||8 Apr 2003||Avid Technology, Inc.||Media editing system with improved effect management|
|US6546392||25 Jun 1999||8 Apr 2003||Mediaone Group, Inc.||Self service gateway|
|US6570587 *||25 Jun 1997||27 May 2003||Veon Ltd.||System and method and linking information to a video|
|US6571255||9 Sep 1999||27 May 2003||Robert Gonsalves||Modification of media with common attributes on a digital nonlinear editing system|
|US6581102||27 May 1999||17 Jun 2003||International Business Machines Corporation||System and method for integrating arbitrary isochronous processing algorithms in general media processing systems|
|US6590604||7 Apr 2000||8 Jul 2003||Polycom, Inc.||Personal videoconferencing system having distributed processing architecture|
|US6591266||14 Aug 2000||8 Jul 2003||Nec Corporation||System and method for intelligent caching and refresh of dynamically generated and static web content|
|US6658477||12 May 1999||2 Dec 2003||Microsoft Corporation||Improving the control of streaming data through multiple processing modules|
|US6675386||4 Sep 1997||6 Jan 2004||Discovery Communications, Inc.||Apparatus for video access and control over computer network, including image correction|
|US6681261||1 Feb 2002||20 Jan 2004||Storage Technology Corporation||Programmable matrix switch|
|US6683696||27 Oct 1998||27 Jan 2004||Hewlett-Packard Development Company, L.P.||Filter based data imaging method for an image forming device|
|US6694087||2 Apr 1999||17 Feb 2004||Autodesk Canada Inc.||Processing audio-visual data|
|US6701316||31 Aug 2000||2 Mar 2004||Nec Corporation||Method and apparatus for intelligent network bandwidth and system resource utilization for web content fetch and refresh|
|US6714216||27 Sep 1999||30 Mar 2004||Sony Corporation||Video editing apparatus and method|
|US6714826||13 Mar 2000||30 Mar 2004||International Business Machines Corporation||Facility for simultaneously outputting both a mixed digital audio signal and an unmixed digital audio signal multiple concurrently received streams of digital audio data|
|US6768499||6 Dec 2000||27 Jul 2004||Microsoft Corporation||Methods and systems for processing media content|
|US6774919||6 Dec 2000||10 Aug 2004||Microsoft Corporation||Interface and related methods for reducing source accesses in a development system|
|US6853466 *||24 Nov 2000||8 Feb 2005||Canon Kabushiki Kaisha||Image processing apparatus and method|
|US20010023436 *||22 Jan 1999||20 Sep 2001||Anand Srinivasan||Method and apparatus for multiplexing seperately-authored metadata for insertion into a video data stream|
|US20020085019 *||25 May 2001||4 Jul 2002||Joseph Ruff||Data-driven layout engine|
|1||Bandhauer, "XPConnect Scriptable Proposal", Jan. 21, 2007, at <<http://www.mozilla.org/scriptable/scriptable-proposal.html>>, Mozilla.org, 1998-2007, pp. 1-4.|
|2||Lee, et al., "Negotiated Disks Admission Control in Video Streaming", retrieved on Oct. 14, 1999, IEEE, 1999, vol. 35, No. 21, pp. 1810-1812.|
|3||Nutt, et al., "Dynamically Negotiated Resource Management for Data Intensive Application", retrieved on Dec. 24, 2006 at <<http://ieeexplore.ieee.org/search/searchresult.jsp?query1=%22matrix+switch%22&scope1=&op1=and&. . .>>, IEEE, Jan./Feb. 2000, pp. 78-95.|
|4||Zhang, et al., "Static and Dynamic Resource Allocation Algoritms of Real-Time VBR Video Transmissions in Multimedia Network", IEEE, 1997, pp. 1657-1662.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7673013||27 Oct 2004||2 Mar 2010||Microsoft Corporation||Methods and systems for processing multi-media editing projects|
|US7680898||21 Oct 2004||16 Mar 2010||Microsoft Corporation||Systems for processing multi-media editing projects|
|US7712106||27 Dec 2005||4 May 2010||Microsoft Corporation||System and methods for generating and managing filter strings in a filter graph|
|US7853921||29 Aug 2005||14 Dec 2010||Microsoft Corporation||Interface and related methods for dynamically generating a filter graph in a development system|
|US7940275||29 Aug 2005||10 May 2011||Microsoft Corporation||Interface and related methods for dynamically generating a filter graph in a development system|
|US8010649||3 Nov 2008||30 Aug 2011||Microsoft Corporation||Methods and systems for processing multi-media editing projects|
|US8150954||3 Nov 2008||3 Apr 2012||Microsoft Corporation||Methods and systems for processing multi-media editing projects|
|US8612859||22 Oct 2007||17 Dec 2013||Microsoft Corporation||Methods and systems for effecting video transitions represented by bitmaps|
|US9032020||17 Jan 2012||12 May 2015||Google Inc.||Online video enhancement|
|US9208819 *||20 Jun 2012||8 Dec 2015||Google Inc.||Dynamic split-frame preview of video editing effects|
|US9478255||4 Nov 2015||25 Oct 2016||Google Inc.||Dynamic split-frame preview of video editing effects|
|US20040221291 *||2 Feb 2004||4 Nov 2004||Miller Daniel J.||System and related methods for reducing source filter invocation in a development project|
|US20050060422 *||27 Oct 2004||17 Mar 2005||Microsoft Corporation||Methods and systems for processing multi-media editing projects|
|US20050060712 *||5 Oct 2004||17 Mar 2005||Microsoft Corporation||Systems for generating and managing filter strings in a filter graph|
|US20050091339 *||21 Oct 2004||28 Apr 2005||Microsoft Corporation||Systems for processing multi-media editing projects|
|US20050262514 *||29 Jul 2005||24 Nov 2005||Microsoft Corporation||Interface and related methods for dynamically generating a filter graph in a development system|
|US20060168554 *||27 Dec 2005||27 Jul 2006||Microsoft Corporation||A System and Methods for Generating and Managing Filter Strings in a Filter Graph|
|US20060218299 *||13 Jun 2006||28 Sep 2006||Microsoft Corporation||Methods and Systems for Efficiently Processing Compressed and Uncompressed Media Content|
|U.S. Classification||715/726, G9B/27.012, G9B/27.051, 715/723|
|International Classification||G06T3/40, G11B27/034, G11B27/34, G11B27/00|
|Cooperative Classification||G11B27/34, G11B27/034, G06T3/40|
|European Classification||G11B27/034, G11B27/34, G06T3/40|
|2 Apr 2001||AS||Assignment|
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MAYMUDES, DAVID M.;MILLER, DANIEL J.;REEL/FRAME:011654/0275;SIGNING DATES FROM 20010307 TO 20010309
|24 Mar 2011||FPAY||Fee payment|
Year of fee payment: 4
|9 Dec 2014||AS||Assignment|
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034541/0001
Effective date: 20141014
|25 Mar 2015||FPAY||Fee payment|
Year of fee payment: 8