oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 2 )

2019 ( 559 )

2018 ( 704 )

2017 ( 696 )

Custom range...

Search Results: 1 - 10 of 401241 matches for " M. Revathy "
All listed articles are free for downloading (OA Articles)
Page 1 /401241
Display every page Item
AN IMPROVED DOMAIN CLASSIFICATION SCHEME BASED ON LOCAL FRACTAL DIMENSION
JAYAMOHAN M.,K. REVATHY
Indian Journal of Computer Science and Engineering , 2012,
Abstract: In fractal image compression, most of the time during encoding is spent for finding the best matching pair of range-domain blocks. Different techniques have been analyzed for decreasing the number of operations required for this range-domain matching. Encoding time can be saved by reducing the domain search pool for each range block. Domain blocks can be classified based on local fractal dimension. Fractal dimension is being studied as a measure to analyze the complexity of image portions. This paper proposes application of height balanced binary search trees for storing domain information ordered in terms of the local fractal dimension. The approach is toprepare the domain pool dynamically, by comparing the fractal dimension of range block with that of the domains. Domains with fractal dimension in an interval, evenly covering the fractal dimension of range block alone are given for comparison. We use AVL trees to enlist the domains based on their fractal dimension. Thedomain pool is prepared at runtime. Since the tree organization is used in the preprocessing phase, the proposed method can be used with any algorithm for fractal compression.
Dynamic Domain Classification for Fractal Image Compression
K. Revathy,M. Jayamohan
International Journal of Computer Science & Information Technology , 2012,
Abstract: Fractal image compression is attractive except for its high encoding time requirements. The image is encoded as a set of contractive affine transformations. The image is partitioned into non-overlapping range blocks, and a best matching domain block larger than the range block is identified. There are many attempts on improving the encoding time by reducing the size of search pool for range-domain matching.But these methods are attempting to prepare a static domain pool that remains unchanged throughout theencoding process. This paper proposes dynamic preparation of separate domain pool for each range block. This will result in significant reduction in the encoding time. The domain pool for a particular range block can be decided based upon a parametric value. Here we use classification based on local fractal dimension.
HDL IMPLEMENTATION OF ALGEBRAIC SOFT DECISION ALGORITHM FOR RS CODES
M. Revathy,R. Saravanan
International Journal of Computer Science and Mobile Computing , 2013,
Abstract: Reed Solomon (RS) codes are widely used to detect and correct data errors in transmission andstorage systems. Hence it is used in many digital communication and storage devices. In existing systemReformulated inversion less Burst error correcting (RiBC) algorithm is used. But it lacks in speed,throughput & area. To overcome this Algebraic Soft Decision (ASD) algorithm is proposed. This Proposedalgorithm is based on Unified VLSI architecture for correcting burst errors as well as random errors. Thisnew architecture is denoted as Unified Hybrid Decoding (UHD) architecture. It will be shown that, being thefirst RS decoder owning enhanced burst-error correcting capability, it can achieve high-speed, throughputand improved error correcting capability than traditional Hard Decision Decoding (HDD) design with lessarea.
Dynamic Domain Classification for Fractal Image Compression
K. Revathy,M. Jayamohan
Computer Science , 2012, DOI: 10.5121/ijcsit.2012.4208
Abstract: Fractal image compression is attractive except for its high encoding time requirements. The image is encoded as a set of contractive affine transformations. The image is partitioned into non-overlapping range blocks, and a best matching domain block larger than the range block is identified. There are many attempts on improving the encoding time by reducing the size of search pool for range-domain matching. But these methods are attempting to prepare a static domain pool that remains unchanged throughout the encoding process. This paper proposes dynamic preparation of separate domain pool for each range block. This will result in significant reduction in the encoding time. The domain pool for a particular range block can be selected based upon a parametric value. Here we use classification based on local fractal dimension.
Efficient Implementation of Low Density Parity Check (LDPC) Decoder In VLSI
M.Revathy,Dr.R.Saravanan
International Journal of Electronics Communication and Computer Technology , 2012,
Abstract: The best error-correcting performance can be achieved by using non-binary low-density parity check (NB-LDPC) codes. This can be of reduced decoding complexity with high cost efficiency and is mostly preferable than binary low density parity check codes. The proposed scheme not only reduces the computation complexity, but also eliminates the memory requirement for storing the intermediate messages generated from the forward and backward processes. A novel scheme and corresponding architecture are developed to implement the elementary step of the check node processing. In the design, layered decoding is applied and only nm Keywords Low-density parity check codes(LDPC) --- latency --- Tanner graph --- check node processing --- sorter --- path constructor
Speciation of Coagulase Negative Staphylococcus causing Bacterial Keratitis
Manikandan P,Bhaskar M,Revathy R,John Rajesh
Indian Journal of Ophthalmology , 2005,
Abstract: Thirty-five coagulase negative Staphylococcus (CoNS) cultured from corneal ulcer were speciated and antibiotic sensitvity tested. S epidermidis was the commonest isolate and it was sensitive to ampicilin and vanconycin.
Acanthamoeba keratitis - A six year epidemiological review from a tertiary care eye hospital in South India
Manikandan P,Bhaskar M,Revathy R,John R
Indian Journal of Medical Microbiology , 2004,
Abstract: PURPOSE: This study analyses the prevalence, demography, predisposing factors and seasonal variation of Acanthamoeba keratitis. METHODS: A retrospective review of all cases presenting with keratitis at the cornea clinic, Aravind Eye Hospital, Coimbatore, from August 1997 to July 2003, was done for screening patients with a provisional diagnosis of Acanthamoeba keratitis. Their records were further analyzed for microbiological details. Cases with culture proven Acanthamoeba keratitis were included for epidemiological analysis. RESULTS: From a total of 4519 patients who attended cornea clinic 32 (33 eyes) patients were confirmed to be positive for Acanthamoeba keratitis. Twenty cases (62.5%) were males. Majority (18; 54.2%) of the Acanthamoeba keratitis eyes reported corneal trauma by solid objects. No peak period was observed in a year, as the number of cases was almost uniform in all months. CONCLUSION: This study indicates the increasing prevalence of Acanthamoeba keratitis among non-contact lens users in this region during the 6-year period.
In vitro propagation of Solidago virgaurea L. through nodal culture
John Peter Paul J,Revathy I,Johnson, M
Research in Plant Biology , 2012,
Abstract:
Understanding Rolle's Theorem
REVATHY PARAMESWARAN
Mathematics Educator , 2009,
Abstract: This paper reports on an experiment studying twelfth grade students’ understanding of Rolle’s Theorem. In particular, we study the influence of different concept images that students employ when solving reasoning tasks related to Rolle’s Theorem. We argue that students’ “container schema” and “motion schema” allow for rich concept images.
Expert Mathematicians' Approach to Understanding Defintions
Revathy Parameswaran
Mathematics Educator , 2010,
Abstract: In this article I report on a study of the cognitive tools that research mathematicians employ when developing deep understandings of abstract mathematical definitions. I arrived at several conclusions about this process: Examples play a predominant role in understanding definitions. Equivalent reformulations of definitions enrich understanding. Evoked conflicts and their resolutions result in improved understanding. The primary role of definitions in mathematics is in proving theorems. And there are several stages in developing understandings of mathematical definitions (Manin, 2007; Tall & Vinner, 1981; Thurston, 1994). I also include some suggestions for pedagogy that are found in the data.
Page 1 /401241
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.