Time filter

Source Type

Vallabh Vidyanagar, India

Kher R.,H+ Technology | Pawar T.,BVM Engineering College | Thakar V.,A D Patel Institute of Technology | Shah H.,H+ Technology
Journal of Medical Engineering and Technology

The use of wearable recorders for long-term monitoring of physiological parameters has increased in the last few years. The ambulatory electrocardiogram (A-ECG) signals of five healthy subjects with four body movements or physical activities (PA) - left arm up down, right arm up down, waist twisting and walking - have been recorded using a wearable ECG recorder. The classification of these four PAs has been performed using neuro-fuzzy classifier (NFC) and support vector machines (SVM). The PA classification is based on the distinct, time-frequency features of the extracted motion artifacts contained in recorded A-ECG signals. The motion artifacts in A-ECG signals have been separated first by the discrete wavelet transform (DWT) and the time-frequency features of these motion artifacts have then been extracted using the Gabor transform. The Gabor energy feature vectors have been fed to the NFC and SVM classifiers. Both the classifiers have achieved a PA classification accuracy of over 95% for all subjects. © 2015 Informa UK Ltd. Source

Patel N.,BVM Engineering College | Zaveri M.,SVNIT
Signal, Image and Video Processing

With better understanding of face anatomy and technical advances in computer graphics, 3D face synthesis has become one of the most active research fields for many human-machine applications, ranging from immersive telecommunication to the video games industry. In this paper we proposed a method that automatically extracts features like eyes, mouth, eyebrows and nose from the given frontal face image. Then a generic 3D face model is superimposed onto the face in accordance with the extracted facial features in order to fit the input face image by transforming the vertex topology of the generic face model. The 3D-specific face can finally be synthesized by texturing the individualized face model. Once the model is ready six basic facial expressions are generated with the help of MPEG-4 facial animation parameters. To generate transitions between these facial expressions we use 3D shape morphing between the corresponding face models and blend the corresponding textures. Novelty of our method is automatic generation of 3D model and synthesis face with different expressions from frontal neutral face image. Our method has the advantage that it is fully automatic, robust, fast and can generate various views of face by rotation of 3D model. It can be used in a variety of applications for which the accuracy of depth is not critical such as games, avatars, face recognition. We have tested and evaluated our system using standard database namely, BU-3DFE. © 2011 Springer-Verlag London Limited. Source

Patel R.,BVM Engineering College | Parmar S.,H+ Technology
Proceedings on 2014 2nd International Conference on "Emerging Technology Trends in Electronics, Communication and Networking", ET2ECN 2014

Content based image retrieval is used as an important tool by a radiologist, as it is very useful to diagnosis a patient. A set of interested images are retrieved from a large database, which helps to narrow down the problem under examination. Database consisting various images of organs like brain, lungs, neck, and colon. Haar like features are extracted and supplied to Support Vector Machine classifier, to decide that image belongs to which organ of a body. Once, it has been classified, process enters in a next phase of retrieval. In the phase of retrieval, where two different approaches are used for feature extraction, one based on intensity and other based on Statistical moments. Images are retrieved using a similarity measure for both approaches and a comparative analysis is shown in this paper. © 2014 IEEE. Source

Vegad M.M.,Indian Institute of Technology Delhi | Vegad M.M.,BVM Engineering College | De S.,Indian Institute of Technology Delhi | Lall B.,Indian Institute of Technology Delhi
Wireless Personal Communications

IEEE 802.11 wireless ad hoc network performance in distributed coordination function mode is limited by hidden and exposed terminals problem. Request-to-send/clear-to-send based hand shake reduces the problem to some extent, but the network performance is a function of nodal carrier sense (CS) range and interference range. While a large CS range compared to the interference range can reduce the collision related throughput loss, it has a negative impact of increased exposed terminals. Via experimental studies it was recently demonstrated that, the effect of interference to a reception process differs depending on arrival order of the desired signal and interfering signal. In view of this frame arrival order dependent capture (ODC) capability of receivers, in this paper we investigate the optimal choice of CS range and explore the possibility of maximizing the network performance. Via mathematical analysis, supported by extensive network simulations, we demonstrate the network performance benefit of ODC dependent optimal CS range. The distinctive characteristic of ODC diminishes at higher data rates, and as a result the performance gain with optimal CS range reduces. Nevertheless, at low-to-moderately-high data rates, the performance gain is shown to be quite significant. © 2014, Springer Science+Business Media New York. Source

Thakor D.,BVM Engineering College | Shah A.,H+ Technology
Proceedings of the 2011 World Congress on Information and Communication Technologies, WICT 2011

A scheduling algorithm decides a schedule for a set of tasks. There are numbers of algorithm for scheduling tasks on a processor. Some of these algorithms are used for scheduling tasks on multiprocessor system either under the partitioning scheme or under the global scheduling scheme. The most common scheduling algorithms are: Earliest Deadline First (EDF) and Least Laxity First (LLF). They are optimal scheduling algorithms for single processor system, but problem arises when algorithms are used for multiprocessor system. In this paper, we have proposed a new algorithm, D-EDF. D-EDF scheduling algorithm overcomes the limitations of dynamic algorithm during overloaded conditions. The proposed algorithm D-EDF, simulated and tested for independent, preemptive, periodic tasks on tightly coupled real-time multiprocessor system under global scheduling. The performance is measured in terms of Success Ratio and Effective CPU Utilization. From experiments and result analysis it concludes that the proposed algorithm is very efficient in both underloaded and overloaded conditions. It performs always better than conventional EDF algorithm. The algorithm proposed in the paper performs quite well during overloaded conditions. © 2011 IEEE. Source

Discover hidden collaborations