• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.10
• /
• pp.194-202
• /
• 1999

A method for pattern recognition based on wavelet transform is proposed in this paper. The boundary of the object to be recognized includes shape information for object of machine parts. The contour is first represented using a one-dimensional signal and normalized about translation, rotation and scale, then is used to build the wavelet transform representation of the object. Wavelets allow us to decompose a function into multi-resolution hierarchy of localized frequency bands. The recognition of 2-dimensional object based on the wavelet is described to analyze the shape of analysis technique; the discrete wavelet transform(DWT). The feature vectors obtained using wavelet analysis is classified using a multi-layer neural network. The results show that, compared with the use of fourier descriptors, recognition using wavelet is more stable and efficient representation. And particularly the performance for objects corrupted with noise is better than that of other method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.55-57
• /
• 2005

최근 들어 PDA, 스마트카드, 휴대폰, MP3 플레이어 등과 같은 이동 컴퓨팅 장치의 데이터 저장소로 플래시 메모리를 많이 사용하고 있다. 이런 이동 컴퓨팅 장치의 데이터를 효율적으로 삽입$\cdot$삭제$\cdot$검색하기 위한 색인기법이 필요하다. 기존연구에서는 BFTL(B-Tree Flash Translation Layer)기법을 사용하여 플래시 메모리 상에 B-트리 구축 시 쓰기연산을 감소시켜 비용을 줄였지만, B-트리 검색비용과 하드웨어 구성비용이 증가한다는 단점을 가지고 있다. 본 논문에서는 기존 연구의 문제점을 개선하고 효율적으로 플래시 메모리상에 B-트리를 구현하기위해 BOF(B-Tree On Flash Memory)기법을 제안한다. 이 기법을 통해 BFTL 기법에 근접하는 구축비용을 얻을 수 있을 뿐만 아니라 상당한 검색비용을 줄일 수 있다. 또한 하드웨어적 비용도 고려하여 저비용으로 B-트리를 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.118-120
• /
• 2005

XML이 다양한 장점으로 인해 인터넷 기반 환경에서 데이터의 표현 및 교환의 표준으로 자리잡으면서 XML 데이터의 효율적인 저장 및 질의 처리에 대한 연구가 활발히 진행되었다. XML 데이터를 저장하는 방법 중에서 강력한 질의 처리 및 데이터 관리 기능을 제공하는 관계형 데이터베이스 시스템에 저장하는 것은 많은 이익을 가져온다. 그러나, 이 방법을 사용하기 위해서는 XML 질의를 SQL 질의로 변환해야 한다. 본 논문에서는 대표적인 XML 질의 언어인 XQuery 질의를 SQL:2003 질의로 변환하는 방법을 제안한다. 최근 XML 데이터와 관계형 데이터베이스의 상호 운용에 대한 요구가 증대되면서 SQL:1999를 대체하는 SQL:2003에는 XML을 지원하기 위한 표준을 포함하고 있으므로, SQL:2003을 지원하는 관계형 데이타베이스 시스템을 기반으로 한다면, XML 질의를 보다 쉽게 SQL 질의로 변환할 수 있다. 본 논문에서는 SQL 템플릿을 기반으로 XQucry 질의를 SQL 질의로 변환하는 방법을 제안한다.

• Annual Conference on Human and Language Technology
• /
• 1991.10a
• /
• pp.219-227
• /
• 1991

본 논문에서는 정보처리에 관한 일반 모형으로 제기된 안-밖 합치도원리 모형(김정호, 1986; Kim, 1986b, 1991)을 통해서 컴퓨터 용어의 효율적인 한글화를 위한 하나의 접근방법을 제시하였다. 안-밖 합치도는 인간의 정보처리 전반에 걸쳐서 인간이 주어진 환경에서 특정 정보를 구성함에 있어서 갖는 정보처리의 좋음 혹은 쉬움을 나타내는 개념이다. 여기서 중요한 것은 안-밖 합치도가 구성할 특정 정보에 상대적이라는 점이며 안-밖 합치도를 측정할 때에는 어떤 정보에 관심이 있는가의 목적을 명백히 해야 한다. 컴퓨터 용어의 효율적 한글화는 안-밖 합치도원리 모형의 관점에서 볼 때, 특정 목적을 위하여, 만들어진 한글 컴퓨터 용어와 그 용어의 사용자 간의 안-밖 합치도를 높이고자 하는 작업이라고 할 수 있다. 본 논문에서는 컴퓨터 용어의 한글화에 있어서 고려될 수 있는 목적들을 크게 경제적 목적, 문화적 목적, 및 심미적 목적 등으로 나누어 고찰하였다. 끝으로 각 목적에 따른 실제적인 연구방법을 소개하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.12
• /
• pp.653-659
• /
• 2001

In this paper, we propose an efficient algorithm for constructing cylindrical panoramic image. At first, we describe a fast image alignment algorithm, which matches image strips located on equal distance for image centers. And then, we explain how to estimate accurately the effective focal length of camera by a bisection method. Although there is a limitation in that the image should be taken by a camera with pure panning motion, the proposed simple and fast algorithm is applicable to practical application.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1171-1180
• /
• 1995

In this paper, we present a 3-D object recognition system in which the 3-D Hough transform domain is employed to represent the 3-D objects. In object modeling step, the features for recognition are extracted from the CAD models of objects to be recognized. Since the approach is based on the CAD models, the accuracy and flexibility are greatly improved. In matching stage, the sensed image is compared with the stored model, which is assumed to yield a distortion (location and orientation) in the 3-D Hough transform domain. The high dimensional (6-D) parameter space, which defines the distortion, is decomposed into the low dimensional space for an efficient recognition. At first we decompose the distortion parameter into the rotation parameter and the translation parameter, and the rotation parameter is further decomposed into the viewing direction and the rotational angle. Since we use the 3-D Hough transform domain of the input images directly, the sensitivity to the noise and the high computational complexity could be significantly alleviated. The results show that the proposed 3-D object recognition system provides a satisfactory performance on the real range images.

• Journal of Information Science Theory and Practice
• /
• v.3 no.1
• /
• pp.24-39
• /
• 2015

Pre-retrieval query formulation is an important step for identifying local text reuse. Local reuse with high obfuscation, paraphrasing, and translation poses a challenge of finding the reused text in a document. In this paper, three pre-retrieval query formulation strategies for heuristic retrieval in case of low obfuscated, high obfuscated, and translated text are studied. The strategies used are (a) Query formulation using proper nouns; (b) Query formulation using unique words (Hapax); and (c) Query formulation using most frequent words. Whereas in case of low and high obfuscation and simulated paraphrasing, keywords with Hapax proved to be slightly more efficient, initial results indicate that the simple strategy of query formulation using proper nouns gives promising results and may prove better in reducing the size of the corpus for post processing, for identifying local text reuse in case of obfuscated and translated text reuse.

• Bulletin of the Korean Chemical Society
• /
• v.22 no.8
• /
• pp.889-896
• /
• 2001

The reaction of gas-phase atomic bromine with highly covered chemisorbed hydrogen atoms on a silicon surface is studied by use of the classical trajectory approach. It is found that the major reaction is the formation of HBr(g), and it proceeds th rough two modes, that is, direct Eley-Rideal and hot-atom mechanism. The HBr formation reaction takes place on a picosecond time scale with most of the reaction exothermicity depositing in the product vibration and translation. The adsorption of Br(g) on the surface is the second most efficient reaction pathway. The total reaction cross sections are $2.53{\AA}2$ for the HBr formation and $2.32{\AA}2$ for the adsorption of Br(g) at gas temperature 1500 K and surface temperature 300 K.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.252-253
• /
• 2023

Container terminal automation might offer many potential benefits, such as increased productivity, reduced cost, and improved safety. Autonomous trucks can lead to more efficient container transport. A robust lane detection method is proposed using score-based generative modeling through stochastic differential equations for image-to-image translation. Image processing techniques are combined with Density-Based Spatial Clustering of Applications with Noise (DBSCAN) and Genetic Algorithm (GA) to ensure lane positioning robustness. The proposed method is validated by a dataset collected from the port terminals under different environmental conditions and tested the robustness of the lane detection method with stochastic noise.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.90-102
• /
• 2010

Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.