• Journal of Digital Convergence
• /
• v.10 no.3
• /
• pp.173-178
• /
• 2012

In this paper, a new saliency map generation method is discussed which extracts objects effectively using extracted Salient Region. Feature map is constructed first using four features of edge, hue of HSV color model, focus and entropy and then conspicuity map is generated from Center Surround Differences using the feature map. Final saliency map is constructed by the combination of conspicuity maps. Saliency map generated using this procedure is compared to the conventional technique and confirmed that new technique has better results.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.4
• /
• pp.17-22
• /
• 2006

We present the technique that automatically generates caricatures from input face images. We get the mean-shape of training images and extract input image's feature point using AAM(Active Appearance Model). From literature of caricature artists, we define exaggeration rules and apply our rules to input feature points, then we can get exaggerated feature points. To change our results into cartoon-like images, we apply some cartoon-stylizing method to input image and combine it with facial sketch. The input image is warped to exaggerated feature point for final results. Our method can automatically generate a caricature image while it minimizes user interaction.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.127-134
• /
• 2020

In this paper, we propose a map alignment method for maps generated by point-line monocular SLAM. In the proposed method, the information of feature lines as well as feature points extracted from multiple maps are fused into a single map. To this end, the proposed method first searches for similar areas between maps via Bag-of-Words-based image matching. Thereafter, it calculates the similarity transformation between the maps in the corresponding areas to align the maps. Finally, we merge the overlapped information of multiple maps into a single map by removing duplicate information from similar areas. Experimental results show that maps created by different users are combined into a single map, and the accuracy of the fused map is similar with the one generated by a single user. We expect that the proposed method can be utilized for fast imagery map generation.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.93-96
• /
• 2000

In this paper, we suggest a feature points selection method using block-based watershed segmentation and polygon approximation for preprocessing of MPEG-4 mesh generation. 2D natural image is segmented by 8$\times$8 or 4$\times$4 block classification method and watershed algorithm. As this result, pixels on the watershed lines represent scene's interior feature and this lines are shapes of closed contour. Continuous pixels on the watershed lines are selected out feature points using Polygon approximation and post processing.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.871-880
• /
• 2010

Many applications dealing with image management need a technique for removing duplicate images or for grouping related (near-duplicate) images in a database. This paper proposes a concentric circle-based image signature which makes it possible to detect near-duplicates rapidly and accurately. An image is partitioned by radius and angle levels from the center of the image. Feature values are calculated using the average or variation between the partitioned sub-regions. The feature values distributed in sequence are formed into an image signature by hash generation. The hashing facilitates storage space reduction and fast matching. The performance was evaluated through discriminability and robustness tests. Using these tests, the particularity among the different images and the invariability among the modified images are verified, respectively. In addition, we also measured the discriminability and robustness by the distribution analysis of the hashed bits. The proposed method is robust to various modifications, as shown by its average detection rate of 98.99%. The experimental results showed that the proposed method is suitable for near-duplicate detection in large databases.

• Journal of the Korean Society of Food Culture
• /
• v.26 no.3
• /
• pp.211-219
• /
• 2011

To examine the key success factors for long-lasting restaurants, we visited 10 restaurants with 30 or more than 30 years of tradition, located in Seoul and Gyeonggi-do districts, to research these restaurant menus and customer characteristics by observation and interview. The results were analyzed using descriptive statistics. The outstanding feature noted was that each and every restaurant had its own simple and specialized menu. We found that this feature created a virtuous circle that reinforced itself through a positive feedback loop. The simple and specialized menu increased both the cooking efficiency and food quality while it reduced both food and labor costs, this enabled the customers to eat at an affordable price and have generous servings. This lead to customer satisfaction and revisits to the restaurant, which triggered word-of-mouth referral and expansion of their customer base. This in turn created higher operating profit margins that could be reinvested in the business. The secret recipes for cooking, invented by their founders, were passed on from generation to generation. Their customer base included customers of all ages from children to senior people. And their regular customers consisted of neighboring office workers and families traveling from a long distance. We hope that our findings on long-lasting restaurants, especially of the virtuous cycle created due to the simple and specialized menus with secret recipes, will contribute to the development of Korean style long-lasting restaurant model.

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

This paper presents a method that generates various facial expressions of vector graphic character by using the simplified principle component vector. First, we analyze principle components to the nine facial expression(astonished, delighted, etc.) redefined based on Russell's internal emotion state. From this, we find principle component vector having the biggest effect on the character's facial feature and expression and generate the facial expression by using that. Also we create natural intermediate characters and expressions by interpolating weighting values to character's feature and expression. We can save memory space considerably, and create intermediate expressions with a small computation. Hence the performance of character generation system can be considerably improved in web, mobile service and game that real time control is required.

• The Journal of Information Systems
• /
• v.31 no.4
• /
• pp.47-73
• /
• 2022

Purpose The purpose of this study is to select the electronic architecture concept of the powertrain domain of the electronic platform to be applied to electric vehicles after 2025. Previously, the automotive electrical and electronic architecture was determined only by trend analysis, but the purpose was to determine the scenario based on the data and select it with clear evaluation indicators. Design/methodology/approach This study identified the function to be applied to the powertrain domain of next-generation electric vehicle, estimated the controller, defined the function feature list, organized the scenario candidates with the controller list and function feature list, and selected the final architecture scenario. Findings According to the research results, the powertrain domain of electric vehicles was selected as the architectural concept to apply the DCU (Domain Control Unit) and VCU (Vehicle Control Unit) integrated architecture to next-generation electric vehicles. Although it is disadvantageous or equivalent in terms of cost, it was found to be excellent in most indicators such as stability, security, and hardware demand.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.47-53
• /
• 2004

The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.