Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 60 )

2018 ( 330 )

2017 ( 345 )

2016 ( 540 )

Custom range...

Search Results: 1 - 10 of 200002 matches for " Sanjay N. Talbar "
All listed articles are free for downloading (OA Articles)
Page 1 /200002
Display every page Item
Dynamic Threshold in Clip Analysis and Retrieval
Satishkumar L Varma & Sanjay N Talbar
International Journal of Image Processing , 2011,
Abstract: Key frame extraction can be helpful in video summarization, analysis, indexing, browsing, andretrieval. Clip analysis of key frame sequences is an open research issues. The paper deals withidentification and extraction of key frames using dynamic threshold followed by video retrieval.The number of key frames to be extracted for each shot depends on the activity details of theshot. This system uses the statistics of comparison between the successive frames within a levelextracted on the basis of color histograms and dynamic threshold. Two program interfaces arelinked for clip analysis and video indexing and retrieval using entropy. The results using proposedsystem on few video sequences are tested and the extracted key frames and retrieved results areshown.
Independent Component Analysis of Edge Information for Face Recognition
Kailash J. Karande,Sanjay N. Talbar
International Journal of Image Processing , 2009,
Abstract: In this paper we address the problem of face recognition using edge informationas independent components. The edge information is obtained by usingLaplacian of Gaussian (LoG) and Canny edge detection methods thenpreprocessing is done by using Principle Component analysis (PCA) beforeapplying the Independent Component Analysis (ICA) algorithm for training ofimages. The independent components obtained by ICA algorithm are used asfeature vectors for classification. The Euclidean distance and Mahalanobisdistance classifiers are used for testing of images. The algorithm is tested on twodifferent databases of face images for variation in illumination and facial posesup to 1800rotation angle.
FPGA Prototype of Robust Image Watermarking For JPEG 2000 With Dual Detection
Pankaj U.Lande, Sanjay N. Talbar & G.N. Shinde
International Journal of Computer Science and Security , 2010,
Abstract: This paper presents a novel robust invisible watermarking method for still images. The scheme is implemented on hardware, and it can be incorporated with the lossless JPEG2000 compression standard. We have implemented Cohen-Daubechies-Favreau (CDF) 5/3 wavelet filters with lifting scheme which requires less hardware and they are also the basis of lossless JPEG2000. Its modular structure is well suitable for hardware implementation and it is more efficient use of power and chip area. The objective of the hardware assisted watermarking is to achieve low power usage, real-time performance, robust and ease of integration with existing consumer electronic devices such as scanners, cameras and handy camcorders. The proposed scheme of watermarking is tested with StirMark software which is a one of the benchmarking software for watermarking scheme. The experimental result shows that the proposed scheme of watermarking is robust against most of the geometric attacks such as scaling and rotation. We have proposed a dual detection technique for watermark detection which is a novelty of our algorithm.
Pankaj U.Lande,Sanjay N. Talbar,G.N. Shinde
International Journal of Signal Processing, Image Processing and Pattern Recognition , 2010,
Abstract: In this paper a fuzzy logic approach is introduced to embed the encrypted watermark in the wavelet domain. The multi-resolution representation based on DWT incorporates a model of Human VisualSystem (HVS). Encryption and digital watermarking techniques need to be incorporated in digital right management. It is clear that these two technologies are complimenting each other, and the completesecurity of the digital contains depends on both. Encryption transforms the original contain into unreadable format and watermarking leaves the digital object intact and recognizable. The objective is to develop simple, real time and robust secure watermarking system, which can be achieved through the hardware implementation. To meet a real time constrain we have proposed parallel computing architecture for wavelet transform. The experimental results demonstrate the high robustness of theproposed algorithm to various attacks like noise additions etc
Encryption and Decryption of Digital Image Using Color Signal
Gamil R. S. Qaid,S.N. Talbar
International Journal of Computer Science Issues , 2012,
Abstract: This paper aims at improving the level of security and secrecy provided by the digital color signal-based image encryption. The image encryption and decryption algorithm is designed and implemented to provide confidentiality and security in transmission of the image based data as well as in storage. This new proposed encryption algorithm can ensure the lossless of transmissions of images. The proposed encryption algorithm in this study has been tested on some images and showed good results.
Tunable Bandwidth Third Order Switched-Capacitor with Multiple Feedbacks Filter for Different Center Frequencies  [PDF]
Ganeshchandra N. Shinde, Sanjay R. Bhagat
Engineering (ENG) , 2010, DOI: 10.4236/eng.2010.23025
Abstract: This paper proposes third order tunable bandwidth active Switched-Capacitor filter. The circuit consists of only op-amps and switched capacitors. The circuit is designed for circuit merit factor Q = 10. The proposed circuit implements three filter functions low pass, band pass and high pass simultaneously in single circuit. The filter circuit can be used for both narrow as well as for wide bandwidth. For various values of cut-off frequencies the behaviour of circuit is studied. The circuit works properly only for higher central frequencies, when f0 > 10 kHz.
Representational task formats and problem solving strategies in kinematics and work
Bashirah Ibrahim,N. Sanjay Rebello
Physical Review Special Topics. Physics Education Research , 2012,
Abstract: Previous studies have reported that students employed different problem solving approaches when presented with the same task structured with different representations. In this study, we explored and compared students’ strategies as they attempted tasks from two topical areas, kinematics and work. Our participants were 19 engineering students taking a calculus-based physics course. The tasks were presented in linguistic, graphical, and symbolic forms and requested either a qualitative solution or a value. The analysis was both qualitative and quantitative in nature focusing principally on the characteristics of the strategies employed as well as the underlying reasoning for their applications. A comparison was also made for the same student’s approach with the same kind of representation across the two topics. Additionally, the participants’ overall strategies across the different tasks, in each topic, were considered. On the whole, we found that the students prefer manipulating equations irrespective of the representational format of the task. They rarely recognized the applicability of a “qualitative” approach to solve the problem although they were aware of the concepts involved. Even when the students included visual representations in their solutions, they seldom used these representations in conjunction with the mathematical part of the problem. Additionally, the students were not consistent in their approach for interpreting and solving problems with the same kind of representation across the two topical areas. The representational format, level of prior knowledge, and familiarity with a topic appeared to influence their strategies, their written responses, and their ability to recognize qualitative ways to attempt a problem. The nature of the solution does not seem to impact the strategies employed to handle the problem.
An Experimental Survey on Parsing with Neural and Finite Automata Networks
Sanjay Bhargava,G. N. Purohit
International Journal of Computer Science Issues , 2011,
Abstract: Parsing is the process of structuring a linear depiction in accordance with a given grammar. The "linear depiction" may be a language sentence, a computer program, a weaving pattern, a sequence of biological strata, a part of music, actions in a ritual performance, in short any linear chain in which the preceding elements in some way confine the next element. Parsing with finite automata networks implies, in one way, the conversion of a regular expression into a minimal deterministic finite automaton, while parsing with neural networks involves parsing of a natural language sentence. This research paper presents a twofold investigation on the various parsing techniques with (i) neural networks and (ii) finite automata networks. Consequently, the present research paper depicts a comprehensive comparison among a number of parsing techniques with neural networks followed by another in depth comparison flanked by a number of parsing techniques with finite automata networks.
Development and validation of RP-HPLC method for estimation of Cefotaxime sodium in marketed formulations
Lalitha N,Sanjay Pai PN
Journal of Basic and Clinical Pharmacy , 2010,
Abstract: A RP-HPLC assay method has been developed and validated for cefotaxime. An isocratic RP-HPLC was developed on a SS Wakosil II- C8 column (250 mm ×4.6 mm i.d., 5 μm) utilizing a mobile phase of ammonium acetate buffer (pH 6.8) and acetonitrile (85:15 v/v) with UV detection at wavelength 252 nm at the flow rate 0 .8 ml/min. The proposed method was validated for sensitivity, selectivity, linearity, accuracy, precision, ruggedness, robustness and solution stability. The response of the drug was linear in the concentration range of 10-70 μg/ml. Limit of detection and Limit of quantification was found to be 0.3 μg/ml and 0.6 μg/ml respectively. The % recovery ranged within 97-102 %. Method, system, interday and intraday precision was found to be within the limits of acceptance criteria. Method was found to be rugged when analysis was carried out by different analyst. The method was found to be sensitive and efficient with 2216 theoretical plates, 0.1128 mm HETP and tailing factor 1. The method was suitable for the quality control of cefotaxime in injection formulations.
Analysis and Study of Incremental DBSCAN Clustering Algorithm
Sanjay Chakraborty,N. K. Nagwani
Computer Science , 2014,
Abstract: This paper describes the incremental behaviours of Density based clustering. It specially focuses on the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm and its incremental approach.DBSCAN relies on a density based notion of clusters.It discovers clusters of arbitrary shapes in spatial databases with noise.In incremental approach, the DBSCAN algorithm is applied to a dynamic database where the data may be frequently updated. After insertions or deletions to the dynamic database, the clustering discovered by DBSCAN has to be updated. And we measure the new cluster by directly compute the new data entering into the existing clusters instead of rerunning the algorithm.It finally discovers new updated clusters and outliers as well.Thus it describes at what percent of delta change in the original database the actual and incremental DBSCAN algorithms behave like same.DBSCAN is widely used in those situations where large multidimensional databases are maintained such as Data Warehouse.
Page 1 /200002
Display every page Item

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