PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “secured computing”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 757 records · Page 42Linked to original sources
PubMed1994

An accountability server for health care information systems.

The paper starts off by first briefly discussing the necessary ethical, legal and administrative/management controls that are required before the mechanisms of accountability controls can be implemented in automated clinical patient record systems. After these social aspects are discussed the technical aspects of the ALS are outlined. The security concepts of the ECMA framework are reviewed and used to explain the technical design of the ALS. A walk-through of the server in a typical patient record transaction is used to explain the operations of the server. The paper concludes with a general discussion of the usefulness of accountability mechanisms in making security in health care information work in practice.

Computer Communication Networks↗
PubMed1995

Security in hospital information systems.

The paper links the previous and proposed activities of IMIA WG4 with the developments of IMIA WG10. The fading systems boundaries, increasing and integrated functionality together with the increasing use of information within HIS to care for patients raises the questions of whether HIS should be treated as 'safety critical' systems or medical devices and tested appropriately. These considerations immediately lead to the need to establish appropriate security standards for HIS.

Computer Communication Networks↗
PubMed2006

Designing web services in health information systems: from process to application level.

Service-oriented architectures (SOAs) and web service technologies have been proposed to respond to some central interoperability challenges of heterogeneous health information systems (HIS). We propose a model which we are using to define services and solutions for healthcare applications from the requirements in the healthcare processes. Focusing on the transition from the process level of the model to the application level, we also present some central design considerations, which can be used to guide the design of service-based interoperability. We illustrate these aspects with examples from our current work from the service-enabled HIS.

Computer Security↗
PubMed2004

Applying informed coding and embedding to design a robust high-capacity watermark.

We describe a new watermarking system based on the principles of informed coding and informed embedding. This system is capable of embedding 1380 bits of information in images with dimensions 240 x 368 pixels. Experiments on 2000 images indicate the watermarks are robust to significant valumetric distortions, including additive noise, low-pass filtering, changes in contrast, and lossy compression. Our system encodes watermark messages with a modified trellis code in which a given message may be represented by a variety of different signals, with the embedded signal selected according to the cover image. The signal is embedded by an iterative method that seeks to ensure the message will not be confused with other messages, even after addition of noise. Fidelity is improved by the incorporation of perceptual shaping into the embedding process. We show that each of these three components improves performance substantially.

Algorithms↗
PubMed2004

Robust image-adaptive data hiding using erasure and error correction.

Information-theoretic analyses for data hiding prescribe embedding the hidden data in the choice of quantizer for the host data. In this paper, we propose practical realizations of this prescription for data hiding in images, with a view to hiding large volumes of data with low perceptual degradation. The hidden data can be recovered reliably under attacks, such as compression and limited amounts of image tampering and image resizing. The three main findings are as follows. 1) In order to limit perceivable distortion while hiding large amounts of data, hiding schemes must use image-adaptive criteria in addition to statistical criteria based on information theory. 2) The use of local criteria to choose where to hide data can potentially cause desynchronization of the encoder and decoder. This synchronization problem is solved by the use of powerful, but simple-to-implement, erasures and errors correcting codes, which also provide robustness against a variety of attacks. 3) For simplicity, scalar quantization-based hiding is employed, even though information-theoretic guidelines prescribe vector quantization-based methods. However, an information-theoretic analysis for an idealized model is provided to show that scalar quantization-based hiding incurs approximately only a 2-dB penalty in terms of resilience to attack.

Algorithms↗
PubMed2005

Lossless generalized-lSB data embedding.

We present a novel lossless (reversible) data-embedding technique, which enables the exact recovery of the original host signal upon extraction of the embedded information. A generalization of the well-known least significant bit (LSB) modification is proposed as the data-embedding method, which introduces additional operating points on the capacity-distortion curve. Lossless recovery of the original is achieved by compressing portions of the signal that are susceptible to embedding distortion and transmitting these compressed descriptions as a part of the embedded payload. A prediction-based conditional entropy coder which utilizes unaltered portions of the host signal as side-information improves the compression efficiency and, thus, the lossless data-embedding capacity.

Algorithms↗
PubMed2005

Multipurpose image watermarking algorithm based on multistage vector quantization.

The rapid growth of digital multimedia and Internet technologies has made copyright protection, copy protection, and integrity verification three important issues in the digital world. To solve these problems, the digital watermarking technique has been presented and widely researched. Traditional watermarking algorithms are mostly based on discrete transform domains, such as the discrete cosine transform, discrete Fourier transform (DFT), and discrete wavelet transform (DWT). Most of these algorithms are good for only one purpose. Recently, some multipurpose digital watermarking methods have been presented, which can achieve the goal of content authentication and copyright protection simultaneously. However, they are based on DWT or DFT. Lately, several robust watermarking schemes based on vector quantization (VQ) have been presented, but they can only be used for copyright protection. In this paper, we present a novel multipurpose digital image watermarking method based on the multistage vector quantizer structure, which can be applied to image authentication and copyright protection. In the proposed method, the semi-fragile watermark and the robust watermark are embedded in different VQ stages using different techniques, and both of them can be extracted without the original image. Simulation results demonstrate the effectiveness of our algorithm in terms of robustness and fragility.

Algorithms↗
PubMed2005

Hardcopy image barcodes via block-error diffusion.

Error diffusion halftoning is a popular method of producing frequency modulated (FM) halftones for printing and display. FM halftoning fixes the dot size (e.g., to one pixel in conventional error diffusion) and varies the dot frequency according to the intensity of the original grayscale image. We generalize error diffusion to produce FM halftones with user-controlled dot size and shape by using block quantization and block filtering. As a key application, we show how block-error diffusion may be applied to embed information in hardcopy using dot shape modulation. We enable the encoding and subsequent decoding of information embedded in the hardcopy version of continuous-tone base images. The encoding-decoding process is modeled by robust data transmission through a noisy print-scan channel that is explicitly modeled. We refer to the encoded printed version as an image barcode due to its high information capacity that differentiates it from common hardcopy watermarks. The encoding/halftoning strategy is based on a modified version of block-error diffusion. Encoder stability, image quality versus information capacity tradeoffs, and decoding issues with and without explicit knowledge of the base image are discussed.

Algorithms↗
PubMed2006

Progressive quantized projection approach to data hiding.

A new image data-hiding technique is proposed. The proposed approach modifies blocks of the image after projecting them onto certain directions. By quantizing the projected blocks to even and odd values, one can represent the hidden information properly. The proposed algorithm performs the modification progressively to ensure successful data extraction without the need for the original image at the receiver side. Two techniques are also presented for correcting scaling and rotation attacks. The first approach is an exhaustive search in nature, which is based on a training sequence that is inserted as part of the hidden information. The second approach uses wavelet maxima as image semantics for rotation and scaling estimation. Both algorithms have proved to be effective in correcting rotation and scaling distortion.

Algorithms↗
PubMed2006

High-capacity data hiding in halftone images using minimal-error bit searching and least-mean square filter.

In this paper, a high-capacity data hiding is proposed for embedding a large amount of information into halftone images. The embedded watermark can be distributed into several error-diffused images with the proposed minimal-error bit-searching technique (MEBS). The method can also be generalized to self-decoding mode with dot diffusion or color halftone images. From the experiments, the embedded capacity from 33% up to 50% and good quality results are achieved. Furthermore, the proposed MEBS method is also extended for robust watermarking against the degradation from printing-and-scanning and several kinds of distortions. Finally, a least-mean square-based halftoning is developed to produce an edge-enhanced halftone image, and the technique also cooperates with MEBS for all the applications described above, including high-capacity data hiding with secret sharing or self-decoding mode, as well as robust watermarking. The results prove much sharper than the error diffusion or dot diffusion methods.

Algorithms↗
PubMed2006

Blind MPEG-2 video watermarking robust against geometric attacks: a set of approaches in DCT domain.

A set of robust MPEG-2 video watermarking techniques is proposed, focusing on commonly used typical geometric processing for bit-rate reduction, cropping, removal of any rows, arbitrary-ratio downscaling, and frame dropping. Both the embedding and the extraction of watermarks are done in the compressed domain, so the computational cost is low. Moreover, the watermark extraction is blind, i.e., no original unwatermarked MPEG-2 video is needed for watermark extraction. The presented technique is applicable not only to MPEG-2 video, but also to other DCT-based coding videos. Selected experimental results validate our techniques.

Algorithms↗
PubMed2006

A novel high-capacity data-embedding system.

In this paper, we present a novel data-embedding system with high embedding capacity. The embedding algorithm is based on the quantized projection embedding method with some enhancement to achieve high embedding rates. In particular, our system uses a random permutation of the columns of a Hadamard matrix as projection vectors and a fixed perceptual mask based on the JPEG default quantization table for the quantization step design. As a result, the data-embedding system achieves 1/167 (1 bit out of 167 raw image bits) to 1/84 hiding ratios with a BER of around 0.1% in the presence of JPEG compression attacks, while maintaining visual distortion at a minimum.

Algorithms↗
PubMed2006

Halftone visual cryptography.

Visual cryptography encodes a secret binary image (SI) into n shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the n shares, however, have no visual meaning and hinder the objectives of visual cryptography. Extended visual cryptography [1] was proposed recently to construct meaningful binary images as shares using hypergraph colourings, but the visual quality is poor. In this paper, a novel technique named halftone visual cryptography is proposed to achieve visual cryptography via halftoning. Based on the blue-noise dithering principles, the proposed method utilizes the void and cluster algorithm [2] to encode a secret binary image into n halftone shares (images) carrying significant visual information. The simulation shows that the visual quality of the obtained halftone shares are observably better than that attained by any available visual cryptography method known to date.

Algorithms↗