• Journal of Biomedical Engineering Research
• /
• v.15 no.1
• /
• pp.83-88
• /
• 1994

The transform trellis code is an optimal source code as a block size and the constraint length of a shift register go to infinite for stationary Gaussian sources with the squared-error distortion measure. However to implement this code, we have to choose the finite block size and constraint length. Moreover real-world sources are inherently non stationary. To overcome these difficulties, we developed a training algorithm for the transform trellis code. The trained transform trellis code which uses the same rates to each block led to a variation in the resulting distortion from one block to another. To alleviate this non-uniformity in the encoded image, we constructed clusters from the variance of the training data and assigned different rates for each cluster.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.231-239
• /
• 2010

In cluster-based wireless sensor networks, the energy could be saved when the nodes that have data to transmit participate in cooperative multiple-input multiple-output (MIMO). In this paper, by making the idle nodes that have no data to transmit participate in the cooperative MIMO, it is found that much more energy could be saved. The number of the idle nodes that participate in the cooperative MIMO is optimized to minimize the total energy consumption. It is also found that the optimal number of all the nodes participating in cooperative communication does not vary with the number of nodes that have data to transmit. The proposition is proved mathematically. The influence of long-haul distance and modulation constellation size on the total energy consumption is investigated. A cooperative MIMO scheme with help-node participation is proposed and the simulation results show that the proposed scheme achieves significant energy saving.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.30 no.2
• /
• pp.86-96
• /
• 1994

In order to estimate the optimum harvesting mesh size of multispecies, the 24 species of catching data which were taken by fishing trial of trawl gear in Korean Southern Coast and East China Sea during 1991-1993 year were grouped and divided by the Cluster analysis method, considering first maturity length and body width, body height, body girth based on the first maturity length. With the same method, the above groups were subdivided by the potential escape such as possible escape index, range factor and selection factor. In case of the species devoid of selection parameters, these species were first subdivided by the use of possible escape index and length range factor. Next, the optimum harvesting mesh size of multispecies was properly classified according to the optimal mesh size of a fish estimated by first maturity length against selection factor. The results obtained are summarized as follows: 1. Each optimum harvesting mesh size of Psenopsis anomala, Priacanthus macra-canthus, Trachurus japonicus, Argyrosomus argentatus was 71.1-79.5mm, and Saurida undosquamis was 65.5mm. 2. Each optimum harvesting mesh size of Scomber japonicus, Pseudosciaena crosea, Pseudosciaena Polyactis, Sebastes thompsoni, Doderleinia berycoides was 78.5-85.6mm, and Bembras japonicus, Sphyraena pinguis was 48.4-51.3mm. 3. Each optimum harvesting mesh size of Zeus faber, Pampus argenteus, Zenopsis nebulosan was 118.4-124.1mm, and Caranx equula was 91.4mm, and Thamnaconus modestus was 131.2mm, and Pagrus major was 149.4mm. 4. Each optimum harvesting mesh size of Upeneus bensasi, Callanthias japonicus, Sardinops melanosticata, Konosirus punctatus was 36.8-42.8mm, and Acropoma japonicum was 21.2mm, and Apogon lineatus was 26.3mm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.942-949
• /
• 2016

Efficient routing protocols designed for Wireless Sensor Networks (WSN) can be extended and applied to Internet of Things (IoT) data routing, as IoT can be considered to be an extension from WSN. When the size of the data in IoT is often bigger than in conventional WSNs, existing cluster routing protocol such as LEACH may cause high data loss rate due to its incomplete load balancing. We present an enhanced LEACH-based protocol which can minimize the data loss which is an important performance measure in IoT. In our proposed protocol, the base station estimates the location of nodes by the trilateration technique to make sure optimal number of cluster heads and members in a deterministic manner. We evaluate our proposed protocol via computer simulations in terms of data loss rate and average network lifetime.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.426-431
• /
• 1991

Diakoptic method applied to analyze large power system, always require the efficient tearing algorithm. But conventional tearing methods is not suitable to apply practical power system. This paper presents new tearing algorithm based on factorization path concept of sparse vector method, and applied MPRLD, a kind of optimal ordering algorithm, in ordering step to improve the efficiency of tearing algorithm. Test result of model systems shows that new proposed method in this paper is enable to tear power systems not to be teared by heuristic cluster method, reduces computing time and memory size.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_3
• /
• pp.1427-1443
• /
• 2018

Object-based image analysis (OBIA) allows higher computation efficiency and usability of information inherent in the image, as it reduces the complexity of the image while maintaining the image properties. Superpixel methods oversegment the image with a smaller image unit than an ordinary object segment and well preserve the edges of the image. SLIC (Simple linear iterative clustering) is known for outperforming the previous superpixel methods with high image segmentation quality. Although the input parameter for SLIC, number of superpixels has considerable influence on image segmentation results, impact analysis for SLIC parameter has not been investigated enough. In this study, we performed optimal parameter analysis and evaluation of change detection for SLIC-based superpixel techniques using KOMPSAT data. Forsuperpixel generation, three superpixel methods (SLIC; SLIC0, zero parameter version of SLIC; SNIC, simple non-iterative clustering) were used with superpixel sizes in ranges of $5{\times}5$ (pixels) to $50{\times}50$ (pixels). Then, the image segmentation results were analyzed for how well they preserve the edges of the change detection reference data. Based on the optimal parameter analysis, image segmentation boundaries were obtained from difference image of the bi-temporal images. Then, DBSCAN (Density-based spatial clustering of applications with noise) was applied to cluster the superpixels to a certain size of objects for change detection. The changes of features were detected for each superpixel and compared with reference data for evaluation. From the change detection results, it proved that better change detection can be achieved even with bigger superpixel size if the superpixels were generated with high regularity of size and shape.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.171-177
• /
• 2011

Accuracy and computing time are considerable issues in machine learning. In general, the computing time for data analysis is increased in proportion to the size of given data. So, we need a sampling approach to reduce the size of training data. But, the accuracy of constructed model is decreased by going down the data size simultaneously. To solve this problem, we propose a new statistical sampling method having similar performance to the total data. We suggest a rule to select optimal sampling techniques according to given data structure. This paper shows a sampling method for reducing computing time with keeping the most of accuracy using cluster sampling, stratified sampling, and systematic sampling. We verify improved performance of proposed method by accuracy and computing time between sample data and total data using objective machine learning data sets.

• 한국균학회소식:학술대회논문집
• /
• 2014.05a
• /
• pp.21-21
• /
• 2014

A edible mushroom, Hypsizygus marmoreus is commercially cultivated in Northeast Asia. Japan's annual production is 110,000ton or more. Since 2002, cultivation is expanded in Korea. To investigate the morphological, cultural and microscopic characteristics of Hypsizygus marmoreus, 109 isolates were collected from Korea and other countries. Clamp connection, chlamydospore and arthrospore were present in all tested isolates of H. marmoreus except HYM-002 and HYM-004. Also pilealtrama, gilltrama, basidia, basidiospore and cystidia of fruiting body were no difference among the isolates in the present investigation. Morphological characteristics of fruiting body was that color of pileus was brown and white, irregular as marble, the average size 12~22mm and stipes was $46{\sim}91{\times}6{\sim}10mm$. Isolates HYM-031, HYM-047 and HYM-109 formed grayish-brown pileus with a faint pattern. Molecular analysis with RAPD and ITS rDNA sequence analysis were also performed to check the genetic relationships among H. marmoreus isolates. Based on the RAPD analysis using the URP-PCR, all isolates of H. marmoreus were clustered into large 3 groups but more than 90% showed high similarity. In addition, morphological and geographical differences have been classified as an independent cluster. The brown and white strains enclosed in same cluster. So genetically no significance difference was observed between these two strains. ITS gene sequences of 16 selected isolates which were 640 bp long, were aligned and compared. The similarity in ITS sequence was 94.8 to 99.1% among tested isolates and the H. marmoreus isolates in GeneBank. In conclusion the tested isolates were H. marmoreus. Morphological and molecular observations proved that all tested isolates were belonging to H. marmoreus. For the stable artificial cultivation, composition of optimum media, mature period and light condition were established. Optimal formula of artificial cultivation medium was Douglas sawdust: corn cob: soybean meal: wheat bran = 40:30:15:15. In addition, 7% rice bran and 3% yellow sucrose was the most effective composition for spawn's liquid medium. For the maturation of the isolates was favorable for growing for 20 to 30 days at $25^{\circ}C$ and the LED lights in mixture of white and blue was good for growth period. For effective growth, the temperature, humidity and aeration control in every step was important.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.