Filters








414,724 Hits in 3.1 sec

P-complete problems in data compression

Sergio De Agostino
1994 Theoretical Computer Science  
., P-complete problems in data compression, Theoretical Computer Science 127 (1994) 181-186.  ...  In this paper we study the parallel computational complexity of some methods for compressing data via textual substitution.  ...  We need to introduce the notions of P-complete problem and P-complete algorithm that we adopt as defined in [4, 11.  ... 
doi:10.1016/0304-3975(94)90106-6 fatcat:u6rnykrd5fhjfhylyvnxbyaa4e

Erratum to "P-complete Problems in Data Compression"

Sergio De Agostino
2000 Theoretical Computer Science  
We modify the reduction from the circuit value problem in order to sove the problem, by using a ternary alphabet.  ...  In the proof of Theorem 3:1, at the end of p. 184 we observe: "The inputs of c m are both equal to 1(0), so the substring b 2a aa(ab 2m aa) is added to the dictionary, where the last a is preÿx of Y m+  ...  The proofs of Theorems 4:1 and 4:2 can be ÿxed in an analogous way.  ... 
doi:10.1016/s0304-3975(99)00314-x fatcat:c7aredu2z5cybiupfweovdd5am

An Efficient Technique for Image Compression and Quality Retrieval using Matrix Completion

Ranjeet Kumar, Utpreksh Patbhaje, A. Kumar
2019 Journal of King Saud University: Computer and Information Sciences  
In this paper, an efficient technique for image compression and quality retrieval using matrix completion is presented.  ...  Here, an image is decomposed using singular value decomposition (SVD) to obtain a low rank of image data, which is approximated in compressed form.  ...  This algorithm forms and solves Eq. ( 7 ) for special matrix completion problem, defined as, minimize k X k subject to P X ðXÞ ¼ P X ðMÞ ð8Þ where, P X denotes the orthogonal projection of extended matrices  ... 
doi:10.1016/j.jksuci.2019.08.002 fatcat:mouc4difx5ewjg5ibkza44vc2y

Efficient Data Gathering in Wireless Sensor Networks Based on Matrix Completion and Compressive Sensing

Jiping Xiong, Jian Zhao, Lei Chen
2013 International Journal of Online Engineering (iJOE)  
Therefore, in this paper, we use low rank matrix completion theory to explore the inter-spatial correlation and use compressive sensing theory to take advantage of intratemporal correlation.  ...  Gathering data in an energy efficient manner in wireless sensor networks is an important design challenge.  ...  In this paper, we propose a Matrix Completion and Compressive Sensing based data gathering method in wireless sensor networks in a computationally and energy SPECIAL FOCUS PAPER EFFICIENT DATA GATHERING  ... 
doi:10.3991/ijoe.v9is7.3188 fatcat:abaofqodwncmhk6irtyqoblwqa

Multi-view Geometry Compression [chapter]

Siyu Zhu, Tian Fang, Runze Zhang, Long Quan
2015 Lecture Notes in Computer Science  
We first construct an image quality graph, in which each vertex represents an input image, and the problem is then to determine a connected sub-graph guaranteeing a consistent reconstruction and maximizing  ...  the accuracy and completeness of the final reconstruction.  ...  We then formulate the compression problem as a graph simplification procedure.  ... 
doi:10.1007/978-3-319-16808-1_1 fatcat:meg7fxcwj5hr3llck3peyqzezi

A PTIME-complete matching problem for SLP-compressed words

N. Markey, Ph. Schnoebelen
2004 Information Processing Letters  
We prove that the problem of deciding whether an SLPcompressed word is recognized by a FSA is complete for polynomial-time.  ...  SLP-compressed words are words given by simple deterministic grammars called "straight-line programs".  ...  Note that these same problems are PTIME-complete for LZ-compressed words [4] .  ... 
doi:10.1016/j.ipl.2004.01.002 fatcat:cmak745kl5dl3i7kumlwhu6uom

Efficient Data Gathering in Wireless Sensor Networks Based on Matrix Completion and Compressive Sensing [article]

Jiping Xiong, Jian Zhao, Lei Chen
2013 arXiv   pre-print
Therefore, in this letter, we use low rank matrix completion theory to explore the inter-spatial correlation and use compressive sensing theory to take advantage of intra-temporal correlation.  ...  Gathering data in an energy efficient manner in wireless sensor networks is an important design challenge.  ...  proposed EDCA scheme to apply the low rank matrix completion theory to the data gathering problem of WSNs [12] .  ... 
arXiv:1302.2244v1 fatcat:y2avff7ngjf2fosjnsz3bulesu

What Happens on the Edge, Stays on the Edge: Toward Compressive Deep Learning [article]

Yang Li, Thomas Strohmer
2019 arXiv   pre-print
In the first step, inspired by compressive sensing, data is collected in compressed form simultaneously with the sensing process.  ...  Thus this compression happens already at the hardware level during data acquisition.  ...  We emphasize that the projection/compression we carry out at the data acquisiton step is completely different from standard (jpeg-type) image compression.  ... 
arXiv:1909.01539v1 fatcat:6bqmduqjo5eotjf33v2ypxgonm

Optimizing Geometry Compression Using Quantum Annealing

Sebastian Feld, Markus Friedrich, Claudia Linnhoff-Popien
2018 2018 IEEE Globecom Workshops (GC Wkshps)  
The compression of geometry data is an important aspect of bandwidth-efficient data transfer for distributed 3d computer vision applications.  ...  Key parts of the pipeline are mapped to NP-complete problems for which an efficient Ising formulation suitable for the execution on a Quantum Annealer exists.  ...  Quantum Annealing for NP-complete Problems Numerous different methods for solving such NP-hard problems have been developed.  ... 
doi:10.1109/glocomw.2018.8644358 dblp:conf/globecom/FeldFL18 fatcat:ttmzj4rgnrgefg3t62cizhwymu

Mobile Wireless Multimedia Sensor Networks Image Compression Task Collaboration Based on Dynamic Alliance

He Li, Qinglei Qi, Jinjiang Liu, Pan Zhao, Yang Yang
2020 IEEE Access  
nodes. when processing the image compression tasks, these methods will cause frequent interruptions and result in data re-transmission for those tasks. in this paper, an image compression task collaboration  ...  algorithm based on dynamic alliance is proposed to solve this problem in mobile wireless multimedia sensor networks. first, a dynamic task alliance is established by the camera node based on the location  ...  The cost vector of completing an image compression subtask for the union cooperative node is P n (p 1 , p 2 , . . . p n ).  ... 
doi:10.1109/access.2020.2992795 fatcat:eofvjrnqmzbqhfqm267nlbrsm4

Exploiting Multi-Spatial Correlations of Motion Data in a Body Sensor Network

Chun-Hao Wu, Yu-Chee Tseng
2012 IEEE Communications Letters  
for data compression.  ...  Index Terms-Body sensor network, data compression, inertial sensor, pervasive computing, wireless sensor network.  ...  A case study in Pilates exercises shows significant compression effect using the model in Fig. 1(b) . In this work, we extend [8] by considering the multi-spatial data compression (κ-MDC) problem.  ... 
doi:10.1109/lcomm.2012.031212.120073 fatcat:gi6qzul5djgxre36y76uq2vsum

Page 499 of The Journal of the Operational Research Society Vol. 54, Issue 5 [page]

2003 The Journal of the Operational Research Society  
There are costs x and f associated with All data are assumed to be non-negative integers. The values p; and s, can be real numbers.  ...  In the first subproblem, the objective is to find a solution such that total completion time 5~”_, C; is minimized, subject to an upper bound B on total compression cost: 45~"_,x; + BY_y,<B.  ... 

A Novel Compressed Sensing Scheme for Photoacoustic Tomography

M. Sandbichler, F. Krahmer, T. Berer, P. Burgholzer, M. Haltmeier
2015 SIAM Journal on Applied Mathematics  
In this article, we propose a new scheme for speeding up the data collection process in photoacoustic tomography.  ...  As measurement data we use random combinations of pressure values that we use to recover a complete set of pressure data prior to the actual image reconstruction.  ...  Berer and P.  ... 
doi:10.1137/141001408 fatcat:rtj55ju7afb3hcgl5mznu33xnm

A Novel Compressed Sensing Scheme for Photoacoustic Tomography [article]

Michael Sandbichler, Felix Krahmer, Thomas Berer, Peter Burgholzer and Markus Haltmeier
2015 arXiv   pre-print
In this article, we propose a new scheme for speeding up the data collection process in photoacoustic tomography.  ...  As measurement data we use random combinations of pressure values that we use to recover a complete set of pressure data prior to the actual image reconstruction.  ...  Berer and P.  ... 
arXiv:1501.04305v1 fatcat:rz3jd6n33bd25h4oukhfs2ycdy

Statistical wavelet-based anomaly detection in big data with compressive sensing

Wei Wang, Dunqiang Lu, Xin Zhou, Baoju Zhang, Jiasong Mu
2013 EURASIP Journal on Wireless Communications and Networking  
Anomaly detection in big data is a key problem in the big data analytics domain. In this paper, the definitions of anomaly detection and big data were presented.  ...  Due to the sampling and storage burden and the inadequacy of privacy protection of anomaly detection based on uncompressed data, compressive sensing theory was introduced and used in the anomaly detection  ...  Acknowledgment The authors would love to thank Professor Qilian Liang from the University of Texas at Arlington for providing the UWB radar data.  ... 
doi:10.1186/1687-1499-2013-269 fatcat:zvucw62webdbpnhqfujlmgllgi
« Previous Showing results 1 — 15 out of 414,724 results