Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29636


Select areas to restrict search in scientific publication database:
10000023
Quad Tree Decomposition Based Analysis of Compressed Image Data Communication for Lossy and Lossless Using WSN
Abstract:
The Quad Tree Decomposition based performance analysis of compressed image data communication for lossy and lossless through wireless sensor network is presented. Images have considerably higher storage requirement than text. While transmitting a multimedia content there is chance of the packets being dropped due to noise and interference. At the receiver end the packets that carry valuable information might be damaged or lost due to noise, interference and congestion. In order to avoid the valuable information from being dropped various retransmission schemes have been proposed. In this proposed scheme QTD is used. QTD is an image segmentation method that divides the image into homogeneous areas. In this proposed scheme involves analysis of parameters such as compression ratio, peak signal to noise ratio, mean square error, bits per pixel in compressed image and analysis of difficulties during data packet communication in Wireless Sensor Networks. By considering the above, this paper is to use the QTD to improve the compression ratio as well as visual quality and the algorithm in MATLAB 7.1 and NS2 Simulator software tool.
Digital Object Identifier (DOI):

References:

[1] G. Nikolakopoulos, P. Stavrou, A. Tzes, D. Tsitsipis, D. Kandris, T. Theocharis, “A dual scheme for compression and restoration of sequentially transmitted images over Wireless sensor networks”, Elsevier Journal, Vol. 1, Issue1, January 2013, pp- 410-426.
[2] M. Mozammel Hoque, Amina, Khatun, “Image Compression using Discrete Wavelet Transform”, International Journal of Computer Science Issues (IJCSI), Vol. 9, No.1, Jul 2012, pp.621-627.
[3] Maneesha Gupta, Dr. Amit Kumar Jarg, “Analysis of image compression using Discrete Cosine Transform”, International Journal Engineering Research Applications (IJERA), Vol. 2, No.1, Jan-Feb 2012, pp. 515- 521.
[4] Y. Wexler, E. Shechtman, M. Irani, “Space-time video completion”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 29, No.3, 2007, pp 463–476.
[5] W. Tan, A. Zakhor, “Real-time Internet video using error resilient scalable compression and TCP friendly transport protocol”, IEEE Trans Multimedia, Vol. 1, Issue2, June 1999, p.p. 172- 186.
[6] J. De Bonet, “Multi resolution Sampling Procedure for Analysis and Synthesis of Texture Images”, In Computer Graphics (SIGGRAPH’97 Conference, Proceeding), Aug 1997, pp- 361- 368.
[7] J. Vaisey, A. Gersho, “Image compression with variable block size segmentation”, IEEE Transaction on Signal processing, Vol. 40, p.p. 2040- 2060, Aug 1992.
[8] G. J. Sullivan, R. L. Baker, “Rate–distortion optimization for tree structured source coding with multi- way node decisions”, in Proc, IEEE Int.Conf.Acoust. Speech Signal Processing (ICASSP), pp III- 393- 396, Mar 1992.
[9] G. J. Sullivan, “Low-rate coding of moving images using motion compensation, vector quantization and quad tree decomposition” Ph.D. thesis, Univ.of Calif., Los Angles, Sept- 1991.
[10] P. A. Chou, T. Lookabaugh, R. M. Gray, “Optimal pruning with applications to tree- structured source coding and modeling”, IEEE Trans.Inform.Theory, Vol. 35, p.p. 299-315, Mar1989.
[11] A. Wyner, J. Ziv, “The rate-distortion function for source coding with side information at the decoder”, IEEE Trans. Inform. Theory 22(1), Jan 1976, pp. 1-10.
Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007