• Speech Sciences
• /
• v.12 no.4
• /
• pp.183-195
• /
• 2005

In the present study, we investigated development of verb inflections or endings in 3- to 5-year old Korean-speaking children using 28 action verbs for both comprehension and production tasks. For each verb, a l0-second long motion picture and a sheet of paper with three random-ordered color pictures representing 'before, in the middle of, at the end of' the action were generated. A past tense inflection' -et ta,' two present progressive verb endings '-enta' & '-ko itta.' a future tense ending '-elyeko hanta' were tested. In the comprehension task, children were asked to point to a picture correctly representing the tense of a presented verb. In the production task, children were asked to produce a verb with correctly marking the tense of a presented picture. The order of the two tasks were counterbalanced across the children, and the motion pictures were only presented in the first task. Across the ages, the performance accuracies on both comprehension and production tasks were the highest for the past tense marking followed by two present progressive and future tense markings. For each verb endings, the changes of accuracies across ages were analyzed in both tasks. The types of errors for production tasks were also reported.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.403-406
• /
• 1999

Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.597-600
• /
• 1999

In this paper, we propose a fast object-tracking algorithm in a moving picture. The proposed object-tracking algorithm is based on a projection scheme. More specifically, to alleviate the computational complexities of the previous motion estimation methods, we propose to use the projected row and column 1-D image data to extract the motion information. Experimental results show that the proposed method can detect the motion of an object fairly well with reduced computational time.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.449-451
• /
• 2002

We reported the algorithm of driving scheme that enhances moving picture property by improving gray-to-gray response time. Here, we report result of simulation for estimation of driving voltage to reduce response time, and experimental result. We investigated optimization of algorithm so that minimum size of LUT can support to reducing the gray-to-gray response time within 1 frame period, and with single algorithm it is possible to apply the algorithm to various kinds of LC material. So in our system there is no external EEPROM.

• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.278-288
• /
• 2007

We propose the fast full search algorithm that reduces the computational load of the block matching algorithm which is used for a motion estimation in the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion picture. However we proposed the efficient motion estimation method which is good for the fast and slow motion picture. Firstly, when finding the initial threshold value, we use the expanded predictor that can approximately calculate minimum threshold value. The proposed algorithm estimates the motion in the new search order after partitioning the search window and adapt the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm reduces the computational load 94% in average compared to the conventional spiral full search algorithm without any loss of image quality.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.517-520
• /
• 2005

In this paper, we propose a motion picture processor for CSTN-LCD without gamut problem. The proposed method employed CDF(Cumulative Density Function) in order to perform a mutual independent in image gradation and color balance. In addition, the proposed method has solved a gamut problem used by conversion of RGB system and CMY system. Also, we apply the BFI (Black Field Insertion) to the design to compensate for response time of a LC (Liquid Crystal). The proposed hardware architecture has been implemented and verified using a FPGA on prototype board. Visual test and standard deviation of histogram were introduced to evaluate the result of the proposed method and the original ones.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.529-532
• /
• 2005

In this paper, we propose a motion picture processor for CSTN LCD. In order to eliminate flicker phenomenon, the proposed processor suggests a new driving scheme, SFP(Subgroup Frame Pattern). We use an input image compression methode from RGB(:8:8;8) to RGB(5:6:5) to improve quality of the image and apply the image to CSTN Module. The proposed hardware architecture has been implemented and verified using a FPGA on prototype board. The proposed Algorithm provide a lower computational complexity. Therefore the processor can be used in the display devices such as PDA, mobile phone and PMP(Portable Multimedia Player).

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1157-1163
• /
• 2005

In this paper, an efficient and fast method to segment a video in the MPEG(motion picture expert group) video stream is proposed. For the real time processing of large amount of broadcasting data, we use DC images of I-frames in an MPEG compressed video with minimal decoding. Using the modified histogram comparison which counts on not only luminance but also chrominance information, the scene change detection was performed in the fast and accurate way Also, to discriminate anchorperson frame from non-anchor frame, a neural network method was introduced.

• Journal of Digital Contents Society
• /
• v.8 no.4
• /
• pp.547-553
• /
• 2007

UCC is highlighted in so many field for information system area and new business part. So many people made UCC and it does effect on advertise area and marketing area. But it is stoped developed new motion picture editing system for UCC, so it is need to make new paradigm for easy develop UCC system. This paper introduce to build authorizing tool for UCC. Our system is different other motion picture edition system and very easy to build UCC.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.187-189
• /
• 2001

In this study, the Web Camera System is implementation and simulated on two different architectures. In the one architecture, a Web-server and Camera-server are implemented on the same system, and the system transfers motion picture which compressed to JPEG file to users on the WWW(World Wide Web). In the other architecture, the Web-server and Camera-server are implemented on different systems, and the motion picture is transferred from the Camera-server to Web-server, and finally to users. In order to compare system performance between two architecture, data traffic is measured and simulated in the unit of byte per second and frame per second.