International Journal of Advanced Networking and Applications

T. V. Aravinda ¹, K. R. Krishna Reddy ¹, Nagabhushana ², G. Mahadevan ³

Affiliations
1 PRIST University, Thanjavur, Tamilnadu, IN
2 PRIST Universituy, Thanjavur, Tamilnadu, IN
3 Dept. of CS&E, AMCE, Bangalore, Karnataka, IN

Abstract

This paper describes a novel video coding scheme based on a three-dimensional Matching Pursuit algorithm. In addition to good compression performance at low bit rate, the proposed coder allows for flexible spatial, temporal and rate scalability thanks to its progressive coding structure. The Matching Pursuit algorithm generates a sparse composition of a video sequence in a series of spatio-temporal atoms, taken from an over complete dictionary of three-dimensional basis functions. The dictionary is generated by shifting, scaling and rotating two different mother atoms in order to cover the whole frequency cube. An embedded stream is then produced from the series of atoms. They are first distributed into sets through the set-partitioned position map algorithm (SPPM) to form the index-map, inspired from bit plane encoding. Scalar quantization is then applied to the coefficients which are finally arithmetic coded. A complete MP3D codec has been implemented, and performances are shown to favorably compare to other scalable coders like MPEG-4 FGS and SPIHT-3D. In addition, the MP3D streams offer an incomparable flexibility for multiresolution streaming or adaptive decoding.

Full Text

   

Nagabhushana ¹, T. V. Aravinda ¹, B. S. Nataraja ²

Affiliations
1 Department of Computer Science & Engineering, S.J.M.I.T Chitradurga, Karnataka-577501, IN
2 Department of Computer Science & Engineering, S.J.M.I.T Chitradurga, IN

Abstract

Conventional password transformation plot for client authentication in order to provide access to the system is to change password into some form of hash esteems. These secret word plans are nearly straightforward as well as quick in light of the fact that those depend on content and famed cryptography. In any case, those can be presented to digital assaults using secret key by cracking device or hash-breaking on the web locales. Assailants can altogether make sense of a unique secret word from hash esteem if it is generally basic and clear. Therefore, numerous hacking mishaps are happening transcendentally in frameworks receiving these hash oriented plans. This project recommends an upgraded secret word preparing plan in view of picture utilizing visual cryptography (VC). Not the same as the customary plan in light of hash and content, the proposed system changes a client identification word of plain text type into 2 pictures encoded by Visual Cryptography. The server just saves client identification word and one of the pictures rather than secret key. At the point when the client sign in and upload the other picture, then server extracts client identification word by using OCR (Optical Character Recognition). Thus, it confirms client through contrasting extricated ID and spared one. This proposed system has bring down calculation, counteracts digital assault went for hash splitting, and underpins confirmation not to uncover individual data, for example, ID to assailants.

Keywords

Visual Cryptography, User Authentication, Password Processing, Hash, OCR, Multimedia.

Full Text

   

Nagabhushana ¹, T. V. Aravinda ¹, A. V. Radhika ¹

Affiliations
1 Department of Computer Science and Engineering, SJMIT Chitradurga, 577501, IN

Abstract

This5paper proposes5a joint system wherein5lifting-based, divisible, image matched5wavelets are assessed from5compressively detected pictures and are utilized for5the recreation of the5same. Matched5wavelet can be effectively composed if5full picture is5available. Additionally contrasted with5standard wavelets as5sparsifying bases, coordinated wavelet5may give better recreation brings about5compressive sensing5application. Since in5application, we have5compressively detected pictures rather than full picture. Existing strategies for outlining coordinated wavelets can't be utilized. Accordingly, we5propose a joint structure that appraisals coordinated5wavelets from compressively detected pictures and furthermore recreates full pictures. This paper has three huge commitments. To begin with, lifting-based, picture coordinated distinct wavelet is planned from compressively detected pictures and is additionally used to recreate the same. Second, a straightforward detecting network is utilized to test information at sub-Nyquist rate with the end goal that detecting and reproduction time is diminished extensively. Third, another5multi-level L-Pyramid wavelet5disintegration system is accommodated divisible wavelet usage on pictures that prompts enhanced reproduction execution. Contrasted with CS-based remaking utilizing standard5wavelets with Gaussian detecting lattice and5with existing wavelet5decomposition system, the proposed strategy gives speedier5and better picture reproduction in compressive sensing5application.

Keywords

Pattern Recognition, Matched Wavelet, Multi-Level L-Pyramid Wavelet Decomposition, Nyquistrate, Gaussian Sensing Matrix, Image Reconstruction, PCIM- Partial Canonical Identity Matrix, PCI - Partial Canonical Identity.

Full Text