... Corporation
EURASIP Journal on Advances in Signal Processing
Volume 2007, Article ID 63281, 13 pages
doi:10.1155/2007/63281
Research Article
A Secret Image Sharing Method Using Integer
Wavelet Transform
Chin-Pan ... when images at low bit rate are recovered. Wang and Su
[5] developed a secret image sharing method based on the
Galois field. It has the advantage o...
... Because of its data reduction capability, DWT
has become a standard method in the image compression
applications. In the wavelet compression, the image data is
transformed and compressed as a ... ratios and image quality even at low bit rates.
1. Introduction
Raw or uncompressed multimedia data such as graphics,
still images, audio, and video requires substantial storage
capacit...
... operation
Extracting operation
Pattern pairs
Predicted image
2. Pattern matching
4. Reversible data hiding
Pattern pairs
image
Grayscale image
grayscale image
Selected LUT templates
3. LUT template ... Introduction
Inverse halftoning is a process which transforms halftone
images into grayscale images. Halftone images are binary
images that provide a rendition of grayscale images a...
... experimental data, and some advantage to a pathway modelling approach to this problem is reported.
1. Introduction
Graphical models play a central role in modelling genomic
data, largely because the pathway ... Emmert-Streib and M. Dehmer, “Detecting pathological
pathways of a complex disease by a comparitive analysis of
networks,” in Analysis of Microarray Data: A Network-Based
App...
... the American Mathematical Society, vol.
4, pp. 506–510, 1953.
2 S. Reich, “Weak convergence theorems for nonexpansive mappings in Banach spaces,” Journal of
Mathematical Analysis and Applications, ... pages
doi:10.1155/2010/262691
Research Article
A New General Iterative Method for a Finite Family
of Nonexpansive Mappings in Hilbert Spaces
Urailuk Singthong
1
and Suthep Suantai
1,...
... our method and the best
method (team “RK”) was really minor, whereas our method
was approximately 13 times faster than the best method
(team “RK”). The algorithm has been implemented as
Matlab ... and fast constant-Q transform implementation
needs approximately 2000
∗ f
s
. The comparison clearly
suggests that Fast RTFI implementation is also much faster
than transform-based implement...
... 3
Location
resolver
Location
database
Server
Data relay
GUI
Ranging
measurement
data
Single-hop ranging measurements
Location node
Anchor node
Gateway anchor node
Figure 1: Centralized localization network architecture.
distance ... scene analysis
approaches are greatly reduced by the time-consuming
collection and maintenance of the RF sample database.
Searching trough the sample database or...
... uses adaptive data
aggregation in order to reduce the amount of information
travelling through out the network rather than using a back-
pressure approach to regulate source nodes transmission rate
on ... packet.
Therefore, data packets are piggybacked to update buffer
state. When a sensor x sends out a data packet, it piggybacks
its residual-buffer size in the frame header. If a neig...
... Hyers-Ulam-Rassias stability in Banach modules
over a C
∗
-algebra,” Journal of Mathematical Analysis and Applications, vol. 294, no. 1, pp. 196–
205, 2004.
[4] J H. Bae and W G. Park, “On stability ... functional equations that have the quadratic
property,” Journal of Mathematical Analysis and Applications, vol. 222, no. 1, pp. 126–137, 1998.
[6] W G. Park and J H. Bae, “On a bi-quadrati...
... configured CoA and the old CoA that was used
at the PAR. The NAR checks whether the newly formulated
CoA is a valid address to ensure that it has no duplicate. If the
new CoA is valid, the NAR adds it ... will acquire a
care-of address in a way that a duplicate or invalid packet ad-
dress is not picked.
3.2. Address configuration
After completing the layer 2 handover, address configurati...