• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.3
• /
• pp.258-263
• /
• 2010

Sound localization algorithm usually adapts three step process: sampling sound signals, estimating time difference of arrival between microphones, estimate location of sound source. To apply this process in indoor environment, sound localization algorithm must be strong enough against reverberant and noisy condition. Additionally, calculation efficiency must be considered in implementing real-time sound localization system. To implement real-time robust sound localization system we adapt four low cost condenser microphones which reduce the cost and total calculation load. And to get TDOA(Time Differences of Arrival) of microphones we adapt GCC-PHAT(Generalized Cross Correlation-Phase Transform) which is robust algorithm to the reverberant and noise environment. The position of sound source was calculated by using iterative least square algorithm which produce highly accurate position data.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.414-420
• /
• 2015

The quality of depth images is important in the 3D video system to represent complete 3D contents. However, the original depth image from a depth camera has a low resolution and a flickering problem which shows vibrating depth values in terms of temporal meaning. This problem causes an uncomfortable feeling when we look 3D contents. In order to solve a low resolution problem, we employ 3D warping and a depth weighted joint bilateral filter. A temporal mean filter can be applied to solve the flickering problem while we encounter a residual spectrum problem in the depth image. Thus, after classifying foreground andbackground regions, we use an upsampled depth image for a foreground region and temporal mean image for background region.Test results shows that the proposed method generates a time consistent depth video with a high resolution.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.121-124
• /
• 2001

음성 합성기의 합성음의 자연감을 높이기 위해 자연음에 내재하는 정확한 운율 법칙을 구하여 음성합성 시스템에서 이를 구현해 주어야 한다 무제한 어휘 음성합성 시스템의 문-음성 합성기에서 필요한 운율 법칙은 언어학적 정보를 이용해 구하거나, 자연음에서 추출하고 있다 그러나 추출한 운율 법칙이 자연음에 내재하는 모든 운율 법칙을 반영하지 못했거나, 잘못 구현되는 경우에는 합성음의 자연성이 떨어지게 된다. 이런 점을 고려하여 본 논문에서는 한국어 자연음을 분석하여 추출한 운율 정보를 인공 신경망이 학습하도록 하고 훈련을 마친 인공 신경망에 문장을 입력하고, 출력으로 나오는 운율 정보와 자연음의 운율 정보를 비교한 결과 제안한 인공 신경망이 자연음에 내재하고 있는 운율을 학습할 수 있음을 알 수 있었다. 운율의 3대 요소는 피치 , 지속시간, 크기의 변화이다. 제안한 인공 신경망이 한국어 문장의 음소 열을 입력으로 받아들이고, 각 음소의 지속시간에 따른 피치변화와 크기 변화를 출력으로 내보내면 자연음을 분석해 구한 각 음소의 운율 정보인 목표 패턴과 출력 패턴 의 오차를 최소화하도록 인공 신경망의 가중치를 조절할 수 있도록 설계하였다. 지속시간에 따른 각 음소의 피치와 크기 변화를 학습시키기 위해 피치 및 크기 인공 신경망을 구성하였다. 이들 인공 신경망을 훈련시키기 위해 먼저 음소 균형 문장 군을 구축하여야 하고, 이들 언어 자료를 특정 화자가 일정 환경에서 읽고 이를 녹음하여 , 분석하여 구한운율 정보를 운율 데이터베이스로 구축하였다. 문장 내의 각 음소에 대해 지속 시간과 피치 변화 그리고 크기 변화를 구하고, 곡선 적응 방법을 이용하여 각 변화 곡선에 대한 다항식 계수와 초기 값을 구해 운율 데이터베이스를 구축한다. 이 운율 데이터베이스의 일부는 인공 신경망을 훈련시키는데 이용하고, 나머지로 인공 신경망의 성능을 평가하여 인공 신경망이 운율 법칙을 학습할 수 있었다. 언어 자료의 문장 수를 늘리고 발음 횟수를 늘려 운율 데이터베이스를 확장하면 인공 신경망의 성능을 높일 수 있고, 문장 내의 음소의 수를 감안하여 인공 신경망의 입력 단자의 수는 계산량과 초분절 요인을 감안하여 결정해야 할 것이다

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.81-92
• /
• 2001

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. The load balancing is considered as a necessary feature for the clustering of heterogeneous workstations to minimize the turnaround time. Since each workstation may have different users, groups. requests for different tasks, and different processing power, the capability of each processing unit is relative to the others' unit in the clustering environment Previous works is a static approach which assign a predetermined weight for the processing capability of each workstation or a dynamic approach which executes a benchmark program to get relative processing capability of each workstation. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present an efficient task distribution method and implementation of load balancing system for the clustering environment with heterogeneous workstations. Turnaround time of the methods presented in this paper is compared with the method without load balancing as well as with the method load balancing with performance evaluation program. The experimental results show that our methods outperform all the other methods that we compared.

• The Journal of the Korea Contents Association
• /
• v.18 no.1
• /
• pp.64-75
• /
• 2018

With the development of location-aware technologies and the activation of smart phones, location based social networks(LBSN) have been activated to allow people to easily share their location. In particular, studies on recommending the location of user interests by using the user check-in function in LBSN have been actively conducted. In this paper, we propose a location recommendation scheme considering time and user activities in LBSN. The proposed scheme considers user preference changes over time, local experts, and user interest in rare places. In other words, it uses the check-in history over time and distinguishes the user activity area to identify local experts. It also considers a rare place to give a weight to the user preferred place. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.6
• /
• pp.1493-1504
• /
• 2016

As cyber threats have been increased over the Internet, the invasions of personal information are constantly occurring. A malicious user can access the Web site as a normal user using leaked personal information and does illegal activities. This paper proposes an effective method which authenticates a genuine user with real-time. The method use the user's profile which is a record of user's behavior created by Membership Analysis(MA) and Markov Chain Model(MCM). In addition to, user's profile is augmented by a Time Weight(TW) which reflects the user's tendency. This method can detect a malicious user who camouflage normal user. Even if it is a genuine user, it can be determined as an abnomal user if the user acts beyond the record profile. The result of experiment showed a high accuracy, 96%, for the correct user.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.5
• /
• pp.526-529
• /
• 2003

Recommender systems or collaborative filtering are methods to identify potentially interesting or valuable items to a particular user Under the assumption that people with similar interest tend to like the similar types of items, these methods use a database on the preference of a set of users and predict the rating on the items that the user has not rated. Usually the preference of a particular user is liable to vary with time and this temporal variation may cause an inaccurate identification and prediction. In this paper we propose a method to adapt the temporal variation of the user preference in order to improve the predictive performance of a collaborative filtering algorithm. To be more specific, the correlation weight of the GroupLens system which is a general formulation of statistical collaborative filtering algorithm is modified to reflect only recent similarity between two user. The proposed method is evaluated for EachMovie dataset and shows much better prediction results compared with GrouPLens system.

• Korean Journal of Remote Sensing
• /
• v.18 no.2
• /
• pp.117-125
• /
• 2002

Multitemporal analysis with remotely sensed data is complicated by numerous intervening factors, including atmospheric attenuation and occurrence of clouds that obscure the relationship between ground and satellite observed spectral measurements. Using an adaptive reconstruction system, dynamic compositing approach was developed to recover missing/bad observations. The reconstruction method incorporates temporal variation in physical properties of targets and anisotropic spatial optical properties into image processing. The adaptive system performs the dynamic compositing by obtaining a composite image as a weighted sum of the observed value and the value predicted according to local temporal trend. The proposed system was applied to the sequence of NDVI images of AVHRR observed on the Korean Peninsula from 1999 year to 2000 year. The experiment shows that the reconstructed series can be used as an estimated series with complete data for the observations including bad/missing values. Additionally, the gradient image, which represents the amount of temporal change at the corresponding time, was generated by the proposed system. It shows more clearly temporal variation than the data image series.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.162-169
• /
• 2022

In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A^* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A^* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.83-92
• /
• 2012

Location-based services (LBS) are increasingly popular due to the improvement of geo-positioning capabilities and wireless communication technology. However, in order to enjoy LBS services, a user requesting a query must send his/her exact location to the LBS provider. Therefore, it is a key challenge to preserve user's privacy while providing LBS. To solve this problem, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, 2PASS does not fully guarantee the actual user privacy because it does not take the real user distribution into account. Hence, in this paper, we propose a nearest neighbor query processing algorithm that supports K-anonymity property based on the weighted adjacency graph(WAG). Our algorithm not only preserves the location of a user by guaranteeing k-anonymity in a query region, but also improves a bandwidth usage by reducing unnecessary search for a query result. We demonstrate from experimental results that our algorithm outperforms the existing one in terms of query processing time and bandwidth usage.