• Journal of Korea Game Society
• /
• 제10권2호
• /
• pp.49-56
• /
• 2010

In this paper, we propose a control method of virtual hand by the recognition of a user's hand in the virtual reality game environment. We display virtual hand on the game screen after getting the information of the user's hand movement and the direction thru input images by camera. We can utilize the movement of a user's hand as an input interface for virtual hand to select and move the object. As a hand recognition method based on the vision technology, the proposed method transforms input image from RGB color space to HSV color space, then segments the hand area using double threshold of H, S value and connected component analysis. Next, The center of gravity of the hand area can be calculated by 0 and 1 moment implementation of the segmented area. Since the center of gravity is positioned onto the center of the hand, the further apart pixels from the center of the gravity among the pixels in the segmented image can be recognized as fingertips. Finally, the axis of the hand is obtained as the vector of the center of gravity and the fingertips. In order to increase recognition stability and performance the method using a history buffer and a bounding box is also shown. The experiments on various input images show that our hand recognition method provides high level of accuracy and relatively fast stable results.

• Journal of Korea Multimedia Society
• /
• 제13권9호
• /
• pp.1299-1313
• /
• 2010

Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL -index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the $i^{th}$ sublayer in the partitioned database has the objects that can be the top-i object in the partitioned one. To retrieve top k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sublayer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL -index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (ie., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sublayer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.

• Journal of Animal Science and Technology
• /
• 제46권1호
• /
• pp.97-106
• /
• 2004

The study was conducted to investigate the effects of practical variations in feed restriction, pre-slaughter handing and chilling regime on pork quality during ageing. A total of twenty male landraces were allocated into three treatments(i.e., pre-slaughter feeding, stress and chilling regime) in a factorial arrangement. pH, temperature, free calcium ions, WB-shear force, sarcomere length, cooking loss, drip loss and objective color were determined during rigor development and/or 1, 3, 7 d postmortem. Pre-slaughter chasing stress for approximately 15 min had no effects on pH/temperature profile and objective meat quality. There was an interaction(P < 0.05) between the fasting treatment and chi1ling regime for muscle temperature at pH 6.2. Sarcomere length indicated that the current experiment conditions did not induce muscle shortening, with 1.7 to 1.8 ${\mu}m$, in spite of a significant effect of the fasting treatment (P<0.01). Pigs fed until the morning of slaughter showed a low WB-shear force(P < 0.05) until 3 d at I "C. The treatment also resulted in a higher Hunter L* and a*(P < 0.05) at 24 h and 7 d. Fasted pigs showed a significantly(P < 0.05) reduced cooking loss. The current results indicated that feeding upon the morning of slaughter became detrimental on meat color and the negative effect on cooking loss were linearly elevated with increased ageing time. On the other hand, WB-shear force did not distinguishable after 3 d. Collectively, it appeared that feed restriction from a day before slaughter could produce more a desirable meat quality at the time of consuming. However, the limited effect of animal handling and chilling rate on meat quality is not necessarily to extend to that these do not affect pork quality, as that largely depends on experimental design.

• Journal of Korea Multimedia Society
• /
• 제16권2호
• /
• pp.169-179
• /
• 2013

Change detection algorithms take two image frames and return the locations of newly introduced objects which cause differences between the images. This paper presents a new change detection method, which classifies intensity changes due to introduced objects, reflected light and shadow from the objects to their neighborhood, and the noise, and exactly localizes the introduced objects. For classification and localization, first we analyze the histogram of the intensity difference between two images, and estimate multiple threshold values. Second we estimate candidate object boundaries using the gradient difference between two images. Using those threshold values and candidate object boundaries, we segment the frame difference image into multiple regions. Finally we classify whether each region belongs to the introduced objects or not using textures in the region. Experiments show that the proposed method exactly localizes the objects in various scenes with different lighting.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제15권1호
• /
• pp.161-166
• /
• 2020

This paper suggests an extension of the unified Bayesian Tikhonov regularization method. The unified method establishes the relationship between Tikhonov regularization parameter and Bayesian hyper-parameters, and presents a formula for obtaining the regularization parameter using the maximum posterior probability and the evidence framework. When the dimension of the data matrix is m by n (m >= n), we derive that the total misfit has the range of m ± n instead of m. Thus the search range is extended from one to 2n + 1 integer points. Golden section search rather than linear one is applied to reduce the time. A new benchmark for optimizing relative error and new model selection criteria to target it are suggested. The experimental results show the effectiveness of the proposed method in the image restoration problem.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제14권6호
• /
• pp.1197-1206
• /
• 2019

Suncheon Bay is a very important natural resource and various efforts have been made to protect it from the environmental pollution. Although the project to monitor the environmental changes in periodically by observing the creatures in tidal flats is processing, it is being done inefficiently by people directly observing it. In this paper, we propose an object segmentation method that can be applied to the method to automatically monitor the living creatures in the tidal flats. In the proposed method, a foreground map representing the location of objects is obtained by using a temporal difference method, and a superpixel method is applied to detect the detailed boundary of an image. Finally the region of crab is extracted by combining the foreground map and the superpixel information. Experimental results show that the proposed method separates crab regions from a tidal flat image easily and accurately.

• Korean Journal of Cognitive Science
• /
• 제4권1호
• /
• pp.243-260
• /
• 1993

This paper presents an efficient method for estimationg and correcting the slant of off-line handwritten Hangul strings.In the proposed method,after extracting contours from input image.Hough tranform is applied to the contours to detect lines and estimate slants of the lines.When Hough trans form is applied to the contours,pixels which are not parts of the same stroke could be detected as a line.In order to exclude these lines from slant estimation process,detected lines which have the length less than threshold are eliminated.Experiments have been performed with address images which were extracted from live envelopes provided by Seoul Mail Center.Experimental results show that the proposed method is superior to the previous methods,which had been done with handwritten English strings.in estimation the slant of off-line handwritten Hangul strings.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제19권4호
• /
• pp.478-484
• /
• 2009

Automatic speech recognition(ASR) is attractive technique in trend these day that seek convenient life. Although many approaches have been proposed for ASR but the performance is still not good in noisy environment. Now-a-days in the state of art in speech recognition, ASR uses not only the audio information but also the visual information. In this paper, We present a novel lip detection method for visual speech recognition in mobile environment. In order to apply visual information to speech recognition, we need to extract exact lip regions. Because eye-detection is more easy than lip-detection, we firstly detect positions of left and right eyes, then locate lip region roughly. After that we apply K-means clustering technique to devide that region into groups, than two lip corners and lip center are detected by choosing biggest one among clustered groups. Finally, we have shown the effectiveness of the proposed method through the experiments based on samsung AVSR database.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제42권4호
• /
• pp.119-126
• /
• 2005

We propose a new content-based image retrieval using a representative color histogram and directional pattern histogram that is adaptive to the classification characteristics of the image blocks. In the proposed method the color and pattern feature vectors are extracted according to the characteristics o: the block classification after dividing the image into blocks with a fixed size. First, the divided blocks are classified as either luminance or color blocks depending on the saturation of the block. Thereafter, the color feature vectors are extracted by calculating histograms of the block average luminance co-occurrence for the luminance block and the block average colors for the color blocks. In addition, block directional pattern feature vectors are extracted by calculating histograms after performing the directional gradient classification of the luminance. Experimental results show that the proposed method can outperform the conventional methods as regards the precision and the size of the feature vector dimension.

• Journal of KIISE
• /
• 제43권1호
• /
• pp.40-46
• /
• 2016

Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.