• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.700-707
• /
• 2013

In this paper, we propose a non-rigid registration method of lung parenchyma in temporal chest CT scans using region binarization modeling and locally deformable model. To cope with intensity differences between CT scans, we segment the lung vessel and parenchyma in each scan and perform binarization modeling. Then, we match them without referring any intensity information. We globally align two lung surfaces. Then, locally deformable transformation model is developed for the subsequent non-rigid registration. Subtracted quantification results after non-rigid registration are visualized by pre-defined color map. Experimental results showed that proposed registration method correctly aligned lung parenchyma in the full inspiration and expiration CT images for ten patients. Our non-rigid lung registration method may be useful for the assessment of various lung diseases by providing intuitive color-coded information of quantification results about lung parenchyma.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.49-57
• /
• 2010

In this thesis, We studied on hand-written character recognition, that characters entered into a digital input device and remove noise and separating character elements using preprocessing. And processed character images has done thinning and 3-level wavelet transform for making normalized image and reducing image data. The structural method among the numerical Hangul recognition methods are suitable for recognition of printed or hand-written characters because it is usefull method deal with distortion. so that method are applied to separating elements and analysing texture. The results show that recognition by analysing texture is easily distinguished with respect to consonants. But hand-written characters are tend to decreasing successful recognition rate for the difficulty of extraction process of the starting point, of interconnection of each elements, of mis-recognition from vanishing at the thinning process, and complexity of character combinations. Some characters associated with the separation process is more complicated and sometime impossible to separating elements. However, analysis texture of the proposed character recognition with the exception of the complex handwritten is aware of the character.

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

The main stream of presentation is interrupted because of the direct manipulation of their PC frequently so as to control the screen and file open and so on. A variety of products have been developed to solve these inconveniences of the conventional laser beam pointer [LBP] by simply adding a mouse function to the previous LBP. However. the LBPs fully supporting a mouse function are not yet appeared. In this paper. we developed the LBP fully fulfilling a mouse function using mono-camera as well as a robust image processing and analyzed the position detection accuracy. Finally we verified the developed LBP does not only fulfill a mouse function but also solve the defects of the current laser pointer such as inconvenient installation and Position detection errors due to the illumination and viewing direction changes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.7
• /
• pp.700-710
• /
• 2009

A computer vision technique of estimating the location of an unmanned ground vehicle is proposed. Identifying the location of the unmaned vehicle is very important task for automatic navigation of the vehicle. Conventional positioning sensors may fail to work properly in some real situations due to internal and external interferences. Given a DSM(Digital Surface Map), location of the vehicle can be estimated by the registration of the DSM and multiview range images obtained at the vehicle. Registration of the DSM and range images yields the 3D transformation from the coordinates of the range sensor to the reference coordinates of the DSM. To estimate the vehicle position, we first register a range image to the DSM coarsely and then refine the result. For coarse registration, we employ a fast random sample matching method. After the initial position is estimated and refined, all subsequent range images are registered by applying a pair-wise registration technique between range images. To reduce the accumulation error of pair-wise registration, we periodically refine the registration between range images and the DSM. Virtual environment is established to perform several experiments using a virtual vehicle. Range images are created based on the DSM by modeling a real 3D sensor. The vehicle moves along three different path while acquiring range images. Experimental results show that registration error is about under 1.3m in average.

• Journal of Digital Contents Society
• /
• v.10 no.4
• /
• pp.569-578
• /
• 2009

In this paper, we describe the color reproduction system for color images captured by digital camera. The system uses a color compensation chart to estimate the transformation between the colors in the image and the reference colors in the chart. The color reproduction process consists of two steps, i.e., the profile creation process and the profile application process. During the pro-file creation process, the relationships between the captured colors and the ref-erence colors are estimated. And the system creates a color profile and embeds the estimation result in the profile. During the profile application process, the colors in the images which are captured under the same condition as that of the chart image are reproduced using the created color profile. To evaluate the per-formance of the system, we perform experiments under various conditions. And we compare the results with those of widely used commercial applications.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.77-85
• /
• 2011

In this paper, we propose an region segmentation and texture based feature extraction method which split the pavement and roadway from the camera which equipped to the visually impaired person during a walk. We perform the hough transformation method for detect the boundary between pavement and roadway, and devide the segmented region into 3-level according to perspective. Next step, split into pavement and roadway according to the extracted texture feature of segmented regions. Our walking assistance system use rotation-invariant LBP and GLCM texture features for compare the characteristic of pavement block with various pattern and uniformity roadway. Our proposed method show that can segment two regions with illumination invariant in day and night image, and split there regions rotation and occlution invariant in complexed outdoor image.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.63-71
• /
• 1983

A dye-edge tracking algorithm was used to determine the corresponding points in the two images(anterior-posterior and lateral) of the digital subtraction biplane angiography. This correspondence was used to reconstruct three dimensional images of cerebral artery in a dog experiment. The method was tested by comparing the measured image of oblique view with the computed reconstructed image. For the present study, we have developed three new algorithms. The first algorithm is to determine the corresponding dye-edge points using the fact the dye density at the moving edge avows the same changing pattern in the two projection views. This moving pattern of dye-edge density is computed using a matching method of cross-correlation for the two sequential frames' dye density. The second algorithm is for simplified perspective transformation, and the third one is to identify the specific corresponding points on the small vessels. The present method can be applied to compute the blood velocity using the dye-edge displacement and the three- dimensional distance data.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.7
• /
• pp.656-665
• /
• 2015

In this paper, we improved the clarity and quality of the radar imaging by applying motion compensation for time-frequency transform in B-ISAR imaging. The proposed motion compensation algorithm using UWB radar is verified. B-ISAR algorithm procedure and time-frequency transform for improved motion compensation are provided for theoretical ground. The image was created by a UWB Radar B-ISAR imaging algorithm method. Also, creating a B-ISAR imaging algorithm for motion compensation of time-frequency transformation method was used. The B-ISAR Imaging algorithm is implemented using STFT(Short-Time Fourier Transform), GWT(Gabor Wavelet Transform), and WVD(Wigner-Ville Distribution) approaches. The performance of STFT is compared with the GWT and WVD algorithms. It is found that the WVD image shows more clarity and decreased spread phenomenon than other methods.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.380-388
• /
• 2000

In computing the optical flow, Horn and Schunck's method which is a representative algorithm is based on differentiation. Therefore it is difficult to estimate the velocity for a large displacement by this algorithm. In this paper, we propose a method for estimating nonuniform motion from sequential images which is based on integral brightness constancy constraints. The equations which transform a source image to a target image are expressed as a function of the displacement field. If marginal effects can be neglected, the form of the transformation integral transform or orthogonal expansion can be determined from the expansion coefficients of the two images. The apparent displacement field is then computed iteratively by a projection method which utilities the functional derivatives of the linearized moment equations. We demonstrate that the performance of the orthogonal function transform on the data set of large motion.

• Journal of Computing Science and Engineering
• /
• v.6 no.1
• /
• pp.1-11
• /
• 2012

Computed tomography (CT) images are widely used for the analysis of the temporal evaluation or monitoring of the progression of a disease. The follow-up examinations of CT scan images of the same patient require a 3D registration technique. In this paper, an automatic and robust registration is proposed for the rigid registration of 3D CT images. The proposed method involves two steps. Firstly, the two CT volumes are aligned based on their principal axes, and then, the alignment from the previous step is refined by the optimization of the similarity score of the image's voxel. Normalized cross correlation (NCC) is used as a similarity metric and a downhill simplex method is employed to find out the optimal score. The performance of the algorithm is evaluated on phantom images and knee synthetic CT images. By the extraction of the initial transformation parameters with principal axis of the binary volumes, the searching space to find out the parameters is reduced in the optimization step. Thus, the overall registration time is algorithmically decreased without the deterioration of the accuracy. The preliminary experimental results of the study demonstrate that the proposed method can be applied to rigid registration problems of real patient images.