1704202
Effective steganalysis based on statistical moments of wavelet characteristic function
In this paper, an effective steganalysis based on statistical moments of wavelet characteristic function is proposed. It decomposes the test image using two-level Haar wavelet transform into nine subbands (here the image itself is considered as the LL/sub 0/ subband). For each subband, the characteristic function is calculated. The first and second statistical moments of the characteristic functions from all the subbands are selected to form an 18-dimensional feature vector for steganalysis. The Bayes classifier is utilized in classification. All of the 1096 images from the CorelDraw image database are used in our extensive experimental work. With randomly selected 100 images for training and the remaining 996 images for testing, the proposed steganalysis system can steadily achieve a correct classification rate of 79% for the non-blind Spread Spectrum watermarking algorithm proposed by Cox et ai, 88% for the blind Spread Spectrum watermarking algorithm proposed by Piva et ai, and 91% for a generic LSB embedding method, thus indicating significant advancement in steganalysis.
11148752
Steganalysis Using High-Dimensional Features Derived from Co-occurrence Matrix and Class-Wise Non-Principal Components Analysis (CNPCA)
This paper presents a novel steganalysis scheme with high-dimensional feature vectors derived from co-occurrence matrix in either spatial domain or JPEG coefficient domain, which is sensitive to data embedding process. The class-wise non-principal components analysis (CNPCA) is proposed to solve the problem of the classification in the high-dimensional feature vector space. The experimental results have demonstrated that the proposed scheme outperforms the existing steganalysis techniques in attacking the commonly used steganographic schemes applied to spatial domain (Spread-Spectrum, LSB, QIM) or JPEG domain (OutGuess, F5, Model-Based).
4242083
Lossless Data Hiding Using Histogram Shifting Method Based on Integer Wavelets
This paper proposes a histogram shifting method for image lossless data hiding in integer wavelet transform domain. This algorithm hides data into wavelet coefficients of high frequency subbands. It shifts a part of the histogram of high frequency wavelet subbands and thus embeds data by using the created histogram zero-point. This shifting process may be sequentially carried out if necessary. Histogram modification technique is applied to prevent overflow and underflow. The performance of this proposed technique in terms of the data embedding payload versus the visual quality of marked images is compared with that of the existing lossless data hiding methods implemented in the spatial domain, integer cosine transform domain, and integer wavelet transform domain. The experimental results have demonstrated the superiority of the proposed method over the existing methods. That is, the proposed method has a larger embedding payload in the same visual quality (measured by PSNR (peak signal noise ratio)) or has a higher PSNR in the same payload.
11590179
GLIDER: gradient landmark-based distributed routing for sensor networks
We present gradient landmark-based distributed routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating nodes. We assume that the nodes are fixed (though their geographic locations are not necessarily known), and that each node can communicate wirelessly with some of its geographic neighbors - a common scenario in sensor networks. We develop a protocol which in a preprocessing phase discovers the global topology of the sensor field and, as a byproduct, partitions the nodes into routable tiles - regions where the node placement is sufficiently dense and regular that local greedy methods can work well. Such global topology includes not just connectivity but also higher order topological features, such as the presence of holes. We address each node by the name of the tile containing it and a set of local coordinates derived from connectivity graph distances between the node and certain landmark nodes associated with its own and neighboring tiles. We use the tile adjacency graph for global route planning and the local coordinates for realizing actual inter- and intra-tile routes. We show that efficient load-balanced global routing can be implemented quite simply using such a scheme.
13640860
Parallel Multiresolution Volume Rendering of Large Data Sets with Error-Guided Load Balancing
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multiresolution wavelet tree. To eliminate the parent-child data dependency for reconstruction and achieve load-balanced rendering, we design a novel algorithm to partition the tree and distribute the data along a hierarchical space-filling curve with error-guided bucketization. At run time, the wavelet tree is traversed according to the user-specified error tolerance, data blocks of different resolutions are decompressed and rendered to compose the final image in parallel. Experimental results showed that our algorithm can reduce the run-time communication cost to a minimum and ensure a well-balanced workload among processors when visualizing gigabytes of data with arbitrary error tolerances.
18339723
Automatic video object shape extraction and its classification with camera in motion
In this paper, we present an automatic moving object extraction and classification system. For automatic extraction of object taken by a moving camera, a novel technique is proposed, in which optical flow handles the background modeling and camera motion estimation, and frame difference information yields the exact object shape. We also use forward region boundary based change detection approach for frame difference. This approach assures change detection for uniform intensity regions. For classification, weighted likelihood discriminant based shape classifier is designed. Unlike maximum likelihood (ML) methods, our proposed method utilizes information from all classes to design the classifier. In the description phase of the classifier, curvature features are extracted from the shape and are utilized to build a hidden Markov model (HMM). The HMM provides a robust ML description of the shape. In the discrimination phase, a weighted likelihood discriminant function is introduced, which weights the likelihoods of curvature at individual points of the shape to minimize the classification error. The weights are estimated by generalized probabilistic descent (GPD) method. To demonstrate the performance of the proposed method, we present results achieved for car shapes extraction and classification.
16214442
An adaptive algorithm for text detection from natural scenes
We present a new adaptive algorithm for automatic detection of text from a natural scene. The initial cues of text regions are first detected from the captured image/video. An adaptive color modeling and searching algorithm is then utilized near the initial text cues, to discriminate text/non-text regions. EM optimization algorithm is used for color modeling, under the constraint of text layout relations for a specific language. The proposed algorithm combines the advantages of several previous approaches for text detection, and utilizes a focus-of-attention approach for text finding. The whole algorithm is applied in a prototype system that can automatically detect and recognize sign input from a video camera, and translate the signs into English text or voice streams. We present evaluation results of our algorithm on this system.
5160
Well-separated pair decomposition for the unit-disk graph metric and its applications
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk graph metric: the shortest path distance metric induced by the intersection graph of unit disks. We show that for the unit-disk graph metric of n points in the plane and for any constant c≥1, there exists a c-well-separated pair decomposition with O(n log n) pairs, and the decomposition can be computed in O(n log n) time. We also show that for the unit-ball graph metric in k dimensions where k≥3, there exists a c-well-separated pair decomposition with O(n2-2/k) pairs, and the bound is tight in the worst case. We present the application of the well-separated pair decomposition in obtaining efficient algorithms for approximating the diameter, closest pair, nearest neighbor, center, median, and stretch factor, all under the unit-disk graph metric.