A feature-based digital image watermarking scheme is proposed to resist geometrical transformations. Such interest point extraction as scale-invariant feature transform is applied to form the invariant regions for signal embedding. Along with the watermark, the pilot signal used for synchronized detection will also be embedded to help to determine larger areas for improving the payload of watermarking and/or increasing the confidence of watermark detection. Both embedded signals are weighted by the just noticeable difference of Watson's perceptual model to meet the requirement of invisibility. In the detection phase, after the same interest point extraction, synchronization can be achieved via adjusting the related affine parameters of grids on the investigated image to detect the possible hidden pilot signal so that the watermark can be successfully retrieved afterward. Experimental results show the feasibility of the proposed method.
Digital audio watermarking embeds inaudible information into digital audio data for the purposes of copyright protection, ownership verification, covert communication, and/or auxiliary data carrying. In this paper, we first describe the desirable characteristics of digital audio watermarks. Previous work on audio watermarking, which has primarily focused on the inaudibility of the embedded watermark and its robustness against attacks such as compression and noise, is then reviewed. In this research, special attention is paid to the synchronization attack caused by casual audio editing or malicious random cropping, which is a low-cost yet effective attack to watermarking algorithms developed before. A digital audio watermarking scheme of low complexity is proposed in this research as an effective way to deter users from misusing or illegally distributing audio data. The proposed scheme is based on audio content analysis using the wavelet filterbank while the watermark is embedded in the Fourier transform domain. A blind watermark detection technique is developed to identify the embedded watermark under various types of attacks.
1 February 2001 in Journal of Signal Processing Systems
CT-fluoroscopy (CTF) is an efficient imaging technique for guiding percutaneous lung intervention such as biopsy and ablation. In CTF-guided procedures, four to ten axial images are captured in a very short time period during breath holding to provide near real-time feedback of patients' anatomy so that physicians can adjust the needle as it is advanced toward a target lesion. Although popularly used in clinics, this procedure requires frequent scans to guide the needle, which may cause increased procedure time, complication rates, and radiation exposure to both clinicians and patients. In addition, CTF only generates a limited number of 2-D axial images and does not provide sufficient 3-D anatomical information. Therefore, how to provide volumetric anatomical information using CTF while reducing intraoperative scan is an important and challenging problem. In this paper, we propose a fast CT-CTF deformable registration algorithm that warps the inhale preprocedural CT onto the intraprocedural CTF for guidance in 3-D. In the algorithm, the deformation in the transverse plane is modeled using 2-D B-Spline, and the deformation along z-direction is regularized by smoothness constraint. A respiratory motion compensation framework is also incorporated for accurate registration. A parallel implementation strategy is adopted to accomplish the registration in several seconds. With electromagnetic tracking, the needle position can be superimposed onto the deformed inhale CT image, thereby providing 3-D image guidance during breath holding. Experiments were conducted using both simulated CTF images with known deformation and real CTF images captured during lung cancer biopsy studies. The experiments demonstrated satisfactory registration results of our proposed fast CT-CTF registration algorithm.