Hierarchical morphological segmentation for image sequence coding

This paper deals with a hierarchical morphological segmentation algorithm for image sequence coding. Mathematical morphology is very attractive for this purpose because it efficiently deals with geometrical features such as size, shape, contrast, or connectivity that can be considered as segmentation-oriented features. The algorithm follows a top-down procedure. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, the segmentation quality is improved by introducing regions corresponding to more local information. The algorithm, considering sequences as being functions on a 3-D space, directly segments 3-D regions. A 3-D approach is used to get a segmentation that is stable in time and to directly solve the region correspondence problem. Each segmentation stage relies on four basic steps: simplification, marker extraction, decision, and quality estimation. The simplification removes information from the sequence to make it easier to segment. Morphological filters based on partial reconstruction are proven to be very efficient for this purpose, especially in the case of sequences. The marker extraction identifies the presence of homogeneous 3-D regions. It is based on constrained flat region labeling and morphological contrast extraction. The goal of the decision is to precisely locate the contours of regions detected by the marker extraction. This decision is performed by a modified watershed algorithm. Finally, the quality estimation concentrates on the coding residue, all the information about the 3-D regions that have not been properly segmented and therefore coded. The procedure allows the introduction of the texture and contour coding schemes within the segmentation algorithm. The coding residue is transmitted to the next segmentation stage to improve the segmentation and coding quality. Finally, segmentation and coding examples are presented to show the validity and interest of the coding approach.Peer ReviewedPostprint (published version

Data compression techniques applied to high resolution high frame rate video technology

An investigation is presented of video data compression applied to microgravity space experiments using High Resolution High Frame Rate Video Technology (HHVT). An extensive survey of methods of video data compression, described in the open literature, was conducted. The survey examines compression methods employing digital computing. The results of the survey are presented. They include a description of each method and assessment of image degradation and video data parameters. An assessment is made of present and near term future technology for implementation of video data compression in high speed imaging system. Results of the assessment are discussed and summarized. The results of a study of a baseline HHVT video system, and approaches for implementation of video data compression, are presented. Case studies of three microgravity experiments are presented and specific compression techniques and implementations are recommended

Variable size block truncation coding with adaptive bit plane omission for image compression

A modified version of the Block Truncation Coding (BTC), which is a non-information preserving image compression technique, is studied. The first modification is the introduction of variable block sizes to the standard BTC technique. The second modification is the adaptive omission of bit planes. Threshold selections for this modified BTC technique are analyzed in the context of the human visual system. Modified BTC techniques are compared against the standard technique from the point of view of visual image quality and compresion efficiency

Improved Harmony Search Algorithm For Color Image CompressionÂ

No Abstrac

k-d Tree-Segmented Block Truncation Coding for Image Compression

Block truncation coding (BTC) is a class of image compression algorithms whose main technique is the partitioning of an image into pixel blocks that are then each encoded using a representative set of pixel values. It is commonly used because of its simplicity and low computational complexity. The Quadtree-segmented BTC (QTS-BTC), which utilizes a dynamic hierarchical segmentation technique, is among the most efficient in the BTC class. In this study, we propose a new BTC variant that introduces two ideas: (1) the use of a k-d tree for segmentation and (2) the use of a Mean Squared Error (MSE) threshold for dynamically determining the granularity of the blocks. We refer to this new BTC variant as the k-d Tree Segmented BTC (KTS-BTC), and we test this against some of the existing BTC variants by running the algorithms on a standard image compression dataset. The results show that the proposed variant yields low bit rates of the compressed images, even outperforming the state-of-the-art QTS-BTC, without a significant reduction in image quality as measured using the Peak Signal-to-Noise Ratio (PSNR). The utilization of k-d tree for image segmentation is further shown to have more impact than that of employing the MSE thresholding scheme as a block activity classifier

Hybrid Techniques On Color And Multispectral Image For Compression

Image Compression is a technique to reduce the number of bits required to represent and store an image. This technique is also used to compress two dimensional color shapes without loss of data as well as quality of the Image. Even though Simple Principal Component Analysis can apply to make enough compression on multispectral image, it needs to extend another version called Enhanced PCA(E-PCA). The given multispectral image is converted into component image and transformed as Column Vector with help of E-PCA. Covariance matrix and eigen values are derived from vector. Multispectral images are reconstructed using only few principal component images with the largest variance of eigen value. Then the component image is divided into block. After finding block sum value, mean value, the number of bits required to represent an image can be reduced by E-BTC model. The features are extracted and constructed in Table form. The proposed algorithm is repeated for all multispectral images as well as color image in the database. Finally, compression ratio table is generated. This proposed algorithm is tested and implemented on various parameters such as MSE, PSNR. These experiments are initially carried out on the standard color image and are to be followed by multispectral imager using MATLAB