IP Library Patent Application 18542866
Patent Application
App. No. 18/542,866

SYSTEMS AND METHODS FOR ORGANIZING AND SEARCHING A VIDEO DATABASE

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
18/542,866
Abstract

A system for organizing and searching a video database includes a logic circuit configured to extract, from a video, at least a video feature, generate at least a first hash value as a function of the at least a video feature, wherein generating the at least a first hash value further comprises performing a robust hash algorithm on the at least a feature, and store the video in a data structure, wherein storing the video further includes storing a representation of the video in a leaf node of the data structure and storing the at least a first hash value in a traversal index linking hash values to leaf nodes.

Claims (41)

1 . A method of organizing and searching a video database, the method comprising: extracting, from a video, at least a video feature;

generating at least a first hash value as a function of the at least a video feature, wherein generating the at least a first hash value further comprises performing a robust hash algorithm on the at least a feature; and

storing the video in a data structure, wherein storing the video further comprises: storing a representation of the video in a leaf node of the data structure; and

storing the at least a first hash value in a traversal index linking hash values to leaf nodes.

2 . The method of claim 1 , wherein the traversal index is configured to link vectors of hash values to leaf nodes.

3 . The method of claim 2 , wherein storing the at least a first hash value in the traversal index further comprises:

arranging the at least a first hash value into a first vector; and

storing the first vector in a traversal index linking vectors to leaf nodes.

4 . The method of claim 3 , wherein the traversal index further comprises a tree structure having internal nodes representing feature hashes and including the leaf nodes, wherein a tier ordering of the internal nodes follows an element ordering of the first vector.

5 . The method of claim 1 , further comprising:

receiving at least a search feature;

generating at least a second hash value using the at least a search feature and the robust hash algorithm;

matching the at least a second hash value to the at least a first value in the traversal index; and

locating the video as a function of the traversal index.

6 . The method of claim 4 , wherein matching further comprises:

arranging the at least a second hash value into a second vector; and

matching the second vector to a first vector containing the at least a first hash value using a vector similarity test.

7 . The method of claim 6 , wherein the traversal index further comprises a tree structure having internal nodes representing feature hashes and including the leaf nodes, and the vector similarity test further comprises:

matching each vector entry to a hash belonging to a set of nodes in a tier corresponding to the vector entry, wherein the set of nodes are child nodes of a previously matched parent node.

8 . The method of claim 4 where receiving the at least a search feature further comprises:

receiving a query frame; and

extracting the at least a search feature from the query frame.

9 . A system for organizing and searching a video database, the system comprising a logic circuit configured to:

extract, from a video, at least a video feature;

generate at least a first hash value as a function of the at least a video feature, wherein generating the at least a first hash value further comprises performing a robust hash algorithm on the at least a feature; and

store the video in a data structure, wherein storing the video further comprises: storing a representation of the video in a leaf node of the data structure; and

storing the at least a first hash value in a traversal index linking hash values to leaf nodes.

10 . The system of claim 9 , wherein the traversal index is configured to link vectors of hash values to leaf nodes.

11 . The system of claim 11 , wherein storing the at least a first hash value in the traversal index further comprises:

arranging the at least a first hash value into a first vector; and

storing the first vector in a traversal index linking vectors to leaf nodes.

12 . The system of claim 9 , further configured to:

receive at least a search feature;

generate at least a second hash value using the at least a search feature and the robust hash algorithm;

match the at least a second hash value to the at least a first value in the traversal index; and locate the video as a function of the traversal index.

13 . The system of claim 12 , wherein matching further comprises:

arranging the at least a second hash value into a second vector; and

matching the second vector to a first vector containing the at least a first hash value using a vector similarity test.

14 . The system of claim 12 wherein receiving the at least a search feature further comprises:

receiving a query frame; and

extracting the at least a search feature from the query frame.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 6, 2025
From: FURHT, BORIVOJE; KALVA, HARI
To: FLORIDA ATLANTIC UNIVERSITY RESEARCH CORPORATION
Reel/Frame 073482/0048 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 6, 2025
From: FLORIDA ATLANTIC UNIVERSITY RESEARCH CORPORATION
To: OP SOLUTIONS, LLC
Reel/Frame 073482/0504 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 6, 2025
From: ADZIC, VELIBOR
To: OP SOLUTIONS, LLC
Reel/Frame 073482/0944 →