• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.181-187
• /
• 2012

Millimeter wave (MMW) readily penetrates fabrics, thus it can be used to detect objects concealed under clothing. A passive MMW imaging system can operate as a stand-off type sensor that scans people in both indoors and outdoors. However, because of the diffraction limit and low signal level, the imaging system often suffers from low image quality. Therefore, suitable statistical analysis and computational processing would be required for automatic analysis of the images. In this paper, a real-time concealed object detection is addressed by means of the multi-level segmentation. The histogram of the image is modeled with a Gaussian mixture distribution, and hidden object areas are segmented by a multi-level scheme involving $k$-means, the expectation-maximization algorithm, and a decision rule. The complete algorithm has been implemented in C++ environments on a standard computer for a real-time process. Experimental and simulation results confirm that the implemented system can achieve the real-time detection of concealed objects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.801-807
• /
• 2013

WSN consists of hundreds to thousands of sensor nodes. In order to solve the problem of energy consumption imbalance cluster head is reelected in every round, while node authentication scheme is utilized for secure communication. However, re-clustering increases the overhead of sensor nodes and during the node authentication phase the frequent AREQ/AREP message exchange also increases the overhead. Therefore, a secure and energy efficient protocol, by which overhead of sensor nodes is reduced and long time communication is achieved, is required for wireless sensor network. In this paper, an energy efficient and reliable IDE-LEACH protocol for WSN is proposed. The proposed protocol is prolongs networks lifetime about average 20% compared to the LEACH-based protocols and all attending nodes in communication form BS authentication consisted of trusted nodes.

• The Journal of Korean Institute of Information Technology
• /
• v.16 no.12
• /
• pp.85-92
• /
• 2018

When using complicated image processing algorithms, we use superpixels to reduce computational complexity. Superpixel segmentation is a method of grouping pixels having similar characteristics into one group. Since superpixel is used as a preprocessing of image processing, it should be generated quickly, and the edge components of the image should be well preserved. In this paper, we propose a method of generating superpixels with a small amount of computation while preserving edge components well. In the proposed method, superpixels of an image are generated by using the existing k-mean method, and similar superpixels among the generated superpixels are merged to make final superpixels. When merging superpixels, the similarity is calculated only for superpixels. Therefore, the amount of computation is maintained small. It is shown by experimental results that the superpixel images produced by the proposed method are conserving edge information of the original image better than those produced by the existing method.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.473-480
• /
• 2005

We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism we create bivariate Polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other's transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and tine for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.66-77
• /
• 2011

We propose a framework for grouping photographic advertising images that employs a hierarchical indexing scheme based on efficient feature combinations. The study provides one specific application of effective tools for monitoring photographic advertising information through online and offline channels. Specifically, it develops a preprocessor for advertising image information tracking. We consider both global features that contain general information on the overall image and local features that are based on local image characteristics. The developed local features are invariant under image rotation and scale, the addition of noise, and change in illumination. Thus, they successfully achieve reliable matching between different views of a scene across affine transformations and exhibit high accuracy in the search for matched pairs of identical images. The method works with global features in advance to organize coarse clusters that consist of several image groups among the image data and then executes fine matching with local features within each cluster to construct elaborate clusters that are separated by identical image groups. In order to decrease the computational time, we apply a conventional clustering method to group images together that are similar in their global characteristics in order to overcome the drawback of excessive time for fine matching time by using local features between identical images.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.558-574
• /
• 2014

The number of fatty liver patients is sharply growing due to the rapid increase in the incidence of metabolic syndrome, which can lead to diseases such as abdominal obesity, hypertension, diabetes, and hyperlipidemia. Early diagnosis requires examinations using magnetic resonance imaging (MRI), wherein quantitative analyses are implemented through a professional water-fat separation method in many cases, as the intensity values of the areas of interest and non-interest are considerably similar or the same. However, such separation method generates inaccurate results in high magnetic fields, where the inhomogeneity of the fields increases. To overcome the limits of such conventional fat quantification methods, this paper proposes a field map estimation method that is effective in high magnetic fields. This method generates field maps through echo images that are obtained using the existing IDEAL sequences, and considers the wrapping degree of the field maps. Then clustering is performed to separate calibration areas, the least square fits based on the region growing method schema of the separated calibration areas, and the histograms are adjusted to separate the water from the fats. In experiment results, our proposed method had a superior fat detection rate of an average of 86.4%, compared to the ideal method with an average of 61.5% and Yu's method with an average of 62.6%. In addition, it was confirmed that the proposed method had a more accurate water detection rate of 98.4% on the average than the 88.6% average of the fat saturation method.

• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.2
• /
• pp.167-179
• /
• 2018

Objective: The aim of this study was to create a set of microsatellite markers with high polymorphism for the genetic monitoring and genetic structure analysis of local goose populations. Methods: Novel microsatellite markers were isolated from the genomic DNA of white Roman geese using short tandem repeated probes. The DNA segments, including short tandem repeats, were tested for their variability among four populations of geese from the Changhua Animal Propagation Station (CAPS). The selected microsatellite markers could then be used to monitor genetic variability and study the genetic structures of geese from local geese farms. Results: 14 novel microsatellite loci were isolated. In addition to seven known loci, two multiplex sets were constructed for the detection of genetic variations in geese populations. The average of allele number, the effective number of alleles, the observed heterozygosity, the expected heterozygosity, and the polymorphism information content were 11.09, 5.145, 0.499, 0.745, and 0.705, respectively. The results of analysis of molecular variance and principal component analysis indicated a contracting white Roman cluster and a spreading Chinese cluster. In white Roman populations, the CAPS populations were depleted to roughly two clusters when K was set equal to 6 in the Bayesian cluster analysis. The founders of private farm populations had a similar genetic structure. Among the Chinese geese populations, the CAPS populations and private populations represented different clads of the phylogenetic tree and individuals from the private populations had uneven genetic characteristics according to various analyses. Conclusion: Based on this study's analyses, we suggest that the CAPS should institute a proper breeding strategy for white Roman geese to avoid further clustering. In addition, for preservation and stable quality, the Chinese geese in the CAPS and the aforementioned proper breeding scheme should be introduced to geese breeders.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.371-382
• /
• 2007

Modern server systems are usually composed in the form of cluster systems in order to serve not only as many users but also as many kinds of applications as possible. The progression of the cluster system architecture leads in a middleware approach based on the Java framework. The middleware approach alleviates the efforts for the construction and the management of a server system but still preserves its performance and applications on the server. In this research, we introduce a new clustering scheme for the easy construction and maintenance of a cluster server system with the Java Management Extensions. We first demonstrate the construction and configuration process. Our experiment sets can verify that it is easy to construct, expand and manage a middleware based cluster system as well as the applications which reside on it. In addition, we can achieve reasonable performance on our service oriented clustered system with the help of state-of-the-art middleware. The experimental results of performance demonstration contain the availability of a server, and the effectiveness of load balancing and scheduling mechanisms. Especially, our service oriented scheduling mechanism was shown to successfully manage load imbalance under the normal load and cope with the overloaded situations, compared with other known scheduling mechanisms.