• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.177-180
• /
• 2002

In this paper, an effective digital watermarking method for copyright protection of binary image data is proposed. First, a binary image is grouped into feature regions which have geometrical features and general one. The watermark for authentication is embedded in general regions in order to preserve geometrical features regions. We have used run-length code and special runs for grouping feature regions and general one. For invisibility of watermark, we have embedded the watermark considering transition sensitivity of each pixel in general regions. The proposed method is applied to some binary image such as character, signature, seal, and fingerprint image to evaluate performance. By the experimental results, the proposed method preserve feature regions of original image and have higher invisibility of watermarks.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.143.1-143.1
• /
• 2012

We attempt to investigate the main reason of the asymmetrical light curves of contact and near-contact eclipsing binary base on the hypothesis that cool spot was produced on late type star while hot spot was produced from transferred material from their companion star hitting surface. We select 7 eclipsing binary systems which showed asymmetric light curves and mass transfer. Period variation and mass transfer rate were obtained from O-C diagram. Radial velocity curves and light curves of those 7 eclipsing binary system were adopted from available literature in order to obtain the absolute dimension. For four contact eclipsing binary system (AD Phe, EZ Hya, AG Vir and VW Boo), their component stars belonged to spectral type G to K was fitted by cool spot model. While the other two near-contact systems (RT Scl and V1010 Oph) and one contact system (SV Cen) was fitted by cool spot model. The densities of the materials are adopted from stellar model which calculate by stellar structure code. The calculated spot temperature turns out to agree with the photometric solution but there are no correlate between period variation rate and type of spot.

• The Bulletin of The Korean Astronomical Society
• /
• v.45 no.1
• /
• pp.70.4-71
• /
• 2020

One of the distinctive characteristics of the evolution of binary systems would be mass transfer. Close binary systems experience so-called Case A mass transfer during the main-sequence. We have performed calculations of the evolution of massive Case A (with the initial period 1.5 ~ 4.5 days) binary systems with the initial mass of 10 ~ 20 solar masses and mass ratio 0.5 ~ 0.95 using the MESA code. We find that in some systems, after the first mass transfer, the secondary stars evolve faster than the primary stars and undergo so-called 'reverse' mass transfer. Such phenomena tend to occur in relatively low-mass (initial mass < 16 solar masses) and close (initial period < 3 day) systems. Unless a system enters the common-envelope phase, the primary star would become a single helium star after the secondary star ends its life if the system were unbound by the neutron star kick. We find the various evolutionary implications of the remaining primary stars. In addition to the evolution into the compact single helium star progenitor, there is a possibility that the remaining primary star could evolve into a helium giant star, which could be a promising candidate for Type Ibn supernova progenitor, depending on the core mass. Further, we find that some primary stars satisfy the conditions for the formation of electron-capture supernova progenitor.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• Proceedings of the Korean Magnestics Society Conference
• /
• 2015.05a
• /
• pp.149-149
• /
• 2015

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.461-469
• /
• 2016

A novel steganography based on ternary BCH code with t = 2 is presented in this paper. Proposed method utilizes powerful BCH code with t = 2 for data hiding to the DCT coefficients from JPEG images. The presented data hiding technique uses a proposed look up table approach for searching multiple solutions for ternary BCH code with t = 2. The proposed look up table approach enables fast and efficient search for locations of DCT coefficients, which are necessary to modify for hiding data. Presented data hiding technique is the first steganography technique based on ternary BCH code. Experimental results clearly indicate advantages of using ternary BCH compared to binary BCH.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.614-619
• /
• 2013

In multi-robot systems, ultrasonic sensors are widely used for localization and/or obstacle detection. However, conventional ultrasonic sensors have a drawback, that is, the interference problem among ultrasonic transmitters. There are some previous studies to avoid interferences, such as TDMA (Time Division Multiple Access) and CDMA (Code Division Multiple Access). In multiple autonomous mobile robots systems, the Doppler-effect has to be considered because ultrasonic transceivers are attached to the moving robots. To overcome this problem, we find out the ASK (Amplitude Shift Keying)-CDMA technique is more robust to the Doppler-effect than the BPSK (Binary Phase Shift Keying)-CDMA technique. In this paper, we propose a new code-expression method and a Monte-Carlo based algorithm that optimizes the ultrasonic code combination in the ASK-CDMA ultrasonic system. The experimental results show that the proposed algorithm improves the performance of the ultrasonic multiple accessing capacity in the ASK-CDMA ultrasonic system.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.9-15
• /
• 2014

In this paper, we proposed a new LDP code to solve a previous LDP code's problem and can include a face-color information. To include the face-color information, we developed various methods reducing the existing LDP code and analyzed the results. A new LDP code is represented by 6-bits different from the previous LDP code To adapt to a noise and environmental changes effectively and include 2-bits face-color information. The result shows better recognition rates of face and facial-expression than the existing methods effectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.73-80
• /
• 2016

We had introduced the backgrounds, history and physical meanings of Jong Nang in "Jeju Jong Nang Channel Code I, II and III". In "Jeju Jong Nang Channel Code II" paper, we have introduced practical the root of digital human binary coded Jong Nang communications as the wooden gate in Korea Jeju Island custom and investigated Jong Nang gatemodels as an approximation of the AWGN model. The objective was to find a deterministic model, which was accessible to analysis the capacity. Jong Nang communications mean the normal 3 rafters placed on two vertical stones with three holes to convey the family's whereabouts that is deterministic signal. In this paper we find the capacity of deterministic signal processing about the linear deterministic signals approximately.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.1
• /
• pp.53-63
• /
• 1986

In this paper the decoder of nonbinary code satisfying R>1/t has been designed and constructed, where R is the code rate and t is the error correcting capability. In order to design the error trapping decoder, the concept of covering monomial is used and them the decoder system using the (15, 11) Reed-Solomon code is implemented. Without Galois Fiedl multiplication and division circuits, the decoder system is simply constructed. In the decoding process, it takes 60clocks to decode one code word. Two symbol errors and eight binary burst errors are simultaneously corrected. This coding system is shown to be efficient when the channel error probability is approximately from $5{\times}10^-4$~$5{\times}10^-5$.