Bian Yang - Academia.edu (original) (raw)
Papers by Bian Yang
Nowadays, many traditional approaches which encrypt multimedia data directly are not suitable for... more Nowadays, many traditional approaches which encrypt multimedia data directly are not suitable for the special nature of multimedia data. So many new encryption approaches have merged to overcome shortcomings and provide confidentiality. But the file size increases after encryption. The objective of our work is to keep the file size for JPEG image after encryption and do not affect the signal processing of JPEG. The DC differential residues are encrypted through XOR with the key that is the same length with the data stream. DCT blocks are scrambled using a key-controlled chaotic map which we proposed. The information of pre-steps is encrypted by cipher and embedded in the second category of AC coefficients. So our scheme is also well supported by cryptographic theory. Experiments show that the scheme is of high security and quality. What's more, it did not have any impact on signal processing and transmission.
A robust audio hashing algorithm for AAC audio is proposed in this paper. The robust hash is calc... more A robust audio hashing algorithm for AAC audio is proposed in this paper. The robust hash is calculated from MDCT-coefficients which are derived by partial decoding of AAC bitstream. There is no complicated transformation in the proposed algorithm, therefore, it is of low computational complexity. The proposed method is highly robust to MDCT-based audio compression. Experimental results also show its
In many applications encryption/decryption of compressed images or videos is desired to be transp... more In many applications encryption/decryption of compressed images or videos is desired to be transparent to the compression decoder to maintain the file format, file size and content-relevant functionalities. We propose in this paper a transparent encryption mechanism for JPEG-encoded image files to meet the requirements of format-compliance and file-size preservation. The algorithm is based on a special cross-block varied-length codes (VLC) shuffling method perceptually enhanced by a reversible histogram spreading processing, which tends to smoothly re-distribute VLCs among spatial blocks in a reversible way. The algorithm performs visually better than existing shuffling based schemes against content leakage attacks such as DC value removal.
An encryption method is proposed to use random quantization to generate diversified and renewable... more An encryption method is proposed to use random quantization to generate diversified and renewable templates from fingerprint minutiae. The method first achieves absolute pre-alignment over local minutiae quadruplets (called minutiae vicinities) in the original template, resulting in a fixed-length feature vector for each vicinity; and second quantizes the feature vector into binary bits by random quantization; and last post-processes the resultant binary vector in a length tunable way to obtain a protected minutia. Experiments on the fingerprint database FVC2002DB2_A demonstrate the desirable biometric performance achieved by the proposed method.
In a biometric template protected authentication system, a pseudonymous identifier is the part of... more In a biometric template protected authentication system, a pseudonymous identifier is the part of a protected biometric template that can be compared directly against other pseudonymous identifiers. Each compared pair of pseudonymous identifiers results in a verification decision testing whether both attributes are derived from the same individual. Compared to an unprotected system, most existing biometric template protection methods cause
ABSTRACT This paper presents a reversible watermarking scheme for the 2D-vector data (point coord... more ABSTRACT This paper presents a reversible watermarking scheme for the 2D-vector data (point coordinates) which are popularly used in geographical information related applications. This reversible watermarking scheme exploits the high correlation among points in the same ...
This paper describes an efficient and high-capacity reversible 2-D vector data embedding method, ... more This paper describes an efficient and high-capacity reversible 2-D vector data embedding method, which provides a promising solution to GIS (geographic information system) data hiding and authentication applications with a high requirement of fidelity or bit-by-bit ...
We propose a non-invertible geometrical transformation to protect minutiae-based fingerprint temp... more We propose a non-invertible geometrical transformation to protect minutiae-based fingerprint templates. This algorithm combines parameter-controlled linear and non-linear geometrical transformations to map an original minutiae-based template to a protected coordinate-based template in a highly non-invertible way. The protected template is easy to revoke and renew by changing the transformation parameters. Reference points based distance-preserved linear transformation is employed to preserve biometric performance, while cropping and superimposition based non-linear transformation is employed to achieve high non-invertibility which even permits all transformation parameters public in some cases. The high non-invertibiliy also enhances unlinkability among different templates for the same original fingerprint minutiae template against the key-inversion attack which undermines existing algorithms such as fuzzy commitment and fuzzy vault.
... We recently generalized the companding technique based reversible audio watermarking approach... more ... We recently generalized the companding technique based reversible audio watermarking approach [6] to images and proposed an integer DCT and bit-shift based reversiblewatermarking scheme [7], which is comparable to [5] in performance. ...
A renewable fingerprint minutiae template generation scheme is proposed to utilize random project... more A renewable fingerprint minutiae template generation scheme is proposed to utilize random projection for template diversification in a security enhanced way. The scheme first achieves absolute pre-alignment over local minutiae quadruplets in the original template and results in a fix-length feature vector; and then encrypts the feature vector by projecting it to multiple random matrices and quantizing the projected result; and finally post-process the resultant binary vector in a size and security tunable way to obtain the final protected minutia vicinity. Experiments on the fingerprint database FVC2002DB2_A demonstrate the desirable biometric performance of the proposed scheme.
In this paper, we describe the GUC100 multi-scanner fingerprint database that has been created fo... more In this paper, we describe the GUC100 multi-scanner fingerprint database that has been created for independent and in-house (semi-public) performance and interoperability testing of third party algorithms. The GUC100 was collected by using six different fingerprint scanners (TST, L-1, Cross Match, PreciseBiometrics, Lumidigm and Sagem). Over several months fingerprint images of all 10 fingers from 100 subjects on all 6 scanners were acquired. In total, GUC100 contains almost 72.000 fingerprint images.The GUC100 database enables to evaluate various performances and interoperability settings by taking into account different influencing factors such as fingerprint scanner, image quality and so on. The GUC100 data set is freely available to other researchers and practitioners provided that they conduct their testing in the premises of the Gjovik University College in Norway, or alternatively submit their algorithms (in compiled form) to run on GUC100 by researchers in Gjovik.We applied a commercial fingerprint verification algorithm on GUC100 and the reported results indicate that GUC100 is a challenging database.
We investigate in this paper several possible methods to improve the performance of the bit-shift... more We investigate in this paper several possible methods to improve the performance of the bit-shifting operation based reversible image watermarking algorithm in the integer DCT domain. In view of the large distortion caused by the modification of high-amplitude coefficients in the integer DCT domain, several coefficient selection methods are proposed to provide the coefficient modification process with some adaptability to
A minutiae encryption algorithm based on geometric transformation of minutiae positions is propos... more A minutiae encryption algorithm based on geometric transformation of minutiae positions is proposed to generate cancelable fingerprint templates. A geometric transformation is used for alignment. A parameter-controlled minutiae encryption is performed within a local area to generate a cancelable minutiae template, and then all local encryption results are superimposed to form a protected template. Parameters to control the minutiae encryption are generated independent of the geometric-aligned minutiae, which ensures solid non-invertibility compared to those cancelable template generating algorithms with to-be-encrypted minutiae information as parameters.
Soft Computing, 2009
This paper presents a real time video watermarking algorithm based on the singular value decompos... more This paper presents a real time video watermarking algorithm based on the singular value decomposition (SVD). The embedding procedure combines the DCT and SVD. The SVD is applied on the low frequency AC coefficients of block DCT of the frame. Then the relation of neighbor coefficients of those middle frequency bands in the singular values is modified. The hidden information can be extracted without the original video or the order of the original singular values, i.e., this is a blind watermarking algorithm. Experiments show that the algorithm is very robust against MPEG-2 compression, median filtering, small shift, and rotation, etc.
Nowadays, many traditional approaches which encrypt multimedia data directly are not suitable for... more Nowadays, many traditional approaches which encrypt multimedia data directly are not suitable for the special nature of multimedia data. So many new encryption approaches have merged to overcome shortcomings and provide confidentiality. But the file size increases after encryption. The objective of our work is to keep the file size for JPEG image after encryption and do not affect the signal processing of JPEG. The DC differential residues are encrypted through XOR with the key that is the same length with the data stream. DCT blocks are scrambled using a key-controlled chaotic map which we proposed. The information of pre-steps is encrypted by cipher and embedded in the second category of AC coefficients. So our scheme is also well supported by cryptographic theory. Experiments show that the scheme is of high security and quality. What's more, it did not have any impact on signal processing and transmission.
A robust audio hashing algorithm for AAC audio is proposed in this paper. The robust hash is calc... more A robust audio hashing algorithm for AAC audio is proposed in this paper. The robust hash is calculated from MDCT-coefficients which are derived by partial decoding of AAC bitstream. There is no complicated transformation in the proposed algorithm, therefore, it is of low computational complexity. The proposed method is highly robust to MDCT-based audio compression. Experimental results also show its
In many applications encryption/decryption of compressed images or videos is desired to be transp... more In many applications encryption/decryption of compressed images or videos is desired to be transparent to the compression decoder to maintain the file format, file size and content-relevant functionalities. We propose in this paper a transparent encryption mechanism for JPEG-encoded image files to meet the requirements of format-compliance and file-size preservation. The algorithm is based on a special cross-block varied-length codes (VLC) shuffling method perceptually enhanced by a reversible histogram spreading processing, which tends to smoothly re-distribute VLCs among spatial blocks in a reversible way. The algorithm performs visually better than existing shuffling based schemes against content leakage attacks such as DC value removal.
An encryption method is proposed to use random quantization to generate diversified and renewable... more An encryption method is proposed to use random quantization to generate diversified and renewable templates from fingerprint minutiae. The method first achieves absolute pre-alignment over local minutiae quadruplets (called minutiae vicinities) in the original template, resulting in a fixed-length feature vector for each vicinity; and second quantizes the feature vector into binary bits by random quantization; and last post-processes the resultant binary vector in a length tunable way to obtain a protected minutia. Experiments on the fingerprint database FVC2002DB2_A demonstrate the desirable biometric performance achieved by the proposed method.
In a biometric template protected authentication system, a pseudonymous identifier is the part of... more In a biometric template protected authentication system, a pseudonymous identifier is the part of a protected biometric template that can be compared directly against other pseudonymous identifiers. Each compared pair of pseudonymous identifiers results in a verification decision testing whether both attributes are derived from the same individual. Compared to an unprotected system, most existing biometric template protection methods cause
ABSTRACT This paper presents a reversible watermarking scheme for the 2D-vector data (point coord... more ABSTRACT This paper presents a reversible watermarking scheme for the 2D-vector data (point coordinates) which are popularly used in geographical information related applications. This reversible watermarking scheme exploits the high correlation among points in the same ...
This paper describes an efficient and high-capacity reversible 2-D vector data embedding method, ... more This paper describes an efficient and high-capacity reversible 2-D vector data embedding method, which provides a promising solution to GIS (geographic information system) data hiding and authentication applications with a high requirement of fidelity or bit-by-bit ...
We propose a non-invertible geometrical transformation to protect minutiae-based fingerprint temp... more We propose a non-invertible geometrical transformation to protect minutiae-based fingerprint templates. This algorithm combines parameter-controlled linear and non-linear geometrical transformations to map an original minutiae-based template to a protected coordinate-based template in a highly non-invertible way. The protected template is easy to revoke and renew by changing the transformation parameters. Reference points based distance-preserved linear transformation is employed to preserve biometric performance, while cropping and superimposition based non-linear transformation is employed to achieve high non-invertibility which even permits all transformation parameters public in some cases. The high non-invertibiliy also enhances unlinkability among different templates for the same original fingerprint minutiae template against the key-inversion attack which undermines existing algorithms such as fuzzy commitment and fuzzy vault.
... We recently generalized the companding technique based reversible audio watermarking approach... more ... We recently generalized the companding technique based reversible audio watermarking approach [6] to images and proposed an integer DCT and bit-shift based reversiblewatermarking scheme [7], which is comparable to [5] in performance. ...
A renewable fingerprint minutiae template generation scheme is proposed to utilize random project... more A renewable fingerprint minutiae template generation scheme is proposed to utilize random projection for template diversification in a security enhanced way. The scheme first achieves absolute pre-alignment over local minutiae quadruplets in the original template and results in a fix-length feature vector; and then encrypts the feature vector by projecting it to multiple random matrices and quantizing the projected result; and finally post-process the resultant binary vector in a size and security tunable way to obtain the final protected minutia vicinity. Experiments on the fingerprint database FVC2002DB2_A demonstrate the desirable biometric performance of the proposed scheme.
In this paper, we describe the GUC100 multi-scanner fingerprint database that has been created fo... more In this paper, we describe the GUC100 multi-scanner fingerprint database that has been created for independent and in-house (semi-public) performance and interoperability testing of third party algorithms. The GUC100 was collected by using six different fingerprint scanners (TST, L-1, Cross Match, PreciseBiometrics, Lumidigm and Sagem). Over several months fingerprint images of all 10 fingers from 100 subjects on all 6 scanners were acquired. In total, GUC100 contains almost 72.000 fingerprint images.The GUC100 database enables to evaluate various performances and interoperability settings by taking into account different influencing factors such as fingerprint scanner, image quality and so on. The GUC100 data set is freely available to other researchers and practitioners provided that they conduct their testing in the premises of the Gjovik University College in Norway, or alternatively submit their algorithms (in compiled form) to run on GUC100 by researchers in Gjovik.We applied a commercial fingerprint verification algorithm on GUC100 and the reported results indicate that GUC100 is a challenging database.
We investigate in this paper several possible methods to improve the performance of the bit-shift... more We investigate in this paper several possible methods to improve the performance of the bit-shifting operation based reversible image watermarking algorithm in the integer DCT domain. In view of the large distortion caused by the modification of high-amplitude coefficients in the integer DCT domain, several coefficient selection methods are proposed to provide the coefficient modification process with some adaptability to
A minutiae encryption algorithm based on geometric transformation of minutiae positions is propos... more A minutiae encryption algorithm based on geometric transformation of minutiae positions is proposed to generate cancelable fingerprint templates. A geometric transformation is used for alignment. A parameter-controlled minutiae encryption is performed within a local area to generate a cancelable minutiae template, and then all local encryption results are superimposed to form a protected template. Parameters to control the minutiae encryption are generated independent of the geometric-aligned minutiae, which ensures solid non-invertibility compared to those cancelable template generating algorithms with to-be-encrypted minutiae information as parameters.
Soft Computing, 2009
This paper presents a real time video watermarking algorithm based on the singular value decompos... more This paper presents a real time video watermarking algorithm based on the singular value decomposition (SVD). The embedding procedure combines the DCT and SVD. The SVD is applied on the low frequency AC coefficients of block DCT of the frame. Then the relation of neighbor coefficients of those middle frequency bands in the singular values is modified. The hidden information can be extracted without the original video or the order of the original singular values, i.e., this is a blind watermarking algorithm. Experiments show that the algorithm is very robust against MPEG-2 compression, median filtering, small shift, and rotation, etc.