Movement data compression method based on sparse representation
A motion data, sparse expression technology, applied in electrical components, code conversion, etc., can solve problems such as unfavorable incremental database and data change processing, and achieve the effect of good effect, efficient compression, and high compression ratio
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0015] The specific steps of the method and the preparatory knowledge involved will be described in detail below, and the content of the present invention will become easier to understand.
[0016] 1. K-means clustering algorithm
[0017] The K-means clustering algorithm automatically divides the given n data objects into k clusters (k is the input), so that each data object is assigned to the cluster with the closest Euclidean distance. The specific implementation steps are as follows:
[0018] 1) Randomly select k objects from n data objects as the initial clustering center (the default is random selection, you can also specify k objects or specify the coordinates of k initial clustering center points. In this method, due to the needs of the automated process, Only k objects can be randomly selected, so there will be a small error in the clustering results).
[0019] 2) According to the mean value (central object) of each clustering object, calculate the distance between e...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com