The Experts below are selected from a list of 30225 Experts worldwide ranked by ideXlab platform
V Ramasubramanian - One of the best experts on this subject based on the ideXlab platform.
-
high performance on line session adaptation for handling inter session speaker variability in variable text speaker recognition
International Conference on Advances in Pattern Recognition, 2009Co-Authors: S Thiyagarajan, V RamasubramanianAbstract:We propose an on-line session-adaptation algorithm for making variable-text speaker-recognition systems robust to inter-session variability, by a continuous update of registered speakers' multiple templates from test utterances during actual usage of the system. The algorithm is set in a speaker-Verification mode of operation and uses an enhanced Verification Step to ensure reliable selection of input utterances for template updation in an unsupervised way.
-
ICAPR - High Performance On-line Session-adaptation for Handling Inter-session Speaker Variability in Variable-text Speaker-recognition
2009 Seventh International Conference on Advances in Pattern Recognition, 2009Co-Authors: S Thiyagarajan, V RamasubramanianAbstract:We propose an on-line session-adaptation algorithm for making variable-text speaker-recognition systems robust to inter-session variability, by a continuous update of registered speakers' multiple templates from test utterances during actual usage of the system. The algorithm is set in a speaker-Verification mode of operation and uses an enhanced Verification Step to ensure reliable selection of input utterances for template updation in an unsupervised way.
Q Jonathan M Wu - One of the best experts on this subject based on the ideXlab platform.
-
biometrics inspired watermarking based on a fractional dual tree complex wavelet transform
Future Generation Computer Systems, 2013Co-Authors: Gaurav Bhatnagar, Q Jonathan M WuAbstract:In this paper, a novel biometrics inspired watermarking technique is proposed. For this purpose, a newly proposed mathematical transform, namely the fractional dual tree complex wavelet transform (FrDT-CWT), and singular value decomposition (SVD) are used. The core idea is to use biometrically generated keys in the embedding process of a gray-scale watermark. Therefore, this paper first proposes a method for generating keys from biometrics efficiently. The host image is first randomized by Hessenberg decomposition and a chaotic map, followed by embedding in the FrDT-CWT domain by modifying the singular values of the randomized image. Further, in order to prevent the ambiguity problem of SVD-based techniques, a Verification Step is introduced to verify the watermarked image. Finally, a reliable extraction process is proposed to extract the watermark from the possibly attacked watermarked image after Verification. The security, attack, and comparative analysis confirms the high security, efficiency, and robustness of the proposed watermarking technique. Highlights? A novel biometrics inspired watermarking technique is proposed. ? The watermark is embedded in a fractional dual tree complex wavelet transform domain using SVD. ? A method is also proposed to generate keys from biometrics efficiently. ? To prevent the ambiguity problem of SVD-based techniques, a Verification Step is casted. ? The security, attack, and comparative analysis confirms the high security, efficiency, and robustness of the proposed technique.
Pascal Vasseur - One of the best experts on this subject based on the ideXlab platform.
-
ICIP (1) - Event detection based on "common fate" principle: application to vehicles detection from aerial sequences of road traffic
IEEE International Conference on Image Processing 2005, 2005Co-Authors: K. Kaaniche, Pascal VasseurAbstract:This paper introduces a vision system for road traffic surveillance from sequences acquired from an unmanned aerial vehicle (UAV). During the navigation of the UAV, the vision system acquires sequences which are treated in order to detect vehicles. The dynamic behavior of the UAV-camera system makes a fixed background impossible : we present a new approach based on the "common fate" principle : image primitives which have the same type of movement (or displacement) are grouped. The detection of vehicles is then based on the spatiotemporal grouping of primitives formulated as a normalized cuts problem. A Verification Step based on the Dempster-Shafer theory is also proposed in order to recognize vehicles.
-
ICRA - A Vision Algorithm for Dynamic Detection of Moving Vehicles with a UAV
Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 1Co-Authors: K. Kaaniche, B. Champion, Claude Pegard, Pascal VasseurAbstract:This paper presents a vision system for road traffic surveillance from sequences acquired from an unmanned aerial vehicle (UAV). This UAV is able to follow a path considered as the surveillance area and defined by a set of ordered GPS points. During the navigation of the UAV, the vision system acquires sequences which are treated in real-time in order to detect vehicles. This detection allows to perform a traffic estimation or to track a pointed out vehicle. The detection of vehicles is based on the spatiotemporal grouping of primitives formulated as a normalized cuts problem. A Verification Step based on the Dempster-Shafer theory is also proposed in order to recognize the vehicles.
S Thiyagarajan - One of the best experts on this subject based on the ideXlab platform.
-
high performance on line session adaptation for handling inter session speaker variability in variable text speaker recognition
International Conference on Advances in Pattern Recognition, 2009Co-Authors: S Thiyagarajan, V RamasubramanianAbstract:We propose an on-line session-adaptation algorithm for making variable-text speaker-recognition systems robust to inter-session variability, by a continuous update of registered speakers' multiple templates from test utterances during actual usage of the system. The algorithm is set in a speaker-Verification mode of operation and uses an enhanced Verification Step to ensure reliable selection of input utterances for template updation in an unsupervised way.
-
ICAPR - High Performance On-line Session-adaptation for Handling Inter-session Speaker Variability in Variable-text Speaker-recognition
2009 Seventh International Conference on Advances in Pattern Recognition, 2009Co-Authors: S Thiyagarajan, V RamasubramanianAbstract:We propose an on-line session-adaptation algorithm for making variable-text speaker-recognition systems robust to inter-session variability, by a continuous update of registered speakers' multiple templates from test utterances during actual usage of the system. The algorithm is set in a speaker-Verification mode of operation and uses an enhanced Verification Step to ensure reliable selection of input utterances for template updation in an unsupervised way.
Andrew M. Lance - One of the best experts on this subject based on the ideXlab platform.
-
AusCTW - Repeat-accumulate codes for reconciliation in continuous variable quantum key distribution
2016 Australian Communications Theory Workshop (AusCTW), 2016Co-Authors: Sarah J. Johnson, Vikram Arkalgud Chandrasetty, Andrew M. LanceAbstract:This paper investigates the design of low-complexity error correction codes for the Verification Step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation. Given quasi-cyclic repeat-accumulate codes' commercial maturity, low implementation complexity and existing high-speed ASIC implementations, this makes these codes viable candidates for commercial CVQKD systems.
-
Repeat-Accumulate Codes for Reconciliation in Continuous Variable Quantum Key Distribution
arXiv: Information Theory, 2015Co-Authors: Sarah J. Johnson, Vikram Arkalgud Chandrasetty, Andrew M. LanceAbstract:This paper investigates the design of low-complexity error correction codes for the Verification Step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation.
