• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.859-865
• /
• 2010

In this paper, a new method for finger vein recognition is proposed. Researchers are recently interested in the finger vein recognition since it is a good way to avoid the forgery in finger prints recognition and the inconveniences in obtaining images of the iris for iris recognition. The vein images are processed to obtain the line shaped vein images through the local histogram equalization and a thinning process. This thinned vein images are processed for matching, using a new matching algorithm, named HS(HeeSung) matching algorithm. This algorithm yields an excellent recognition rate when it is applied to the curve-linear images processed through a thinning or an edge detection. In our experiment with the finger vein images, the recognition rate has reached up to 99.20% using this algorithm applied to 650finger vein images(130person ${\times}$ 5images each). It takes only about 60 milliseconds to match one pair of images.

• Journal of Biomedical Engineering Research
• /
• v.25 no.1
• /
• pp.33-41
• /
• 2004

Accuracy of registration between images acquired from various medical image modalities is one of the critical issues in radiation treatment planing. In this study, a method of accuracy evaluation of image registration using a homemade brain phantom was investigated. Chamfer matching of CT-MR and CT-SPECT imaging was applied for the multimodal image registration. The accuracy of image correlation was evaluated by comparing the center points of the inserted targets of the phantom. The three dimensional root-mean-square translation deviations of the CT-MR and CT-SPECT registration were 2.1${\pm}$0.8 mm and 2.8${\pm}$1.4 mm, respectively. The rotational errors were ＜ 2$^{\circ}$ for the three orthogonal axes. These errors were within a reasonable margin compared with the previous phantom studies. A visual inspection of the superimposed CT-MR and CT- SPECT images also showed good matching results.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.519-525
• /
• 2006

The traditional area-based matching or efficient matching methods using epipolar geometry and height restriction of stereo images, which have a confined search space for image matching, have still some disadvantages such as mismatching and timeconsuming, especially in the dense metropolitan city that very high and similar buildings exist. To solve these problems, a new image matching method through building recognition has been presented. This paper described building recognition in color stereo images using edge and color information as a elementary study of new matching scheme. We introduce the modified Hausdorff distance for using edge information, and the modified color indexing with 3-D RGB histogram for using color information. Color information or edge information alone is not enough to find conjugate building pairs. For edge information only, building recognition rate shows 46.5%, for color information only, 7.1%. However, building recognition rate distinctly increase 78.5% when both information are combined.

• Journal of KIISE:Software and Applications
• /
• v.36 no.8
• /
• pp.623-632
• /
• 2009

In this paper, we propose a pulmonary nodule registration for the tracking of lung nodules in sequential CT scans. Our method consists of following five steps. First, a translational mismatch is corrected by aligning the center of optimal bounding volumes including each segmented lung. Second, coronal maximum intensity projection(MIP) images including a rib structure which has the highest intensity region in baseline and follow-up CT series are generated. Third, rigid transformations are optimized by normalized average density differences between coronal MIP images. Forth, corresponding nodule candidates are defined by Euclidean distance measure after rigid registration. Finally, template matching is performed between the nodule template in baseline CT image and the search volume in follow-up CT image for the nodule matching. To evaluate the result of our method, we performed the visual inspection, accuracy and processing time. The experimental results show that nodules in serial CT scans can be rapidly and correctly registered by coronal MIP-based rigid registration and local template matching.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.553-560
• /
• 2008

The amount of image data used in medical institution is increasing rapidly with great development of medical technology. Therefore, an automation method that use image processing description, rather than manual macrography of doctors, is required for the analysis large medical data. Specially, medical image registration, which is the process of finding the spatial transform that maps points from one image to the corresponding points in another image, and 3D analysis and visualization skills for a series of 2D images are essential technologies. However, a high establishment cost raise a budget problem, and hence small scaled hospitals hesitate importing these medical visualizing system. In this paper, we propose a visualization system which allows user to manage datasets and manipulates medical images registration using an open source graphics tool - VTK(Visualization Tool Kit). The propose of our research is to get more accurate 3D diagnosis system in less expensive price, compared to existing systems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.287-293
• /
• 2012

This paper presents an efficient image registration method by measuring the similarity, which is based on multi-dimensional intensity fluctuation. Multi-dimensional intensity which considers 4 directions of the image, is applied to reflect more properties in similarity decision. And an intensity fluctuation is also applied to measure comprehensively the similarity by considering a change in brightness between the adjacent pixels of image. The normalized cross-correlation(NCC) is calculated by considering an intensity fluctuation to each of 4 directions. The 5 correlation coefficients based on the NCC have been used to measure the registration, which are total NCC, the arithmetical mean and a simple product on the correlation coefficient of each direction and on the normalized correlation coefficient by the maximum NCC, respectively. The proposed method has been applied to the problem for registrating the 22 face images of 243*243 pixels and the 9 person images of 500*500 pixels, respectively. The experimental results show that the proposed method has a superior registration performance that appears the image properties well. Especially, the arithmetical mean on the correlation coefficient of each direction is the best registration measure.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1117-1122
• /
• 2001

Recently, issues on the internet searching of image information through various multimedia databases have drawn an tremendous attention and several researches on image information retrieval methods are on progress. By incorporating wavelet transform and correlation matrixes, we propose a novel and highly efficient feature vector extraction algorithm that has an capability of a robust similarity matching. The simulation results have yielded a faster and highly accurate candidate image retrieval performance in comparison to those of the conventional algorithms. Such an improved performance can be obtained because the used feature vectors were compressed to 256：1 while the correlation matrixes are incorporated to provide a fuel information for the better matching.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.175-183
• /
• 2004

In this paper, we propose a new accurate and robust image mosaic technique of the mural underdrawing taken from the infra-red camera, which is based on multiple image registration and adaptive blending technique. The image mosaicing methods which have been developed so far have the following deficits. It is hard to generate a high resolution image when there are regions that do not have features or intensity gradients, and there is a trade-off in overlapping region size in view of registration and blending. We consider these issues as follows. First, in order to mosaic images with neither noticeable features nor intensity gradients, we use a projected supplementary pattern and pseudo color image for features in the image pieces which are registered. Second, we search the overlapping region size with minimum blending error between two adjacent images and then apply blending technique to minimum error overlapping region. Finally, we could find our proposed method is more effective and efficient for image mosaicing than conventional mosaic techniques and also is more adequate for the application of infra-red mural underdrawing mosaicing. Experimental results show the accuracy and robustness of the algorithm

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.121-128
• /
• 2003

In this paper, we propose a new disparity estimation method called object based block matching algorithm(OBMA) for stereoscopic images which is able to reduce the blocking artifact. In the proposed algorithm, edge information of the given image is first extracted and then we estimate the disparity of each segmented object to remove the blocking artifact. In the experimental results, it is proven that the proposed algorithm has about the same performance as the old BMA algorithm while it achieves much better subjective quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.530-535
• /
• 2007

Disparity space image (DSI) technique is a method of establishing correspondence between a pair of images. It has a merit of generating a dense disparity map for each pixel. DSI has a cost function to be minimized, and it needs empirical weighting factors for occlusion penalty and match reward. This paper provides theoretical basis for the weighting factors, which depend on image noise and contrast between an object and background.