• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.12
• /
• pp.157-163
• /
• 2017

The object segmentation approach has the merit of reducing the processing cost required to detect moths of interest, because it applies a moth detection algorithm to the segmented objects after segmenting the objects individually in the moth image. In this paper, an object segmentation method for moth detection in pheromone trap images is proposed. Our method consists of preprocessing, thresholding, morphological filtering, and object labeling processes. Thresholding in the process is a critical step significantly influencing the performance of object segmentation. The proposed method can threshold very elaborately by reflecting the local properties of the moth images. We performed thresholding using global and local versions of Ostu's method and, used the proposed method for the moth images of Carposina sasakii acquired on a pheromone trap placed in an orchard. It was demonstrated that the proposed method could reflect the properties of light and background on the moth images. Also, we performed object segmentation and moth classification for Carposina sasakii images, where the latter process used an SVM classifier with training and classification steps. In the experiments, the proposed method performed the detection of Carposina sasakii for 10 moth images and achieved an average detection rate of 95% of them. Therefore, it was shown that the proposed technique is an effective monitoring method of Carposina sasakii in an orchard.

• Korean Journal of Remote Sensing
• /
• v.34 no.2_2
• /
• pp.339-349
• /
• 2018

The massive green tide occurred every summer in the Yellow Sea since 2008, and many studies are being actively conducted to estimate the coverage of green tide through analysis of satellite imagery. However, there is no satellite images selection criterion for accurate coverage calculation of green tide. Therefore, this study aimed to find a suitable satellite image from for the comparison of the green tide coverage according to the spatial resolution of satellite image. In this study, Landsat ETM+, MODIS and GOCI images were used to coverage estimation and its spatial resolution is 30, 250 and 500 m, respectively. Green tide pixels were classified based on the NDVI algorithm, the difference of the green tide coverage was compared with threshold value. In addition, we estimate the proportion of the green tide in one pixel through the Linear Spectral Unmixing (LSU) method, and the effect of the difference of green tide ratio on the coverage calculation were evaluated. The result of green tide coverage from the calculation of the NDVI value, coverage of green tide usually overestimate with decreasing spatial resolution, maximum difference shows 1.5 times. In addition, most of the pixels were included in the group with less than 0.1 (10%) LSU value, and above 0.5 (50%) LSU value accounted for about 2% in all of three images. Even though classified as green tide from the NDVI result, it is considered to be overestimated because it is regarded as the same coverage even if green tide is not 100% filled in one pixel. Mixed-pixel problem seems to be more severe with spatial resolution decreases.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.51-57
• /
• 2012

Hepatic vessel tree is the key structure for hepatic disease diagnosis and liver surgery planning. Especially, it is used to evaluate the donors' and recipients' liver for the LDLT(Living Donors Liver Transplantation) and estimate the volumes of left and right hepatic lobes for securing their life in the LDLT. In this study, we propose a method to apply canny edge detection that is not affected by noise to the liver images for automatic segmentation of hepatic vessels tree in contrast abdominal MDCT image. Using histograms and average pixel values of the various liver CT images, optimized parameters of the Canny algorithm are determined. It is more time-efficient to use the common parameters than to change parameters manually according to CT images. Candidates of hepatic vessels are extracted by threshold filtering around the detected the vessel edge. Finally, using a system which detects the true-negatives and the false-positives in horizontal and vertical direction, the true-negatives are added in candidate of hepatic vessels and the false-positives are removed. As a result of the process, the various hepatic vessel trees of patients are accurately reconstructed in 3D.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.11 no.2
• /
• pp.115-124
• /
• 2017

This study was to develop the balance insole system for detecting and improving the muscle imbalance of left and right side in lower limbs. We were to verify the validation of balance insole system by analyzing the strategy of muscular activities and foot pressure according to sound feedback. We developed the balance insole based FSR sensor modules for estimating the muscle imbalance using detecting foot pressure. The insole system was FPCB have 8-spot FSR sensor with sensitivity range of 64-level. The participants were twenty peoples who have muscle strength differences in left and right legs over 20%. We measured the muscular activity and foot pressure of left and right side of lower limbs in various gait environment for verifying the improvement effect of muscle imbalance according to sound feedback. They performed gait in slope at 0, 5, 10, 15% and velocity at 3, 4, 5km/h. The result showed that the level of muscle imbalance reduced within 30% for sound feedback of balance insole system contrast to high level of muscle imbalance at 169.9~246.8% during normal gait for increasing slope and velocity. This study found the validation of balance insole system with sound feedback stimulus. Also, we thought that it is necessary to research on the sensitivity of foot area, detection of muscle imbalance and processing algorithm of correction threshold spot.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1852-1859
• /
• 2016

The effectiveness of a binarization algorithm in image processing depends on how to eliminate the uncertainty of determining threshold in a reasonable way and on minimizing information loss due to the binarization effect. Fuzzy binarization technique was proposed to handle that uncertainty with fuzzy logic. However, that method is known to be inefficient when the given image has low intensity contrast. In this paper, we propose an improved fuzzy binarization method to overcome such known drawbacks. Our method proposes a trapezoid type fuzzy membership function instead of most-frequently used triangle type one. We also propose an adaptive ${\alpha}$_cut determination policy. Our proposed method has less information loss than other algorithms since we do not use any stretching based preprocessing for enhancing the intensity contrast. In experiment, our proposed method is verified to be more effective in binarization with less information loss for many different types of images with low intensity contrast such as night scenery, lumber scoliosis, and lipoma images.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.467-477
• /
• 2004

While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.10
• /
• pp.713-722
• /
• 2013

This paper proposes a method of using depth information to detect the hand region in real-time based on the cascade method. In order to ensure stable and speedy detection of the hand region even under conditions of lighting changes in the test environment, this study uses only features based on depth information, and proposes a method of detecting the hand region by means of a classifier that uses boosting and cascading methods. First, in order to extract features using only depth information, we calculate the difference between the depth value at the center of the input image and the average of depth value within the segmented block, and to ensure that hand regions of all sizes will be detected, we use the central depth value and the second order linear model to predict the size of the hand region. The cascade method is applied to implement training and recognition by extracting features from the hand region. The classifier proposed in this paper maintains accuracy and enhances speed by composing each stage into a single weak classifier and obtaining the threshold value that satisfies the detection rate while exhibiting the lowest error rate to perform over-fitting training. The trained classifier is used to classify the hand region, and detects the final hand region in the final merger stage. Lastly, to verify performance, we perform quantitative and qualitative comparative analyses with various conventional AdaBoost algorithms to confirm the efficiency of the hand region detection algorithm proposed in this paper.

• Korean Journal of Remote Sensing
• /
• v.37 no.6_1
• /
• pp.1545-1557
• /
• 2021

Crops show sensitive spectral characteristics according to their species and growth conditions and although frequent observation is required especially in summer, it is difficult to utilize optical satellite images due to the rainy season. To solve this problem, Constrained Cloud-Maximum Normalized difference vegetation index Composite (CC-MNC) algorithm was developed to generate periodic composite images with minimal cloud effect. In thisstudy, using this method, monthly Sentinel-2A/B Normalized Difference Vegetation Index (NDVI) composite images were produced for paddies and high-latitude cabbage fields from 2019 to 2021. In August 2020, which received 200mm more precipitation than other periods, the effect of clouds, was also significant in MODIS NDVI 16-day composite product. Except for this period, the CC-MNC method was able to reduce the cloud ratio of 45.4% of the original daily image to 14.9%. In the case of rice paddy, there was no significant difference between Sentinel-2A/B and MODIS NDVI values. In addition, it was possible to monitor the rice growth cycle well even with a revisit cycle 5 days. In the case of high-latitude cabbage fields, Sentinel-2A/B showed the short growth cycle of cabbage well, but MODIS showed limitations in spatial resolution. In addition, the CC-MNC method showed that cloud pixels were used for compositing at the harvest time, suggesting that the View Zenith Angle (VZA) threshold needsto be adjusted according to the domestic region.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.11
• /
• pp.295-302
• /
• 2018

Face recognition (FR) has been widely used in various applications, such as smart surveillance systems, immigration control in airports, user authentication in smart devices, and so on. FR in well-controlled conditions has been extensively studied and is relatively mature. However, in unconstrained conditions, FR performance could degrade due to undesired characteristics of the input face image (such as irregular facial pose variations). To overcome this problem, this paper proposes a new method for determining if an input image is suitable for FR. In the proposed method, for an input face image, reconstruction error is computed by using a predefined set of reference face images. Then, suitability can be determined by comparing the reconstruction error with a threshold value. In order to reduce the effect of illumination changes on the determination of suitability, a preprocessing algorithm is applied to the input and reference face images before the reconstruction. Experimental results show that the proposed method is able to accurately discriminate non-frontal and/or incorrectly aligned face images from correctly aligned frontal face images. In addition, only 3 ms is required to process a face image of $64{\times}64$ pixels, which further demonstrates the efficiency of the proposed method.