Picture of server farm and IT infrastructure

Where technology & law meet: Open Access research on data security & its regulation ...

Strathprints makes available Open Access scholarly outputs exploring both the technical aspects of computer security, but also the regulation of existing or emerging technologies. A research specialism of the Department of Computer & Information Sciences (CIS) is computer security. Researchers explore issues surrounding web intrusion detection techniques, malware characteristics, textual steganography and trusted systems. Digital forensics and cyber crime are also a focus.

Meanwhile, the School of Law and its Centre for Internet Law & Policy undertake studies on Internet governance. An important component of this work is consideration of privacy and data protection questions and the increasing focus on cybercrime and 'cyberterrorism'.

Explore the Open Access research by CIS on computer security or the School of Law's work on law, technology and regulation. Or explore all of Strathclyde's Open Access research...

Fast algorithm for distortion-based error protection of embedded image codes

Hamzaoui, R. and Stankovic, Vladimir M. and Xiong, Z. (2005) Fast algorithm for distortion-based error protection of embedded image codes. IEEE Transactions on Image Processing, 14 (10). pp. 1417-1421. ISSN 1057-7149

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

We consider a joint source-channel coding system that protects an embedded bitstream using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly decoded source bits. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then, we propose a local search (LS) algorithm that starts from a rate-based optimal solution and converges in linear time to a local minimum of the expected distortion. Experimental results for a binary symmetric channel show that our LS algorithm is near optimal, whereas its complexity is much lower than that of the previous best solution.