• Progress in Medical Physics
• /
• v.15 no.2
• /
• pp.70-76
• /
• 2004

The most important work for early detection of liver cancer and decision of its characteristic and location is good segmentation of a liver region from other abdominal organs. This paper proposes a fully automatic liver segmentation algorithm based on the abdominal morphology characteristic as an easy and efficient method. Multi-modal threshold as pre-processing is peformed and a spine is segmented for finding morphological coordinates of an abdomen. Then the liver region is extracted using C-class maximum a posteriori (MAP) decision and morphological filtering. In order to estimate results of the automatic segmented liver region, area error rate (AER) and correlation coefficients of rotational binary region projection matching (RBRPM) are utilized. Experimental results showed automatic liver segmentation obtained by the proposed algorithm provided strong similarity to manual liver segmentation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.1-6
• /
• 2019

One method for image recognition is template matching. In conventional template matching, the block matching algorithm (BMA) is performed while changing the two-dimensional translational displacement of the template within a given matching image. The template size and shape do not change during the BMA. Since only two-dimensional translational displacement is considered, the success rate decreases if the size and direction of the object do not match in the template and the matching image. In this paper, a variable is added to adjust the two-dimensional direction and size of the template, and the optimal value of the variable is automatically calculated in the block corresponding to each two-dimensional translational displacement. Using the calculated optimal value, the template is automatically transformed into an optimal template for each block. The matching error value of each block is then calculated based on the automatically deformed template. Therefore, a more stable result can be obtained for the difference in direction and size. For ease of use, this study focuses on designing the algorithm in a closed form that does not require additional information beyond the template image, such as distance information.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.126-136
• /
• 1998

One of the central problems in sereo matching is the selectionof the optimal window sizes for comparing image regions. The window size must be large enough to include enough variation for reliable matching, but small enough to avoid the effect of projection distortion. This paper discusses these problems with some novel algorithm based on iterativediffusion process at different disparity hypotheses. Also this paper proposes four kinds of diffusion algorithms to preseve discontinuity in stereo matching. We present and discuss extensive empirical results of algorithms based on various sets of synthetic and real image.

• Journal of Biomedical Engineering Research
• /
• v.29 no.6
• /
• pp.431-435
• /
• 2008

Quantitative information of a three dimensional(3D) kinematics of joint is very useful in knee joint surgery, understanding how knee kinematics related to joint injury, impairment, surgical treatment, and rehabilitation. In this paper, an automated 2D/3D image matching technique was developed to estimate the 3D in vivo knee kinematics using dual X-ray images. First, a 3D geometric model of the knee was reconstructed from CT scan data. The 3D in vivo position and orientation of femoral and tibial components of the knee joint could be estimated by minimizing the pixel by pixel difference between the projection images from the developed 3D model and the given X-ray images. The accuracy of the developed technique was validated by an experiment with a cubic phantom. The present 2D/3D image matching technique for the estimation of in vivo joint kinematics could be useful for pre-operative planning as well as post-operative evaluation of knee surgery.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.261-268
• /
• 2007

In this paper, We propose a new technique extract efficiently a car number plate based on edge projection. In order to obtain the region of car number plate, we use a motive that the luminance differences between the number plate background and characters. And, we introduce a projection technique to obtain character parts based on edge image. In vertical direction. we propose a shape matching method. Specially the new number plate standard has more characters than the old one in horizontal direction and, it is efficiently used to extract the number plate. Therefore, the proposed technique is useful to the new number plate standard. In simulation results. We have illustrated that our algorithm can recognize different number plates with a success ration of 90%.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.435-442
• /
• 2018

This study implemented an FPGA-based system to extract PCB defect patterns. The FPGA-based system can perform pattern matching at high speed for vision automation. An image processing library that is used to extract defect patterns was also implemented in IPs to optimize the system. The IPs implemented are Camera Link IP, Histogram IP, VGA IP, Horizontal Projection IP and Vertical Projection IP. In terms of hardware, the FPGA chip from the Vertex-5 of Xilinx was used to receive and handle images that are sent from a digital camera. This system uses MicroBlaze CPU. The image results are sent to PC and displayed on a 7inch TFT-LCD and monitor.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.209-210
• /
• 2007

Obtained disparity map from the stereo camera by using the several stereo matching algorithms carries lots of noise because of various causes. In our approach, mode filtering and noise elimination technique using the histogram and projection-based region merging methods are adopted for improving the quality of disparity map and image segmentation. The proposed algorithms are implemented in VHDL and the real-time experimentation shows the accurately divided objects.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.630-638
• /
• 2016

In this paper, a feature based panorama image generation algorithm using FAST(Features from Accelerated Segment Test) method that is faster than SIFT(Scale Invariant Feature Transform) and SURF(Speeded Up Robust Features) is proposed. Cylindrical projection is performed to generate natural panorama images with numerous images as input. The occurred error can be minimized by applying RANSAC(Random Sample Consensus) for the matching process. When we synthesize numerous images acquired from different camera angles, we use blending techniques to compensate the distortions by the heterogeneity of border line. In that way, we could get more natural synthesized panorama image. The proposed algorithm can generate natural panorama images regardless the order of input images and tilted images. In addition, the image matching can be faster than the conventional method. As a result of the experiments, distortion was corrected and natural panorama image was generated.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.446-449
• /
• 2009

In this paper, we present a novel method for reconstructing a super-resolution image using multi-view low-resolution images captured for depth varying scene without requiring complex analysis such as depth estimation and feature matching. The proposed method is based on the iterative back projection technique that is extended to the 3D volume domain (i.e., space + depth), unlike the conventional superresolution methods that handle only 2D translation among captured images.