• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1722-1725
• /
• 1997

This paper presents image analysis method using a Markov random field(MRF) model. Particulary, image esgmentation is to partition the given image into regions. This scheme is first segmented into regions, and the obtained domain knowledge is used to obtain the improved segmented image by a Markov random field model. The method is a maximum a posteriori(MAP) estimation with the MRF model and its associated Gibbs distribution. MAP estimation method is applied to capture the natural image by TMS320C80(MVP) and to realize the segmented image by a MRF model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.40-48
• /
• 2007

This paper presents a novel texture segmentation method using multilayer perceptron (MLP) networks and Markov random fields in multiscale Bayesian framework. Multiscale wavelet coefficients are used as input for the neural networks. The output of the neural network is modeled as a posterior probability. Texture classification at each scale is performed by the posterior probabilities from MLP networks and MAP (maximum a posterior) classification. Then, in order to obtain the more improved segmentation result at the finest scale, our proposed method fuses the multiscale MAP classifications sequentially from coarse to fine scales. This process is done by computing the MAP classification given the classification at one scale and a priori knowledge regarding contextual information which is extracted from the adjacent coarser scale classification. In this fusion process, the MRF (Markov random field) prior distribution and Gibbs sampler are used, where the MRF model serves as the smoothness constraint and the Gibbs sampler acts as the MAP classifier. The proposed segmentation method shows better performance than texture segmentation using the HMT (Hidden Markov trees) model and HMTseg.

• Journal of Advanced Navigation Technology
• /
• v.27 no.4
• /
• pp.457-462
• /
• 2023

We proposed a flexible link configuration in a system combining mid-span spectral inversion (MSSI) and dispersion management used for long-distance transmission of high-capacity optical signals such as wavelength division multiplexing signals, and examined specific methods to increase chromatic dispersion and nonlinear distortion compensation effects. The dispersion map proposed to increase the flexibility of dispersion-managed link configuration has a 'random-inverse' structure. That is, in the proposed dispersion map, the residual dispersion per span (RDPS) of each fiber span in the first half section up to the optical phase conjugator is randomly distributed, and the RDPS distribution in the second half section reverses the distribution pattern of the first section. Although the proposed dispersion map has a random distribution of RDPS, it was confirmed that the distortion compensation effect is improved due to the fact that the dispersion profile is symmetrical with respect to the optical phase conjugator. In the dispersion map of the 'random-inverse' configuration, it was also confirmed that the compensation effect of the distorted wavelength division multiplexing signal becomes improved when the magnitude of the RDPS allocated to each fiber span is large.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1453-1459
• /
• 2016

Recently, vector map has developed, used in many domains, and in most cases vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the manufacturing process of a vector map is complex and the maintenance of a digital map requires substantial monetary and human resources. This paper presents the selective encryption scheme based on polyline simplification methods for GIS vector map data protection to store, transmit or distribute to authorized users. Main advantages of our algorithm are random vertices and transformation processes but it still meets requirements of security by random processes, and this algorithm can be implement to many types of vector map formats.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.4
• /
• pp.577-581
• /
• 2003

Some random fixed point theorems for weakly inward multivalued random maps are obtained in Banach spaces.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.125-129
• /
• 1996

In this study, a method is proposed for the cutting force prediction of Ball-end milling process using Z-map is proposed. Any types of cutting area generated from previous cutting process can be expressed in z-map data. Cutting edge of a ball-end mill is divided into a set of finite cutting edges and the position of this edge is projected to the cross-section plane normal to the Z-axis. Comparing this projected position with Z-map data of cutting area and determining whether it is in the cutting region, total cutting force can be calculated by means of numerical integration. A series of experiments such as side cutting and upward/downard cutting was performet to verify the simulated cutting force.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.357-372
• /
• 1998

In this paper we introduce and study a new class of random completely generalized strongly nonlinear quasi -comple- mentarity problems with non-compact valued random fuzzy map-pings and construct some new iterative algorithms for this kind of random fuzzy quasi-complementarity problems. We also prove the existence of random solutions for this class of random fuzzy quasi-complementarity problems and the convergence of random iterative sequences generated by the algorithms.

• Journal of Plant Biotechnology
• /
• v.1 no.2
• /
• pp.109-115
• /
• 1999

A linkage map of Capsicum annuum L. was constructed by random amplified polymorphic DNA (RAPD) markers followed in a backcross population of an intraspecific cross between cultivars HDA210 and Yatsufusa. A total of 420 random primers were tested and 311 polymorphic bands were generated by 158 random primers. Among them, 86 Yatsufusa specific bands generated by 52 primers were examined for mapping. Most bands except three segregated in Mendelian fashion fitting the expected 1:1 ratio. The total length of the map was 533 cM distributed in 15 linkage groups. The map distance between adjacent markers ranged 0 to 32.8 cM, with an average distance of 9.1 cM (63 markers). Some markers were clustered and this may be due to the amplification of a repetitive sequence by the RAPDs. Primer pairs for a sequence characterized amplified region (SCAR) were developed and the segregation scores by the SCAR primers were in accordance with the RAPD data. Two QTL markers for number of axillary shoots and for early flowering were developed. One QTL for early flowering located in the linkage group 3 and explained 61 "io of the phenotypic variation. The other QTL for the number of axillary shoots located in the linkage group 4 explained 55 % of the phenotypic variation.tion.

• Korean Journal of Environmental Agriculture
• /
• v.34 no.3
• /
• pp.168-177
• /
• 2015

BACKGROUND: In recent year, there has been great concern regarding agricultural land uses and their importance for the conservation of biodiversity. Rice fields are managed unique wetland for wildlife, especially waterbirds. A comprehensive monitoring of the waterbird assemblage to understand patterning changes was attempted for rice ecosystem in South Korea. This rice ecosystem has been recognized as one of the most important for waterbirds conservation. METHODS AND RESULTS: Biweekly monitoring was implemented for the 4 years from April 2009 to March 2010, from April 2011 to March 2014. 32 species of waterbirds were observed. Self-organizing map (SOM) and random forest were applied to the waterbirds dataset to identify the characteristics in waterbirds distribution. SOM and random forest analysis clearly classified into four clusters and extract ecological information from waterbird dataset. Waterbird assemblages represented strong seasonality and habitat use according to waterbird group such as shorebirds, herons and waterfowl. CONCLUSION: Our results showed that the combination of SOM and random forest analysis could be useful for ecosystem assessment and management. Furthermore, we strongly suggested that a strict management strategy for the rice fields to conserve the waterbirds. The strategy could be seasonally and species specific.