Sarabjeet Singh Bedi
Research Subjects
Sarabjeet Singh Bedi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Rakesh Ahuja
Chitkara University
2 shared publications - Piyush Kapoor
Kvantum Inc., Gurgaon 122001, India
1 shared publication - Suhail Javed Quraishi
Manav Rachna International Institute of Research and Studies, India
1 shared publication
Latest Publications
- 27 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 138-144
Secure System of Continuous User Authentication Using Mouse Dynamics
Now a days, as there is a noteworthy increase in the usage of computer systems and internet, resulting in the tremendous increase in the cases of unauthorized access. Due to this, user authentication based on biometrics especially behavioural biometrics are gaining popularity. Mouse dynamics is one of the emerging behavioral trait for authentication of a user. In mouse dynamics, the genuinity of a user can be verified by observing the mouse usage behaviour of the user. In this paper, the proposed method focuses on the mouse dynamics to provide continuous user authentication in a system. The proposed system is designed for an open scenario, where any person can access the computer. So no prior registration of the user is required. One-class Support Vector Machine (SVM) was used to identify the deviation of current behaviour from recorded patterns, and thus verifying genuine user from intruder.
- 27 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 138-144
Secure System of Continuous User Authentication Using Mouse Dynamics
Now a days, as there is a noteworthy increase in the usage of computer systems and internet, resulting in the tremendous increase in the cases of unauthorized access. Due to this, user authentication based on biometrics especially behavioural biometrics are gaining popularity. Mouse dynamics is one of the emerging behavioral trait for authentication of a user. In mouse dynamics, the genuinity of a user can be verified by observing the mouse usage behaviour of the user. In this paper, the proposed method focuses on the mouse dynamics to provide continuous user authentication in a system. The proposed system is designed for an open scenario, where any person can access the computer. So no prior registration of the user is required. One-class Support Vector Machine (SVM) was used to identify the deviation of current behaviour from recorded patterns, and thus verifying genuine user from intruder.
- Open Access
- 8 November 2015
- Published by MECS Publisher in International Journal of Image, Graphics and Signal Processing
- Vol. 7 (12) , 54-73
All Aspects of Digital Video Watermarking Under an Umbrella
- 8 November 2015
- Published by MECS Publisher in International Journal of Image, Graphics and Signal Processing
- Vol. 7 (12) , 54-73
Open AccessAll Aspects of Digital Video Watermarking Under an Umbrella
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1048-1053
Copyright protection using blind video watermarking algorithm based on MPEG-2 structure
Video watermarking plays a key role in copyright protection domain of today's world. In the following paper, a blind watermarking algorithm is being proposed in which the watermark information is being embedded by little alteration of some of the value of DCT coefficients of luminance part of video during encoding it in MPEG-2 style. It is obvious that for any type of watermarking the three parameters, robustness, perceptibility and payload capacity must be simulated in order to provide better results. But unfortunately there is always a trade off among all these three parameters. But the proposed algorithm focused on one more issue, `elapsed time', a serious concern in video watermarking. The special care must be taken that how much time the system takes to embed the watermark. The algorithm is being tested also against several intentional and unintentional attacks to judge the robustness of this scheme. To maintain the perceptibility issue the value of threshold is manage in such a way that the quality of video must not being compromised during the embedding process. Therefore, the superiority of this algorithm is that our approach has covered three characteristics and evaluated better results as compared to the existing techniques proposed by other researchers.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1048-1053
Copyright protection using blind video watermarking algorithm based on MPEG-2 structure
Video watermarking plays a key role in copyright protection domain of today's world. In the following paper, a blind watermarking algorithm is being proposed in which the watermark information is being embedded by little alteration of some of the value of DCT coefficients of luminance part of video during encoding it in MPEG-2 style. It is obvious that for any type of watermarking the three parameters, robustness, perceptibility and payload capacity must be simulated in order to provide better results. But unfortunately there is always a trade off among all these three parameters. But the proposed algorithm focused on one more issue, `elapsed time', a serious concern in video watermarking. The special care must be taken that how much time the system takes to embed the watermark. The algorithm is being tested also against several intentional and unintentional attacks to judge the robustness of this scheme. To maintain the perceptibility issue the value of threshold is manage in such a way that the quality of video must not being compromised during the embedding process. Therefore, the superiority of this algorithm is that our approach has covered three characteristics and evaluated better results as compared to the existing techniques proposed by other researchers.
- Open Access
- 10 December 2013
- Published by Wiley in ISRN Signal Processing
- Vol. 2013, 1-5
Weather Forecasting Using Sliding Window Algorithm
To predict the future’s weather condition, the variation in the conditions in past years must be utilized. The probability that the weather condition of the day in consideration will match the same day in previous year is very less. But the probability that it will match within the span of adjacent fortnight of previous year is very high. So, for the fortnight considered for previous year a sliding window is selected of size equivalent to a week. Every week of sliding window is then matched with that of current year’s week in consideration. The window best matched is made to participate in the process of predicting weather conditions. The prediction is made based on sliding window algorithm. The monthwise results are being computed for three years to check the accuracy. The results of the approach suggested that the method used for weather condition prediction is quite efficient with an average accuracy of 92.2%.
- 10 December 2013
- Published by Wiley in ISRN Signal Processing
- Vol. 2013, 1-5
Open AccessWeather Forecasting Using Sliding Window Algorithm
To predict the future’s weather condition, the variation in the conditions in past years must be utilized. The probability that the weather condition of the day in consideration will match the same day in previous year is very less. But the probability that it will match within the span of adjacent fortnight of previous year is very high. So, for the fortnight considered for previous year a sliding window is selected of size equivalent to a week. Every week of sliding window is then matched with that of current year’s week in consideration. The window best matched is made to participate in the process of predicting weather conditions. The prediction is made based on sliding window algorithm. The monthwise results are being computed for three years to check the accuracy. The results of the approach suggested that the method used for weather condition prediction is quite efficient with an average accuracy of 92.2%.