The Experts below are selected from a list of 93588 Experts worldwide ranked by ideXlab platform
Hiroshi Nakajima - One of the best experts on this subject based on the ideXlab platform.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
a fingerprint recognition algorithm combining phase based Image Matching and feature based Matching
Lecture Notes in Computer Science, 2006Co-Authors: Ayumi Morita, Hiroshi Nakajima, Takafumi Aoki, Koji Kobayashi, Tatsuo HiguchiAbstract:, This paper proposes an efficient fingerprint recognition algorithm combining phase-based Image Matching and feature-based Matching. The use of Fourier phase information of fingerprint Images makes possible to achieve robust recognition for weakly impressed, low-quality fingerprint Images. Experimental evaluations using two different types of fingerprint Image databases demonstrate efficient recognition performance of the proposed algorithm compared with a typical minutiae-based algorithm and the conventional phase-based algorithm.
-
an efficient iris recognition algorithm using phase based Image Matching
International Conference on Image Processing, 2005Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Hiroshi NakajimaAbstract:A major approach for iris recognition today is to generate feature vectors corresponding to individual iris Images and to perform iris Matching based on some distance metrics. One of the difficult problems in feature-based iris recognition is that the Matching performance is significantly influenced by many parameters in feature extraction process, which may vary depending on environmental factors of Image acquisition. This paper presents an efficient algorithm for iris recognition using phase-based Image Matching. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of iris Images makes possible to achieve highly robust iris recognition in a unified fashion with a simple Matching algorithm. Experimental evaluation using an iris Image database clearly demonstrates an efficient Matching performance of the proposed algorithm.
-
an efficient iris recognition algorithm using phase based Image Matching
International Conference on Image Processing, 2005Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:A major approach for iris recognition today is to generate feature vectors corresponding to individual iris Images and to perform iris Matching based on some distance metrics. One of the difficult problems in feature-based iris recognition is that the Matching performance is significantly influenced by many parameters in feature extraction process, which may vary depending on environmental factors of Image acquisition. This paper presents an efficient algorithm for iris recognition using phase-based Image Matching. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of iris Images makes possible to achieve highly robust iris recognition in a unified fashion with a simple Matching algorithm. Experimental evaluation using an iris Image database clearly demonstrates an efficient Matching performance of the proposed algorithm.
Jane You - One of the best experts on this subject based on the ideXlab platform.
-
a wavelet based coarse to fine Image Matching scheme in a parallel virtual machine environment
IEEE Transactions on Image Processing, 2000Co-Authors: Jane You, Prabir BhattacharyaAbstract:We present a wavelet-based, high performance, hierarchical scheme for Image Matching which includes (1) dynamic detection of interesting points as feature points at different levels of subband Images via the wavelet transform, (2) adaptive thresholding selection based on compactness measures of fuzzy sets in Image feature space, and (3) a guided searching strategy for the best Matching from coarse level to fine level. In contrast to the traditional parallel approaches which rely on specialized parallel machines, we explored the potential of distributed systems for parallelism. The proposed Image Matching algorithms were implemented on a network of workstation clusters using parallel virtual machine (PVM). The results show that our wavelet-based hierarchical Image Matching scheme is efficient and effective for object recognition.
-
real time object recognition hierarchical Image Matching in a parallel virtual machine environment
International Conference on Pattern Recognition, 1998Co-Authors: Jane You, P Bhattaharya, S HungenahallyAbstract:This paper describes an approach to high performance Image Matching, which includes parallel feature detection and hierarchical Image Matching. To improve the performance of the traditional Image Matching algorithms, we adopted interesting points as feature points to reduce the redundant edge points and proposed a parallel guided Image Matching scheme by using Hausdorff distance. A series of experiments have been conducted and the results indicate the effectiveness of the proposed approach in terms of speed-up and Matching accuracy.
-
hierarchical Image Matching a chamfer Matching algorithm using interesting points
Intelligent Information Systems, 1995Co-Authors: Jane You, W P Zhu, Edwige E Pissaloux, Harvey A CohenAbstract:Image Matching in conjunction with a distance transform has played an important role in computer vision and Image analysis. This paper presents a new hierarchical chamfer Matching algorithm based on the detection of interesting points. The algorithm extends the traditional method by introducing interesting points to replace edge points in the distance transform for the Matching measurement. A series of Images, with different numbers of interesting points featuring in the original Image, is created in a pyramid structure through a dynamic thresholding scheme. The Matching is performed in this pyramid in a coarse-to-fine level order, by minimizing a given Matching criterion in terms of the distance between selected interesting points. This hierarchical structure aims to reduce the computational load. The algorithm is simple to implement and quite insensitive to noise and other disturbances. In addition, such a hierarchical Matching scheme is implemented on a low-cost heterogeneous PVM (Parallel Virtual Machine) network to speed up the processing without any specific software and hardware requirements.
Takafumi Aoki - One of the best experts on this subject based on the ideXlab platform.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
a fingerprint recognition algorithm combining phase based Image Matching and feature based Matching
Lecture Notes in Computer Science, 2006Co-Authors: Ayumi Morita, Hiroshi Nakajima, Takafumi Aoki, Koji Kobayashi, Tatsuo HiguchiAbstract:, This paper proposes an efficient fingerprint recognition algorithm combining phase-based Image Matching and feature-based Matching. The use of Fourier phase information of fingerprint Images makes possible to achieve robust recognition for weakly impressed, low-quality fingerprint Images. Experimental evaluations using two different types of fingerprint Image databases demonstrate efficient recognition performance of the proposed algorithm compared with a typical minutiae-based algorithm and the conventional phase-based algorithm.
-
a subpixel Image Matching technique using phase only correlation
International Symposium on Intelligent Signal Processing and Communication Systems, 2006Co-Authors: Sei Nagashima, Tatsuo Higuchi, Takafumi Aoki, Koji KobayashiAbstract:This paper presents a high-accuracy Image Matching technique using a Phase-Only Correlation (POC) function. The POC-based Image Matching enables estimation of Image displacements with 1/10~1/100-pixel accuracy by a function fitting technique using the closed-form representation of the POC function's peak. This method requires an iterative process for the nonlinear function fitting, resulting in long computation times. In this paper, we propose a Peak Evaluation Formula (PEF) that directly estimates the correlation peak location from actual 2-D data array of the POC function. Experimental evaluation shows that the proposed method reduces computation time without sacrificing Image Matching accuracy.
-
an efficient iris recognition algorithm using phase based Image Matching
International Conference on Image Processing, 2005Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Hiroshi NakajimaAbstract:A major approach for iris recognition today is to generate feature vectors corresponding to individual iris Images and to perform iris Matching based on some distance metrics. One of the difficult problems in feature-based iris recognition is that the Matching performance is significantly influenced by many parameters in feature extraction process, which may vary depending on environmental factors of Image acquisition. This paper presents an efficient algorithm for iris recognition using phase-based Image Matching. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of iris Images makes possible to achieve highly robust iris recognition in a unified fashion with a simple Matching algorithm. Experimental evaluation using an iris Image database clearly demonstrates an efficient Matching performance of the proposed algorithm.
Koji Kobayashi - One of the best experts on this subject based on the ideXlab platform.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
a fingerprint recognition algorithm combining phase based Image Matching and feature based Matching
Lecture Notes in Computer Science, 2006Co-Authors: Ayumi Morita, Hiroshi Nakajima, Takafumi Aoki, Koji Kobayashi, Tatsuo HiguchiAbstract:, This paper proposes an efficient fingerprint recognition algorithm combining phase-based Image Matching and feature-based Matching. The use of Fourier phase information of fingerprint Images makes possible to achieve robust recognition for weakly impressed, low-quality fingerprint Images. Experimental evaluations using two different types of fingerprint Image databases demonstrate efficient recognition performance of the proposed algorithm compared with a typical minutiae-based algorithm and the conventional phase-based algorithm.
-
a subpixel Image Matching technique using phase only correlation
International Symposium on Intelligent Signal Processing and Communication Systems, 2006Co-Authors: Sei Nagashima, Tatsuo Higuchi, Takafumi Aoki, Koji KobayashiAbstract:This paper presents a high-accuracy Image Matching technique using a Phase-Only Correlation (POC) function. The POC-based Image Matching enables estimation of Image displacements with 1/10~1/100-pixel accuracy by a function fitting technique using the closed-form representation of the POC function's peak. This method requires an iterative process for the nonlinear function fitting, resulting in long computation times. In this paper, we propose a Peak Evaluation Formula (PEF) that directly estimates the correlation peak location from actual 2-D data array of the POC function. Experimental evaluation shows that the proposed method reduces computation time without sacrificing Image Matching accuracy.
-
an efficient iris recognition algorithm using phase based Image Matching
International Conference on Image Processing, 2005Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Hiroshi NakajimaAbstract:A major approach for iris recognition today is to generate feature vectors corresponding to individual iris Images and to perform iris Matching based on some distance metrics. One of the difficult problems in feature-based iris recognition is that the Matching performance is significantly influenced by many parameters in feature extraction process, which may vary depending on environmental factors of Image acquisition. This paper presents an efficient algorithm for iris recognition using phase-based Image Matching. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of iris Images makes possible to achieve highly robust iris recognition in a unified fashion with a simple Matching algorithm. Experimental evaluation using an iris Image database clearly demonstrates an efficient Matching performance of the proposed algorithm.
Kazuyuki Miyazawa - One of the best experts on this subject based on the ideXlab platform.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
an effective approach for iris recognition using phase based Image Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:This paper presents an efficient algorithm for iris recognition using phase-based Image Matching - an Image Matching technique using phase components in 2D discrete Fourier transforms (DFTs) of given Images. Experimental evaluation using the CASIA iris Image databases (versions 1.0 and 2.0) and Iris challenge evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris Images makes it possible to achieve highly accurate iris recognition with a simple Matching algorithm. This paper also discusses the major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris Images, we introduce the idea of 2D Fourier phase code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art digital signal processing (DSP) technology.
-
an efficient iris recognition algorithm using phase based Image Matching
International Conference on Image Processing, 2005Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Hiroshi NakajimaAbstract:A major approach for iris recognition today is to generate feature vectors corresponding to individual iris Images and to perform iris Matching based on some distance metrics. One of the difficult problems in feature-based iris recognition is that the Matching performance is significantly influenced by many parameters in feature extraction process, which may vary depending on environmental factors of Image acquisition. This paper presents an efficient algorithm for iris recognition using phase-based Image Matching. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of iris Images makes possible to achieve highly robust iris recognition in a unified fashion with a simple Matching algorithm. Experimental evaluation using an iris Image database clearly demonstrates an efficient Matching performance of the proposed algorithm.
-
an efficient iris recognition algorithm using phase based Image Matching
International Conference on Image Processing, 2005Co-Authors: Kazuyuki Miyazawa, Takafumi Aoki, Koji Kobayashi, Koichi Ito, Hiroshi NakajimaAbstract:A major approach for iris recognition today is to generate feature vectors corresponding to individual iris Images and to perform iris Matching based on some distance metrics. One of the difficult problems in feature-based iris recognition is that the Matching performance is significantly influenced by many parameters in feature extraction process, which may vary depending on environmental factors of Image acquisition. This paper presents an efficient algorithm for iris recognition using phase-based Image Matching. The use of phase components in 2D (two-dimensional) discrete Fourier transforms of iris Images makes possible to achieve highly robust iris recognition in a unified fashion with a simple Matching algorithm. Experimental evaluation using an iris Image database clearly demonstrates an efficient Matching performance of the proposed algorithm.