Entropy Based Estimation Algorithm using Break-up Images to Decrease Loss Compression Ratio
B Gowri Sankaran1, B Karthik2, S P Vijayaragavan3
1B Gowri Sankaran, Research Scholar, Department of Electronics & Communication Engineering, BIHER – Bharath Institute of Higher Education and Research, Chennai, India.
2B Karthik, Associate Professor, Department of Electronics & Communication Engineering, BIHER – Bharath Institute of Higher Education and Research, Chennai, India.
3S P Vijayaragavan, Associate Professor, Department of Electronics & Communication Engineering, BIHER – Bharath Institute of Higher Education and Research, Chennai, India.
Manuscript received on 01 March 2019 | Revised Manuscript received on 09 March 2019 | Manuscript published on 30 July 2019 | PP: 4700-4703 | Volume-8 Issue-2, July 2019 | Retrieval Number: B3519078219/19©BEIESP | DOI: 10.35940/ijrte.B3519.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Raring the source files after divide them into some numbers which may increase loss ratio. Acquired loss ratio which may be improved by raring the individual part of the source with the help of various algorithm because each algorithm which may provides various raring ratio on involution values. In this paper, identical compression results and evaluate involution values of divide source which may obtained, and an evaluate algorithm which may got based on the following results is specified. Our algorithms divide the source into 18 parts, which may raring the individual parts with various algorithm and merge the sources after raring is to be done. Raring output which show case that the acquiring our evaluated algorithm which may use the larger raring ratio over all the source raring techniques with the ratio of 10 % on a average and 30% on larger.
Index Terms: Math Raring, Tree Computation, Encoder and Decoder, Hadamard Cross Sections.
Scope of the Article: Analysis of Algorithms and Computational Complexity