• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.253-260
• /
• 1999

In this paper, we suggest a new direct method for mage segmentation using texture and color information combined through a multivariate linear discriminant algorithm. The color texture is computed in nin 3${\times}$3 masks obtained from each 3${\times}$3${\times}$3 spatio-spectral neighborhood in the image using the classical haralick and Pressman texture features. Among these 9${\times}$28 texture features the best set was extracted from a training set. The resulting set of 10 features were used to segment an image into four different regions. The resulting segmentation was Compared to classical color and texture segmentation methods using both box classifiers and maximum likelihood classification. It compared favourably on the test image from a Fastred-Lightgreen stained prostatic histological tissue section based on visual inspection. The classification accuracy of 97.5% for the new method obtained on the training data was also among the best of the tested methods. If these results hold for a larger set of images, this method should be a useful tool for segmenting images where both color and texture are relevant for the segmentation process.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.34-40
• /
• 2018

This paper presents a new method to estimate the pose of a moving object accurately using a monocular camera and a low-end GPS+IMU sensor system. For this goal, we adopted a deep neural network for the semantic segmentation of input images and compared the results with a semantic map of a neighborhood. In this map matching, we use weight tables to deal with label inconsistency effectively. Signals from a low-end GPS+IMU sensor system are used to limit search spaces and minimize the proposed function. For the evaluation, we added noise to the signals from a high-end GPS-IMU system. The results show that the pose can be recovered from the noisy signals. We also show that the proposed method is effective in handling non-open-sky situations.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.50-57
• /
• 2006

In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.364-367
• /
• 2013

In this paper, we propose a method about reducing facial blemishes using Morphological Operation. First, we detect skin region using pixel data of RGB's each channel image. we create histogram of skin region R, G, B channel and save 3 pixel values that are high frequency pixel value in each channel. After than, we find facial blemishes using Black-hat operation. The pixel value of facial blemishes changes average of its pixel value, 8-neighborhood pixel value and high frequency pixel values. And the facial blemishes pixel is blurred with median filter. The result of this test with facial pictures that have facial blemishes, we prove that this system that correct the face skin using reduction facial Blemishes is more efficient method than correct the face skin just using lighting up.

• The Journal of the Korea Contents Association
• /
• v.15 no.2
• /
• pp.21-30
• /
• 2015

Image coding based on mixed raster content model generates don't care regions (DCR) in foreground and background layers, and its overall coding performance is greatly affected by region filling methods for DCRs. Most conventional methods for DCR filling fail in utilizing the local signal properties in hole regions and thus the high frequency components in non-DCR regions are reflected into DCR after signal filling. In addition, further high frequency components are induced to the filled signal because of signal discontinuities in the boundary of DCR. To solve this problem, a new DCR filling algorithm using the priority-based adaptive region growing is proposed in this paper. The proposed method uses the watershed algorithm and the flooding priority of each pixel for region filling is determined from the degree of smoothness in the neighborhood area. By growing the filled region into DCR based on the computed priority, the expansion of high-textured area can be minimized which can improve the overall coding performance. Experimental results show that the proposed method outperforms conventional algorithms.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.16 no.2
• /
• pp.129-140
• /
• 2013

This study reviewed different results according to the selection of viewpoints and considerations of the neighborhood in the analysis of view to regulate the height of buildings. To do this, 4 cases were set according to the analytical methodology and a GIS simulation was performed. Characteristics of each methodology were compared and analyzed by simulated values with ANOVA(analysis of variance) and post-hoc analysis. First, the method using moving viewpoints was found to be appropriate for the regulation of building height as it could reflect basic characteristics of landscape which was sequential and it did not show big difference in analysis result according to situational setting. Second, the method using grid viewpoints showed a problem that viewpoints at left and right sides viewed ridges of other mountains than the background mountains of the target land. Additionally, the simulation method that induces three-dimensional cross-sections between multiple sight-surface and virtual construction points created at viewpoints used in this study was found to be useful in the simulation review with various settings as it induced the marginal height of the spot quantitatively.

• Journal of Digital Convergence
• /
• v.15 no.4
• /
• pp.421-426
• /
• 2017

After the Pokemon game became popular, the popularity of the Augmented Reality game is higher than ever. Therefore, it is an important choice to use an engine to create an augmented reality game. It explains how to create an augmented reality game using Unity engine, which is one of the most used game engines in game development. We describe a method for implementing augmented reality optimized for games by selecting a MARKERLESS method that does not require a marker among the augmented reality techniques. In this paper, we propose a technique to create MARKERLESS augmented reality game using KUDAN AR engine which supports Unity engine and unity through 'Our Hero' project.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.21 no.2
• /
• pp.34-49
• /
• 1993

This research aimed to analize the cognitive intensity of valuation(C.I.V) on urban environment as a first stage of the works on evaluative urban image under the hypothesis that it could be interpreted with a correlation analysis between the C.I.V and attitude(Satisfaction of unsatisfaction Intensity) toward urban environment. As a method of a study, 118 cognitive elements were selected representing an urban environment, and each of elements was suggested to citizens of Kyungju with 7 point Likert Scale. The analysis of C.I.V was operated under the three criteria: The first, three of urban space scale(urban scale, neighborhood scale, and housing scale), the second, four elements of urban living environment(safety, amenity, healthfulness, and effectiveness), and the last, thirteen urban unit environment(housing, traffic, education, tourism, medical/health, culture, etc.). The results were as follows: C.I.V to each of 118 elements was cleary defined, showing the possibilities of being applied to a method for subjective, or cognitive evaluation on urban environment: It was revealed that citizens'C.I.V was rather higher in non-physical, qualitative elements than in physical and quantitative ones. This shows well the limitation of the objective method of evaluation of urban environment: The results of the others' studies on the image of Kyungju based on the cognitive approach, being focused on the analysis of the visual aspects of urban structure, cultural assets, historic site and tourism, were almost same as this study but it was quite different for this research to reveal well the citizens' cognition on their living environment of traffic, education, medical, etc..

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.352-358
• /
• 2004

This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.