Carsten Gottschlich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Carsten Gottschlich has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Stephan F. Huckemann
Georg-August-Universität at Göttingen
7 shared publications Stephan Huckemann
Institute for Mathematical Stochastics University of Göttingen Goldschmidtstr. 7 37077 Göttingen Germany
5 shared publicationsAxel Munk
Institute for Mathematical Stochastics, University of Göttingen, Göttingen, Germany
2 shared publications- Dominic Schuhmacher
Institute for Mathematical Stochastics University of Göttingen Goldschmidtstrasse 7 37077 Göttingen Germany
2 shared publications - Duy Hoang Thai
Statistical and Applied Mathematical Science Institute (SAMSI) USA
2 shared publications - Ken'Ichi Ohshika
Osaka University
2 shared publications
Latest Publications
- 18 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (8) , 1963-1974
Smudge Noise for Quality Estimation of Fingerprints and its Validation
Automated biometric identification systems are inherently challenged to optimize false (non-)match rates. This can be addressed either by directly improving comparison subsystems, or indirectly by allowing only ”good quality” biometric queries to be compared. We are interested in the latter, where the challenge lies in relating ”good quality” of a query to its utility with respect to a comparison subsystem. First, we propose a new general robust biometric quality validation scheme (RBQ VS) that, mimicking the use-case, robustly quantifies comparison improvement obtained by employing a specific quality estimator. For this purpose we robustify an existing validation scheme by repeated random subsampling cross-validation. Secondly, specifically for the task of fingerprint comparison, we propose a novel biometric feature for quality estimation. Since comparison subsystems based on fingerprint minutiae, which are ridge endings and bifurcations, appear to miss minutiae or detect spurious minutiae, especially in the presence of smudge noise, we propose an algorithm aiming at measuring corruption by smudge. To this end, we employ a recently developed three parts imagedecomposition and link our new smudge noise quality estimator (SNoQE) to the structure of the texture part found. Lastly, using the FVC databases and a NIST database, we compare the SNoQE with the popular NFIQ 2.0 estimator, and its predecessor. Experimental results show that the single-feature SNoQE can compete with the multi-feature NFIQ 2.0 and, in fact, adds new information not sufficiently reproduced by the NFIQ 2.0. Indeed, a simple combination of SNoQE and NFIQ 2.0 tends to outperform on all databases included in the comparison study. An implementation of the RBQ VS and the SNoQE can be found online.
- 18 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (8) , 1963-1974
Smudge Noise for Quality Estimation of Fingerprints and its Validation
Automated biometric identification systems are inherently challenged to optimize false (non-)match rates. This can be addressed either by directly improving comparison subsystems, or indirectly by allowing only ”good quality” biometric queries to be compared. We are interested in the latter, where the challenge lies in relating ”good quality” of a query to its utility with respect to a comparison subsystem. First, we propose a new general robust biometric quality validation scheme (RBQ VS) that, mimicking the use-case, robustly quantifies comparison improvement obtained by employing a specific quality estimator. For this purpose we robustify an existing validation scheme by repeated random subsampling cross-validation. Secondly, specifically for the task of fingerprint comparison, we propose a novel biometric feature for quality estimation. Since comparison subsystems based on fingerprint minutiae, which are ridge endings and bifurcations, appear to miss minutiae or detect spurious minutiae, especially in the presence of smudge noise, we propose an algorithm aiming at measuring corruption by smudge. To this end, we employ a recently developed three parts imagedecomposition and link our new smudge noise quality estimator (SNoQE) to the structure of the texture part found. Lastly, using the FVC databases and a NIST database, we compare the SNoQE with the popular NFIQ 2.0 estimator, and its predecessor. Experimental results show that the single-feature SNoQE can compete with the multi-feature NFIQ 2.0 and, in fact, adds new information not sufficiently reproduced by the NFIQ 2.0. Indeed, a simple combination of SNoQE and NFIQ 2.0 tends to outperform on all databases included in the comparison study. An implementation of the RBQ VS and the SNoQE can be found online.
- Open Access
- 4 March 2019
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 78 (7) , 2171-2206
An anisotropic interaction model for simulating fingerprints
Evidence suggests that both the interaction of so-called Merkel cells and the epidermal stress distribution play an important role in the formation of fingerprint patterns during pregnancy. To model the formation of fingerprint patterns in a biologically meaningful way these patterns have to become stationary. For the creation of synthetic fingerprints it is also very desirable that rescaling the model parameters leads to rescaled distances between the stationary fingerprint ridges. Based on these observations, as well as the model introduced by Kücken and Champod we propose a new model for the formation of fingerprint patterns during pregnancy. In this anisotropic interaction model the interaction forces not only depend on the distance vector between the cells and the model parameters, but additionally on an underlying tensor field, representing a stress field. This dependence on the tensor field leads to complex, anisotropic patterns. We study the resulting stationary patterns both analytically and numerically. In particular, we show that fingerprint patterns can be modeled as stationary solutions by choosing the underlying tensor field appropriately.
- 4 March 2019
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 78 (7) , 2171-2206
Open AccessAn anisotropic interaction model for simulating fingerprints
Evidence suggests that both the interaction of so-called Merkel cells and the epidermal stress distribution play an important role in the formation of fingerprint patterns during pregnancy. To model the formation of fingerprint patterns in a biologically meaningful way these patterns have to become stationary. For the creation of synthetic fingerprints it is also very desirable that rescaling the model parameters leads to rescaled distances between the stationary fingerprint ridges. Based on these observations, as well as the model introduced by Kücken and Champod we propose a new model for the formation of fingerprint patterns during pregnancy. In this anisotropic interaction model the interaction forces not only depend on the distance vector between the cells and the model parameters, but additionally on an underlying tensor field, representing a stress field. This dependence on the tensor field leads to complex, anisotropic patterns. We study the resulting stationary patterns both analytically and numerically. In particular, we show that fingerprint patterns can be modeled as stationary solutions by choosing the underlying tensor field appropriately.
- 18 December 2017
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 60 (5) , 651-660
Möbius Moduli for Fingerprint Orientation Fields
- 18 December 2017
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 60 (5) , 651-660
Möbius Moduli for Fingerprint Orientation Fields
- Open Access
Möbius Moduli for Fingerprint Orientation Fields
We propose a novel fingerprint descriptor, namely M\"obius moduli, measuring local deviation of orientation fields (OF) of fingerprints from conformal fields, and we propose a method to robustly measure them, based on tetraquadrilaterals to approximate a conformal modulus locally with one due to a M\"obius transformation. Conformal fields arise by the approximation of fingerprint OFs given by zero pole models, which are determined by the singular points and a rotation. This approximation is very coarse, e.g. for fingerprints with no singular points (arch type), the zero-pole model's OF has parallel lines. Quadratic differential (QD) models, which are obtained from zero-pole models by adding suitable singularities outside the observation window, approximate real fingerprints much better. For example, for arch type fingerprints, parallel lines along the distal joint change slowly into circular lines around the nail furrow. Still, QD models are not fully realistic because, for example along the central axis of arch type fingerprints, ridge line curvatures usually first increase and then decrease again. It is impossible to model this with QDs, which, due to complex analyticity, also produce conformal fields only. In fact, as one of many applications of the new descriptor, we show, using histograms of curvature and conformality index (log of the absolute value of the M\"obius modulus), that local deviation from conformality in fingerprints occurs systematically at high curvature which is not reflected by state of the art fingerprint models as are used, for instance, in the well known synthetic fingerprint generation tool SFinGe and these differences robustely discriminate real prints from SFinGe's synthetic prints.
Open AccessMöbius Moduli for Fingerprint Orientation Fields
We propose a novel fingerprint descriptor, namely M\"obius moduli, measuring local deviation of orientation fields (OF) of fingerprints from conformal fields, and we propose a method to robustly measure them, based on tetraquadrilaterals to approximate a conformal modulus locally with one due to a M\"obius transformation. Conformal fields arise by the approximation of fingerprint OFs given by zero pole models, which are determined by the singular points and a rotation. This approximation is very coarse, e.g. for fingerprints with no singular points (arch type), the zero-pole model's OF has parallel lines. Quadratic differential (QD) models, which are obtained from zero-pole models by adding suitable singularities outside the observation window, approximate real fingerprints much better. For example, for arch type fingerprints, parallel lines along the distal joint change slowly into circular lines around the nail furrow. Still, QD models are not fully realistic because, for example along the central axis of arch type fingerprints, ridge line curvatures usually first increase and then decrease again. It is impossible to model this with QDs, which, due to complex analyticity, also produce conformal fields only. In fact, as one of many applications of the new descriptor, we show, using histograms of curvature and conformality index (log of the absolute value of the M\"obius modulus), that local deviation from conformality in fingerprints occurs systematically at high curvature which is not reflected by state of the art fingerprint models as are used, for instance, in the well known synthetic fingerprint generation tool SFinGe and these differences robustely discriminate real prints from SFinGe's synthetic prints.
- Open Access
- 14 December 2016
- Published by Institution of Engineering and Technology (IET) in IET Biometrics
- Vol. 6 (3) , 183-190
Perfect fingerprint orientation fields by locally adaptive global models
Fingerprint recognition is widely used for verification and identification in many commercial, governmental and forensic applications. The orientation field (OF) plays an important role at various processing stages in fingerprint recognition systems. OFs are used for image enhancement, fingerprint alignment, for fingerprint liveness detection, fingerprint alteration detection and fingerprint matching. In this study, a novel approach is presented to globally model an OF combined with locally adaptive methods. The authors show that this model adapts perfectly to the ‘true OF’ in the limit. This perfect OF is described by a small number of parameters with straightforward geometric interpretation. Applications are manifold: Quick expert marking of very poor quality (for instance latent) OFs, high‐fidelity low parameter OF compression and a direct road to ground truth OFs markings for large databases, say. In this contribution, they describe an algorithm to perfectly estimate OF parameters automatically or semi‐automatically, depending on image quality, and they establish the main underlying claim of high‐fidelity low parameter OF compression.
- 14 December 2016
- Published by Institution of Engineering and Technology (IET) in IET Biometrics
- Vol. 6 (3) , 183-190
Open AccessPerfect fingerprint orientation fields by locally adaptive global models
Fingerprint recognition is widely used for verification and identification in many commercial, governmental and forensic applications. The orientation field (OF) plays an important role at various processing stages in fingerprint recognition systems. OFs are used for image enhancement, fingerprint alignment, for fingerprint liveness detection, fingerprint alteration detection and fingerprint matching. In this study, a novel approach is presented to globally model an OF combined with locally adaptive methods. The authors show that this model adapts perfectly to the ‘true OF’ in the limit. This perfect OF is described by a small number of parameters with straightforward geometric interpretation. Applications are manifold: Quick expert marking of very poor quality (for instance latent) OFs, high‐fidelity low parameter OF compression and a direct road to ground truth OFs markings for large databases, say. In this contribution, they describe an algorithm to perfectly estimate OF parameters automatically or semi‐automatically, depending on image quality, and they establish the main underlying claim of high‐fidelity low parameter OF compression.
- Open Access
DOTmark - A Benchmark for Discrete Optimal Transport
The Wasserstein metric or earth mover's distance (EMD) is a useful tool in statistics, machine learning and computer science with many applications to biological or medical imaging, among others. Especially in the light of increasingly complex data, the computation of these distances via optimal transport is often the limiting factor. Inspired by this challenge, a variety of new approaches to optimal transport has been proposed in recent years and along with these new methods comes the need for a meaningful comparison. In this paper, we introduce a benchmark for discrete optimal transport, called DOTmark, which is designed to serve as a neutral collection of problems, where discrete optimal transport methods can be tested, compared to one another, and brought to their limits on large-scale instances. It consists of a variety of grayscale images, in various resolutions and classes, such as several types of randomly generated images, classical test images and real data from microscopy. Along with the DOTmark we present a survey and a performance test for a cross section of established methods ranging from more traditional algorithms, such as the transportation simplex, to recently developed approaches, such as the shielding neighborhood method, and including also a comparison with commercial solvers.
Open AccessDOTmark - A Benchmark for Discrete Optimal Transport
The Wasserstein metric or earth mover's distance (EMD) is a useful tool in statistics, machine learning and computer science with many applications to biological or medical imaging, among others. Especially in the light of increasingly complex data, the computation of these distances via optimal transport is often the limiting factor. Inspired by this challenge, a variety of new approaches to optimal transport has been proposed in recent years and along with these new methods comes the need for a meaningful comparison. In this paper, we introduce a benchmark for discrete optimal transport, called DOTmark, which is designed to serve as a neutral collection of problems, where discrete optimal transport methods can be tested, compared to one another, and brought to their limits on large-scale instances. It consists of a variety of grayscale images, in various resolutions and classes, such as several types of randomly generated images, classical test images and real data from microscopy. Along with the DOTmark we present a survey and a performance test for a cross section of established methods ranging from more traditional algorithms, such as the transportation simplex, to recently developed approaches, such as the shielding neighborhood method, and including also a comparison with commercial solvers.
- Open Access
Perfect Fingerprint Orientation Fields by Locally Adaptive Global Models
Fingerprint recognition is widely used for verification and identification in many commercial, governmental and forensic applications. The orientation field (OF) plays an important role at various processing stages in fingerprint recognition systems. OFs are used for image enhancement, fingerprint alignment, for fingerprint liveness detection, fingerprint alteration detection and fingerprint matching. In this paper, a novel approach is presented to globally model an OF combined with locally adaptive methods. We show that this model adapts perfectly to the 'true OF' in the limit. This perfect OF is described by a small number of parameters with straightforward geometric interpretation. Applications are manifold: Quick expert marking of very poor quality (for instance latent) OFs, high fidelity low parameter OF compression and a direct road to ground truth OFs markings for large databases, say. In this contribution we describe an algorithm to perfectly estimate OF parameters automatically or semi-automatically, depending on image quality, and we establish the main underlying claim of high fidelity low parameter OF compression.
Open AccessPerfect Fingerprint Orientation Fields by Locally Adaptive Global Models
Fingerprint recognition is widely used for verification and identification in many commercial, governmental and forensic applications. The orientation field (OF) plays an important role at various processing stages in fingerprint recognition systems. OFs are used for image enhancement, fingerprint alignment, for fingerprint liveness detection, fingerprint alteration detection and fingerprint matching. In this paper, a novel approach is presented to globally model an OF combined with locally adaptive methods. We show that this model adapts perfectly to the 'true OF' in the limit. This perfect OF is described by a small number of parameters with straightforward geometric interpretation. Applications are manifold: Quick expert marking of very poor quality (for instance latent) OFs, high fidelity low parameter OF compression and a direct road to ground truth OFs markings for large databases, say. In this contribution we describe an algorithm to perfectly estimate OF parameters automatically or semi-automatically, depending on image quality, and we establish the main underlying claim of high fidelity low parameter OF compression.
- Open Access
Simultaneous Inpainting and Denoising by Directional Global Three-part Decomposition: Connecting Variational and Fourier Domain Based Image Processing
We consider the very challenging task of restoring images (i) which have a large number of missing pixels, (ii) whose existing pixels are corrupted by noise and (iii) the ideal image to be restored contains both cartoon and texture elements. The combination of these three properties makes this inverse problem a very difficult one. The solution proposed in this manuscript is based on directional global three-part decomposition (DG3PD) [ThaiGottschlich2016] with directional total variation norm, directional G-norm and $\ell_\infty$-norm in curvelet domain as key ingredients of the model. Image decomposition by DG3PD enables a decoupled inpainting and denoising of the cartoon and texture components. A comparison to existing approaches for inpainting and denoising shows the advantages of the proposed method. Moreover, we regard the image restoration problem from the viewpoint of a Bayesian framework and we discuss the connections between the proposed solution by function space and related image representation by harmonic analysis and pyramid decomposition.
Open AccessSimultaneous Inpainting and Denoising by Directional Global Three-part Decomposition: Connecting Variational and Fourier Domain Based Image Processing
We consider the very challenging task of restoring images (i) which have a large number of missing pixels, (ii) whose existing pixels are corrupted by noise and (iii) the ideal image to be restored contains both cartoon and texture elements. The combination of these three properties makes this inverse problem a very difficult one. The solution proposed in this manuscript is based on directional global three-part decomposition (DG3PD) [ThaiGottschlich2016] with directional total variation norm, directional G-norm and $\ell_\infty$-norm in curvelet domain as key ingredients of the model. Image decomposition by DG3PD enables a decoupled inpainting and denoising of the cartoon and texture components. A comparison to existing approaches for inpainting and denoising shows the advantages of the proposed method. Moreover, we regard the image restoration problem from the viewpoint of a Bayesian framework and we discuss the connections between the proposed solution by function space and related image representation by harmonic analysis and pyramid decomposition.
- Open Access
- 4 February 2016
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 11 (2) , e0148552
Convolution Comparison Pattern: An Efficient Local Image Descriptor for Fingerprint Liveness Detection
We present a new type of local image descriptor which yields binary patterns from small image patches. For the application to fingerprint liveness detection, we achieve rotation invariant image patches by taking the fingerprint segmentation and orientation field into account. We compute the discrete cosine transform (DCT) for these rotation invariant patches and attain binary patterns by comparing pairs of two DCT coefficients. These patterns are summarized into one or more histograms per image. Each histogram comprises the relative frequencies of pattern occurrences. Multiple histograms are concatenated and the resulting feature vector is used for image classification. We name this novel type of descriptor convolution comparison pattern (CCP). Experimental results show the usefulness of the proposed CCP descriptor for fingerprint liveness detection. CCP outperforms other local image descriptors such as LBP, LPQ and WLD on the LivDet 2013 benchmark. The CCP descriptor is a general type of local image descriptor which we expect to prove useful in areas beyond fingerprint liveness detection such as biological and medical image processing, texture recognition, face recognition and iris recognition, liveness detection for face and iris images, and machine vision for surface inspection and material classification.
- 4 February 2016
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 11 (2) , e0148552
Open AccessConvolution Comparison Pattern: An Efficient Local Image Descriptor for Fingerprint Liveness Detection
We present a new type of local image descriptor which yields binary patterns from small image patches. For the application to fingerprint liveness detection, we achieve rotation invariant image patches by taking the fingerprint segmentation and orientation field into account. We compute the discrete cosine transform (DCT) for these rotation invariant patches and attain binary patterns by comparing pairs of two DCT coefficients. These patterns are summarized into one or more histograms per image. Each histogram comprises the relative frequencies of pattern occurrences. Multiple histograms are concatenated and the resulting feature vector is used for image classification. We name this novel type of descriptor convolution comparison pattern (CCP). Experimental results show the usefulness of the proposed CCP descriptor for fingerprint liveness detection. CCP outperforms other local image descriptors such as LBP, LPQ and WLD on the LivDet 2013 benchmark. The CCP descriptor is a general type of local image descriptor which we expect to prove useful in areas beyond fingerprint liveness detection such as biological and medical image processing, texture recognition, face recognition and iris recognition, liveness detection for face and iris images, and machine vision for surface inspection and material classification.
- Open Access
Directional Global Three-part Image Decomposition
We consider the task of image decomposition and we introduce a new model coined directional global three-part decomposition (DG3PD) for solving it. As key ingredients of the DG3PD model, we introduce a discrete multi-directional total variation norm and a discrete multi-directional G-norm. Using these novel norms, the proposed discrete DG3PD model can decompose an image into two parts or into three parts. Existing models for image decomposition by Vese and Osher, by Aujol and Chambolle, by Starck et al., and by Thai and Gottschlich are included as special cases in the new model. Decomposition of an image by DG3PD results in a cartoon image, a texture image and a residual image. Advantages of the DG3PD model over existing ones lie in the properties enforced on the cartoon and texture images. The geometric objects in the cartoon image have a very smooth surface and sharp edges. The texture image yields oscillating patterns on a defined scale which is both smooth and sparse. Moreover, the DG3PD method achieves the goal of perfect reconstruction by summation of all components better than the other considered methods. Relevant applications of DG3PD are a novel way of image compression as well as feature extraction for applications such as latent fingerprint processing and optical character recognition.
Open AccessDirectional Global Three-part Image Decomposition
We consider the task of image decomposition and we introduce a new model coined directional global three-part decomposition (DG3PD) for solving it. As key ingredients of the DG3PD model, we introduce a discrete multi-directional total variation norm and a discrete multi-directional G-norm. Using these novel norms, the proposed discrete DG3PD model can decompose an image into two parts or into three parts. Existing models for image decomposition by Vese and Osher, by Aujol and Chambolle, by Starck et al., and by Thai and Gottschlich are included as special cases in the new model. Decomposition of an image by DG3PD results in a cartoon image, a texture image and a residual image. Advantages of the DG3PD model over existing ones lie in the properties enforced on the cartoon and texture images. The geometric objects in the cartoon image have a very smooth surface and sharp edges. The texture image yields oscillating patterns on a defined scale which is both smooth and sparse. Moreover, the DG3PD method achieves the goal of perfect reconstruction by summation of all components better than the other considered methods. Relevant applications of DG3PD are a novel way of image compression as well as feature extraction for applications such as latent fingerprint processing and optical character recognition.