FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3177654077> ?p ?o ?g. }

• W3177654077 abstract "Recently a number of researches have demonstrated performance improvement in the video fractal compression compared to the current video transmission standards (MPEG, H.263, H.264). This article describes a current problem of relatively low fractal encoding speed. Indeed, high computational complexity is a sore point of fractal compression approach. It seems almost every paper on this subject touches the problem of encoding speed. Productive ideas and algorithms can be borrowed from the pattern recognition problem. In the course of recent decades feature points approach in computer vision has been demonstrating good performance in SLAM and pattern recognition. Technology of feature detection, description and tracking is being developed successfully and has effective applications in augmented reality like Android ARCore and IOS ARKit frameworks that are real-time engines. Similarities among parts of video frames are analyzed and used for both image registration and visual scene tracking therefore it fits highly to block matching task. Statistic properties for domain/range blocks matching has been analyzed on the basis of previous investigation for fractal compression. As a result, a simple algorithm is proposed based on computer vision approach. The approach includes a visual feature points extraction, feature descriptors calculation and fast NN-search in descriptor space. The key idea of the proposed approach is as follows. Only a limited number of domain blocks around the most salient points are subject to selection. Other blocks are not essential for matching as transforms would have big Lipschitz constant and will have worse contractive properties. Salient points should be unique as well. Further the descriptors for feature point are calculated. The algorithm has O(N log N) complexity for pixel number in the frame image, however if the number of domain blocks is limited the complexity could be almost linear. Python program for the algorithm test has been developed and shows that reconstruction result is acceptable in terms of encoding speed (< 2 s on 2 GHz CPU) and quality (PSNR) ~25 dB. The result of the proposed approach could be interesting for further improvement both for image and video compression. Further steps for quality increasing are also described." @default.
• W3177654077 created "2021-07-19" @default.
• W3177654077 creator A5007964310 @default.
• W3177654077 date "2020-01-01" @default.
• W3177654077 modified "2023-09-25" @default.
• W3177654077 title "A feature­based approach to fractal image compression" @default.
• W3177654077 doi "https://doi.org/10.31673/2412-9070.2020.052226" @default.
• W3177654077 hasPublicationYear "2020" @default.
• W3177654077 type Work @default.
• W3177654077 sameAs 3177654077 @default.
• W3177654077 citedByCount "0" @default.
• W3177654077 crossrefType "journal-article" @default.
• W3177654077 hasAuthorship W3177654077A5007964310 @default.
• W3177654077 hasBestOaLocation W31776540771 @default.
• W3177654077 hasConcept C109116516 @default.
• W3177654077 hasConcept C115961682 @default.
• W3177654077 hasConcept C134306372 @default.
• W3177654077 hasConcept C13481523 @default.
• W3177654077 hasConcept C138885662 @default.
• W3177654077 hasConcept C153180895 @default.
• W3177654077 hasConcept C154945302 @default.
• W3177654077 hasConcept C202474056 @default.
• W3177654077 hasConcept C2776401178 @default.
• W3177654077 hasConcept C2780719617 @default.
• W3177654077 hasConcept C31972630 @default.
• W3177654077 hasConcept C33923547 @default.
• W3177654077 hasConcept C40636538 @default.
• W3177654077 hasConcept C41008148 @default.
• W3177654077 hasConcept C41895202 @default.
• W3177654077 hasConcept C65483669 @default.
• W3177654077 hasConcept C9417928 @default.
• W3177654077 hasConceptScore W3177654077C109116516 @default.
• W3177654077 hasConceptScore W3177654077C115961682 @default.
• W3177654077 hasConceptScore W3177654077C134306372 @default.
• W3177654077 hasConceptScore W3177654077C13481523 @default.
• W3177654077 hasConceptScore W3177654077C138885662 @default.
• W3177654077 hasConceptScore W3177654077C153180895 @default.
• W3177654077 hasConceptScore W3177654077C154945302 @default.
• W3177654077 hasConceptScore W3177654077C202474056 @default.
• W3177654077 hasConceptScore W3177654077C2776401178 @default.
• W3177654077 hasConceptScore W3177654077C2780719617 @default.
• W3177654077 hasConceptScore W3177654077C31972630 @default.
• W3177654077 hasConceptScore W3177654077C33923547 @default.
• W3177654077 hasConceptScore W3177654077C40636538 @default.
• W3177654077 hasConceptScore W3177654077C41008148 @default.
• W3177654077 hasConceptScore W3177654077C41895202 @default.
• W3177654077 hasConceptScore W3177654077C65483669 @default.
• W3177654077 hasConceptScore W3177654077C9417928 @default.
• W3177654077 hasLocation W31776540771 @default.
• W3177654077 hasOpenAccess W3177654077 @default.
• W3177654077 hasPrimaryLocation W31776540771 @default.
• W3177654077 hasRelatedWork W11462192 @default.
• W3177654077 hasRelatedWork W1865312 @default.
• W3177654077 hasRelatedWork W2376444 @default.
• W3177654077 hasRelatedWork W2683536 @default.
• W3177654077 hasRelatedWork W4794928 @default.
• W3177654077 hasRelatedWork W797409 @default.
• W3177654077 hasRelatedWork W856777 @default.
• W3177654077 hasRelatedWork W9280766 @default.
• W3177654077 hasRelatedWork W9626623 @default.
• W3177654077 hasRelatedWork W8510054 @default.
• W3177654077 isParatext "false" @default.
• W3177654077 isRetracted "false" @default.
• W3177654077 magId "3177654077" @default.
• W3177654077 workType "article" @default.