A CBIR Scheme Using GLCM Features in DCT Domain

Many effective watermarking algorithms have been proposed and implemented for digital images and digital video. However, a few algorithms have been proposed for audio watermarking. This is due to the fact that, human auditory system (HAS) is far more complex and sensitive than human visual system (HVS). In this research work, a new method of embedding image data into the audio signal and additive audio watermarking algorithm based on Discrete Cosine Transformation (DCT) domain is proposed. First, the original audio is transformed into DCT domain. The DCT coefficients are divided into a fixed number of subsections and the energy of each subsection is calculated. Next, watermark is generated from image by image processing algorithm. Watermarks are then embedded into selected peaks of highest energy subsection. Experimental results demonstrate that the watermark is inaudible and this algorithm is robust to common operations of digital audio signal processing, such as noise addition, re-sampling, requantization and so on. To evaluate the performance of the proposed audio watermarking method, subjective and objective quality tests including Bit Error Rate (BER) and Signal to Noise ratio (SNR) are conducted.

At recently, the most of the digital images are stored and transferred in their compressed format using discrete cosine transform (DCT)-based compression technique. DCT is one of the most important data compression technique due to the efforts from Joint Photographic Experts Group(JPEG). Blind steganalysis means how to detect the presence of the messages that are hidden using different types of steganography algorithms and has the ability to detect new unknown steganography algorithms. This paper presents blind steganalysis technique that can reliably detect the existence of messages hidden in JPEG files. In order to save the computation and memory cost, it is desirable to have image processing operations implemented directly in the DCT domain. The proposed method is based on extracting features directly from DCT domain through the analysis of differences between DCT coefficients before and after cropping. The extracted features are prepared as input to Support Vector Machine (SVM) to classify the image as stego (image that contain secret message) or clean (image that does not contain secret message). The experiments performed show that the proposed method yields better classification accuracy compared with other related works.

디지털 워터마킹은 저작권 보호와 멀티미디어 데이터 인증의 수단으로 사용되어 왔다. 기존의 공간영역에서의 CRT 기반 워터마킹 방법은 JPEG 압축에 취약하여, JPEG 압축에서 잘 동작하는 DCT 영역에서의 CRT 기반 워터마킹이 제안되었다. 본 논문에서는 DCT 영역에서의 향상된 CRT 기반 워터마킹 방법을 제안한다. 제안한 방법은 DCT 변환시 발생되는 rounding 오류 또는 여러 가지 공격에도 나머지들의 차에 대한 절대값의 변화를 감소시켜 견고성을 향상시킨다. 실험을 통하여 제안한 방법이 기존의 DCT 영역에서의 CRT 기반 워터마킹 방법보다 여러 가지 공격에 대하여 견고성이 향상되는 것을 확인하였다. Digital watermarking techniques have been used as one of the means for copyright protection and authentication of multimedia data. Conventional Chinese Remainder Theorem(CRT)-based spatial domain watermarking techniques do not perform well under JPEG compression. However, it is seen that the CRT-based watermarking technique in Discrete Cosine Transform(DCT) domain performs well for JPEG compression. In this paper, an improved CRT-based image watermarking method in the DCT domain is proposed. The proposed method provides better robustness which decreases changes of absolute difference of residues against rounding errors due to DCT conversion and various attacks. Experimental results show that the proposed method has a good robustness against various attacks compared with the conventional CRT-based watermarking in DCT domain.

In content based image retrieval (CBIR) process, every image has been represented in a compact set of local visual features i.e. color, texture, and/or shape of images. This set of local visual features is known as feature vector. In the CBIR process, feature vectors of images have been used to represent or to identify similar images in adequate way. As a result, feature vector construction has always been considered as an important issue since it must reflect proper image semantics using minimal amount of data. The proposed CBIR scheme is based on the combination of color and texture features. In this work initially, we have converted the given RGB image into HSV color image. Subsequently, we have considered H (hue), S (saturation), and V (intensity) components for extraction of visual image features. The texture features have been extracted from the V component of the image using 2D dual-tree complex wavelet transform (2D DT-CWT) where it analyzes the textural patterns in six different directions i.e. ±15\(^{\circ }\), ±45\(^{\circ }\), and ±75\(^{\circ }\). At the same time, we have computed the probability histograms of H and S components of the image respectively and subsequently those are divided into non-uniform bins based on cumulative probability for extraction of color based features. So, in this work both the color and texture features have been extracted simultaneously. Finally, the obtained features have been concatenated to attain the final feature vector and same is considered in image retrieval process. We have tested the novelty and performance of the proposed work in two Corel, two objects, and, a texture image datasets. The experimental results reveal the acceptable retrieval performances for different types of datasets.

Solid waste bin level detection using gray level co-occurrence matrix feature extraction approach

Bridging the gap between micro- and macro-scales in medical imaging with textural analysis – A biological basis for CT radiomics classifiers?

Skeleton-based similar action recognition through integrating the salient image feature into a center-connected graph convolutional network

Nowadays, the majority of images are in JPEG and MPEG compressed formats, and JPEG2000 is considered to be the next generation of compression standard due to the high- performance of discrete wavelet transform (DWT). It is time- consuming and occupies too much memory in conventional image retrieval ways. In order to solve these problems, we use grading retrieval techniques to implement image retrieval based on discrete cosine transform (DCT) compressed domain and DWT compressed domain. For image retrieval based on DCT domain, we use color features: color moment and color histogram, to describe content of images and propose a new dynamic color space quantization based on color distribution; For image retrieval based on DWT domain, we use texture features as two level feature vectors. The mean and standard deviation of low frequency sub-band coefficients are used as the first level retrieval. The means and standard deviations of selected high frequency sub-band coefficients are used as the second level retrieval. Furthermore, the third level retrieval is achieved by the fast wavelet histogram. Our experiment results clearly show that the two grading image retrieval algorithms work better than other algorithms: store memory is reduced and retrieval accuracy is improved. Index Terms—Content based image retrieval (CBIR), compressed domain, discrete cosine transform (DCT), discrete wavelet transform (DWT), color features, texture features

The analysis of anti-nuclear antibodies in HEp-2 cells by Indirect Immunofluorescence (IIF) is considered a powerful, sensitive, and comprehensive test for auto-antibodies analysis for autoimmune diseases. The aim of this study is to explore the use of wavelet texture analysis for automated categorization of auto-antibodies into one of the six categories of immunofluorescent staining. Gray level co-occurrence matrix (GLCM) features were extracted over sub-bands obtained from multi-level wavelet decomposition. In this study, an attempt is also made to investigate effect of different wavelet bases and their superiority on spatial domain features on classification task at hand. A qualitative as well as quantitative comparison is done between GLCM features in wavelet domain and spatial domain. Discrete Meyer wavelet has been found to be the most discriminating for this classification task.

Presented is an efficient watermarking scheme using Particle Swarm Optimization (PSO) to watermark host fingerprint images with their corresponding facial images in the Discrete Cosine Transform (DCT) domain. PSO is used to find the best DCT coefficients’ locations in the host image where the facial image data can be embedded, so that the distortion produced in the host image is minimum. The objective function for PSO is formulated in terms of the Structural Similarity Index (SSIM) and the Orientation Certainty Level Index (OCL) so as to base it on the simple visual effect of the human visual perception capability and correct minutia prediction ability. The results exhibit better watermarked image quality while retaining the feature set of the original fingerprint. Moreover, the proposed technique is robust so that the extraction of watermark is possible even after the watermarked image is exposed to attacks. As a result, at the receiver’s end, the watermarked fingerprint image and the extracted facial image can be verified for a secure and accurate biometric based personal authentication.

With the wide use of various image altering tools, digital image manipulation becomes very convenient and easy, which makes the detection of image originality and authenticity significant. Among various image tampering detection tools, double JPEG image compression detector, which is not sensitive to specific image tampering operation, has received large attention. In this paper, we propose an improved double JPEG compression detection method based on noise-free DCT (Discrete Cosine Transform) coefficients mixture histogram model. Specifically, we first extract the block-wise DCT coefficients histogram and eliminate the quantization noise which introduced by rounding and truncation operations. Then, for each DCT frequency, a posterior probability can be obtained by solving the DCT coefficients mixture histogram with a simplified model. Finally, the probabilities from all the DCT frequencies are accumulated to give the posterior probability of a DCT block being authentic or tampered. Extensive experimental results in both quantitative and qualitative terms prove the superiority of our proposed method when compared with the state-of-the-art methods.

Pap smear is a digital image generated from the recording of cervical cancer cell preparation. Images generated are susceptible to errors due to the relatively small cell sizes and overlapping cell nuclei. Therefore, accurate Pap smear image analysis is essential to obtain the right information. This research compares nucleus segmentation and detection using Grey Level Co-occurrence Matrix (GLCM) features in two methods: Otsu and Polynomial. The tested data consisted of 400 images sourced from RepoMedUNM, a publicly accessible repository containing 2,346 images. Both methods were compared and evaluated to obtain the most accurate features. The research results showed that the average distance of the Otsu method was 6.6457, which was superior to the Polynomial method with a value of 6.6215. Distance refers to the distance between the nucleus detected by the Otsu and the Polynomial method. Distance is an important measure to assess how closely the detection results align with the actual nucleus positions. It indicates that the Polynomial method produces nucleus detections that are on average closer to the actual nucleus positions compared to the Otsu method. Consequently, this research can serve as a reference for further studies in developing new methods to enhance the accuracy of identification.

This paper presents new fast full search motion estimation (ME) algorithms using discrete cosine transform (DCT) coefficients as a gradient magnitude. The proposed algorithms use intra DCT coefficients to arrange the matching scan order. The proposed algorithm 1 uses some of DCT coefficients based on the relationship between gradient magnitude and DCT coefficients, and the proposed algorithm 2 uses all of DCT alternating current (AC) coefficients in order to predict the fluctuation of a block. The proposed algorithms significantly reduce the computational complexity of the conventional algorithm while maintaining the visual quality of video.

Support vector machine (SVM) regression is considered for a statistical method of single frame superresolution in both the spatial and Discrete Cosine Transform (DCT) domains. As opposed to current classification techniques, regression allows considerably more freedom in the determination of missing high-resolution information. In addition, since SVM regression approaches the superresolution problem as an estimation problem with a criterion of image correctness rather than visual acceptableness, its optimization results have better mean-squared error. With the addition of structure in the DCT coefficients, DCT domain image superresolution is further improved.

The discrete cosine transform (DCT) offers superior energy compaction properties for a large class of functions and has been employed as a standard tool in many signal and image processing applications. However, it suffers from spurious behavior in the vicinity of edge discontinuities in piecewise smooth signals. To leverage the sparse representation provided by the DCT, in this article, we derive a framework for the inverse polynomial reconstruction in the DCT expansion. It yields the expansion of a piecewise smooth signal in terms of polynomial coefficients, obtained from the DCT representation of the same signal. Taking advantage of this framework, we show that it is feasible to recover piecewise smooth signals from a relatively small number of DCT coefficients with high accuracy. Furthermore, automatic methods based on minimum description length principle and cross-validation are devised to select the polynomial orders, as a requirement of the inverse polynomial reconstruction method in practical applications. The developed framework can considerably enhance the performance of the DCT in sparse representation of piecewise smooth signals. Numerical results show that denoising and image approximation algorithms based on the proposed framework indicate significant improvements over wavelet counterparts for this class of signals.