• 전기전자학회논문지
• /
• 제18권2호
• /
• pp.291-297
• /
• 2014

Since hand gesture recognition was realized thanks to improved image processing algorithms, sign language translation has been a critical issue for the hearing-impaired. In this paper, we extract human hand figures from a real time image stream and detect gestures in order to figure out which kind of hand language it means. We used depth-color calibrated image from the Kinect to extract human hands and made a decision tree in order to recognize the hand gesture. The decision tree contains information such as number of fingers, contours, and the hand's position inside a uniform sized image. We succeeded in recognizing 'Hangul', the Korean alphabet, with a recognizing rate of 98.16%. The average execution time per letter of the system was about 76.5msec, a reasonable speed considering hand language translation is based on almost still images. We expect that this research will help communication between the hearing-impaired and other people who don't know hand language.

• 한국통신학회논문지
• /
• 제18권11호
• /
• pp.1735-1741
• /
• 1993

주파수 도약 다원접속 통신시스템에 사용될 수 있는 우수한 해밍자기상관성 및 타 상관성 그리고 긴주기를 갖는 새로운 주파수 도약 패턴순이 소개되었다. 주파수 도략 패턴순의 주기는 qk-1, 알파벧 크기는 q, 주파수 도약 패턴군의 크기는 q인데, 여기서 k는 임의의 양의정수 그리고 q는 소수의 정수승이다. 자시상관함수 및 타 상관함수의 최대값은 qk-1(trivial 경우 제외)인데 이것은 최적의 해밍 상관함수에 해당된다. 그리고 주파수 도약 패턴에 있어서 q*q 스퀘어당 평균 충돌의 수는 1보다 작다.

• 한국측량학회지
• /
• 제37권2호
• /
• pp.81-89
• /
• 2019

As the need for the integration of administrative datasets and address information increases, there is also growing interest in POI (Point of Interest) data as a source of location information across applications and platforms. The purpose of this study is to develop an alias database management method for efficient POI searching, based on POI data representing position. First, we determine the attributes of POI alias data as it is used variously by individual users. When classifying aliases of POIs, we excluded POIs in which the typo and names are all in English alphabet. The attributes of POI aliases are classified into four categories, and each category is reclassified into three classes according to the strength of the attributes. We then define the quality of POI aliases classified in this study through experiments. Based on the four attributes of POI defined in this study, we developed a method of managing one POI alias through and integrated method composed of word embedding and a similarity measurement. Experimental results of the proposed POI alias management method show that it is possible to utilize the algorithm developed in this study if there are small numbers of aliases in each POI with appropriate POI attributes defined in this study.

• Imaging Science in Dentistry
• /
• 제32권3호
• /
• pp.129-134
• /
• 2002

Purpose : To implement the database system of oral and maxillofacial radiological images using a commercial medical image management software with personally developed classification code. Materials and methods : The image database was built using a slightly modified commercial medical image management software, Dr. Image v.2.1 (Bit Computer Co., Korea). The function of wild card '*' was added to the search function of this program. Diagnosis classification codes were written as the number at the first three digits, and radiographic technique classification codes as the alphabet right after the diagnosis code. 449 radiological films of 218 cases from January, 2000 to December, 2000, which had been specially stored for the demonstration and education at Dept. of OMF Radiology of Dankook University Dental Hospital, were scanned with each patient information. Results: Cases could be efficiently accessed and analyzed by using the classification code. Search and statistics results were easily obtained according to sex, age, disease diagnosis and radiographic technique. Conclusion : Efficient image management was possible with this image database system. Application of this system to other departments or personal image management can be made possible by utilizing the appropriate classification code system.

• 정보보호학회논문지
• /
• 제25권5호
• /
• pp.1235-1243
• /
• 2015

본 논문은 웹페이지의 로그인 또는 패스워드 변경 인터페이스에서 제공하는 패스워드 표기 방법이 국내 사용자의 패스워드 구성(composition)에 영향을 주는지 설문을 통해 살펴보고, 보안 향상을 위한 표기법을 제안한다. 특히 현재 혼용되고 있는 외국어 '패스워드' 표기와 이를 우리말로 번역한 '비밀번호' 표기는 의미적인 차이가 있다. 국내 S대학교 재학생 200명을 대상으로 설문조사를 통해 '비밀번호' 표기를 사용할 때 더 많은 학생들이 숫자 위주의 패스워드를 만드는 것을 확인하였다. 숫자 위주의 패스워드는 그렇지 않은 경우에 비해 가능한 조합의 수가 크게 감소하므로 이는 보안에 좋지 않은 영향을 줄 우려가 있다. 따라서 본 논문이 국내 사용자들의 패스워드 보안을 향상시킬 방법을 찾는 연구의 참고 자료로 활용될 수 있을 것이라 기대한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.171-174
• /
• 2003

In this paper, a Learning module for a reconfigurable neural network processor(ERNIE) was proposed for an On-chip learning. The existing reconfigurable neural network processor(ERNIE) has a much better performance than the software program but it doesn't support On-chip learning function. A learning module which is based on Back Propagation algorithm was designed for a help of this weak point. A pipeline structure let the learning module be able to update the weights rapidly and continuously. It was tested with five types of alphabet font to evaluate learning module. It compared with C programed neural network model on PC in calculation speed and correctness of recognition. As a result of this experiment, it can be found that the neural network processor(ERNIE) with learning module decrease the neural network training time efficiently at the same recognition rate compared with software computing based neural network model. This On-chip learning module showed that the reconfigurable neural network processor(ERNIE) could be a evolvable neural network processor which can fine the optimal configuration of network by itself.

• Journal of Computing Science and Engineering
• /
• 제3권1호
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권4호
• /
• pp.283-290
• /
• 2009

Rank/select 자료구조는 트리, 그래프, 문자열 인덱스 등의 다양한 자료구조를 간결하게 표현하는 기본 도구이다. Rank/select 자료구조는 주어진 문자열에 어느 위치까지 나타난 문자 개수를 세는 연산을 처리한다. 효율적인 rank/select 자료구조를 위해 이론적인 압축 방식들이 제안되었으나, 실제 구현에 있어 연산 시간 및 저장 공간의 효율을 보장할 수 없었다. 본 논문은 간단한 방법으로 이론적인 압축 크기를 보장하면서 연산 시간도 효율적인 rank/select 자료구조 구현 방법을 제시한다. 본 논문의 실험을 통해, 복잡한 인코딩 방법 없이도 이론적인 nH$_0$ + O(n) 비트 크기에 근접하면서 기존의 HSS 자료구조보다 빠른 rank/select 연산을 지원하는 구현 방법임을 보인다.

• 한국산학기술학회논문지
• /
• 제16권3호
• /
• pp.2219-2228
• /
• 2015

RDT(Reversed Double T) 거더교는 생태교 맞춤형으로 개발된 PSC 교량 형식이다. 모음 ㅛ형상과 유사한 단면형상이 가장 큰 특징이며 거더 내부 공간에 흙을 담을 수 있어 상부 구조 전체 높이를 획기적으로 낮추고 시공성과 경제성이 우수하여 생태교로써 적용이 활발할 것으로 기대되는 공법이다. 새로 제안된 RDT 거더교의 실적용을 위해서는 공용 중 안전성 검증이 필요하다. 본 연구에서는 RDT 거더교의 실물모형 실험체를 설계 및 제작하여 정적재하 실험을 수행하였다. 실험결과와 변형률적합법을 이용한 비선형 해석 결과를 바탕으로 거동을 평가하고 구조성능을 검토하였다. 검토 결과, RDT 거더교는 사용하중의 2배 이상 균열 안전성을 확보하고 있으며 우수한 휨 성능을 보유하고 있는 것으로 나타났다.

• 근관절건강학회지
• /
• 제22권3호
• /
• pp.205-218
• /
• 2015

Purpose: This study was performed to analyze the visiting nurses' job using Developing a curriculum (DACUM). Methods: The DACUM committee with 6 visiting nurses participated in the workshop. In this workshop, the visiting nurses role was defined and their duties and tasks were identified. After content validation via the experts, the pilot test was conducted to 78 nurses. Results: A total of 13 duties and 82 tasks were identified on the DACUM chart which represented the importance, difficulty, and frequency of tasks with alphabet A, B, and C as its higher degree. Regarding duties, 'visiting nursing for high risk group' is the highest, while the lowest was 'public welfare events'. Regarding to tasks, 'discovering a new patient' was the highest, while 'selecting patients and offering medical supplies (nutritional supplement, patch)' was the lowest one. Conclusion: The results showed that visiting nurses working in the visiting health care service center were doing more various duties and tasks than those working according to 'Act on Long-term Care Insurance for the Aged'. The results can be used to develop training programs for visiting nurses and evaluation-scale of their job performance.