7,328 research outputs found

    Print-Scan Resilient Text Image Watermarking Based on Stroke Direction Modulation for Chinese Document Authentication

    Get PDF
    Print-scan resilient watermarking has emerged as an attractive way for document security. This paper proposes an stroke direction modulation technique for watermarking in Chinese text images. The watermark produced by the idea offers robustness to print-photocopy-scan, yet provides relatively high embedding capacity without losing the transparency. During the embedding phase, the angle of rotatable strokes are quantized to embed the bits. This requires several stages of preprocessing, including stroke generation, junction searching, rotatable stroke decision and character partition. Moreover, shuffling is applied to equalize the uneven embedding capacity. For the data detection, denoising and deskewing mechanisms are used to compensate for the distortions induced by hardcopy. Experimental results show that our technique attains high detection accuracy against distortions resulting from print-scan operations, good quality photocopies and benign attacks in accord with the future goal of soft authentication

    Image Segmentation using Human Visual System Properties with Applications in Image Compression

    Get PDF
    In order to represent a digital image, a very large number of bits is required. For example, a 512 X 512 pixel, 256 gray level image requires over two million bits. This large number of bits is a substantial drawback when it is necessary to store or transmit a digital image. Image compression, often referred to as image coding, attempts to reduce the number of bits used to represent an image, while keeping the degradation in the decoded image to a minimum. One approach to image compression is segmentation-based image compression. The image to be compressed is segmented, i.e. the pixels in the image are divided into mutually exclusive spatial regions based on some criteria. Once the image has been segmented, information is extracted describing the shapes and interiors of the image segments. Compression is achieved by efficiently representing the image segments. In this thesis we propose an image segmentation technique which is based on centroid-linkage region growing, and takes advantage of human visual system (HVS) properties. We systematically determine through subjective experiments the parameters for our segmentation algorithm which produce the most visually pleasing segmented images, and demonstrate the effectiveness of our method. We also propose a method for the quantization of segmented images based on HVS contrast sensitivity, arid investigate the effect of quantization on segmented images

    Performance evaluation of a feature-preserving filtering algorithm for removing additive random noise in digital images

    Get PDF
    We evaluate the performance of a feature-preserving filtering algorithm over a range of images corrupted by typical additive random noise against three common spatial filter algorithms: median, sigma and averaging. The concept of the new algorithm is based on a corrupted-pixel identification methodology over a variable subimage size. Rather than processing every pixel indiscriminately in a digital image, this corrupted-pixel identification algorithm interrogates the image in variable-sized subimage regions to determine which are the corrupted pixels and which are not. As a result, only the corrupted pixels are being filtered, whereas the uncorrupted pixels are untouched. Extensive evaluation of the algorithm over a large number of noisy images shows that the corrupted-pixel identification algorithm exhibits three major characteristics. First, its ability in removing additive random noise is better visually (subjective) and has the smallest mean-square errors (objective) in all cases compared with the median filter, averaging filter and sigma filter. Second, the effect of smoothing introduced by the new filter is minimal. In other words, most edge and line sharpness is preserved. Third, the corrupted-pixel identification algorithm is consistently faster than the median and sigma filters in all our test cases. © 1996 Society of Photo-Optical Instrumentation Engineers.published_or_final_versio

    Navigation of mobile robots using artificial intelligence technique.

    Get PDF
    The ability to acquire a representation of the spatial environment and the ability to localize within it are essential for successful navigation in a-priori unknown environments. This document presents a computer vision method and related algorithms for the navigation of a robot in a static environment. Our environment is a simple white colored area with black obstacles and robot (with some identification mark-a circle and a rectangle of orange color which helps in giving it a direction) present over it. This environment is grabbed in a camera which sends image to the desktop using data cable. The image is then converted to the binary format from jpeg format using software which is then processed in the computer using MATLAB. The data acquired from the program is then used as an input for another program which controls the robot drive motors using wireless controls. Robot then tries to reach its destination avoiding obstacles in its path. The algorithm presented in this paper uses the distance transform methodology to generate paths for the robot to execute. This paper describes an algorithm for approximately finding the fastest route for a vehicle to travel one point to a destination point in a digital plain map, avoiding obstacles along the way. In our experimental setup the camera used is a SONY HANDYCAM. This camera grabs the image and specifies the location of the robot (starting point) in the plain and its destination point. The destination point used in our experimental setup is a table tennis ball, but it can be any other entity like a single person, a combat unit or a vehicle

    Pre-processing of integral images for 3-D displays

    Get PDF
    This paper seeks to explore a method to accurately correct geometric distortions caused during the capture of three dimensional (3-D) integral images. Such distortions are rotational and scaling errors which, if not corrected, will cause banding and moire effects on the replayed image. The method for calculating the angle of deviation in the 3-D Integral Images is based on Hough Transform. It allows detection of the angle necessary for correction of the rotational error. Experiments have been conducted on a number of 3-D integral image samples and it has been found that the proposed method produces results with accuracy of 0.05 deg
    corecore