Non-greedy hierarchical segmentation of serial data
US10210908B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 26, 2017 |
| Grant date | Feb 19, 2019 |
| Priority date | — |
| Expiry date | Apr 1, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG11B27/28
- WIPO fieldAudio-visual technology
- WIPO sectorElectrical engineering
Abstract
Segmenting serial data by processing multiple candidate segmentation point sets associated with a serial data set, each candidate set including a different number of candidate segmentation points representing the serial data set as segments in accordance with segmentation criteria, where the processing includes determining, for each of the candidate points, a count of the candidate sets that include the candidate point, and creating, for each of the candidate sets, a corresponding alternative segmentation point set associated with the serial data set, where the alternative set includes n alternative segmentation points representing the serial data set as n+1 segments, where n equals the number of candidate points in the candidate set to which the alternative set corresponds, and where the n alternative points in the alternative set correspond to n of the candidate points having the greatest counts, and arranging the alternative sets in order of their numbers of segmentation points.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.