Patent US7697785B2 successfully refreshed from Google Patents.
← Back to Patent Explorer
US7697785B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Generating a highly condensed visual summary

Assignee: Fujifilm Business Innovation Corp
•
Filing: 2004-03-31
•
Granted: 2010-04-13
•
Expires: 2024-03-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In one embodiment, the present invention extracts video regions of interest from one or more videos and generates a highly condensed visual summary of the videos. The video regions of interest are extracted based on to energy, movement, face or other object detection methods, associated data or external input, or some other feature of the video. In another embodiment, the present invention extracts regions of interest from images and generates highly condensed visual summaries of the images. The highly condensed visual summary is generated by laying out germs on a canvas and then filling the spaces between the germs. The result is a visual summary that resembles a stained glass window having cells of varying shape. The germs may be laid out by temporal order, color histogram, similarity, according to a desired pattern, size, or some other manner. The people, objects and other visual content in the germs appear larger and become easier to see. The visual summary of the present invention utilizes important regions within the key frames, leading to more condensed summaries that are well suitable for small screens.

Inventors

  • 👤 Patrick Chiu
  • 👤 Andreas Girgensohn
  • 👤 Qiong Liu

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 09:59
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/60; G06F; G06F16/00; G06F16/70; G06F16/73; G06F16/738; G06F16/739; G06F16/78; G06F16/783; G06F16/7837; G06F16/784; G06F16/7847; G06F16/785; G06F16/786; G11; G11B; G11B27/00; G11B27/02; G11B27/031; G11B27/10; G11B27/19; G11B27/28

Claims Analysis

Total Claims: 21
Claim 1
Independent Claim 277 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for defining a germ in each of a plurality of images, the germ containing a region of interest; utilizing the memory and CPU for defining a support in each of the video segments, wherein the support is the video segment less the germ; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein there is no more than one germ for every video segment, wherein the canvas is partitioned into disjoint areas corresponding to the shape of the germs, wherein the shape of the disjoint areas is defined by a Voronoi algorithm; and utilizing the memory and CPU for filling in the space of the canvas between the disjoint areas corresponding to the shape of the germs, wherein filling in the space of the canvas between the germs includes laying out one or more portions of the supports by assigning a pixel value of a point in the space from the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point in the space is only assigned a background value if no support includes the point, to generate a highly condensed visual summary of the plurality of video segments.
Claim 2
Dependent Claim 277 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for defining a germ in each of a plurality of images, the germ containing a region of interest; utilizing the memory and CPU for defining a support in each of the video segments, wherein the support is the video segment less the germ; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein there is no more than one germ for every video segment, wherein the canvas is partitioned into disjoint areas corresponding to the shape of the germs, wherein the shape of the disjoint areas is defined by a Voronoi algorithm; and utilizing the memory and CPU for filling in the space of the canvas between the disjoint areas corresponding to the shape of the germs, wherein filling in the space of the canvas between the germs includes laying out one or more portions of the supports by assigning a pixel value of a point in the space from the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point in the space is only assigned a background value if no support includes the point, to generate a highly condensed visual summary of the plurality of video segments.
Claim 3
Dependent Claim 27 words
The method of claim 1 wherein defining a germ includes: defining a two dimensional shape that encompasses the projection of a dominant group onto the key frame.
Claim 4
Dependent Claim 13 words
The method of claim 2 wherein the two dimensional shape is a rectangle.
Claim 5
Dependent Claim 36 words
The method of claim 2 wherein laying out the germs includes: determining a scale factor to be applied to every germ such that the germs are scaled to the maximum size that fits into the canvas.
Claim 6
Dependent Claim 31 words
The method of claim 2 wherein laying out the germs includes: placing the germs in rows, wherein each row has a height according to the longest germ in the particular row.
Claim 7
Dependent Claim 12 words
The method of claim 2 wherein the two dimensional shape is irregular.
Claim 8
Dependent Claim 20 words
The method of claim 1 wherein defining a germ includes: detecting a face in each of the plurality of images.
Claim 9
Dependent Claim 22 words
The method of claim 1 wherein defining a germ includes: using an algorithm to determine a region of interest of an image.
Claim 10
Dependent Claim 271 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for determining a germ in each of a plurality of images, the germ containing a region of interest; utilizing the memory and CPU for defining a support in each of the video segments wherein the support is the video segment less the germ; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein the germs are laid out in irregular two dimensional shapes on the canvas; utilizing the memory and CPU for defining a space between the germs; and utilizing the memory and CPU for filling in the space of the canvas between the irregular two dimensional shape germs, wherein filling in the space of the canvas between the irregular two dimensional shape germs includes laying out one or more portions of the supports by assigning the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning a pixel value of a point in the space from pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point between the irregular two dimensional shape germs is assigned an average value of nearby point values only if no support includes the point, to generate a highly condensed visual summary of the plurality of video segments.
Claim 11
Dependent Claim 271 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for determining a germ in each of a plurality of images, the germ containing a region of interest; utilizing the memory and CPU for defining a support in each of the video segments wherein the support is the video segment less the germ; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein the germs are laid out in irregular two dimensional shapes on the canvas; utilizing the memory and CPU for defining a space between the germs; and utilizing the memory and CPU for filling in the space of the canvas between the irregular two dimensional shape germs, wherein filling in the space of the canvas between the irregular two dimensional shape germs includes laying out one or more portions of the supports by assigning the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning a pixel value of a point in the space from pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point between the irregular two dimensional shape germs is assigned an average value of nearby point values only if no support includes the point, to generate a highly condensed visual summary of the plurality of video segments.
Claim 12
Dependent Claim 20 words
The method of claim 9 wherein determining a germ includes: detecting a face in each of the plurality of images.
Claim 13
Dependent Claim 23 words
The method of claim 9 wherein determining a germ includes: receiving user input, the user input associated with a part of an image.
Claim 14
Dependent Claim 44 words
The method of claim 9 wherein determining a germ includes: using an algorithm to determine the regions of interest of an image based on one or more methods selected from the group consisting of a face-detection algorithm, an object detection algorithms and user input.
Claim 15
Dependent Claim 36 words
The method of claim 9 wherein laying out the germs includes: determining a scale factor to be applied to every germ such that the germs are scaled to the maximum size that fits into the canvas.
Claim 16
Dependent Claim 31 words
The method of claim 9 wherein laying out the germs includes: placing the germs in rows, wherein each row has a height according to the longest germ in the particular row.
Claim 17
Dependent Claim 331 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for determining a dominant group in each of a plurality of video segments, wherein the dominant group includes a face; utilizing the memory and CPU for determining a key frame in each of the video segments; utilizing the memory and CPU for defining a germ associated with each dominant group in each of the video segments, wherein the germ is the x-y projection of the dominant group including the face onto the keyframe; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein the canvas is partitioned into disjoint areas corresponding to the germs, wherein the shape of the disjoint areas is defined using one or more algorithm selected from the group consisting of the distances between the germs, the distance between the face and the germ and the distance between two or more faces and the germ; and utilizing the memory and CPU for filling in the space of the canvas between the disjoint areas corresponding to the germs, wherein filling in the space of the canvas between the germs includes laying out one or more portions of the supports by assigning a pixel value of a point in the space from the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point between the irregular two dimensional shape germs is assigned an average value of nearby point values only if no support includes the point, wherein the canvas generated is a highly condensed visual summary of the plurality of video segments.
Claim 18
Dependent Claim 331 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for determining a dominant group in each of a plurality of video segments, wherein the dominant group includes a face; utilizing the memory and CPU for determining a key frame in each of the video segments; utilizing the memory and CPU for defining a germ associated with each dominant group in each of the video segments, wherein the germ is the x-y projection of the dominant group including the face onto the keyframe; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein the canvas is partitioned into disjoint areas corresponding to the germs, wherein the shape of the disjoint areas is defined using one or more algorithm selected from the group consisting of the distances between the germs, the distance between the face and the germ and the distance between two or more faces and the germ; and utilizing the memory and CPU for filling in the space of the canvas between the disjoint areas corresponding to the germs, wherein filling in the space of the canvas between the germs includes laying out one or more portions of the supports by assigning a pixel value of a point in the space from the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point between the irregular two dimensional shape germs is assigned an average value of nearby point values only if no support includes the point, wherein the canvas generated is a highly condensed visual summary of the plurality of video segments.
Claim 19
Dependent Claim 323 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for determining a germ in each of a plurality of images, the germ containing a region of interest; utilizing the memory and CPU for defining a support in each of the video segments, wherein the support is the video segment less the germ; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein the canvas is partitioned into disjoint areas corresponding to the shape of the germs; utilizing the memory and CPU for computing boundary curves between the germs, wherein the boundary curves between the germs are defined using one or more algorithm selected from the group consisting of the distance between a point and the closest border of the germ, the distance between a point and the center of a germ and the distance between a point and the size of the germ; utilizing the memory and CPU for defining a space between the boundary curves; and utilizing the memory and CPU for filling in the space of the canvas, wherein filling in the space of the canvas includes laying out one or more portions of the supports by assigning a pixel value of a point in the space from the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point between the boundary curves is assigned an average value of nearby point values only if no support includes the point, to generate a highly condensed visual summary of the plurality of video segments.
Claim 20
Dependent Claim 323 words
A computer implemented method implemented within a computer system including memory and CPU for generating a highly condensed visual summary of video regions, comprising: utilizing the memory and CPU for determining a germ in each of a plurality of images, the germ containing a region of interest; utilizing the memory and CPU for defining a support in each of the video segments, wherein the support is the video segment less the germ; utilizing the memory and CPU for separating the germ from the video segments; utilizing the memory and CPU for laying out the germs on a canvas, wherein the canvas is partitioned into disjoint areas corresponding to the shape of the germs; utilizing the memory and CPU for computing boundary curves between the germs, wherein the boundary curves between the germs are defined using one or more algorithm selected from the group consisting of the distance between a point and the closest border of the germ, the distance between a point and the center of a germ and the distance between a point and the size of the germ; utilizing the memory and CPU for defining a space between the boundary curves; and utilizing the memory and CPU for filling in the space of the canvas, wherein filling in the space of the canvas includes laying out one or more portions of the supports by assigning a pixel value of a point in the space from the same value as the corresponding pixel of the germ's support when this point is nearest the germ, and only when the germ's support does not encompass the point assigning pixel values of a support of a neighboring germ based on a distance from the point to the neighboring germ, wherein a point between the boundary curves is assigned an average value of nearby point values only if no support includes the point, to generate a highly condensed visual summary of the plurality of video segments.
Claim 21
Dependent Claim 21 words
The computer implemented method of claim 16 wherein the germs are laid out in irregular two dimensional shapes on the canvas.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2013-04-12 2013-10-12 2014-04-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2017-04-12 2017-10-12 2018-04-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2021-04-12 2021-10-12 2022-04-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag