• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.581-588
• /
• 2008

Old films or photographs usually have damages from physical or chemical effects, and the damage and digitalization make stain, scratch, scribbling, noise, and digital drop out in frames. Damages include global damage and local damage, and it is well known that local damage restoration is a main factor for improving image quality. Previous researches have focused on impairment localization (esp. for line scratch impairments) and restoration techniques for line scratch, dirt, blob, and intentional scratch. Inpainting is a key technique using partial derivatives to restore damages in images. It does not show good quality for the complex images because it is based on finite order for partial derivatives, and it takes much time complexity. In this paper, we present a modified inpainting scheme, where we use Sobel edge operator's and angle to compute isophotes, and compare our scheme with Bertalmio's scheme. We experiment our scheme with two old Korean films, and Simulation results show that our scheme requires smaller time complexity than Bertalmio's scheme with comparable reconstructed image quality.

• Nuclear Engineering and Technology
• /
• v.5 no.4
• /
• pp.310-320
• /
• 1973

The sorption and fixation of cesium in dilute solutions by vermiculite saturated with Na or K were studied in order to investigate any possibibty of its use in radioactive effluent treatment. The cesium sorbed by vermiculite with the increase in pH is attributed to the increase of sorption surface as a result of the dispersion. The increased cesium sorption by Na-vermiculite is due to the different sorption rates by the different exchange sites : external surface and internal surface. It is shown that the larger amount of sorbed cesium was extracted by KCI rather than with any other extractants. It is suggested that the fixation of cesium by vermiculite occurs at the crystal edge where Cs may replace K. Domestic vermiculite is a valuable material for use in the cesium sorption and fixation, and might be useful as a good packing material outside the tank of highly radioactive liquid waste. And from these results one could suggest that the artificial alteration of the biotite to vermiculite might be occurring by treating with NaCl.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.08a
• /
• pp.73-76
• /
• 2008

We present a area-based method for stereo matching using varying weights. A central problem in a area-based stereo matching is different result from selecting a window size. Most of the previous window-based methods iteratively update windows. However, the iterative methods very sensitive the initial disparity estimation and are computationally expensive. To resolve this problem, we proposed a new function to assign weights to pixels using features. To begin with, we extract features in a given stereo images based on edge. We adjust the weights of the pixels in a given window based on correlation of the stereo images. Then, we match pixels in a given window between the reference and target images of a stereo pair. The proposed method is compared to existing matching strategies using both synthetic and real images. The experimental results show the improved accuracy of the proposed method.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.347-357
• /
• 2002

Graphs have provided a powerful methodology to solve a lot of real-world problems, and therefore there have been many proposals on the graph representations and algorithms. But, because most of them considered only memory-based graphs, there are still difficulties to apply them to large-scale problems. To cope with the difficulties, this paper proposes a graph representation and graph algorithms based on the well-developed relational database theory. Graphs are represented in the form of relations which can be visualized as relational tables. Each vertex and edge of a graph is represented as a tuple in the tables. Graph algorithms are also defined in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. We also developed a library of basic graph operations for the management of graphs and the development of graph applications. This database approach provides an efficient methodology to deal with very large- scale graphs, and the graph library supports the development of graph applications. Furthermore, it has many advantages such as the concurrent graph sharing among users by virtue of the capability of database.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.939-948
• /
• 2004

In this paper. we Propose a robust and fast image registration technique for motion correction in brain CT-CT angiography obtained from same patient to be taken at different time. First, the feature points of two images are respectively extracted by 3D edge detection technique, and they are converted to locally weighted 3D distance map in reference image. Second, we search the optimal location whore the cross-correlation of two edges is maximized while floating image is transformed rigidly to reference image. This optimal location is determined when the maximum value of cross-correlation does't change any more and iterates over constant number. Finally, two images are registered at optimal location by transforming floating image. In the experiment, we evaluate an accuracy and robustness using artificial image and give a visual inspection using clinical brain CT-CT angiography dataset. Our proposed method shows that two images can be registered at optimal location without converging at local maximum location robustly and rapidly by using locally weighted 3D distance map, even though we use a few number of feature points in those images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11C
• /
• pp.1518-1526
• /
• 2004

In this paper, an algorithm using wavelet transform for detecting a cut that is a radical scene transition point, and fade and dissolve that are gradual scene transition points is proposed. The conventional methods using wavelet transform for this purpose is using features in both spatial and frequency domain. But in the proposed algorithm, the color space of an input image is converted to YUV and then luminance component Y is transformed in frequency domain using 2-level lifting. Then, the histogram of only low frequency subband that may contain some spatial domain features is compared with the previous one. Edges obtained from other higher bands can be divided into global, semi-global and local regions and the histogram of each edge region is compared. The experimental results show the performance improvement of about 17% in recall and 18% in precision and also show a good performance in fade and dissolve detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.925-932
• /
• 2012

In this paper, we develop a pattern recognition algorithm applied to a humanoid robot which is exploited as a guide for visually handicapped persons to find a desired path to their destinations. Behavior primitives of a humanoid robot are defined, and Canny's edge detection algorithm is employed to extract the pattern and color of the paving blocks that especially devised for visually handicapped persons. Based on these, an efficient path finding algorithm is developed and implemented on a humanoid robot, running on an embedded linux operating system equipped with a video camera. The performance of our algorithm is experimentally examined in terms of the response time and the pattern recognition ratio. In order to validate our algorithm in various realistic environments, the experiments are repeatedly performed by changing the tilt of paving blocks and the brightness in surrounding area. The results show that our algorithm performs sufficiently well to be exploited as a path finding system for visually handicapped persons.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.17-25
• /
• 2012

In this paper, we propose a method of producing a stereoscopic image from multiple images captured from a monoscopic camera. By translating a camera in the horizontal direction, left and right images are chosen among N captured images. For this, image edges are extracted and a rotational angle is estimated from edge orientation. Also, a translational vector is also estimated from the correlation of projected image data. Then, two optimal images are chosen and subsequently compensated using the rotational angle as well as the translational vector in order to make a satisfactory stereoscopic image. The proposed method was performed on thirty-two test image set. The subjective visual fatigue test was carried out to validate the 3D quality of stereoscopic images. In terms of visual fatigue, the 3D satisfaction ratio reached approximately 84%.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.331-337
• /
• 2020

The study is underway with the goal of developing an app that will replace vernier calipers using a smartphone's high-performance camera. The specifications of the camera mounted on recent smart phones have evolved so that usually has a 12 Mpixels of image sensor and its size of the pixel is 1.4㎛ and the size of the image sensor is 1 / 2.55 in. The proposed algorithm will apply to develop a precision measuring application that will compete with the Vernier calipers. Most existing applications cannot guarantee an accuracy in scale because the scale of the ruler displayed on the image is unclear or the size of the measurement object varies depending on the distance between the camera and the measurement object. In addition, another accurate measuring tools using lasers are also available, but they are limited because they are expensive. Therefore, if easy-to-carry and precise applications are developed, it is possible to substitute existing measurement tools. The proposed correction algorithm is an algorithm that automatically corrects the distorted source image using the shape and size information of the known template. The e-calipers are applications that display the distance when the area to be measured is specified in the corrected image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1925-1936
• /
• 2010

In this paper, multi-legged robot was designed and produced using stable walking pattern algorithm. The robot had embedded camera and wireless communication function and it is possible to recognize both hand posture and obstacles. The algorithm decided moving paths, and recognized and avoided obstacles through Hough Transform using Edge Detection of inputed image from image sensor. The robot can be controlled by hand posture using Mahalanobis Distance and average value of skin's color pixel, which is previously learned in order to decide the destination. The developed system has shown obstacle detection rate of 96% and hand posture recognition rate of 94%.