• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.421-428
• /
• 2010

It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn't have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.322-331
• /
• 2009

This paper proposes an efficient data representation of stereo images using edge-based mesh optimization. Mash-based two dimensional warping for stereo images mainly depends on the performance of a node selection and a disparity estimation of selected nodes. Therefore, the proposed method first of all constructs the feature map which consists of both strong edges and boundary lines of objects for node selection and then generates a grid-based mesh structure using initial nodes. The displacement of each nodal position is iteratively estimated by minimizing the predicted errors between target image and predicted image after two dimensional warping for local area. Generally, iterative two dimensional warping for optimized nodal position required a high time complexity. To overcome this problem, we assume that input stereo images are only horizontal disparity and that optimal nodal position is located on the edge include object boundary lines. Therefore, proposed iterative warping method performs searching process to find optimal nodal position only on edge lines along the horizontal lines. In the experiments, we compare our proposed method with the other mesh-based methods with respect to the quality by using Peak Signal to Noise Ratio (PSNR) according to the number of nodes. Furthermore, computational complexity for an optimal mesh generation is also estimated. Therefore, we have the results that our proposed method provides an efficient stereo image representation not only fast optimal mesh generation but also decreasing of quality deterioration in spite of a small number of nodes through our experiments.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.63-71
• /
• 2011

In this paper, we propose a new real time image retargeting method which preserves the contents of an image. Since the conventional seam carving which is the well-known content-based image retargeting technology uses the dynamic programming method, the repetitive update procedure of the accumulation minimum energy map is absolutely needed. The energy map update procedure cannot avoid the processing time delay because of many operations by the image full-searching. The proposed method calculates the diffusion region of each seam candidates in the accumulation minimum energy map in order to reduce the update processing time. By using the diffusion region, several seams are extracted at the same time and the update number of accumulation energy map is reduced. Therefore, although the fast processing is possible, the quality of an image can be analogously maintained with an existing method. The experimental results show that the proposed method can preserve the contents of an image and adjust the image size on a real-time.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.1-7
• /
• 2002

The fast extraction of the silhouettes of a model is very useful for many applications in computer graphics and animation. In this paper, we present an efficient algorithm to compute a sequence of perspective silhouettes for a polyhedral model from a moving viewpoint. The viewpoint is assumed to move along a trajectory q(t), which is a space curve of a time parameter t. Then, we can compute the time-intervals for each edge of the model to be contained in the silhouette by two major computations: (i) intersecting q(t) with two planes and (ii) a number of dot products. If q(t) is a curve of degree n, then there are at most of n + 1 time-intervals for an edge to be in a silhouette. For each time point $t_i$ we can extract silhouette edges by searching the intervals containing $t_i$ among the computed intervals. For the efficient search, we propose two kinds of data structures for storing the intervals: an interval tree and an array. Our algorithm can be easily extended to compute the parallel silhouettes with minor modifications.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.1 s.1
• /
• pp.5-18
• /
• 1999

Recently, the necessity of automatic knowledge extraction from spatial data stored in spatial databases has been increased. Spatial data mining can be defined as the extraction of implicit knowledge, spatial relationships, or other knowledge not explicitly stored in spatial databases. In order to extract useful knowledge from spatial data, an object management system that can store spatial data efficiently, provide very fast indexing & searching mechanisms, and support a distributed computing environment is needed. In this paper, we designed and implemented an open object management system for spatial data mining, that supports efficient management of spatial, aspatial, and knowledge data. In order to develop this system, we used Open OODB that is a widely used object management system. However, the lark of facilities for spatial data mining in Open OODB, we extended it to support spatial data type, dynamic class generation, object-oriented inheritance, spatial index, spatial operations, etc. In addition, for further increasement of interoperability with other spatial database management systems or data mining systems, we adopted international standards such as ODMG 2.0 for data modeling, SDTS(Spatial Data Transfer Standard) for modeling and exchanging spatial data, and OpenGIS Simple Features Specification for CORBA for connecting clients and servers efficiently.

• Journal of Information Management
• /
• v.39 no.3
• /
• pp.95-113
• /
• 2008

In todays environment in which scientific technologies are changing very fast than ever, companies have to monitor and search emerging technologies to gain competitiveness. Actually many nations try to do that. Most of them use Dephi approach based on experts review as a searching method. But experts review has been criticised for probability of inclination and its derivative problems in the sense that it is accomplished only by expert's subjectivity. To overcome such problems, we used Scientometric Method for identifying emerging technology that had been done by Delphi as a rule. We made three particular efforts in order to improve the Quality of the result. Firstly, we selected one alternative database between SCI and Scopus hoping to see evenly-distributing results in wide fields on the front burner. Secondly we used Fractional citation counting in counting citation number in the stage of linear regression analysis. Lastly, we verified Scientometric result with experts opinions to minimize probable errors in a Scientometric research. As a result, we derived 290 emerging technologies from Scientometric analysis with Scopus Database, and visualized them on 2-dimension map with data mining system named KnowledgeMatrix which was developed by KISTI.

• Korean Journal of Social Welfare
• /
• v.62 no.1
• /
• pp.237-261
• /
• 2010

This study aims at exploring the employment experiences of people with psychiatric disabilities who look for job and work at workplace through deeply searching that of people with psychiatric disabilities from the point of their view. So this research shows how their employment experiences appears in our country and also what kind of meaning that gives to people with psychiatric disabilities. The Main question of this study is what the meaning and essence of employment experiences of people with psychiatric disabilities is. The qualitative research method was taken for widely understanding and lively writing employment experiences of people with psychiatric disabilities in the connection of their lives. Especially, it was set that phenomenological research methods introduced by Colaizzi's, which can be used for understanding the essential meaning of the experiences of research participants. The major themes could be analyzed as "Entering a narrow door", "Being raised on an unfamiliar stage", "Confusing in the fast world", "Enduring", "Adjusting to an ordinary life", and "Taking a step forward admitting their limitation". These are connected not in the state of independence state but dependence according to time flow. In this study the people with psychiatric disabilities in relation to employment are compared to salmons running back in a wild river. People with psychiatric disabilities have power through running back in their employment and lives like a long river. Even though there are difficulty things, they actively try to flow together with other people as mature people in our society. This research helps to make strategies of employment supports for people with psychiatric disabilities through their employment experiences.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.29-37
• /
• 2006

Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.125-144
• /
• 2006

The development of mobile applications is fast in recent years. However, nearly all applications are for messaging, financial, locating services based on simple interactions with mobile users because of the limited screen size, narrow network bandwidth, and low computing power. Processing an algorithm for supporting a group decision process on mobile devices becomes impossible. In this paper, we introduce the mobile-oriented simple interactive procedure for support a group decision making process. The interactive procedure is developed for multiple objective linear programming problems to help the group select a compromising solution in the mobile Internet environment. Our procedure lessens the burden of group decision makers, which is one of necessary conditions of the mobile environment. Only the partial weak order preferences of variables and objectives from group decision makers are enough for searching the best compromising solution. The methodology is designed to avoid any assumption about the shape or existence of the decision makers' utility function. For the purpose of the experimental study of the procedure, we developed a group decision support system in the mobile Internet environment, MOBIGSS and applied to an allocation problem of investor assets.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.