• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2737-2753
• /
• 2013

In this study, we propose a novel salient object detection strategy based on regional contrast and relative spatial compactness. Our algorithm consists of four basic steps. First, we learn color names offline using the probabilistic latent semantic analysis (PLSA) model to find the mapping between basic color names and pixel values. The color names can be used for image segmentation and region description. Second, image pixels are assigned to special color names according to their values, forming different color clusters. The saliency measure for every cluster is evaluated by its spatial compactness relative to other clusters rather than by the intra variance of the cluster alone. Third, every cluster is divided into local regions that are described with color name descriptors. The regional contrast is evaluated by computing the color distance between different regions in the entire image. Last, the final saliency map is constructed by incorporating the color cluster's spatial compactness measure and the corresponding regional contrast. Experiments show that our algorithm outperforms several existing salient object detection methods with higher precision and better recall rates when evaluated using public datasets.

• Communications for Statistical Applications and Methods
• /
• v.25 no.4
• /
• pp.373-383
• /
• 2018

The spatial scan statistic is a widely used method to detect spatial clusters. The method imposes a large number of scanning windows with pre-defined shapes and varying sizes on the entire study region. The likelihood ratio test statistic comparing inside versus outside each window is then calculated and the window with the maximum value of test statistic becomes the most likely cluster. The results of cluster detection respond sensitively to the shape and the maximum size of scanning windows. The shape of scanning window has been extensively studied; however, there has been relatively little attention on the maximum scanning window size (MSWS) or maximum reported cluster size (MRCS). The Gini coefficient has recently been proposed by Han et al. (International Journal of Health Geographics, 15, 27, 2016) as a powerful tool to determine the optimal value of MRCS for the Poisson-based spatial scan statistic. In this paper, we apply the Gini coefficient to normal-based spatial scan statistics. Through a simulation study, we evaluate the performance of the proposed method. We illustrate the method using a real data example of female colorectal cancer incidence rates in South Korea for the year 2009.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.5
• /
• pp.1193-1201
• /
• 2016

In epidemiology or etiology, we are often interested in identifying areas of elevated risk, so called, hot spot or cluster. Many existing clustering methods only tend to a result if there exists any clustering pattern in study area. Recently, however, lots of newly introduced clustering methods can identify the location, size, and shape of clusters and test if the clusters are statistically significant as well. In this paper, one of most commonly used clustering methods, scan statistic, and its implementation SaTScan software, which is freely available, will be introduced. To exemplify the usage of SaTScan software, we used cancer data from the SEER program of National Cancer Institute of U.S.A.We aimed to help researchers and practitioners, who are interested in spatial cluster detection, using female lung cancer mortality data of the SEER program.

• Journal of the Korean Geographical Society
• /
• v.45 no.4
• /
• pp.502-520
• /
• 2010

The main objective of the paper is to develop a GIS-based method for delineating spatial clusters. Major tasks are: (i) to devise a sustainable algorithm with reference to various methods developed in the fields of geographic boundary analysis and cluster detection; (ii) to develop a GIS-based program to implement the algorithm. The main results are as follows. First, it is recognized that the AMOEBA technique utilizing LISA is the best candidate. Second, a modified version of the AMOEBA technique is proposed and implemented in a GIS environment. Third, the validity and usefulness of the modified AMOEBA algorithm is assured by its applications to test and real data sets.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.37-43
• /
• 2016

This paper introduces a method for video shot group detection needed for efficient management and summary of video. The proposed method detects shots based on low-level visual properties and performs temporal and spatial clustering based on visual similarity of neighboring shots. Shot groups created from temporal clustering are further clustered into small groups with respect to visual similarity. A set of representative shot frames are selected from each cluster of the smaller groups representing a scene. Shots excluded from temporal clustering are also clustered into groups from which representative shot frames are selected. A number of video clips are collected and applied to the method for accuracy of shot group detection. We achieved 91% of accuracy of the method for shot group detection. The number of representative shot frames is reduced to 1/3 of the total shot frames. The experiment also shows the inverse relationship between accuracy and compression rate.

• Journal of Korean Society on Water Environment
• /
• v.25 no.5
• /
• pp.735-741
• /
• 2009

In order to support the basic information for planning and performing the environment management such as Total Maximum Daily Loads (TMDLs), it is highly recommended to understand the spatial distribution of water quality and runoff data in the unit watersheds. Therefore, in the present study, we applied Self-Organizing Map (SOM) to detect the characteristics of spatial distribution of Biological Oxygen Demand (BOD) concentration and runoff data which have been measured in the Yeongsan, Seomjin, and Tamjin River basins. For the purpose, the input dataset for SOM was constructed with the mean, standard deviation, skewness, and kurtosis values of the respective data measured from the stations of 22-subbasins in the rivers. The results showed that the $4{\times}4$ array structure of SOM was selected by the trial and error method and the best performance was revealed when it classified the stations into three clusters according to the basic statistics. The cluster-1 and 2 were classified primarily by the skewness and kurtosis of runoff data and the cluster-3 including the basic statistics of YB_B, YB_C, and YB_D stations was clearly decomposed by the mean value of BOD concentration showing the worst condition of water quality among the three clusters. Consequently, the methodology based on the SOM proposed in the present study can be considered that it is highly applicable to detect the spatial distribution of BOD concentration and runoff data and it can be used effectively for the further utilization using different water quality items as a data analysis tool.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.272-287
• /
• 2016

Recently, various and effective contrast based salient object detection models to focus on a single target have been proposed. However, there is a lack of research on detection of multiple objects, and also it is a more challenging task than single target process. In the multiple target problem, we are confronted by new difficulties caused by distinct difference between properties of objects. The characteristic of existing models depending on the global maximum distribution of data point would become a drawback for detection of multiple objects. In this paper, by analyzing limitations of the existing methods, we have devised three main processes to detect multiple salient objects. In the first stage, regional features are extracted from over-segmented regions. In the second stage, the regional features are categorized into homogeneous cluster using the mean-shift algorithm with the kernel function having various sizes. In the final stage, we compute saliency scores of the categorized regions using only spatial features without the contrast features, and then all scores are integrated for the final salient regions. In the experimental results, the scheme achieved superior detection accuracy for the SED2 and MSRA-ASD benchmarks with both a higher precision and better recall than state-of-the-art approaches. Especially, given multiple objects having different properties, our model significantly outperforms all existing models.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.1
• /
• pp.57.2-57.2
• /
• 2013

Based on N-body simulations, we find out that significant fraction of dynamically formed BH-BH (10 $M_{\odot}$ and NS-NS (1.4 $M_{\odot$ ecah) binaries are ejected from globular clusters. About 30 percent of compact stars are ejected in the form of binary. The merging time of ejected binary depends on the velocity dispersion of globular cluster. Some of ejected binaries have merging time-scales shorter than Hubble time and are expected to produce gravitational waves that can be detectable by the advanced ground-based interferometers. The merger rates of ejected BH-BH and NS-NS binaries per globular cluster are estimated to be 3.5 and 17 per Gyr, respectively. Assuming the spatial density of globular clusters as 8.4 $h^3$ clusters $Mpc^{-3}$ and extrapolating to the horizon distance of the advanced LIGO-Virgo network, we expect the detection rates solely attributed to BH-BH and NS-NS with cluster origin are to be 42 and 1.7 $yr^{-1}$, respectively. Besides, we find out that BH-NS binary ejection hardly occurs in globular clusters and dynamically formed compact binaries may possibly be the source of short GRBs whose locations are far from host galaxies.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.70-77
• /
• 2008

This paper proposes a new text candidate region detection method that uses genetic algorithm based on information of the segmented regions. In image segmentation, a classification of the pixels at each color channel and a reclassification of the region-unit for reducing inhomogeneous clusters are performed. EWFCM(Entropy-based Weighted C-Means) algorithm to classify the pixels at each color channel is an improved FCM algorithm added with spatial information, and therefore it removes the meaningless regions like noise. A region-based reclassification based on a similarity between each segmented region of the most inhomogeneous cluster and the other clusters reduces the inhomogeneous clusters more efficiently than pixel- and cluster-based reclassifications. And detecting text candidate regions is performed by genetic algorithm based on energy and variance of the directional edge components, the number, and a size of the segmented regions. The region information-based detection method can singles out semantic text candidate regions more accurately than pixel-based detection method and the detection results will be more useful in recognizing the text regions hereafter. Experiments showed the results of the segmentation and the detection. And it confirmed that the proposed method was superior to the existing methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.267-273
• /
• 2011

In this paper, we proposed the method to detect brain tumor region in MR images. Our method is composed of 3 parts, detection of tumor slice, detection of tumor region and tumor boundary detection. In the tumor slice detection step, a slice which contains tumor regions is distinguished using symmetric analysis in 3D brain volume. The tumor region detection step is the process to segment the tumor region in the slice distinguished as a tumor slice. And tumor region is finally detected, using spatial feature and symmetric analysis based on the cluster information. The process for detecting tumor slice and tumor region have advantages which are robust for noise and requires less computational time, using the knowledge of the brain tumor and cluster-based on symmetric analysis. And we use the level set method with fast marching algorithm to detect the tumor boundary. It is performed to find the tumor boundary for all other slices using the initial seeds derived from the previous or later slice until the tumor region is vanished. It requires less computational time because every procedure is not performed for all slices.