• Journal of the Korea Society of Computer and Information
• /
• v.18 no.12
• /
• pp.65-73
• /
• 2013

As the advent of the digital age, documents are often scanned to be archived or to be transmitted over the network. The largest proportion of documents is texts and the next is seal images indicating the author of the documents. While a lot of research has been conducted to recognize texts in scanned documents and commercialized text recognizing products are developed as highlighted the importance of the scanned document, information about seal images is discarded. In this paper, we study how to extract the seal image area from the color or black and white document containing the seal image and how to save the seal image. We propose a preprocessing step to remove other components except for the candidate outlines of the seal imprint from scanned documents and a method to select the final region of interest from these candidates by using the feature of seal images. Also in case of a seal imprint overlapped with texts, the most similar image among those stored in the database is selected through the template matching process. We verify the implemented system for a various type of documents produced in schools and analyze the results.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.327-340
• /
• 2009

To achieve the noise reduction effect in boundary image matching, we use the moving average transform of time-series matching. Our motivation is based on an intuition that using the moving average transform we may exploit the noise reduction effect in boundary image matching as in time-series matching. To confirm this simple intuition, we first propose $\kappa$-order image matching, which applies the moving average transform to boundary image matching. A boundary image can be represented as a sequence in the time-series domain, and our $\kappa$-order image matching identifies similar images in this time-series domain by comparing the $\kappa$-moving average transformed sequences. Next, we propose an index-based matching method that efficiently performs $\kappa$-order image matching on a large volume of image databases, and formally prove the correctness of the index-based method. Moreover, we formally analyze the relationship between an order $\kappa$ and its matching result, and present a systematic way of controlling the noise reduction effect by changing the order $\kappa$. Experimental results show that our $\kappa$-order image matching exploits the noise reduction effect, and our index-based matching method outperforms the sequential scan by one or two orders of magnitude.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.392-398
• /
• 2017

The point-cloud representation of an object is performed by scanning a space through a laser scanner that is extracting a set of points, and the points are then integrated into the same coordinate system through a registration. The set of the completed registration-integrated point clouds is classified into meaningful regions, shapes, and noises through a mathematical analysis. In this paper, the aim is the matching of a curved area like a cylinder shape in 3D point-cloud data. The matching procedure is the attainment of the center and radius data through the extraction of the cylinder-shape candidates from the sphere that is fitted through the RANdom Sample Consensus (RANSAC) in the point cloud, and completion requires the matching of the curved region with the Catmull-Rom spline from the extracted center-point data using the Principal Component Analysis (PCA). Not only is the proposed method expected to derive a fast estimation result via linear and curved cylinder estimations after a center-axis estimation without constraint and segmentation, but it should also increase the work efficiency of reverse engineering.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.42-55
• /
• 2006

We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.

• Convergence Security Journal
• /
• v.9 no.4
• /
• pp.21-27
• /
• 2009

In the environment of development of network bandwidth and intrusion technology there is limit to the pattern analysis of all massed packets through the existing pattern matching method by the intrusion detection system. To detect the packets efficiently when they are received fragmented, it has been presented the matching method only the pattern of packets consisting with the operation system such as Esnort. Pattern matching performance is improved through the use of NMAP, the basic mechanism od Esnort, by scanning the operation system of the same network system and appling pattern match selectively scanned information and the same operation system as the received packets. However, it can be appeared the case of disregarding the receivied packets depending on the diversity of the kind of operation systems and recognition mistake of operation system of nmap. In this paper, we present and verify the improved intrusion detection system shortening the pattern matching time by the creation of hashy table through the pattern hash of intrusion detection system independently with the users system environment .in the state of flux.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1583-1590
• /
• 2011

As the existing radiation scanning systems use 2-dimensional radiation scanned images, the low accuracy has been pointed out as a problem of it. This research analyzes the applicability of the stereo image processing technique to X-ray scanned images. Two 2-dimensional radiation images which have different disparity values are acquired from a newly designed stereo image acquisition system which has one additional line sensor to the conventional system. Using a matching algorithm the 3D reconstruction process which find the correspondence between the images is progressed. As the radiation image is just a density information of the scanned object, the direct application of the general stereo image processing techniques to it is inefficient. To overcome this limitation of a stereo image processing in radiation area, we reconstruct 3-D shapes of the edges of the objects. Also, we proposed a new volume based 3D reconstruction algorithm. Experimental results show the proposed new volume based reconstruction technique can provide more efficient visualization for cargo inspection. The proposed technique can be used for such objects which CT or MRI cannot inspect due to restricted scan environment.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.134-142
• /
• 2006

In this paper, we investigate a Hausdorff distance, which is used for the measurement of image similarity, to see whether it is also effective for document retrieval. The proposed method uses a local crowdedness and a Hausdorff distance to locate text images by determining whether a pair of images scanned at different time comes from the same text or not. To reduce the processing time, which is one of the disadvantages of a Hausdorff distance algorithm, we adopt a local crowdedness for feature point extraction. We apply the proposed method to 190 pairs of the same class and 190 pairs of the different class collected from postal envelop images. The results show that the modified Hausdorff distance proposed in this paper performed well in locating the tort region and calculating the degree of similarity between two images. An improvement of accuracy by 2.7% and 9.0% has been obtained, compared to a binary correlation method and the original Hausdorff distance method, respectively.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.10
• /
• pp.1551-1560
• /
• 1997

This study is devoted to the detection of the 3-dimensional point obstacles on the plane by using accumulated scan line images. The proposed accumulating only one scan line allow to process image at real time. And the change of motion of the feature in image is small because of the short time between image frames, so it does not take much time to track features. To obtain recursive optimal obstacles position and robot motion along to the motion of camera, Kalman filter algorithm is used. After using Kalman filter in case of the fixed environment, 3-dimensional obstacles point map is obtained. The position and motion of moving obstacles can also be obtained by pre-segmentation. Finally, to solve the stereo ambiguity problem from multiple matches, the camera motion is actively used to discard mis-matched features. To get relative distance of obstacles from camera, parallel stereo camera setup is used. In order to evaluate the proposed algorithm, experiments are carried out by a small test vehicle.

• Korean Journal of Construction Engineering and Management
• /
• v.22 no.3
• /
• pp.40-51
• /
• 2021

MLS (Mobile Laser Scanning) which is a scanning method done by moving the LiDAR (Light Detection and Ranging) is widely employed to capture indoor PCD (Point Cloud Data) for floor plan generation in the AEC (Architecture, Engineering, and Construction) industry. The movement and rotation of LiDAR in the scanning phase cause deformation (i.e. skew) of PCD and impose a significant impact on quality of output. Thus, a de-skewing method is required to increase the accuracy of geometric representation. De-skewing methods which use position and pose information of LiDAR collected by IMU (Inertial Measurement Unit) have been mainly developed to refine the PCD. However, the existing methods have limitations on de-skewing PCD without IMU. In this study, a novel algorithm for de-skewing 2D PCD captured from MLS without IMU is presented. The algorithm de-skews PCD using scan matching between points captured from adjacent scan positions. Based on the comparison of the deskewed floor plan with the benchmark derived from TLS (Terrestrial Laser Scanning), the performance of proposed algorithm is verified by reducing the average mismatched area 49.82%. The result of this study shows that the accurate floor plan is generated by the de-skewing algorithm without IMU.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.559-566
• /
• 2008

In this paper, we propose a range subsequence matching under dynamic time warping (DTW) distance. We exploit Dual Match, which divides data sequences into disjoint windows and the query sequence into sliding windows. However, Dual Match is known to work under Euclidean distance. We argue that Euclidean distance is a fragile distance, and thus, DTW should be supported by Dual Match. For this purpose, we derive a new important theorem showing the correctness of our approach and provide a detailed algorithm using the theorem. Extensive experimental results show that our range subsequence matching performs much better than the sequential scan algorithm.