• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.400-407
• /
• 1995

The straightness property is one of fundamental geometric tolerances to be strictly controlled for guideways of machine tools and measuring machines. The staightness measurement for long guideways was usually difficult to perform, and it needed additional equipments or special treatment with limited application. In this paper, a new approach is proposed using the profile matching technique for the long guideways, which can be applicable to most of straghtness measurements. An edge of relativelly sthort length is located along a divided section of a long guideway, and the local straightness measurement is performed. The edge is then moved to the next section with several positions overlap. After thelocal straightness profile is measured for every section along the long guideway with overlap, the global straightness profile is constructed using the profile matching technique based on theleast squares method. The proposed techinique is numerically tested for two cases of known global straightness profile arc profile and irregular profile and those profiles with and without random error intervention, respectively. When norandom errors are involved, the constructed golval profile is identical to the original profile. When the random errors are involved, the effect of the number of overlap points are investigated, and it is also found that the difference between the difference between the constructed and original profiles is very close to the limit of random uncertainty with juist few overlap points. The developed technique has been practically applied to a vertical milling machine of moving table type, and showed good performance. Thus the accuracy and efficiency of the proposed method are demonstrated, and shows great potential for variety of application for most of straightness measuirement cases using straight edges, laser optics, and angular measurement equipments.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.2
• /
• pp.75-80
• /
• 2017

Recently, there has been growing interest in spatial data that combines information and communication technology with smart cities. The high-precision LiDAR (Light Dectection and Ranging) equipment is mainly used to collect three-dimensional spatial data, and the acquired data is also used to model geographic features and to manage plant construction and cultural heritages which require precision. The LiDAR equipment can collect precise data, but also has limitations because they are expensive and take long time to collect data. On the other hand, in the field of computer vision, research is being conducted on the methods of acquiring image data and performing 3D reconstruction based on image data without expensive equipment. Thus, precise 3D spatial data can be constructed efficiently by collecting and processing image data using CCTVs which are installed as infrastructure facilities in smart cities. However, this method can have an accuracy problem compared to the existing equipment. In this study, experiments were conducted and the results were analyzed to increase the number of extracted matching points by applying the feature-based method and the area-based method in order to improve the precision of 3D spatial data built with image data acquired from stereo CCTVs. For techniques to extract matching points, SIFT algorithm and PATCH algorithm were used. If precise 3D reconstruction is possible using the image data from stereo CCTVs, it will be possible to collect 3D spatial data with low-cost equipment and to collect and build data in real time because image data can be easily acquired through the Web from smart-phones and drones.

• Spatial Information Research
• /
• v.16 no.2
• /
• pp.193-206
• /
• 2008

If stereo images is used for Digital Elevation Model (DEM) generation, a DEM is generally made by matching left image against right image from stereo images. In stereo matching, tie-points are used as initial match candidate points. The number and distribution of tie-points influence the matching result. DEM made from matching result has errors such as holes, peaks, etc. These errors are usually interpolated by neighbored pixel values. In this paper, we propose the DEM generation method combined with automatic tie-points extraction using existing DEM, image pyramid, and interpolating new DEM using existing DEM for more reliable DEM. For test, we used IKONOS, QuickBird, SPOT5 stereo images and a DTED level 2 data. The test results show that the proposed method automatically makes reliable DEMs. For DEM validation, we compared heights of DEM by proposed method with height of existing DTED level 2 data. In comparison result, RMSE was under than 15 m.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.145-156
• /
• 2007

Recently, the needs for effective real time change detection algorithms for XML/HTML documents and increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real time change detection for large number of XML/HTML documents require fast heuristic algorithms to be used in real time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactory edit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff+ has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.10
• /
• pp.851-856
• /
• 2005

The DNA and protein data of diverse species have been daily discovered and deposited in the public archives according to each established format. Database systems in the public archives provide not only an easy-to-use, flexible interface to the public, but also in silico analysis tools of unidentified sequence data. Of such in silico analysis tools, multiple sequence alignment [1] methods relying on pairwise alignment and Smith-Waterman algorithm [2] enable us to identify unknown DNA, protein sequences or phylogenetic relation among several species. However, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST was combined with a clustering tool. Our clustering and annotating tool is summarized as the following steps: (1) construction of suffix tree; (2) masking of cross-matching pairs; (3) clustering of gene sequences and (4) annotating gene clusters by BLAST search. The system was successfully evaluated with 22 gene sequences in the pyrubate pathway of bacteria, clustering 7 clusters and finding out representative common subsequences of each cluster

• Journal of IKEEE
• /
• v.15 no.4
• /
• pp.274-280
• /
• 2011

The implementation of the recognition system of a vehicle license plate and the Linux OS environment which is built in SoC Embedded system and its test result are presented in this paper. In order to recognize a vehicle license plate, each character has to be extracted from the whole image of a license plate and the extracted image is revised for the template matching. Labeling technique and numerical features are used to detect the vehicle license plate. Each character in the license plate has coordinates. The extracted image is revised by comparison of the numerical coordinates and recognized through template matching method. The experimental results show that the license plate detection rate is 96%, and a character recognition rate is 73%, and a number recognition rate is 97% for about 300 license plate images. The average time of the recognition in the embedded board is 0.66 sec.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.57-65
• /
• 2007

In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

• Research in Community and Public Health Nursing
• /
• v.31 no.spc
• /
• pp.534-548
• /
• 2020

Purpose: This study was conducted to evaluate the prevalence and lifestyle habits of cardiovascular disease (CVD) according to the type of disability in Korean adults compared to adults without disability. Methods: This study was secondary data analysis using the National Health check-up database from 2010 to 2013. Among the total 395,627 adults aged 30~80, the physically disabled (n=21,614) and the mentally disabled (n=1,448) who met the diagnosis criteria were extracted and compared with non-disabled (n=372,565) through 1:2 propensity score matching for nine characteristics. Results: Prior to matching, the prevalence of CVD was 34.4% in individuals without disabilities, accounting for 53.8% in those with physical disabilities and 22.4% in those with mental disabilities, showing significant differences between groups (p<.001). After matching, compared to the individuals without disability, those with physically disabled had significantly higher prevalence of CVD and the average number of CVD (p<.001). The prevalence of hypertension, diabetes, and vascular disease was significantly higher in the physically disabled (p<.05). Drinking was significantly higher in the non-disabled than in the physically and mentally disabled, and smoking was more in the non-disabled than in the mentally disabled. Physical activity was found to be significantly less in both the physically and mentally disabled than in the non-disabled (p<.01). Conclusion: It is necessary to confirm the differences in the prevalence of CVD risk factors and lifestyle according to the type of disability, suggesting the development and verification of health promotion programs including physical activity for CVD prevention in the disabled with CVD risk factors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1051-1077
• /
• 2021

The secure communication of information is a major concern over the internet. The information must be protected before transmitting over a communication channel to avoid security violations. In this paper, a new hybrid method called compressed encrypted data embedding (CEDE) is proposed. In CEDE, the secret information is first compressed with Lempel Ziv Welch (LZW) compression algorithm. Then, the compressed secret information is encrypted using the Advanced Encryption Standard (AES) symmetric block cipher. In the last step, the encrypted information is embedded into an image of size 512 × 512 pixels by using image steganography. In the steganographic technique, the compressed and encrypted secret data bits are divided into pairs of two bits and pixels of the cover image are also arranged in four pairs. The four pairs of secret data are compared with the respective four pairs of each cover pixel which leads to sixteen possibilities of matching in between secret data pairs and pairs of cover pixels. The least significant bits (LSBs) of current and imminent pixels are modified according to the matching case number. The proposed technique provides double-folded security and the results show that stego image carries a high capacity of secret data with adequate peak signal to noise ratio (PSNR) and lower mean square error (MSE) when compared with existing methods in the literature.

• Journal of IKEEE
• /
• v.25 no.1
• /
• pp.25-31
• /
• 2021

The conventional credit card number recognition system generally needs a card to be placed in a designated location before its processing, which is not an ideal user experience especially for people with visual impairment. To improve the user experience, this paper proposes a novel algorithm that can automatically detect the location of a credit card number based on the fact that a group of sixteen digits has a fixed aspect ratio. The proposed algorithm first performs morphological operations to obtain multiple candidates of the credit card number with >4:1 aspect ratio, then recognizes the card number by testing each candidate via OCR and BIN matching techniques. Implemented with OpenCV and Firebase ML, the proposed scheme achieves 77.75% accuracy in the credit card number recognition task.