US 6,552,731 B1Grant
Multi-tone representation of a digital image on a digital nonlinear editing system
Issue Date:2003-04-22
•3 Claims
•6 Drawing Sheets
Abstract
A system and method for generating a multi-tone representation of a digital image by applying a plurality of functions of luma to the digital image. The functions of luma comprise at least a first function and a second function, where each function has a value for each luma value in a range of luma values. Each function also has an associated display value. The digital image includes a plurality of pixels, where for each pixel, it is determined which of the first and second functions has a maximum value for a luma value of the pixel. Each pixel is represented using the display value associated with the determined function.
Metadata
Assignee
- Avid Technology, Inc.
Inventor
- Robert Gonsalves
Application Information
Application Number:US 09/293,732
Filing Date:1999-04-16
Priority Date:1999-04-16
Art Unit:7
Classifications
IPC:
G09G 502G06K 900G06K 940B41B 100G03F 308
Field of Search:
345581345589345591345593345594345595345690345602358 19358520358521358518358519382167382174382274382162382169386 44348631348663348674348673348687348251348396348254348453348576348577348649348650348651
Patent Drawings (6 sheets)
Description
Background
[0002] Digital non-linear editing (DNLE) is a process by which digital media may be edited. DNLE, as the name implies, is performed on digital media stored as data in digital media files on a digital random access medium. DNLE may be conducted in a non-linear fashion because the digital media files in which the digital media is stored can be randomly accessed. Thus an editor may access a piece of the digital media without having to proceed sequentially through other pieces of the digital media stored in the same or other digital media files. More than one editor also may be able to access different pieces of the same digital media contemporaneously. The digital media may be a digitized version of a film or videotape or digital media produced through live capture onto a disk of a graphics or animation software application. Example commercial DNLE systems include the Media Composer® or the Avid® Symphony™ video production system or, NewsCutter® news editing system available from Avid Technology, Inc. For a more detailed description of DNLE, see Digital Nonlinear Editing, New Approaches to Editing Film and Video,1993, by Thomas Ohanian.
[0003] Color modification is a class of operations that may be performed on media data. Color modification is used both to correct color errors due to process errors and to adjust the colors used in the video for artistic expression. Such color modifications may include enhancing contrasts or color in an image to give a program an overall “look,” or applying special effects to selected segments. Other color modifications may be made by an editor to correct problems with color or lighting resulting from the source of the media. Such corrections may include color balancing for camera and lighting differences, correcting for film processing differences, matching colors and tones from shot to shot, or adjusting video levels for differences in source tapes, source decks, etc.
[0004] Digital images are comprised of an array of picture elements called pixels. For a given image, color modifications may be applied to all pixels in the image or pixels comprising a portion of the image. In digital video signal processing, a variety of data formats can be used to represent the color of pixels within a digital image. Formats may be classified into two major categories: composite signals and component signals. Component formats represent a color as multiple components, each component defining a value along a dimension of the color space in which the color being represented is defined. A composite video is an analog signal that uses a high frequency subcarrier to encode color information. The subcarrier is a sinewave of which the amplitude is modulated by the saturation of the color represented by the signal, and the hue of the color is encoded as a phase difference from a color burst. Analog composite signals are generally used to broadcast television video signals.
[0005] There are a variety of component formats used to represent color. RGB (Red, Green, Blue) format represents a color with a red component, a green component and a blue component. CMY (Cyan, Magenta, Yellow, Black) format represents a color with a cyan component, a magenta component, and a yellow component. CMY is a format commonly used by printers. The CMY components are color opposites of RGB components. In a three-dimensional coordinate system, each component of either the RGB or the CMY format represents a value along an axis, the combination of the values defining a cubic color space.
[0006] The data formats HSL (Hue, Saturation, Lightness or Luminance) and HSV (Hue, Saturation, Value) represent a color with a hue component, a saturation component, and a luma component. In a three-dimensional coordinate system, the luma component represents a value along a luma axis, the hue component represents the angle of a chroma vector with respect to the luma axis and the saturation component represents the magnitude of the chroma vector. The combination of the values defines a hexagonal cone-shaped color space.
[0007] YCrCb, YUV, and YIQ are three formats that represent a color with a luma component Y, and two chroma components, Cr and Cb, U and V, or I and Q, respectively, that define a chroma vector. In a three-dimensional coordinate system, each component of either the YCrCb, YUV, and YIQ format represents a value along an axis, the combination of the values defining a cylindrical color space around the luma axis. The chroma components define the chroma vector. In data formats with a luma component, the luma component can be used independently to represent a pixel in a black and white image to be displayed, for example, with a black and white monitor.
[0008] A typical color modification in HSL color space may include increasing a color component or a combination of color components for all pixels in each digital image of a section of digital media. Typically, an editor accesses a segment of a composition that represents the section of media through an editor interface and inputs desired color modifications through the editor interface. Some systems permit an editor to apply color modifications to only portions of a digital image. Portions of a digital image also may be described as one or more pixels. For example, an editor may select with a mouse, keyboard, or some other editor input device a portion of the image and define color modifications for the selected portion. A suitable commercial system for color modification is Avid Media Illusion™ available from Avid Technology, Inc. The Avid Media Illusion Reference Guide, available from Avid Technology, Inc. is herein incorporated by reference. Other commercial software applications may be used.
[0009] Some systems permit an editor to define a color modification as a function of the luma of a pixel. Some systems also allow a user to define functions of luma that allow an editor to define the effect of a color modification over a range of possible luma values of a pixel. For example, an editor may define a highlight function that primarily affects high luma values, a midtone function that primarily affects mid-range luma values, and a shadow function that primarily affects low luma values. The editor may then associate a color modification with each function. If more than one function is defined over a range of luma values, each function, and thus a color modification associated with the function, may have a weighted effect for a given luma value. This weighted effect is defined by the value of the function for the given luma value normalized with respect to the values of functions for the given luma value. Although luma may be used to determine the weighting of the color modification, the color modification itself is not limited to adjusting the luma. Typical color modifications include adjustments to hue, saturation, luminance, brightness, contrast, gamma, tinting, etc.
[0010] For example, a color modification A is specified for a luma function defined by X=2L−2, and a color modification B is specified for a luma function defined by Y=0.5L+2. For pixel P with a luma value of 16, X=30 and Y=10. Normalizing X and Y, the weighted value of X is 0.75 and the weighted value of Y is 0.25. Thus, the color modification applied to pixel P is Z=0.75A+0.25B. The function used in this example is linear to simplify the explanation, but for decreasing and increasing the effect of a color modification for different values of luma, the function is usually non-linear.
[0011] The range of possible luma values may have ranges in which one of the functions has a predominant effect. For the highlight, midtone, and shadow functions described above, a highlight range is the range of luma values for which the highlight function has the strongest effect or the greatest weighted value, a midtone range is the range of luma values for which the midtone function has the strongest effect or the greatest weighted value, and the shadow range is the range of luma values for which the shadow function has the strongest effect or the greatest weighted value.
[0012] Some systems allow an editor to view a visual representation of the effect of more than one luma function on a digital image, where a selected luma function is emphasized. This representation generally is a substantially continuous gray scale image. In the gray scale image, pixels represented as white are pixels having a luma value for which the selected function has the strongest contribution. Pixels represented as black are pixels having a luma value for which the selected luma function has no contribution. All other pixels are represented as levels of gray between white and black, where the gray level representing the pixel is inversely proportional to the weighted value of the luma function for the luma value of the pixel. A suitable commercial product for defining luma functions, defining color modifications for each function, and viewing a representation of an image emphasizing a selected luma function is Avid Media Illusion ™ available from Avid Technology, Inc.
Summary
[0013] A problem with systems allowing an editor to define luma functions and color modifications for each luma function is that an editor cannot always determine from a visual inspection of a digital image which pixels or portions of the image fall within a luma range. Thus the editor may not know which pixels will be most affected by a color modification defined for a function. Even if an editor may view the effects of more than one function on a digital image in gray scale, with a selected function emphasized, this gray scale image does not illustrate the boundaries of the luma ranges, and thus does not give the editor a clear illustration of which function has the strongest effect for a range of luma values. The gray scale image also emphasizes only one luma function at a time. For a selected function, the gray scale image also may be confusing and not intuitive because the gray scale image may not represent the pixels in proportion to their luma. For example, if a midtone function is selected, pixels having a value for which the midtone function has the highest weighted value are represented as white, which has high luma, and pixels affected more by a highlight function, usually pixels having higher luma values, are represented as darker grays which have lower luma. For an editor, especially a novice to color modification, this confusion may result in a lack of efficiency.
[0014] Providing a multi-tone representation of a digital image, where each tone represents a luma range, permits an editor to visually identify pixels of a digital image that fall within predefined luma ranges. This multi-tone representation allows an editor to control the effect of luma-based color modifications to pixels in a more efficient manner.
[0015] Multi-tone representation of a digital image provides a method of producing a representation of a digital image by applying a plurality of functions of luma to the digital image. The luma functions may be selected and redefined by a user. The functions of luma comprise at least a first function and a second function, where each function has a value for each luma value in a range of luma values. Each function also has an associated display value. The digital image includes a plurality of pixels, where for each pixel, it is determined which of the first and second functions has a maximum value for a luma value of the pixel. Each pixel is represented using the display value associated with the determined function. The representation of the digital image may be displayed on a display device. Each pixel of the representation may be displayed as the level of gray represented by the display value determined for each pixel.
[0016] In one embodiment, each display value associated with one of the functions represents a level of gray. In an alternative embodiment, each display value associated with one of the functions represents a color.
Brief Description of the Drawings
[0017] In the drawings,
[0018] FIG. 1 is a data flow diagram illustrating an embodiment of a three-tone image generating system;
[0019] FIG. 2ais an illustration of an image including an illuminated spherical object;
[0020] FIG. 2bis an illustration of a three-tone image of the spherical object of FIG. 2a;
[0021] FIG. 3 is a diagram illustrating an embodiment of a user interface for defining luma ranges;
[0022] FIG. 4 is a data flow diagram illustrating an embodiment of a luma graph editing system;
[0023] FIG. 5 is a flow chart illustrating an embodiment of a process for generating a three-tone representation of a digital image;
[0024] FIG. 6 is a data flow diagram illustrating an embodiment of the operation of the pixel tone generator of FIG. 1; and
[0025] FIG. 7 is a block diagram of an embodiment of a data structure representing a luma graph.
Detailed Description
[0026] The following detailed description should be read in conjunction with the attached drawing in which similar reference numbers indicate similar structures. All references cited herein are hereby expressly incorporated by reference.
[0027] FIG. 1 is a data flow diagram illustrating three-tone image generation. A three-tone image generator 46 receives luma graphs 48 that include a highlight graph 54, a midtone graph 56, and a shadow graph 58. The graphs 54, 56, and 58 define output values of a highlight function, a midtone function, and a shadow function, respectively, as a function of a luma input value. The three-tone image generator 46 also receives the digital image 50. The three-tone image generator applies the luma graphs 48 to the digital image 50 to generate a three-tone image 52. The three-tone image generator 46 includes a pixel tone generator 62, discussed below in greater detail. Although three-tone generation is described, the system and method described herein can be used to define any number, e.g., two or more of luma graphs, and apply the graphs to a digital image. The system and method described herein also may be used to apply other graphs defining output values as a function of a color component other than luma to a digital image to produce a multi-tone image.
[0028] FIG. 2ais an illustration of a gray scale image 36 that includes an illuminated sphere 37 and a white background 39. In FIG. 2a, a light source (not shown) illuminates the sphere 37 from the upper right hand corner of the image 36. The illumination fails to reach the lower left corner of the sphere such that the sphere goes from having high luma or highlights in its upper right region to having mid-range luma or midtones towards the middle, and low luma or shadows towards the lower left.
[0029] The digital image 38 of FIG. 2bis produced by applying three-tone image generation to the digital image 36. In the image 38, the various levels of luma on the sphere 37 in FIG. 2aare now represented by three discrete regions: a white region 40, a gray region 42, and a black region 44, each having a different level of gray. The regions 40, 42 and 44 correspond to three luma ranges resulting from three luma functions applied to the digital image 38. Because white has a high luma, the white background 39 of FIG. 1 is again represented as the color white at 39 in FIG. 2b. FIGS. 2aand 2bmay be a representation of a color image with the chroma components removed. Although FIG. 2buses gray, white and black, any three colors may be used to represent the three luma regions of the digital image 38.
[0030] FIG. 3 illustrates an embodiment of a user interface that may be used to define the highlight graph 54, the midtone graph 56, and the shadow graph 58. In FIG. 3, the visual display 6 may include three distinct graphs sharing a common X-axis and Y-axis. Alternatively, the visual display 6 includes only one of the highlight graph 54, the midtone graph 56, and the shadow graph 58 at a time, as requested by an editor. Although not shown in FIG. 3, the Y-axis is the left-hand side of the visual display 6, the X-axis runs along the bottom of the visual display 6, and the origin is the lower left-hand comer. The X-axis represents possible luma values of a pixel, and the Y-axis defines a normalized or weighted value for each possible value of the X-axis. For example, if the color of a pixel is being represented in YCrCb format, the X-axis represents the Y component of the pixel and may range from 0 to 255. The Y-axis, on the other hand, represents a range from zero to one where the highlight graph 54, midtone graph 56, and shadow graph 58 each have a weighted value from zero to one.
[0031] In the visual display 6, the dotted curve 10 represents the shadow graph 58. The value of the dotted curve 10 is high for lower values of luma and low for higher levels of luma. The dashed curve 12 represents the midtone graph 56. The value of the dashed curve 12 has its highest value for mid-range values of luma, and low values for higher and lower values of luma. The solid curve 14 represents the highlight graph 54. The value of the solid curve 14 is low for lower values of luma, and high for higher values of luma.
[0032] A display value to be assigned to a pixel is determined by comparing the graphs or the graph curves 10, 12, and 14 illustrated in FIG. 3 to determine which curve has the greatest weighted value for a given luma value. The visual display 6 appears to have three ranges: a shadow range 30 where the shadow graph has the greatest weighted value; a midtone ranged 32 where the midtone graph has the highest weighted value; and a luma range 34 where the luma graph has the highest weighted value. The boundaries of the luma regions are illustrated at 26 and 28.
[0033] The user interface 2 also may include a graph selection pane 4 for selecting the highlight curve 14, midtone curve 12, or shadow curve 10 of the visual display 6 to permit editing of the curve. In the example of FIG. 3, the radio button 3 next to the word “HIGHLIGHT” indicates that the highlight curve 14 is currently being edited. Control points 16, 18, 20, 22, and 24 define the highlight curve 14 in the visual display 6. Although five points are being used in the example of visual display 6, any number of points may be used depending upon an editor's preference and limits imposed by the application software being used.
[0034] The user interface 2 also may include a preview selection pane 8 to permit a user to select an image to preview in another visual display. In the example of FIG. 3, the radio button labeled “THREE TONE” indicates that the user has selected the three tone preview which allows the user to view a three tone presentation that illustrates the luma ranges created by the luma curves 10, 12, and 14. The radio button labeled “INPUT” allows a user to view the digital image before the luma curves, 10, 12, and 14 are applied. The radio button labeled “OUTPUT”, allows a user to view the digital image with the luma curves, 10, 12, and 14 applied.
[0035] An editor may select an individual control point of the control points 16-24, and then move the point either up or, down on the highlight curve 14. An editor also may add a new control point to the control points 16-24. The highlight curve 14 is redefined in response to changes, additions or deletions of control points. The curve may be redefined by interpolating points along the curve between the control points. Such interpolation can be accomplished for example by representing the curve using linear interpolation, cubic splines, or bezier curves.
[0036] Referring to FIG. 4, a graph editor 114 receives an editor-defined control point 112 for a curve of a graph, which may be a new point or a change in the position of an existing point. The graph editor 114 then interpolates all the points between the editor-defined control point and other control points on the curve to redefine the graph. The graph editor may employ linear interpolation, cubic splines, bezier curves, or other known methods of interpolation. The data structure that represents a luma graph, for example the highlight graph 54, the midtone graph 56, and the shadow graph 58 is described in more detail below.
[0037] FIG. 5 is a flow chart illustrating an example method of generating a display value for a pixel that may be performed by the image generator 46 of FIG. 1. First, in steps 88 and 90, the next pixel of a digital image is received, and the luma value of the pixel identified. In steps 92 and 94, the highlight luma graph is accessed and a weighted value of the highlight graph for the luma value of the pixel is determined. In steps 96 and 98 the midtone luma graph is accessed and the weighted value of the midtone graph 4 of the luma value is determined. In step 100, the weighted value of the highlight graph is compared to the weighted value of the midtone graph to determine the greater value of the two.
[0038] In steps 102 and 104, the shadow luma graph is accessed and a weighted value of the shadow graph for the luma value is determined. In step 106, the value of the shadow graph is compared to the greater value of the highlight graph and the midtone graph, determined in step 100, to determine the greatest weighted value of the three graphs. The graph values may be compared in any order or in parallel. Steps 92, 96 and step 102 all may occur before the first determination of the value of the highlight graph in step 94. In step 108, a display value associated with the luma graph that had the greatest value for the luma value of the pixel is assigned to the pixel.
[0039] In an alternative embodiment, the luma graph with the greatest value is determined for each possible luma value before a pixel is received. In this embodiment, each entry of a single LUT holds the display value associated with the luma graph having the greatest value for a given luma value. Given a pixel, the luma value of the pixel is identified, the entry of the single LUT for the luma value is accessed, and the display value of the entry is assigned to the pixel.
[0040] In another alternative embodiment, a pixel is represented with RGB components, and three LUTs, one for each component, are used. Each LUT includes entries, and each entry holds the display value associated with the luma graph having the greatest value for a given luma value. A 3×3 matrix is applied to the RGB color to determine the luma value. This technique may be applied to other component formats, for example, CMY.
[0041] In yet another embodiment, the function associated with each luma graph is stored, and for each pixel received, the luma value is identified, and the weighted value of each luma graph for the luma value is determined, the luma graph with the greatest value is determined, and the display value associated with the determined luma graph is assigned to the pixel.
[0042] After a display value has been associated with each pixel of a digital image, the digital image may then be displayed, with each pixel being displayed as a color or a level of gray corresponding to the display value assigned to the pixel.
[0043] FIG. 6 is a data flow diagram illustrating the operation of the pixel tone generator 62 in more detail. The pixel tone generator 66 includes a lookup table (LUT) engine 78, a comparator 80, and a display value selector 84. Each of the highlight graph 54, the midtone graph 56, and the shadow table 58, include a luma graph lookup table (LUT) and a display value, for example, the highlight LUT 66 and display value 68 of the highlight graph 54.
[0044] The LUT engine 78 receives a pixel 60 and determines a pixel luma value 64 of the pixel. In an alternative embodiment, the LUT engine 78 receives the pixel luma value 64. The luma pixel value serves as a pointer to a value within each of the LUTs of the highlight graph 54, the midtone graph 56, and the shadow graph 58, respectively.
[0045] FIG. 7 is a diagram illustrating an example embodiment of a luma graph LUT, for example highlight LUT 66. Highlight LUT 66 includes a number of entries 67 equal to the number of possible luma values of a pixel. Each entry 67 includes a pixel luma value 69 and the corresponding highlight graph value 71. Highlight LUT 66 has two columns: column 61 representing the possible pixel luma values and column 63 representing the corresponding highlight graph values for each luma value.
[0046] Returning to FIG. 6, the pixel luma value 64 points to an entry in each of the LUTS of the highlight graph 54, the midtone graph 56, and the shadow table 58, respectively. For each LUT, the luma graph value defined for the entry being pointed to, a highlight graph value 70, a midtone graph value 72, and a midtone graph value 74, respectively, is sent to the comparator 80 of the pixel tone generator 62.
[0047] The comparator 80 receives the highlight graph value 70, the midtone graph value 72, and the shadow graph value 74, and generates a graph ID 82. The graph ID indicates which of the graphs, highlight graph 54, midtone graph 56 and midtone graph 58, has the highest value for the given pixel luma values 64.
[0048] The display value selector 84 receives the graph ID 82, highlight display value 68, midtone display value 69, and shadow display value 71, and selects the display value from the graph identified by the graph ID 82. The display value selector 84 then assigns the selected display value 86 to the pixel 60, and outputs the selected display value 86.
[0049] The generation of a multi-tone representation of a digital image may be performed using a general purpose computer. It should be understood that generating a three-tone representation of a digital image is not limited by the specific computer described herein. Many other different machines may be used to implement the invention. Such a suitable computer system includes a processing unit which performs a variety of functions and a manner well-known in the art in response to instructions provided from an application program. The processing unit functions under control of a program known as the operating system, of which many types are known in the art. The steps of an application program are typically provided in random access memory (RAM) in machine-readable form because programs are typically stored on a non-volatile memory, such as a hard disk or floppy disk. When an editor selects an application program, it is loaded from the hard disk to the RAM, and the processing unit proceeds through the sequence of instructions of the application program.
[0050] The computer system also may include an editor input/output (I/O) interface. The editor interface typically includes a display apparatus (not shown), such as a cathode-ray-tube (CRT) display in an input device (not shown), such as a keyboard or mouse. A variety of other known input and output devices may be used, such as speech generation and recognition units, audio output devices, etc.
[0051] The computer system also may include a video and audio data I/O subsystem. Such a subsystem is well-known in the art and the present invention is not limited to the specific subsystem described herein. The audio portion of subsystem includes an analog-to-digital (A/D) converter (not shown), which receives analog audio information and converts it to digital information. The digital information may be compressed using known compression systems, for storage on the hard disk to use at another time. A typical video portion of subsystem includes a video image compressor/decompressor (not shown) of which many are known in the art. Such compressor/decompressors convert analog video information into compressed digital information. The compressed digital information may be stored on hard disk for use at a later time. An example of such a compressor/decompressor is described in U.S. Pat. No. 5,355,450. Video data also may remain uncompressed.
[0052] One or more output devices may be connected to the computer system. Example output devices include a cathode ray tube (CRT) display, liquid crystal displays (LCD) and other video output devices, printers, communication devices such as a modem, storage devices such as disk or tape, and audio output. One or more input devices may be connected to the computer system. Example input devices include a keyboard, keypad, track ball, mouse, pen and tablet, communication device, and data input devices such as audio and video capture devices and sensors. Generation of a three-tone representation of a digital image is not limited to the particular input or output devices used in combination with the computer system or to those described herein.
[0053] The computer system may be a general purpose computer system which is programmable using a computer programming language such as the “C++” or JAVA languages or other language, such as a scripting language or even assembly language. The computer system may also be specially programmed, special purpose hardware. In a general purpose computer system, the processor is typically a commercially available processor, such as the series X86 and PENTIUM processors, available from Intel, similar devices from AMD and Cyrix, the 680X0 series microprocessors available from Motorola, and the POWERPC microprocessor from International Business Machines. Many other processors are available. Such a microprocessor executes a program called an operating system, of which the WINDOWSNT, WINDOWS95 or WINDOWS98, UNIX, LINUX, DOS, VMS, MACOS and OS8 operating systems are examples, which controls the execution of other computer programs and provides scheduling, debugging, input/output control, accounting, compilation, storage assignment, data management and memory management, communication control and related services. The processor and operating system define a computer platform for which application programs in high-level programming languages are written.
[0054] A memory system typically includes a computer readable and writeable nonvolatile recording medium, of which a magnetic disk, a flash memory and tape are examples. The disk may be removable, known as a floppy disk, or permanent, known as a hard drive. A disk has a number of tracks in which signals are stored, typically in binary form, i.e., a form interpreted as a sequence of one and zeros. Such signals may define an application program to be executed by the microprocessor, or information stored on the disk to be processed by the application program. Typically, in operation, the processor causes data to be read from the nonvolatile recording medium into an integrated circuit memory element, which is typically a volatile, random access memory such as a dynamic random access memory (DRAM) or static memory (SRAM). The integrated circuit memory element allows for faster access to the information by the processor than does the disk. The processor generally manipulates the data within the integrated circuit memory and then copies the data to the disk when processing is completed. A variety of mechanisms are known for managing data movement between the disk and the integrated circuit memory element, and the invention is not limited thereto. It should also be understood that the invention is not limited to a particular memory system.
[0055] Such a system may be implemented in software or hardware or firmware, or a combination of the three. The various elements of the system, either individually or in combination may be implemented as a computer program product tangibly embodied in a machine-readable storage device for execution by a computer processor. Various steps of the process may be performed by a computer processor executing a program tangibly embodied on a computer-readable medium to perform functions by operating on input and generating output. Computer programming languages suitable for implementing such a system include procedural programming languages, object-oriented programming languages, and combinations of the two.
[0056] The computer system is not limited to a particular computer platform, particular processor, or particular programming language. Additionally, the computer system may be a multi processor computer system or may include multiple computers connected over a computer network. Each step of FIG. 5 also may be separate modules of a computer program, or may be separate computer programs. Such modules may be operable on separate computers.
[0057] Having now described some embodiments, it should be apparent to those skilled in the art that the foregoing is merely illustrative and not limiting, having been presented by way of example only. Numerous modifications and other embodiments are within the scope of one of ordinary skill in the art and are contemplated as falling within the scope of the invention.
Claims
What is claimed is:
1. A method of producing a representation of a digital image by applying a plurality of functions of luma to the digital image, wherein the functions of luma comprise at least a first function and a second function, each function having a value for each luma value in a range of luma values, and each function having an associated display value, the digital image include a plurality of pixels, the method comprising:
for each pixel, determining which of the first and second function has a maximum value for a luma value of the pixel;
representing the pixel using the display value associated with the determined function; and
redefining a function of luma selected by a user by applying a user-defined value to the selected function of luma.
2. The method of claim 1, wherein the selected function of luma is represented as a function curve on a graph, an X-axis of the graph representing the range of luma values and a Y-axis of the graph representing values of the selected function, the step of redefining the selected curve including:
receiving a signal defining a first control point on the function curve.
3. The method of claim 2, wherein the first curve has at least two control points, the step of redefining further comprising:
interpolating points along the function curve between the first control point and at least a second control point, the first control point thereby redefining the selected function.
Patent Citations (115)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4189742(A) | 1980-02-01 | Klopsch | Applicant |
| US4272780(A) | 1981-06-01 | Belmares-Sarabia et al. | Applicant |
| US4298885(A) | 1981-11-01 | Okada | Applicant |
| US4367465(A) | 1983-01-01 | Mati et al. | Applicant |
| US4385311(A) | 1983-05-01 | Harwood et al. | Applicant |
| US4410908(A) | 1983-10-01 | Belmares-Sarabia et al. | Applicant |
| US4418358(A) | 1983-11-01 | Poetsch et al. | Applicant |
| US4488245(A) | 1984-12-01 | Dalke et al. | Applicant |
| US4492978(A) | 1985-01-01 | Thomas | Applicant |
| US4571632(A) | 1986-02-01 | Schaphorst et al. | Applicant |
| US4599643(A) | 1986-07-01 | Harlan | Applicant |
| US4602286(A) | 1986-07-01 | Kellar et al. | Applicant |
| US4642632(A) | 1987-02-01 | Ohyagi et al. | Applicant |
| US4642676(A) | 1987-02-01 | Weinger | Applicant |
| US4679067(A) | 1987-07-01 | Belmares-Sarabia et al. | Applicant |
| US4694329(A) | 1987-09-01 | Belmares-Sarabia et al. | Applicant |
| US4698666(A) | 1987-10-01 | Lake, Jr. et al. | Applicant |
| US4727412(A) | 1988-02-01 | Fearing et al. | Applicant |
| US4733230(A) | 1988-03-01 | Kurihara et al. | Applicant |
| US4750050(A) | 1988-06-01 | Belmares-Sarabia et al. | Applicant |
| US4763186(A) | 1988-08-01 | Belmares-Sarabia et al. | Applicant |
| US4782397(A) | 1988-11-01 | Kimoto | Applicant |
| US4794460(A) | 1988-12-01 | Shiota | Applicant |
| US4797733(A) | 1989-01-01 | Takagi et al. | Applicant |
| US4811084(A) | 1989-03-01 | Belmares-Sarabia et al. | Applicant |
| US4823184(A) | 1989-04-01 | Belmares-Sarabia et al. | Applicant |
| US4827344(A) | 1989-05-01 | Astle et al. | Applicant |
| US4857994(A) | 1989-08-01 | Belmares-Sarabia et al. | Applicant |
| US4862251(A) | 1989-08-01 | Belmares-Sarabia et al. | Applicant |
| US4866511(A) | 1989-09-01 | Belmares-Sarabia et al. | Applicant |
| US4876589(A) | 1989-10-01 | Orsburn et al. | Applicant |
| US4907071(A) | 1990-03-01 | Belmares-Sarabia et al. | Applicant |
| US5038206(A) | 1991-08-01 | Ubukata | Applicant |
| US5070397(A) | 1991-12-01 | Wedderburn-Bisshop | Applicant |
| US5089882(A) | 1992-02-01 | Kaye et al. | Applicant |
| US5129013(A) | 1992-07-01 | Holzmann et al. | Applicant |
| US5130789(A) | 1992-07-01 | Dobbs et al. | Applicant |
| US5134688(A) | 1992-07-01 | Corthout | Applicant |
| US5140416(A) | 1992-08-01 | Tinkler | Applicant |
| US5142273(A) | 1992-08-01 | Wobermin | Applicant |
| US5146325(A) | 1992-09-01 | Ng | Applicant |
| US5153937(A) | 1992-10-01 | Wobermin et al. | Applicant |
| US5179641(A) | 1993-01-01 | Comins et al. | Applicant |
| US5181113(A) | 1993-01-01 | Chang | Applicant |
| US5218671(A) | 1993-06-01 | Liao et al. | Applicant |
| US5241372(A) | 1993-08-01 | Ohba | Applicant |
| US5253043(A) | 1993-10-01 | Gibson | Applicant |
| US5283651(A) | 1994-02-01 | Ishizuka | Applicant |
| US5289295(A) | 1994-02-01 | Yumiba et al. | Applicant |
| US5313275(A) | 1994-05-01 | Daly et al. | Applicant |
| US5317678(A) | 1994-05-01 | Okawara et al. | Applicant |
| US5325449(A) | 1994-06-01 | Burt et al. | Applicant |
| US5373327(A) | 1994-12-01 | McGee et al. | Applicant |
| US5381185(A) | 1995-01-01 | Ohki et al. | Applicant |
| US5392385(A) | 1995-02-01 | Evangelisti et al. | Applicant |
| US5398123(A) | 1995-03-01 | Katsuma | Applicant |
| US5418895(A) | 1995-05-01 | Lee | Applicant |
| US5420971(A) | 1995-05-01 | Westerink et al. | Applicant |
| US5438651(A) | 1995-08-01 | Suzuki et al. | Applicant |
| US5444835(A) | 1995-08-01 | Turkowski | Applicant |
| US5450134(A) | 1995-09-01 | Legate | Applicant |
| US5479590(A) | 1995-12-01 | Lin | Applicant |
| US5488429(A) | 1996-01-01 | Kojima et al. | Applicant |
| US5488674(A) | 1996-01-01 | Burt et al. | Applicant |
| US5506946(A) | 1996-04-01 | Bar et al. | Applicant |
| US5510843(A) | 1996-04-01 | Keene et al. | Applicant |
| US5510851(A) | 1996-04-01 | Foley et al. | Applicant |
| US5532751(A) | 1996-07-01 | Lui | Applicant |
| US5557334(A) | 1996-09-01 | Legate | Applicant |
| US5557339(A) | 1996-09-01 | Dadourian | Applicant |
| US5557340(A) | 1996-09-01 | Millward | Applicant |
| US5600376(A) | 1997-02-01 | Casavant et al. | Applicant |
| US5611030(A) | 1997-03-01 | Stokes | Applicant |
| US5615324(A) | 1997-03-01 | Kuboyama | Applicant |
| US5625421(A) | 1997-04-01 | Faroudja et al. | Applicant |
| US5630037(A) | 1997-05-01 | Schindler | Applicant |
| US5633687(A) | 1997-05-01 | Bhayani et al. | Applicant |
| US5636290(A) | 1997-06-01 | Kita et al. | Applicant |
| US5638136(A) | 1997-06-01 | Kojima et al. | Applicant |
| US5638138(A) | 1997-06-01 | Hickman | Applicant |
| US5645884(A) | 1997-07-01 | Harlow, Jr. et al. | Applicant |
| US5657094(A) | 1997-08-01 | Moriwake | Applicant |
| US5659639(A) | 1997-08-01 | Mahoney et al. | Applicant |
| US5661525(A) | 1997-08-01 | Kovacevicet et al. | Applicant |
| US5663765(A) | 1997-09-01 | Matsuse et al. | Applicant |
| US5682443(A) | 1997-10-01 | Gouch et al. | Applicant |
| US5703654(A) | 1997-12-01 | Iizuka | Applicant |
| US5703659(A) | 1997-12-01 | Tanaka | Applicant |
| US5715377(A) | 1998-02-01 | Fukushima et al. | Applicant |
| US5729360(A) | 1998-03-01 | Kita et al. | Applicant |
| US5745121(A) | 1998-04-01 | Politis | Applicant |
| US5754180(A) | 1998-05-01 | Kivolowitz et al. | Applicant |
| US5770299(A) | 1998-06-01 | Dannenhauer et al. | Applicant |
| US5774112(A) | 1998-06-01 | Kasson | Applicant |
| US5805169(A) | 1998-09-01 | Harada et al. | Applicant |
| US5888444(A) | 1999-03-01 | Dannenhauer et al. | Applicant |
| US5943045(A) | 1999-08-01 | Ikeshoji et al. | Examiner |
| US6002842(A) | 1999-12-01 | Oshio et al. | Examiner |
| US6111980(A) | 2000-08-01 | Sano et al. | Examiner |
| EP205332 | 1990-10-01 | Applicant | |
| EP512839 | 1992-11-01 | Applicant | |
| EP517035 | 1992-12-01 | Applicant | |
| EP594312 | 1994-04-01 | Applicant | |
| EP494325 | 1995-11-01 | Applicant | |
| EP702832 | 1996-03-01 | Applicant | |
| EP709806 | 1996-05-01 | Applicant | |
| EP871177 | 1998-10-01 | Applicant | |
| EP741492 | 1999-03-01 | Applicant | |
| GB2312120 | 1997-10-01 | Applicant | |
| GB2312348 | 1997-10-01 | Applicant | |
| WO94/29868 | 1994-12-01 | Applicant | |
| WO96/13807 | 1996-05-01 | Applicant | |
| WO97/06631 | 1997-02-01 | Applicant | |
| WO97/39452 | 1997-10-01 | Applicant | |
| WO98/11510 | 1998-03-01 | Applicant |
Non-Patent Literature (14)
- Avid Media Illusion Reference Guide, Jul. 1996, pp. 101-102 (No p. 101).Applicant
- Discreet Logic, Inc. Manual, “enter*”, Apr. 1999, pp. 103-128.Applicant
- Discreet Logic, Inc. Manual, “smoke*”, Jul. 1998, pp. 552-554.Applicant
- Kieran, Michael, “The Color Scanning Success Handbook”, 1997, pp. 121-162.Applicant
- Ohanian, Thomas A., “Digital Nonlinear Editing; New Approaches to Editing Film and Video”, 1993, pp. 103-153.Applicant
- U.S. patent application Ser. No. 09/293,590, Cacciatore et al., filed Apr. 16, 1999.Applicant
- U.S. patent application Ser. No. 09/293,259, Cacciatore et al., filed Apr. 16, 1999.Applicant
- U.S. patent application Ser. No. 09/293,730, Gonsalves et al., filed Apr. 16, 1999.Applicant
- U.S. patent application Ser. No. 09/392,823, Gonsalves et al., filed Sep. 9, 1999.Applicant
- U.S. patent application Ser. No. 09/545,644, Cooper et al., filed Apr. 7, 2000.Applicant
- Alan Wm. Paeth, Distance Approximations and Bounding Polyhedra, copyright © 1995 by Academic Press, Inc., pp 78-87.Applicant
- James D. Foley and Andries Van Dam, Fundamentals of Interactive Computer Graphics copyright © 1982 by Addison-Wesley Publishing Company, Inc., pp 245-249.Applicant
- Eric N. Mortensen and William A. Barrett, Intelligent Scissors for Image Composition Computer Graphics Proceedings, Annual Conference Series 1995, Siggraph 95 Conference Proceedings Aug. 6-11, 1995. A publication of ACM Siggraph, pp. 191-198.Applicant
- Alvy Ray Smith and James F. Blinn, Blue Screen Matting, Computer Graphics Proceedings, Annual Conference Series, 1996, Siggraph 96, New Orleans, Louisiana, Aug. 4-9, 1996, pp 259-268.Applicant