Patent US5372961A successfully refreshed from Google Patents.
← Back to Patent Explorer
US10169893B2 Active / In Force US ⏱️ 9.8 years remaining

Optimizing photo album layouts

Assignee: Google LLC
•
Filing: 2016-08-22
•
Granted: 2019-01-01
•
Expires: 2036-08-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Implementations generally relate to optimizing a photo album layout. In some implementations, a method includes receiving a plurality of images and determining a target arrangement. The method also includes arranging the plurality of images in an N-dimensional arrangement based on a predetermined distance function. The method also includes arranging the plurality of images in the target arrangement based on the N-dimensional arrangement.

Inventors

  • 👤 Stephen Joseph DiVerdi
  • 👤 Ohad Izhak Fried

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 10:11
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/60; G06T11/206; G06T11/20; G06T11/26

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 130 words
A computer-implemented method, comprising: receiving a user's plurality of images for an image collection of the user; determining at least one content-based attribute of the user's plurality of images by analyzing content of each of the user's plurality of images; determining a target arrangement for the image collection, wherein the target arrangement includes a set of discrete cells; generating pairwise distances between pairs of the user's plurality of images based on a distance function associated with the at least one content-based attribute, generating a distance graph based on the pairwise distances; embedding the distance graph onto an N-dimensional space to create a preliminary arrangement of the user's plurality of images; and arranging the user's plurality of images in the image collection in the target arrangement based on the preliminary arrangement.
Claim 2
Dependent Claim 130 words
A computer-implemented method, comprising: receiving a user's plurality of images for an image collection of the user; determining at least one content-based attribute of the user's plurality of images by analyzing content of each of the user's plurality of images; determining a target arrangement for the image collection, wherein the target arrangement includes a set of discrete cells; generating pairwise distances between pairs of the user's plurality of images based on a distance function associated with the at least one content-based attribute, generating a distance graph based on the pairwise distances; embedding the distance graph onto an N-dimensional space to create a preliminary arrangement of the user's plurality of images; and arranging the user's plurality of images in the image collection in the target arrangement based on the preliminary arrangement.
Claim 3
Dependent Claim 15 words
The computer-implemented method of claim 1 , wherein the target arrangement is a geometric shape.
Claim 4
Dependent Claim 37 words
The computer-implemented method of claim 1 , further comprising determining a coarse alignment of the preliminary arrangement, wherein the arranging of the user's plurality of images in the target arrangement is further based on the coarse alignment.
Claim 5
Dependent Claim 55 words
The computer-implemented method of claim 3 , wherein the arranging of the user's plurality of images in the target arrangement further comprises: generating a bipartite graph based on the coarse alignment; computing a minimal bijection of the bipartite graph; and arranging the user's plurality of images in the target arrangement based on the minimal bijection.
Claim 6
Dependent Claim 23 words
The computer-implemented method of claim 1 , wherein the preliminary arrangement is a 3-dimensional volume and the target arrangement is a 3-dimensional arrangement.
Claim 7
Dependent Claim 32 words
The computer-implemented method of claim 1 , wherein the distance graph includes a vertex for each image and edges connecting two vertices, and wherein for S vertices there are S 2 edges.
Claim 8
Dependent Claim 24 words
The computer-implemented method of claim 1 , wherein the user's plurality of images is received from at least one computer device of the user.
Claim 9
Independent Claim 162 words
A system comprising: one or more processors; and logic encoded in one or more tangible media for execution by the one or more processors and when executed operable to perform operations comprising: receiving a user's plurality of images for an image album of the user; determining a content-based attribute of the user's plurality of images by analyzing content of each of the user's plurality of images; determining a target arrangement for the image album, wherein the target arrangement includes a grid of discrete cells; generating pairwise distances between pairs of the user's plurality of images based on a distance function associated with the content-based attribute, generating a distance graph based on the pairwise distances; embedding the distance graph onto an N-dimensional space to create a preliminary arrangement of the user's plurality of images; and arranging the user's plurality of images in the image album of the user in the grid of discrete cells of the target arrangement based on the preliminary arrangement.
Claim 10
Independent Claim 162 words
A system comprising: one or more processors; and logic encoded in one or more tangible media for execution by the one or more processors and when executed operable to perform operations comprising: receiving a user's plurality of images for an image album of the user; determining a content-based attribute of the user's plurality of images by analyzing content of each of the user's plurality of images; determining a target arrangement for the image album, wherein the target arrangement includes a grid of discrete cells; generating pairwise distances between pairs of the user's plurality of images based on a distance function associated with the content-based attribute, generating a distance graph based on the pairwise distances; embedding the distance graph onto an N-dimensional space to create a preliminary arrangement of the user's plurality of images; and arranging the user's plurality of images in the image album of the user in the grid of discrete cells of the target arrangement based on the preliminary arrangement.
Claim 11
Dependent Claim 24 words
The system of claim 8 , wherein the grid of discrete cells of the target arrangement is in a form of a geometric shape.
Claim 12
Dependent Claim 39 words
The system of claim 8 , wherein the operations further comprise determining a coarse alignment of the preliminary arrangement, wherein the arranging of the user's plurality of images in the target arrangement is further based on the coarse alignment.
Claim 13
Dependent Claim 54 words
The system of claim 10 , wherein the arranging of the user's plurality of images in the target arrangement further comprises: generating a bipartite graph based on the coarse alignment; computing a minimal bijection of the bipartite graph; and arranging the user's plurality of images in the target arrangement based on the minimal bijection.
Claim 14
Dependent Claim 23 words
The system of claim 8 , wherein the preliminary arrangement is a 2-dimensional plane and the target arrangement is a 2-dimensional (2D) arrangement.
Claim 15
Dependent Claim 22 words
The system of claim 8 , wherein the preliminary arrangement is a 3-dimensional volume and the target arrangement is a 3-dimensional arrangement.
Claim 16
Dependent Claim 31 words
The system of claim 8 , wherein the distance graph includes a vertex for each image and edges connecting two vertices, and wherein for S vertices there are S 2 edges.
Claim 17
Dependent Claim 143 words
A non-transitory computer-readable storage medium having stored thereon software instructions that, when executed by a processor, cause the processor to perform operations including: receiving a user's plurality of images for an image collection of the user; determining a content-based attribute of a plurality of images by analyzing content of each of the user's plurality of images; determining a target arrangement for the image collection, wherein the target arrangement includes a set of discrete cells; generating pairwise distances between pairs of the user's plurality of images based on a distance function associated with the content-based attribute, generating a distance graph based on the pairwise distances; embedding the distance graph onto an N-dimensional space to create a preliminary arrangement of the user's plurality of images; and arranging the user's plurality of images in the image collection in the target arrangement based on the preliminary arrangement.
Claim 18
Dependent Claim 143 words
A non-transitory computer-readable storage medium having stored thereon software instructions that, when executed by a processor, cause the processor to perform operations including: receiving a user's plurality of images for an image collection of the user; determining a content-based attribute of a plurality of images by analyzing content of each of the user's plurality of images; determining a target arrangement for the image collection, wherein the target arrangement includes a set of discrete cells; generating pairwise distances between pairs of the user's plurality of images based on a distance function associated with the content-based attribute, generating a distance graph based on the pairwise distances; embedding the distance graph onto an N-dimensional space to create a preliminary arrangement of the user's plurality of images; and arranging the user's plurality of images in the image collection in the target arrangement based on the preliminary arrangement.
Claim 19
Dependent Claim 17 words
The non-transitory computer-readable storage medium of claim 15 , wherein the target arrangement is a geometric shape.
Claim 20
Dependent Claim 39 words
The non-transitory computer-readable storage medium of claim 15 , further comprising determining a coarse alignment of the preliminary arrangement, wherein the arranging of the user's plurality of images in the target arrangement is further based on the coarse alignment.
Claim 21
Dependent Claim 26 words
The non-transitory computer-readable storage medium of claim 15 , wherein the preliminary arrangement is a 2-dimensional plane and the target arrangement is a 2-dimensional (2D) arrangement.
Claim 22
Dependent Claim 25 words
The non-transitory computer-readable storage medium of claim 15 , wherein the preliminary arrangement is a 3-dimensional volume and the target arrangement is a 3-dimensional arrangement.
Claim 23
Dependent Claim 34 words
The non-transitory computer-readable storage medium of claim 15 , wherein the distance graph includes a vertex for each image and edges connecting two vertices, and wherein for S vertices there are S 2 edges.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2021-12-31 2022-07-02 2023-01-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2025-12-31 2026-07-02 2027-01-01 $3760.00 Surcharge Window Open
11.5 Years (Year 12) 2029-12-31 2030-07-02 2031-01-01 $7700.00 Pending Window

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag