• Korean Journal of Cognitive Science
• /
• v.2 no.2
• /
• pp.221-259
• /
• 1990

Four experiments explored how the size ratio of two letter patterns affects jundgment times in a same-different matching task.Size, continuity of strokes,positions of the two vowel letters were systematically varied in order to test predictions,derved from the following hypotheses:Analogue transformation,position,use of diagnostic information,and decision sriteria.Size ratio influenced only reaction times for same responses and,more importantly,changes in the length of a horizintal line in a letter affected same responses more than the other feature.Taken together,the present experiments provide support for the diagnostic information hypothesis, while casting in doubt the other hypotheses on the nature of size transformations.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.621-630
• /
• 2009

In recent years, there have been many attempts to connect the latest RFID (Radio Frequency Identification) technology with EIS (Enterprise Information System) and utilize them. However, in most cases the focus is only on the simultaneous multiple reading capability of the RFID technology neglecting the management of massive data created from the reader. As a result, it is difficult to obtain time-related information such as flow prediction and analysis in process control. In this paper, we suggest a new method called 'procedure tree', an enhanced and complementary version of PathTree which is one of RFID data mining techniques, to manage massive RFID data sets effectively and to perform a real-time process control efficiently. We will evaluate efficiency of the proposed system after applying real-time process management system connected with the RFID-based EIS. Through the suggested method, we are able to perform such tasks as prediction or tracking of process flow for real-time process control and inventory management efficiently which the existing RFID-based production system could not have done.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.244-246
• /
• 2002

클러스터 기반의 VOD 서버는 동시에 여러 사용자에게 실시간으로 고품질 서비스를 위해 정교한 부하 분산 기술과 버퍼관리 기술을 요구한다. 본 논문은 클러스터 기반 VOD 서버에서 동적 버퍼 분할을 이용한 새로운 부하분산 기법을 제안한다. 제안된 기법은 사용자 요청을 처리하는 서비스 노드간의 버퍼 성능과 디스크 접근 빈도를 고려하여 노드 부하를 고르게 분산한다. 또한 동적 버퍼 분할 기법은 동일한 연속 매체에 접근하려는 여러 사용자에게 평균 대기시간을 감소시킬 수 있도록 버퍼를 동적으로 분할한다. 각 서비스 노드에서 동적 버퍼 분할로 발생하는 버퍼 정보를 유지함으로써 각 서비스 노드의 버퍼 재사용을 극대화할 수 있다. 시뮬레이션을 통해 제안된 기법이 효율적인 버퍼 관리로 노드 부하 균등화, 사용자 평균 대기시간 감소, 병행 사용자 수 증가 등의 성능 향상을 얻었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.403-405
• /
• 2009

통방융합 환경에서 Killer 서비스로 각광을 받고 있는 VOD(Video On Demand)서비스에서 I/O 병목현상은 VOD 서버의 오 동작 및 성능 저하의 주요 원인이 되고 있다. 본 논문에서는 이런 I/O 병목 현상을 개선하여 입출력 효율이 좋은 고성능 VOD 솔루션을 제안한다. 제안된 솔루션은 대용량 더블 버퍼를 구성하여 하나의 버퍼로 클라이언트에 데이터를 전송하고 있는 사이에, 나머지 다른 버퍼에서 스토리지에서 전송되는 데이터를 버퍼에 저장 하여, 디스크 접근 시 한번에 보다 많은 데이터를 읽음으로써 연속적인 정보를 가져올때 빈번하게 하드디스크의 접근을 줄임으로서 끊김없는 전송을 가능하게 한다. 또한 다수의 사용자가 동시 접근 시 데이터 충돌을 방지하고, 스토리지에 순차적으로 연속 접근하도록 접근 발생 시간에 따라 우선 순위 인덱스를 할당하고 회수하도록 스토리지 접근 스케쥴러를 고안 하였다. 제안된 솔루션의 유효성을 검증하기 위해 SD급 콘텐츠에 대해 솔루션의 Throughoutput 처리량을 벤치마킹 테스트로 검증을 하였다. 테스트 결과 MPEG-2 SD급 영상에대해 Raid 5에서 최대 1000 스트리밍을 전송 할 수 있음을 확인 하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.3
• /
• pp.117-124
• /
• 2000

A systolic array is a parallel processing system which consists of processing elements of basic computation capabilities, connected with regular and local communication lines. It has been known that a systolic array is on of effective systems to solve complicated communication problems occurred between densely connected neurons on ANN(Artificial Neural Network). In this paper, a systolic array simulator for the back-propagation ANN, which automatically constructs the proper systolic array for a given number of neurons of the ANN, is designed and constructed. With animation techniques of the simulators, it is easy for users to be able to examine the execution of the back-propagation algorithm on the designed systolic array step by step. Moreover the simulator can perform forward and backward operations of the back-propagation algorithm either in sequence or in parallel on the designed systolic array. Parallel execution can be performed by feeding continuous input patterns and by executing bidirectional propagations on all of processing elements of a systolic array at the same time.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.309-314
• /
• 2014

To generate a complete 3D model from depth images of multiple RGB-D cameras, it is necessary to find 3D transformations between RGB-D cameras. This paper proposes a convenient view calibration technique using a spherical object. Conventional view calibration methods use either planar checkerboards or 3D objects with coded-pattern. In these conventional methods, detection and matching of pattern features and codes takes a significant time. In this paper, we propose a convenient view calibration method using both 3D depth and 2D texture images of a spherical object simultaneously. First, while moving the spherical object freely in the modeling space, depth and texture images of the object are acquired from all RGB-D camera simultaneously. Then, the external parameters of each RGB-D camera is calibrated so that the coordinates of the sphere center coincide in the world coordinate system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.736-745
• /
• 2002

In network delivery of compressed video, packets may be lost if the channel is unreliable like Internet. Such losses tend to of cur in burst like continuous bit-stream error. In this paper, we propose an effective error-concealment approach to which an error resilient video encoding approach is applied against burst errors and which reduces a complexity of error concealment at the decoder using data hiding. To improve the performance of error concealment, a temporal and spatial error resilient video encoding approach at encoder is developed to be robust against burst errors. For spatial area of error concealment, block shuffling scheme is introduced to isolate erroneous blocks caused by packet losses. For temporal area of error concealment, we embed parity bits in content data for motion vectors between intra frames or continuous inter frames and recovery loss packet with it at decoder after transmission While error concealment is performed on error blocks of video data at decoder, it is computationally costly to interpolate error video block using neighboring information. So, in this paper, a set of feature are extracted at the encoder and embedded imperceptibly into the original media. If some part of the media data is damaged during transmission, the embedded features can be extracted and used for recovery of lost data with bi-direction interpolation. The use of data hiding leads to reduced complexity at the decoder. Experimental results suggest that our approach can achieve a reasonable quality for packet loss up to 30% over a wide range of video materials.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.141-144
• /
• 2006

본 논문은 적응형 육각 탐색에 기반한 고속 블록 정합 알고리즘의 성능 개선에 관한 것으로, 이전 프레임의 움직임 활동도를 산출한 후, 웨이블렛 변환의 다단계 저주파 부영상들로 구성된 피라미드 계층 구조상에서 이 움직임 활동도에 따라 초기 움직임 탐색 계층을 적응적으로 선택하면서 적응형 육각 탐색에 기반한 계층적 블록 정합을 수행함으로써 움직임 벡터 추정의 고속화를 실현함과 동시에 국부 최소화를 효과적으로 경감시킬 수 있는 블록 정합 알고리즘을 제안함에 그 목적이 있다. 우선, 초기 연속된 두 프레임에 대해 적응형 육각 탐색을 이용하여 움직임 벡터를 추정한 후 움직임 활동도를 산출한다. 이후, 움직임 활동도가 낮은 경우, 다음 프레임의 움직임 벡터를 추정 시 최하위 계층에서 적응형 육각 탐색을 수행하고, 움직임 활용도가 높은 경우 피라미드 계층 구조상의 최상위 계층에서부터 상하 계층들 간에 움직임 탐색 영역을 중복시키면서 움직임 벡터를 추정한다. 제안된 방법의 타당성과 보편성을 검증하기 위해 서로 다른 움직임 특성을 갖는 복수의 영상 시퀀스들을 대상으로 움직임 보상 화질과 수렴시간 측면에서 그 성능을 평가 분석하였다. 제안된 방법에 따르면, 고속 움직임 탐색이 가능한 적응형 육각 탐색의 장점을 유지하면서도 움직임 활동도가 높은 영상에서 야기되는 국부최소문제를 효과적으로 억제시키고 있음을 확인할 수 있었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1584-1590
• /
• 2008

The combined query which consists of the region and trajectory query finds trajectories of moving objects which locate in a certain region. The trajectory query is very informant factor to determine query performance because it processes a point query continuously to find predecessors. This results in bad performance due to revisiting nodes in an index. This paper suggests an efficient method for the combined query based on the 3-dimensional R-tree which has good performance of the region query. The basic idea is that we define the least common search line which enables to search single path and a filtering method based on prediction without revisiting nodes.