• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2451-2454
• /
• 2003

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses met scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, speech, spectrogram analysis, searching time reduced about 37.5％, 46.21％, 46.3％, 51.29％ in average, computational amount is reduced about 44.76％, 49.44％, 47.03％, 57.40％. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• 한국도서관정보학회지
• /
• 제28권
• /
• pp.263-286
• /
• 1998

To investigate how the online searching was taught in the departments of Library and Information Science, a survey was done to the professors teaching information retrieval course. Questionnaires were mailed to 32 professors and 26 returned. Information retrieval course, one of the central course attended by almost all of the students, covers online searching in depth. Lecture, hard-on practice, and homework were three favored methods of teaching. Among the 22 topics to be covered in online teaching, respondents showed substantially higher consensus except for sections of information technology and service management. However, respondents showed big differences in hours of hand-on practice and the systems used. Free databases through Internet used dominantly. The chronic problem of terminal and communication is solved by using campus-wide facilities. But the problem of teaching assistance is serious. Based on the results, recommendations to improve online searching education are provided.

• 한국도서관정보학회지
• /
• 제18권
• /
• pp.245-268
• /
• 1991

Some conclusions derived from the study are as follows : 1) Most conventional information retrieval systems require users do precisely that specify the information they require, but user's information needs are not always precise. 2) Information need arise from when users are in an anomalous stats of knowledge about some problem, so user's information needs are not always precise. 3) Information retrieval systems must assist to users make themselves correct, complement, and specify their information need. When information need arise, systems should understand the state of knowledge and will be design to present and specify their ill-defined potential information need. 4) Existing information retrieval techniques need a tool to complement current its disadvantages and to enhance retrieval efficiency. Browsing searching will be a role such as a tool. 5) Browsing searching can understand user's state of knowledge and assist to specify not only pre-searching information need but also changed information need during searching progress.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.301-304
• /
• 2007

A realization for image searching engine with moving objects identification and classification is presented in this paper. The identification algorithm is applied to extract difference image between input image and the reference image, and the classification is used the region segmentation. That is made the database for the searching engine. The experimental result of the realized system enables to search for human and animal at time intervals to use a surveillant system at inside environment.

• 디지털콘텐츠학회 논문지
• /
• 제11권1호
• /
• pp.39-45
• /
• 2010

본 논문에서는 기울기 기반 빠른 정상점 탐색 방법론을 제시하고 시뮬레이션 결과를 제시한다. 제안하는 방법론은 유한 구간에서 단봉 그래프를 가지는 함수의 정상점(최대치)을 최대한 적은 수의 함수값을 참조하여 찾는 문제에 대한 솔루션으로, 대표적인 적용분야로는 자동초점이 있다. 우리는 정상점 탐색을 위해 주기적 탐색, 기울기 기반 탐색, 상세 탐색과 같이 세가지 탐색 전략을 통해 정상점을 찾는다. 노이즈가 첨가된 가우시안 함수를 발생시켜 시뮬레이션 한 결과 대략 8번탐색 횟수와 1.04의 오차를 보임을 알 수 있었다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.117-121
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

• Journal of information and communication convergence engineering
• /
• 제3권2호
• /
• pp.72-75
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2010년도 춘계학술발표논문집 1부
• /
• pp.257-260
• /
• 2010

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses mel scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, spectrogram analysis, searching time is reduced about 37.5%, 46.21%, 46.3%, 51.29% in average, computational amount is reduced about 44.76%, 49.44%, 47.03%, 57.40%. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2009년도 춘계 학술논문 발표대회 학계
• /
• pp.175-179
• /
• 2009

Researches of current PMIS(Project Management Information System) information searching focus on providing personalized results as well as matching needed queries in an enormous amount of information. This paper aim at discovering hidden knowledge to provide personalized and inferred search results based on the ontology with categorized concepts and relations among construction data. The current PMIS searching occasionally presents too much redundant information or offers no matching results from large volumes of data. In this paper, we propose a service searching system, which becomes aware of users device using iPMIS(Intelligent Program Management Information System). And we design and plant the ontology-based iPMIS, which is aware of the context in its environment.

• 방송공학회논문지
• /
• 제3권1호
• /
• pp.85-92
• /
• 1998

동영상 부호화에서 블록 정합 움직임 추정 기법은 움직임 추정 기법으로 가장 많이 쓰이고 있는 방법이다. 이 논문에서는 블록 정합 움직임 추정 기법의 하나로 최근에 제안된 공간적 상관 관계와 계층적 탐색방법을 이용한 고속 움직임 추정 알고리즘의 구현에 적합한 VLSI 구조를 제안한다. 제안된 구조는 systolic array에 바탕을 둔 탐색 기본 단위와 두 개의 shift register array등으로 이루어지며 수평/수직 -32~+31 화소 크기의 탐색을 수행한다. 이 때 탐색 기본 단위는 반복하여 사용하게 함으로써 게이트 수를 최소화하였다. 탐색 기본 단위의 구조로는 전역 탐색을 수행할 수 있는 기존의 여러 가지 systolic array 들이 사용 가능하며, 그 선택에 따라 칩의 크기와 속도 사이의 절충이 가능하다. 본 논문에서는 PE(processing element)의 개수를 줄여 전체적인 칩 사이즈를 줄이는데 중점을 두고 탐색 기본 단위의 구조를 결정하였다. 제안된 구조를 이용하면 $352{\times}288$ 크기의 영상, 탐색 영역 수평/수직 -32~+31 화소에 대해서 클럭 주파수가 35MHz일 때 최대 30Hz까지 실시간 처리를 할 수 있는 움직임 추정 칩을 20,000 게이트 이하로 구현할 수 있다. 더 높은 전송률의 입력 영상($720{\times}480$, 30Hz)에 적용할 경우에는 단순히 PE 개수를 늘리 구조를 탐색 기본 단위로 선택함으로써 실시간 구현이 가능하다.