• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3217-3238
• /
• 2018

In this paper, a depth image up-sampling method is put forward by using pixel classifying and jointed bilateral filtering. By analyzing the edge maps originated from the high-resolution color image and low-resolution depth map respectively, pixels in up-sampled depth maps can be classified into four categories: edge points, edge-neighbor points, texture points and smooth points. First, joint bilateral up-sampling (JBU) method is used to generate an initial up-sampling depth image. Then, for each pixel category, different refinement methods are employed to modify the initial up-sampling depth image. Experimental results show that the proposed algorithm can reduce the blurring artifact with lower bad pixel rate (BPR).

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2011.04a
• /
• pp.347-350
• /
• 2011

Automobiles should be light and practical to reduce the price of manufacturing and maintaining expense. Hatchback vehicles are far from the silence for its practicality. This paper introduced the effective method of the planning of the asphalt material which applies the asphalt damping material. This paper showed the experiment which restrains the vibration of the vehicle trunk using asphalt damping material and chose the position of damping material using the velocity map and strain energy map and planed the optimum position.

• Communications for Statistical Applications and Methods
• /
• v.16 no.1
• /
• pp.1-11
• /
• 2009

When micro data are released to users, record by record data are disclosed and the disclosure risk of respondent's information is inevitable. Statistical disclosure control techniques are statistical tools to reduce the risk of disclosure as well as to increase data utility in case of data release. In this paper, we reviewed the concept of disclosure and disclosure risk as well as statistical disclosure control techniques and then investigated selection strategies of a statistical disclosure control technique related with data utility. The risk-utility frontier map method was illustrated as an example. Finally, we listed some check points at each step when microdata are released.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.382-389
• /
• 2009

Recently, knowledge management has been required in companies as a tool of competitiveness. Companies have constructed Enterprise Resource Planning(ERP) system in order to manage huge knowledge. But, it is not easy to formalize knowledge in organization. We focused on data mining system by genetic programming(GP). Data mining system by genetic programming can be useful tools to derive and extract the necessary information and knowledge from the huge accumulated data. However when we don't have enough amounts of data to perform the learning process of genetic programming, we have to reduce input parameter(s) or increase number of learning or training data. In this study, an enhanced data mining method combining Genetic Programming with Self organizing map, that reduces the number of input parameters, is suggested. Experiment results through a prototype implementation are also discussed.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.514-516
• /
• 1998

A Mobile Robot should be able to navigate safely in the workspaces without any additional human's helps. In this paper, a method to generate the safe path to avoid the unknown obstacles using the pre-knowledge of the workspaces was proposed. For the efficiency of the algorithm, it is proposed to model the obstacles as the line segments in numerical map, which can reduce the required memory size and give the simple forms. To make the environments map, we used the Hough transform and the sonar measurements is converted to the set of line segments by Hough transform. In this algorithm, the subgoals are generated to avoid the obstacles until a mobile robot arrives the final position using the proposed environmental model.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.655-666
• /
• 2007

There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.20 no.2
• /
• pp.171-181
• /
• 2002

As the result of the analysis of the underground utility map made before, we could have divided the kind of errors into the two types, position error of geometric data and attribute error and knew the fact that mainly position error is derived from the process of detecting and surveying the underground utility, and attribute is inputting data. In this study we showed the way improving accuracy in detecting and surveying underground utility by field test, and the way to reduce attribute error by process refinement.

• IE interfaces
• /
• v.16 no.1
• /
• pp.34-43
• /
• 2003

The Korean government has been working to reduce national logistics costs since the early 1990s. One of the major plans instituted by the government was to build five complex freight terminals using ICDs(inland container depots) as hub inland terminals. This paper explains the process and the methods adopted for site selection, with special focus on the Youngnam Freight Terminal. Among nineteen developable sites in Youngnam region, four candidates were selected based on the Map Overlay Approach under several criteria, including land acquisition costs, proximity to major highways and railroads, suitability of the terrain, etc. In this study, we used the AHP to select the best site among the four sites.

• The Journal of Korea Robotics Society
• /
• v.1 no.1
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.