• Bulletin of the Korean Space Science Society
• /
• 1998.10a
• /
• pp.23.1-23
• /
• 1998

No Abstract.See Full-text

• Proceedings of the Korean Society for Information Management Conference
• /
• 1996.08a
• /
• pp.19-22
• /
• 1996

본 연구는 전문 D/B의 본문 필드를 텍스트 언어학적 상부구조로 분할하고 태그를 부여함으로써 이용자의 목적이나 상황에 따라서 필요한 부분만을 검색할 수 있는 전문탐색기법의 타당성을 고찰하였다. 한 문헌은 다수의 텍스트 단위로 구성되며, 이 텍스트는 의사소통이나 인지과정의 기본 단위로써 문헌 전체를 통괄하는 상부구조에 의해 연결된다. 상부구조는 텍스트의 생성과 이해에 중요한 매개체 역할을 하며, 정보요구의 상황이나 목적과 밀접하게 관련되어 있음을 밝히고 정보검색시스템의 주요 대상인 학술문헌의 상부구조를 고찰하였다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.403-403
• /
• 2006

• Speech Sciences
• /
• v.11 no.2
• /
• pp.211-216
• /
• 2004

In this paper, we present a fast encoding algorithm for vector quantization with an approximate Euclidean distance calculation. An approximation is performed by converting floating point to the near integer. An inequality between the approximate Euclidean distance and the nearest distance is developed to avoid unnecessary distance calculations. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as conventional full search algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.287-290
• /
• 2002

The block matching algorithm motion estimation is a soft-core for hardwired motion estimation block in MPEG-2, H.261 encoder. This motion estimation has been tested and verified to be valid for implementation of FPGA. Efficiency performance of the synthesized motion estimation was up to 89%, and the average PSNR between the original image and the motion-compensated image is 38dB.

• Annual Conference of KIPS
• /
• 2003.11c
• /
• pp.1339-1342
• /
• 2003

XML이 인터넷상에서 디지털 정보를 표현하고 교환하기 위한 표준이 되어감에 따라 최근까지 XML을 저장하고 검색하기 위한 역인덱스 기법에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 XML 전문 검색을 위한 새로운 역인덱스 구조를 제안한다. 기존에 연구된 역인덱스 기법을 통한 키워드 검색 기능을 더욱 보완하고 최근에 W3C에서 새로운 기능으로 추가된 전문 검색 기능을 구현한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.69-76
• /
• 2010

This paper proposed a new fast multi-reference frame motion estimation algorithm. The proposed algorithm reduces search areas of motion estimation using a linear relation of motion vector with distance of each reference frame. New algorithm executes full search area motion estimation in reference frame 0 and reference frame 1. After that, search areas in reference frame 2, reference frame 3 and reference frame 4 are minimized by distance of each reference frame and results of motion estimation in reference frame 0 and reference frame 1. The proposed algorithm does not use a threshold value which is obstacle of hardware implementation and processing time schedule. Also, it reduced computation quantity of multi-reference motion estimation. Hardware implementation of multi-reference frame motion estimation is possible by these features. Simulation results show that PSNR drop and bitrate increase of proposed algorithm are lower than those of previous fast multi-reference frame motion estimation algorithm The number of computation of new algorithm is reduced 52.5% and quality of result is negligible when compared with full search area motion estimation which has 5 reference frames.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2762-2770
• /
• 2012

In this paper, we propose a novel approach to effectively compress the sub-images transformed from the picked-up elemental images in integral imaging, in which motion vectors of the object in each sub-image are fast and accurately estimated and compensated by combined use of MSE(mean square error)-based TSS(tree-step search) and FS(full search) schemes. This is, the possible object areas in each sub-image are searched by using the fast TSS algorithm in advance, then the these selected object areas are fully searched with the accurate FS algorithm. Furthermore, the sub-images in which all object's motion vectors are compensated, are transformed into the residual images by using the difference image method and finally compressed with the MPEG-4 algorithm. Experimental results reveal that the proposed method shows 214% improvement in the compression time per each image frame compared to that of the conventional method while keeping the same compression ratio with the conventional method. These successful results confirm the feasibility of the proposed method in the practical application.

• Journal of Satellite, Information and Communications
• /
• v.2 no.1
• /
• pp.35-40
• /
• 2007

COSPAS-SARSAT is the search and rescue system for providing a distress alarm and a position identification using an international satellite and ground facilities. Aviators, mariners and land users worldwide are equipped with COSPAS-SARSAT distress beacons, which could help save their in emergency situations anywhere in the world. As the existing COSPAS-SARSAT system is generally operated by LEO(Low-altitude Earth Orbit) Satellite System, the time from the distress beacon to the rescue is more than 1 hour with average and the accuracy of the distress location is about 5 Km. Therefore, in order to overcome this problem, the development for the next generation SAR(search and rescue) system which uses the MEO(middle-altitude Earth Orbit) satellites is going on the Galileo project. EU is developing this project for the full operation capability in 2011, and this project will have SAR payloads and support to the Search and Rescue service-herein called SAR/Galileo. SAR/Galileo will have the performance of a few meter accuracy, within 10 minutes to rescue from reception of distress messages, and Return Link Service(from the SAR operator to the distress emitting beacon), thereby facilitating more efficient rescue operations and helping to reduce the rate of false alerts. As the disaster is larger every year, the ground station, MEOLUT for next generation ASR/Galileo is urgently needed for the lifesaving for the larger disaster, the research for beacon and the ground station such as MEOLUT for introducing the next generation SAR/Galileo in Korea is very timely and is important. This paper presents the procedures and the strategies for the participation, the area to develop reasonably, and the propulsion organization for developing the SAR/Galileo ground system in Korea.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.2
• /
• pp.51-73
• /
• 2015

The Web now provides instant access to an unprecedented amount of information that was unthinkable even 20-30 years ago. However, the full potential of the contents available through the Internet can only be realized when one can speak and understand foreign languages, especially English which accounts for more than half of web contents. In this study, we try to investigate the effect of search task languages and task complexity on searching performance. A total of thirty students enrolled at a top private university in Korea were recruited as study subjects. We set up a quasi-experimental design in which thirty subjects are randomly assigned to a set of eight different search tasks containing an equal number of simple and complex tasks and an equal number of tasks in Korean and in English. The results show that there is a significant difference between simple and complex tasks in terms of SERP time, number of queries used, correctness of results and total search time. However, task language does not seem to have affected search performance for this study group. In addition, students with high English proficiency test scores show comparable search performance in English tasks compared with lower test scores. But we note differences in behavioral patterns (different search engines used and search tactics) among the study participants.