• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.586-594
• /
• 2003

X-Match algorithm is a lossless compression algorithm suitable for hardware implementation owing to its simplicity. It can compress 32 bits per clock cycle and is suitable for real time compression. However, as the bus width increases 64-bit, the compression unit also need to increase. This paper proposes the cooperative parallel X-Match (X-MatchCP) algorithm, which improves the compression speed by performing the two X-Match algorithms in parallel. It searches the all dictionary for two words, combines the compression codes of two words generated by parallel X-Match compression and outputs the combined code while the previous parallel X-Match algorithm searches an individual dictionary. The compression ratio in X-MatchCP is almost the same as in X-Match. X-MatchCP algorithm is described and simulated by Verilog hardware description language.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.976-978
• /
• 2004

Chaining 알고리즘은 주어진 match 정보로부터 좋은 match 조합을 찾아내는 일종의 alignment 알고리즘으로 유전체 서열을 비교하는데 다양하게 응용되고 있다. 특히 서열 전체를 비교하는 대신 부분 서열을 비교할 때 사용할 수 있는 local chaining 알고리즘이 제안되었는데 본 논문은 이 기본적인 알고리즘이 Smith-waterman 알고리즘과 유사하며 따라서 비슷한 단점을 가지고 있음을 지적한다. 그리고 이를 해결하기 위해 X-drop과 정규화 된 정수를 고려하는 두 가지 기법을 적용하고 실험을 통해 개선 효과를 보인다.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.305-310
• /
• 2010

In this paper, we propose a heuristic algorithm for motion correspondence based on a point series similarity. A point series is a sequence of points which are sorted in the ascending order of their x-coordinate values. The proposed algorithm clusters the points of a previous frame based on their local adjacency. For each group, we construct several potential point series by permuting the points in it, each of which is compared to the point series of the following frame in order to match the set of points through their similarity based on a proximity constraint. The longest common subsequence between two point series is used as global information to resolve the local ambiguity. Experimental results show an accuracy of more than 90% on two image sequences from the PETS 2009 and the CAVIAR data sets.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.4
• /
• pp.77-89
• /
• 2024

Knee osteoarthritis (OA) is a very common musculoskeletal disorder worldwide. The assessment of knee osteoarthritis, which requires a rapid and accurate initial diagnosis, is determined to be different depending on the currently dispersed classification system, and each classification system has different criteria. Also, because the medical staff directly sees and reads the X-ray pictures, it depends on the subjective opinion of the medical staff, and it takes time to establish an accurate diagnosis and a clear treatment plan. Therefore, in this study, we designed the stenosis length measurement algorithm and Osteophyte detection and length measurement algorithm, which are the criteria for determining the knee osteoarthritis grade, separately using CNN, which is a deep learning technique. In addition, we would like to create a grading system that integrates and complements the existing classification system and show results that match the judgments of actual medical staff. Based on publicly available OAI (Osteoarthritis Initiative) data, a total of 9,786 knee osteoarthritis data were used in this study, eventually achieving an Accuracy of 69.8% and an F1 score of 76.65%.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.244-260
• /
• 2007

The operator LIKE of the database language SQL is a string pattern search operator. By providing the string pattern, the operator can identify column values that match with the string pattern. As a phonetic symbol, each Korean syllable is composed either of a leading sound and a medial sound or of a leading sound, a medial sound, and a trailing sound. As a search pattern of Korean syllables of the operator LIKE, in addition to the traditional Korean search pattern, this paper proposes a new search pattern that is based on leading sounds and medial sounds of Korean. With the new Korean search pattern, Korean syllables having specific leading sounds, specific medial sounds, or both specific leading sounds and medial sounds can be found. Formulating predicates equivalent with the new Korean search pattern by way of existing SQL operators is cumbersome and might cause the portability problem of applications depending on the underlying character set of the DBMS. This paper presents algorithms for the execution of the operator LIKE considering the new Korean search pattern based on the characters that are represented in KS X 1001, which is a Korean standard code for information interchange of Korean and Chinese.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.13 no.4
• /
• pp.152-159
• /
• 2005

The method of induction noise reduction can be classified by using passive control or active control method. However, the passive control method has a demerit to reduce the effect of noise reduction to low frequency (below) 500Hz) range and to be limited in a space of the engine room. Whereas, the active control method can overcome the demerit of passive control method. The algorithm of active control is mostly used in LMS (Least-Mean-Square) algorithm because it can obtain the complex transfer function easily in real-time. Especially, Filtered-X LMS (FXLMS) algorithm is applied to an ANC system. However, the convergence performance of LMS algorithm could not match if the FXLMS algorithm is applied to an active control of the induction noise under rapidly accelerated driving conditions. So, in order to solve the problem in this study, the Moving Bandpass Filter(MBPF) was proposed and implemented. The ANC using MBPF for the reduction of the induction noise shows that more noise reduction as 4dB than without MBPF.

• Journal of Cadastre & Land InformatiX
• /
• v.51 no.1
• /
• pp.67-77
• /
• 2021

Spatial data is becoming very important as a medium that connects various data produced in smart cities, digital twins, autonomous driving, smart construction, and other applications. In addition, the rapid construction and update of spatial information is becoming a hot topic to satisfy the diverse needs of consumers in this field. This study developed a software prototype that can match the position of an image-based 3D building model produced without Ground Control Points using existing spatial data. As a result of applying this software to the test area, the 3D building model produced based on the image and the existing spatial data show a high positional matching rate, so that it can be widely used in applications requiring the latest 3D spatial data.