• 沒有找到結果。

Hardware-efficient architecture design of wavelet-based adaptive visible watermarking

N/A
N/A
Protected

Academic year: 2021

Share "Hardware-efficient architecture design of wavelet-based adaptive visible watermarking"

Copied!
5
0
0

加載中.... (立即查看全文)

全文

(1)

Hardware-Efficient Architecture Design of

Wavelet-Based

Adaptive

Visible Watermarking

Yu-Cheng Fan, Lan-Da Van, Chun-Ming Huang, and Hen-Wai Tsao Abstract - This paper proposes a hardware-efficient

architecture design of wavelet-based adaptive visibk watermarking. Our method adopts discrete wavelet

transform (D Wr) to embed visible watermarking. We

perjorm this algorithm using hardware-eficient

architecfures that combine operational reduction and

resource sharing teckniques. Our method provides high

qualip visible watermarking image and small hardware

cost. The experimental results have proven that our method is indeed effective'.

I n d e x Terms

-

discrete wavelet transform, resource sharing, visible watermarking, Weber-Fechner law.

I. INTRODUCTION

In this paper, we propose hardware-efficient architecture design of wavelet-based adaptive visible watermarking (Fig. 1). Visible watermarking schemes are important intellectual property right protection mechanisms for digital images and videos that have to be released for certain purposes but illegal reproductions of them are prohibited [ 1][2]. Visible watermarking techniques protect digital contents in a more active manner, which is quite different Erom the invisible watermarking techniques [ 1-51.

Several software based visible watermarking schemes have been presented in the literature; however, only a few hardware schemes have been proposed. In 2004, Mohanty and Ranganathan proposed spatial domain visible watermarking architecture [6]. In 2005, Mohanty presented another watermarking chip that has both visible and invisible discrete cosine transform (DCT) domain watermarking functionalities [73.

Block based DCT domain visible watermarking changes the scaling factors block by block and may result in visual

'

This work was supported by the, National Chip Implementation Center (CIC), National Applied Research Laboratories.

Yu-Cheng Fan is with the Department of Electrical Eng. and Graduate lnstiiute of Electronics Eng., National Taiwan University, Taipei, Taiwan, R.O.C. (e-mail: d9921004~ee.ntu.edu.tw).

Ian-Da Van is with the National Chip Implementation Center (CTC), National Applied Research Laboratories, Science-Based industrial Park, Hsinchu 300, Taiwan, R.O.C.

Chun-Ming Huang is with the National Chip Implemenlation Center (CK), National Applied Research Laboratories, Science-Based Industrial Park, Hsinchu 300, Taiwan, R.O.C.

Hen-Wai Tsao is with the Department of Electrical Eng. and Graduate Institute o r Electronics Eng., National Taiwan University, Taipei, Taiwan, R.O.C.

Fig. 1. Block diagram of wavelet-based adaptive visible watermarking. discontinuity

[XI.

Therefore, Hu IS] proposed a wavelet-

based visible watermarking to solve this problem. Wavelet- based visible watermarking is applied to JPEG-2000 image and many consumer electronics product. These techniques become more and more important.

However, wavelet-based visible watermarking chip has not been performed until now. In order to develop the efficient hardware architecture of wavelet-based adaptive visible watermarking, we adopt operational reduction and resource- sharing techniques to perfonn it according to Hu's algorithm

CXI.

11. HUMAN VISUAL SYSTEM

In order to design well visibie watermarking, we shall concern ourselves with psychophysics, Le., the response of observers to visual stimulus, the response from physiology, or the structure of the visual apparatus. The response of the eye to changes in the intensity of illumination is nonlinear. Consider a background of intensity I surrounds a patch of light of intensity I+ A I (Fig. 2). The just noticeable difference (JND)

dl

is to be determined as a function of 1.

The ratio AI/ I, called the Weber fraction (Weber-Fechner law), is nearly constant at a value of about 0.02 19-11], However, this result does not hold at very low or very high intensities, as illustrated by Fig. 2. When a patch is at very low or very high intensities, the ratio ill/ 1 appears larger

value.

(2)

r I

I I I

Intensity, I Fig. 2. Weber-Fechner law.

a patch of watermarked image and I as an original image.

When the ratio A M is greater than Weber fraction, the watermark become visible. The ratio A I / I increases more, the visible watermark becomes more conspicuous.

111. WAVELET-BASED ADAPTIVE VISIBLE WATERMARKING

First of all, host image and watermark is transferred by discrete wavelet transform @WT) (Fig. 1). Then, luminance characteristics are analyzed according to the image structure

of waveIet decomposition. The low fkquency sub-band

image and the original image have similar histogram characteristics. Luminance affects the coefficients in the low fiequency sub-band in wavelet decomposition. According to Weber-Fechner law, the human visual system is sensitive to the change in middle intensity of luminance region and insensitive in very low or very high intensities region. The adaptive visible watermark is designed depend on Weber- Fachner law and characteristics of wavelet domain. The

formula

(1)

C..' = a..C..

+

p

w.

B ! I 9 ! I 9

defines the watermark image is embedded into host image.

Cy is a luminance coefficient in wavelet domain with coordinates i and j , Wg is a watermark coefficient in wavelet domain with coordinates i a n d j correspond to luminance coefficient. C, ' represents coefficients of watermarked

image.

a y

is the scaling factor for the host image. is the scaling factor €or the watermark image.

In low frequency sub-band, we describe the formula

(3)

that defines the just noticeable difference condition of visible watermarking.

ay,

LL and

P y , ~ ~

represents the scaling factor for the host image and visible watermark in low fiequency wavelet sub-band respectively. k denotes visible strength factor that effect the whether observer can notice the watermark clearly. The range of k is often tuned by watermark designer. The suitable range of k is 2 to 5 in the literature. When visible watermark is designed for printed

p..

g,LL = I - ak.u

obvious visible watermarking. Otherwise, k gets a smaller value (k is 2 to 4) to appear an indistinct visible watermark.

In the high frequency sub-bands, the wavelet Coefficients describe the high frequency characteristics such as edges and textures. High amplitude corresponds to sharp variation and low amplitude represents smooth regions. In [5], a context model is proposed to estimate the distribution of wavelet coefficients. Chang [123 models each wavelet coefficient as a random variable with a Laplacian distribution of zero mean.

gX is standard deviation that estimated by a method called

context modelling as in [ 5 ] . Generally, CT~ is larger in the

edge and texture regions, and smaller in the smooth regions. Edges and textures in high frequency sub-band (frequency orientation=LH, HL, HH) are very sensitivity. Slight change often alters the features of host image. The standard deviation ux and scaling factor

a

v,r,LH.HL.HH are direct

proportion. Therefore, the scaling factor in high frequency

sub-band (with level 1=1,2,3 ...) c ~ ~ ,is smaller in ~ , ~ ~ ~ ~ , ~ ~

sensitive region. Oppositely, the scaling factor L Y ~ ~ . ~ . L H , H L , H H

is larger in insensitive region such as smooth region. r,,,, is maximal level of wavelet domain. d denotes the decay factor

that gives smaller value in level 1 and larger value in higher level.

ox ( 5 )

P v , ~ , ~ , H L , H H

= 1 - ~ ~ 3 r s ~ ~ , m . , x H (6)

-

&,?,x -1 ,

Q i , r , ~ ~ , ~ ~ , ~ ~

-

Scaling factors of luminance are calculated to estimating

the effect of background luminance afterward. Spatial characteristics are analyzed to characterize the activity level

of pixels. The watermark image is embedding by modifying

the coefficients of the host image according to scaling factor. Finally, inverse discrete wavelet transform (IDWT) is performed to obtain the visible watermarked image,

IV. HARDWARE-EFFICIENT ARCHITECTURE DESIGN

The overall architecture for the proposed DWT domain visible watermarking is shown in Fig. 3. Host image and watermark is transferred by discrete wavelet transform (DWT) into three-level multi-resolution structures. The host image signal divides into two sequences that one is sequence A (Seq. A) and the other is sequence B (Seq. B). Sequence A is composed of LL3, LH3, HL3, HH3, LH2, HL2, HH2, and LHI sub-band data. Sequence B is made up HLI and HHI sub-band data. Seq. A and Seq. B have the same patterns length. Two-path parallel processing architecture can reduce the half processing time. Then, de-multiplexers send the signal into difference processing element depend on

(3)

A

-

HH, (Embed)

F

Fig. 3 Wavelet-based visible watermarking architecture.

describes the function of processing element that calculates

a:

ii value. According to human visual system, the range o f

a

is 0.92 to 0.96 (k A

I/&

k 2 - 4 ) . In order to reduce

hardware complexity, we adopt eight kinds of

agu

value

and four kinds of Q ~ , ~ , ~ ~ , HL,HH value to instead OF unlimited cxv value. The intensity of wavelet coefficient also separates into eight regions in LL3 sub-band and four regions in other high frequency sub-bands. The approximate

ail

and ,I3 instead of complex scaling factor calculation and hardware cost. The TABLE 1 presents the approximate rule of

a y

and Observing

a ,

and ,6 rj, we can use 1-1/16-U128 (the approximate value is 0.9296875) to replace 0.93 (TABLE I). After reducing, the shift registers and adders can replace all

complex multiplication operation. This architecture does not

need any multiplier.

Besides, we adopt the resource sharing technique to use the shift registers jointly. We just use five registers (1/8,1/16,1/32,1/64,1/128) to calculate a i j ,

f l y

At the same time,

a

and

p

ij has reduplicate operation. For example,

a

~=1-(1/16+1/128)3 fib=(1/16+1/128). We can reduce the operation (1/16+1/128) adopting hardware sharing. Besides, each

ail

has the same term (1-1/16). We can use operation element jointly.

Via a series of numerical reduction, visible watermarking operation is also reduced.

calculation.

TABLE I

S r A L I N C FACTOR C A I CULATION

Discrknioae a ,,U a aw B ‘IQ B vu (Red) (Approx.) (Red) (Approa.)

C,j<lOO 0.92 I-l/16-l/M 0.08 1/16+1/44 1005C,<872 0 93 1-1/16-l/128 0 0 7 l/lh+1/128 1 0 9 5 5 q < 1233 0 93 1-1/16-1/128 0.07 1/16+1/128 1233 5cg 0.92 1-1/16-l/64 0.08 1 /16+1m 872 S Cl,< 1095 0 937s I - I l 1 6 0.0625 1/14 7SC,, 0.912 1-1/16-1/&1-1/128 0.088 1/16+11&1+1/128 V. EXPERMENTAL

RESULTS

In order to prove the ability of the wavelet-based adaptive visible watermarking architecture, a series of experiments were conducted. The watermark is shown in Fig. 4. The proposed architecture has been tested on various images. The experimental results are shown in Fig. 5 with “L.ena,” “Tiffany,” ”Baboon,” and “skylight (Chinese free verse)” images of 256 x 256 x Sbits. The former contains mainly smooth regions, edge, and texture, which represent low frequency and high frequency. The visual inspection of the watermarked images proves that watermarking is able to preserve the quality of the image while explicitly proving the ownership. We used signal to noise ratio (SNR) as suggested

by [6] to quantify the quality of the watermarked images. We calculated the SNR using the original and the watermarked image. The calculation results show that the SNR for various watermarked images is in the range of 22 dB to 26 dB.

In order to prove the architecturc is hardware efficient, we give a comparison results as listed in TABLE 11. The direct form DWT-based visible watermarking method [8] needs 24 additions, 12 multiplications, 3 divisions, 1 radical and 2

shift registers operation. However, the proposed method just needs 30 additions and 5 shift registers operation without any multiplication, division and radical operation. The approximate technique, numerical reduction and resource sharing technique reduce a great deal operation and hardware complexity, Therefore, It reveals that our proposed

(4)

Fig. . 4 Visible watermarking (National Taiwan Universltvl

architectures have characteristics o f hardware-efficient and fewer computing operations in TABLE 11.

This scheme reduces the hardware complexity and holds high image quality. The experimental results have proven the proposed architecture is indeed hardware-effective.

VI. CONCLUSION

The hardware-efficient architecture design of wavelet-

based adaptive visible watermarking is presented in this

paper. We develop the efficient hardware architecture of wavelet-based adaptive visible watermarking that adopts approximate technique, numerical reduction and resource sharing technique to reduce hardware complexity, Luminance characteristics are calculated to estimating the effect of background luminance afterward. Local spatial

TABLE I1

COMPARlSON RESULTS

Parameters Hu’s Method [8] Proposed Method

Addition 24 30

Multiplication 12 0

Division 3 0

Radical 1 0

Shift Register 2 5

characteristics are analyzed to characterize the activity level of pixels. The watermark image is embedding by modifying the coefficients of the host image according to scaling factor. According to experimental results, our method reduces the hardware complexity and holds high image quality.

ACKNOWLEDGMENT

The authors gratefully acknowledge National Applied Research Laboratories, National Chip Implementation Center (CIC) for technical support and supplying the EDA tools used in the hardware design.

REFERENCES

[ I ] 1. J. Cox, M. L. Miller, and J. A. Bloom, Digirol Watermarking, CA:

Academic Press, San Diego, 2002.

[Z] C. H. Huang, and I. L. Wu, “Attacking visible watermarking schemes,” IEEE Transactions on Mulrimedia, vol. 6 , no. I, pp: 16-30, Feb. 2004.

Y. C. Fan, W. L. Mao, and H. W. Tsao, “An Artificial Neural Network-Based Scheme for Fragile Watermarking”, IEEE

international Conference on Consumer Electronics, ICCE 2003, pp.

210

-

21 1, June 17-19,2003, Los Angeles, California, U.S.A.

Y . C. Fan, and H. W. Tsao, “A Data Backup Embedding Scheme for Fragile Watermarking”, IEEE Intemolional Conference on

Infumulics Cybernetics and Systems, ICICS 2003, pp: 1103-1 108,

Dec. 14-16, 2003.

Y. C. Fan, and H. W. Tsao, “A Dual Pyramid Watermarking for PEG-2000,’’ IEEE The First lnternotiunul Worhhop on Informotion

Networking and Applications. INA 2005, March 28-30,2005.

[6] S. P. Mohanty, N. Ranganathan, and R. K. Namballa, “VLSI implementation of visible watermarking Cor secure digital still camera design,” 17th International ConJei-ence on VLS1 Design, pp: 1063-

1068, Jan. 2004.

S. P. Mohanty, N. Ranganathan, and K. Balaknshnan, “Design of a low power image watermarking encoder using dual voltage and frequency,” 18th International Conference on VLSI Design, pp:

153 ~ 158, Jan. 2005.

[8] Y Hu, and S. Kwong, “Wavelet domain adaptive visible watermarking,” Electronics Letters, vol. 37, no. 20, pp: 1219 ~ 1220,

Sept. 2001

[9] W. F. Schreiber, Fundumentuls of Elecrronic Imaging Systems, Springer-Verlag, Berlin, 1991.

[IO] W. K. Pratt, Digital h u g e Processing, Wiley-Interscience, 2001.

[ I I J S . Hecht, “The visual discrimination of intensity and the Weber- Fechner law,” Journal of General Physiology, 7,1924,241, [I21 S. G. Chang, B. Yu, and M. Vetlerli, “Spatially adaptive wavelet

thresholding with context modeling for image denoising,” IEEE

Transactions on Image Processing, vol. 9, no. 9, pp: 1522 ~ 1531,

Sept. 2000.

[ 3 ]

[4]

[5]

(5)

Yu-Cheng Fan (S’OO) was bom in Hsinchu, Taiwan, R 0 C , on June 6, I975 He received the B S . degree m electrical engineenng from National Cheng Kung University, Tainan, R 0 . C , in 1997, and M S degree in electncal engineenng a b o from National Cheng Kung Umverstty in 1999. He is currently a graduate student in the Department of Electncal Engineenng

of National Taiwan University, Taipei, Taiwan, R.0 C , pursing his doctor’s degree His research interests are consumer electronics, digital watermarking, image and video coding system. In 1999, he received Long-Term (Acer) Paper Awards He

was an elected Chairman of the IEEE NTU Student Branch in 2003 In 2005, he has received IEEE Award for outstanding leadership and service to the IEEE Nlli Student Branch,

instrumentation.

Lan-Da Van (S198-AM’01-M‘02) was born in Miaoli , Taiwan , R 0.C , on Oct. 09, 1972 He received the B.S (Honors) and the M S. degree from

R 0 C in 1995 and 1997, respectively, and the Ph D

I Tatung institute of Technology, Taipei , Taiwan ,

i

degree from National Taiwan University (NTU), Taipei , Taiwan , R 0 C in 2001, all in electrical engineenng

From 1997 to 2001, he was a research assistant at National Taiwan University. From 2001, He is a researcher at Chip Implementation Center (CIC), National Applied Research Laboratories, Hsinchu, Taiwan, R.O.C. His currently research interests are in VLSI architectures, algorithms, and chips for digital signal processing (DSP) and baseband communication systems. This includes the design of high-performance /low-powedarea- aware DSP processors, adaptive digital filters, orthogonal transforms, computer arithmetic, platfom-based SoC designs, and multidimensional signal processing systems. He has published more than 15 IEEE journal and conference papers in these areas.

Dr. Van was a recipient of the Chunghwa Picture Tube (CPT) and

Motorola fellowships in 1996 and 1997, respectively. He won NationaI Taiwan University scholmhips in 1997 and 1999. He was an elected vice- chairman and chairman of IEEE NTU Student Branch in 1999 and 2000, respectively. In 2002, he has received IEEE Award for outstanding leadership and service to the IEEE NTW Student Branch. In 2003 and

2004, he was listed in Marquis Who’s who in science and engineering. In

2005, he is a recipient of the Best Poster Award at iNEER Conference for Engineering Education and Research (ICEER). He was a referee of E E E ISCAS and SCI. Presently, he serves as a reviewer for IEEE Transaction on Circuits and Systems I: Fundamental Theory and Applications, IEEE Transaction on Circuits and Systems U: Analog and Digital Signal Processing. IEEE Transaction on VLSI Systems, IEEE Transaction on Multimedia, IEEE Signal Processing Letters, Elsevier Microelectronics JoumaI, Elsevier Integration, The VLSI Journal and EURASIP Joumal on Applied Signal Processing. He has reviewed over 15 joumaVtransnction papers in these periodicals.

I

j

Chun-Ming Huang is a manager and researcher at Chip Implementation Center (CIC), National Applied Research Laboratories, Hsinchu, Taiwan, R.0 C His currently research interests are i n VLSI design and

Hen-Wai Tsno (M’90) was born in Taipei, Taiwan, R.O.C., in 1953. He received the B.S., the M.S. and the Ph.D degrees in electrical engineering from National Taiwan University in 1975, 1978 and 1990, respectively. Since 1978, he has been with the Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R.O.C., where he

i s currently a professor. His main research interests are optical fiber communication system, communication electronics. and electronic

-

a; testing, platform-based SOC design, and multimedia

communication In 2005, he is 8 recipient of the Best Poster Award at rNEEK Conference for Engineering

數據

Fig.  1.  Block  diagram of  wavelet-based  adaptive visible watermarking.
Fig. 2.  Weber-Fechner law.
TABLE I1  COMPARlSON RESULTS

參考文獻

相關文件

Section 3 is devoted to developing proximal point method to solve the monotone second-order cone complementarity problem with a practical approximation criterion based on a new

• Formation of massive primordial stars as origin of objects in the early universe. • Supernova explosions might be visible to the most

In the third quarter of 2002, the Census and Statistics Department conducted an establishment survey (5) on business aspirations and training needs, upon Hong Kong’s

• Paul Debevec, Rendering Synthetic Objects into Real Scenes:. Bridging Traditional and Image-based Graphics with Global Illumination and High Dynamic

In addition to speed improvement, another advantage of using a function handle is that it provides access to subfunctions, which are normally not visible outside of their

private methods effectively not inherited be- cause not “visible” to the subclass.. More on Access Permissions:

– Camera view plane is parallel to back of volume – Camera up is normal to volume bottom. – Volume bottom

– Any set of parallel lines on the plane define a vanishing point. – The union of all of these vanishing points is the