• The Journal of the Korea Contents Association
• /
• v.18 no.6
• /
• pp.385-398
• /
• 2018

This study aims to explore implications by analyzing voters' behaviors and attitudes of political campaigns & political advertising audience in the 19th presidential election. For this purpose, in-depth interviews with 59 voters who voted in the last election were conducted, and interviewees were allocated by their gender and age. As a result, the motivation to ballot for a candidate was based on the candidates' political affiliations to a party, political inclinations, and election pledges. Voters also determined whom they would vote for after watching the final TV debate. The biggest issue of this election was to create jobs in the public sector, an economical issue. TV was the most trusted medium among the voters, and TV debates had the greatest influence in changing the minds of the voters. Voters thought that Shim, Sang Jung was the best on TV debates and that An, Chul Soo was the worst. Also, voters recalled An, Chul Soo the most among all election posters, but they recalled Moon, Jae In the most out of other political advertisement methods. Therefore, the results elucidated the voters' behaviors and the audience's attitudes in political advertising, and this study provided theoretical and practical implications to be utilized in future presidential election campaigns and political advertising endeavors.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.273.2-277
• /
• 1998

본 논문에서는 음소단위 비정형 연결합성 시, 접합점에서 포만트 불연속을 최소화할 수 있도록 이웃음소간 경계강도 예측모델과 합성단위 검색시 음소단위 최장일치 검색 알고리즘을 설계하였다. 합성단위 연결부에서 발생하는 신호왜곡을 최소화하기 위해 “_C_”환경에서 자음이 유성음화된 경우, “_V_”환경에서 모음이 무성음화된 경우, 그리고 유성음 사이의 포만트 주파수 차이에 대한 모델을 생성하여, 음소간의 조음강도가 약한 부분이 합성단위 경계로 설정되도록 하였다. 합성단위 경계가 결정되면 주어진 문장의 문맥정보만을 이용하여 코포스로부터 후보를 선택한다. 선택된 후보를 사이의 연결성을 측정하기 위하여 합성 경계를 기준으로 전, 후 음소에 대한 음성적 특성과 포만트 천이 특성을 고려하였다. 실험은 K-ToBI 레이블링된 200문장을 기반으로 하였으며, 코퍼스로부터 한 문장을 선택하여 이를 목적치 패턴으로 선정 한 후, 목적치 패턴과 후보사이의 단위비용과 후보들 간의 연결비용을 계산하여 최적의 합성단위열을 추출하는 방식으로 이루어졌다. 본 논문에서는 이러한 문맥종속 단위 기반의 합성단위 추출 알고리즘과 실험 결과에 대해 보고한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.714-720
• /
• 2004

In detecting human faces in color images, additional geometric computation is often necessary for validating the face-candidate regions having various forms. In this paper, we propose a method that detects the facial features using chrominance components of color which do not affected by face occlusion and orientation. The proposed algorithm uses the property that the Cb and Cr components have consistent differences around the facial features, especially eye-area. We designed the Mean-Gray Morphology operator to emphasize the feature areas in the eye-map image which generated by basic chrominance differences. Experimental results show that this method can detect the facial features under various face candidate regions effectively.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 2003.03a
• /
• pp.85-85
• /
• 2003

최근 양자구속 구조 중에서 Stranski-Krastanow 모드에 의해 형성된 양자점에 관한 연구가 활발히 진행되고 있다 양자점은 단전자소자, 고밀도메모리, 발광소자와 같은 양자기능성 소자 제작을 위한 가장 유력한 후보로서 각광받고 있다. 그러나 평탄한 기판 위에서 양자점은 무질서한 형태로 성장되어 양자점의 정확한 위치 조절이 어렵다. 또한 양자점의 위치 조절을 위해서는 정밀한 리소그라피와 정밀한 성장조건이 요구된다. 본 연구에서는 최초로 저압 MOCVD를 사용하여 일차원 InAs 양자점을 GaAs 기판에 새겨진 V 홈 바닥을 따라 위치 조절하여 형성하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.37-40
• /
• 2012

본 논문에서는 지문 인식 시스템의 인식을 위한 등록점으로 융선의 단점과 분기점에 관하여 연구하였다. 원 지문 영상은 전처리 과정을 거치게 되면서 잘못된 특징점을 포함하게 되며 이는 지문 인식 시스템의 효율성을 감소시키는 원인이 될 수 있다. 이 논문에서는 세선화된 지문 영상으로부터 후보 특징점을 추출한 후 연결성 탐색 정보를 이용하여 의사 특징점을 제거할 수 있는 알고리즘을 제안한다.

• Journal of Advanced Navigation Technology
• /
• v.22 no.1
• /
• pp.20-26
• /
• 2018

In this paper, we propose a moving object detection and tracking algorithm based on multi-frame feature point tracking information to reduce false positives. However, there are problems of detection error and tracking speed in existing studies. In order to compensate for this, we first calculate the corner feature points and the optical flow of multiple frames for camera movement compensation and object tracking. Next, the tracking error of the optical flow is reduced by the multi-frame forward-backward tracking, and the traced feature points are divided into the background and the moving object candidate based on homography and RANSAC algorithm for camera movement compensation. Among the transformed corner feature points, the outlier points removed by the RANSAC are clustered and the outlier cluster of a certain size is classified as the moving object candidate. Objects classified as moving object candidates are tracked according to label tracking based data association analysis. In this paper, we prove that the proposed algorithm improves both precision and recall compared with existing algorithms by using quadrotor image - based detection and tracking performance experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.73-78
• /
• 2006

Conventional caption extraction methods use the difference between frames or color segmentation methods from the whole image. Because these methods depend heavily on heuristics, we should have a priori knowledge of the captions to be extracted. Also they are difficult to implement. In this paper, we propose a method that uses little heuristic and simplified algorithm. We use topographical features of characters to extract the character points and use MST(Minimum Spanning Tree) to extract the candidate regions for captions. Character regions are determined by testing several conditions and verifying those candidate regions. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is 98.2%. And then we can see the results that caption area in complex images is well extracted.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.3
• /
• pp.5-12
• /
• 2010

A novel algorithm which computes the orientations and the locations of mobile robots with repeating feature of ceiling textures is proposed. For orientation computation, the relative angle between a strait line on a ceiling image and the center line of the robot is firstly computed. The relative angle is added to the global reference angles of straight lines of the ceiling and a group of robot orientation candidates is composed. The robot orientation is determined from such orientation candidate group by choosing the closest one to the previous robot orientation. Similarly, the location of the robot is determined from the robot location candidate group by choosing the closest one to the previous robot location, where robot location candidate group is composed by adding the relative location of the robot to global locations of neighboring nodes of the previous robot locations. The experiment has been done to test the accuracy of the algorithm in computing locations and orientations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.259-260
• /
• 2014

본 논문은 편의점, 까페 등의 창업시 많은 후보군들 사이에서 적절한 위치를 추천하는 서비스를 만들어보고자 수행되었다. 본 연구는 Skyline Query를 이용하여 사용자가 설정한 지점으로부터의 거리에 따른 예상이익을 도출해내고, MapReduce를 사용하여 많은 후보군들을 대상으로 이를 효율적으로 처리하도록 구현하였다. 본 연구의 방법을 사용하여 창업자가 설정한 한정적 자원 및 거리 제한 조건 안에서 최적의 위치를 손쉽게 추천해줄 수 있을 것이다.