• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.397-404
• /
• 2016

In this work, a method is given to construct quantum codes from cyclic codes over F₄ + vF₄ which will be denoted as R throughout the paper, where v² = v and a Gray map is defined between R and where F₄ is the field with 4 elements. Some optimal quantum code parameters and others will be presented at the end of the paper.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1617-1628
• /
• 2016

In this paper, we extend the results given in [3] to a nonchain ring $R_p={\mathbb{F}}_p+v{\mathbb{F}}_p+{\cdots}+v^{p-1}{\mathbb{F}}_p$, where $v^p=v$ and p is a prime. We determine the structure of the cyclic codes of arbitrary length over the ring $R_p$ and study the structure of their duals. We classify cyclic codes containing their duals over $R_p$ by giving necessary and sufficient conditions. Further, by taking advantage of the Gray map ${\pi}$ defined in [4], we give the parameters of the quantum codes of length pn over ${\mathbb{F}}_p$ which are obtained from cyclic codes over $R_p$. Finally, we illustrate the results by giving some examples.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.2011-2023
• /
• 2015

This paper determines the structures of one-homogeneous weight codes over finite chain rings and studies the algebraic properties of these codes. We present explicit constructions of one-homogeneous weight codes over finite chain rings. By taking advantage of the distance-preserving Gray map defined in [7] from the finite chain ring to its residue field, we obtain a family of optimal one-Hamming weight codes over the residue field. Further, we propose a generalized method that also includes the examples of optimal codes obtained by Shi et al. in [17].

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.409-412
• /
• 2004

This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth, This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2,5dB at $BER=10^{-2}$ compared to Turbo Codes with Gray mapping.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.351-356
• /
• 2012

This paper presents the 2D/3D conversion technique using depth map which is generated based on the haze and relative height cue. In cases that only the conventional haze information is used, errors in image without haze could be generated. To reduce this kind of errors, a new approach is proposed combining the haze information with depth map which is constructed based on the relative height cue. Also the gray scale image from Mean Shift Segmentation is combined with depth map of haze information to sharpen the object's contour lines, upgrading the quality of 3D image. Left and right view images are generated by DIBR(Depth Image Based Rendering) using input image and final depth map. The left and right images are used to generate red-cyan 3D image and the result is verified by measuring PSNR between the depth maps.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.1
• /
• pp.50-57
• /
• 2005

We present a simple and effective method of face and facial feature detection under pose variation of user face in complex background for the human-robot interaction. Our approach is a flexible method that can be performed in both color and gray facial image and is also feasible for detecting facial features in quasi real-time. Based on the characteristics of the intensity of neighborhood area of facial features, new directional template for facial feature is defined. From applying this template to input facial image, novel edge-like blob map (EBM) with multiple intensity strengths is constructed. Regardless of color information of input image, using this map and conditions for facial characteristics, we show that the locations of face and its features - i.e., two eyes and a mouth-can be successfully estimated. Without the information of facial area boundary, final candidate face region is determined by both obtained locations of facial features and weighted correlation values with standard facial templates. Experimental results from many color images and well-known gray level face database images authorize the usefulness of proposed algorithm.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.571-595
• /
• 2021

In this paper we study the algebraic structure of ℤ_pℤ_p[u]/k>-cyclic codes, where u^k = 0 and p is a prime. A ℤ_pℤ_p[u]/k>-linear code of length (r + s) is an R_k-submodule of ℤ^r_p × R^s_k with respect to a suitable scalar multiplication, where R_k = ℤ_p[u]/k>. Such a code can also be viewed as an R_k-submodule of ℤ_p[x]/r - 1> × R_k[x]/s - 1>. A new Gray map has been defined on ℤ_p[u]/k>. We have considered two cases for studying the algebraic structure of ℤ_pℤ_p[u]/k>-cyclic codes, and determined the generator polynomials and minimal spanning sets of these codes in both the cases. In the first case, we have considered (r, p) = 1 and (s, p) ≠ 1, and in the second case we consider (r, p) = 1 and (s, p) = 1. We have established the MacWilliams identity for complete weight enumerators of ℤ_pℤ_p[u]/k>-linear codes. Examples have been given to construct ℤ_pℤ_p[u]/k>-cyclic codes, through which we get codes over ℤ_p using the Gray map. Some optimal p-ary codes have been obtained in this way. An example has also been given to illustrate the use of MacWilliams identity.

• Investigative Magnetic Resonance Imaging
• /
• v.20 no.4
• /
• pp.250-253
• /
• 2016

Acute Japanese encephalitis (JE) is an endemic viral infectious disease in various parts of Far East and Southeast Asian countries including Korea. Bilateral thalami are the most common involving sites in JE. Other areas including the basal ganglia, substantia nigra, red nucleus, pons, cerebral cortex and cerebellum may be also involved. We report an extremely unusual brain diffusion-weighted MR imaging (DWI) findings in a 53-year-old man with serologically proven JE involving unilateral deep gray matter and temporal lobe, which shows multifocal high signal intensities in left thalamus, left substantia nigra, left caudate nucleus and left medial temporal cortex on T2-weighted image and DWI with iso-intensity on apparent diffusion coefficient (ADC) map.

• Journal of Sensor Science and Technology
• /
• v.10 no.5
• /
• pp.286-291
• /
• 2001

We propose a new saliency map model for selecting an attended location in an arbitrary visual scene, which is one of the most important characteristics of human vision system. In selecting an attended location, an edge information can be considered as a feature basis to construct the saliency map. Edge filters are obtained from the independent component analysis(ICA) that is the best way to find independent edges in natural gray scenes. In order to reflect the non-uniform density in our retina, we use a multi-scaled pyramid input image instead of using an original input image. Computer simulation results show that the proposed saliency map model with multi-scale property successfully generates the plausible attended locations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.1-7
• /
• 2011

Terrain, building location and area, and building shape information is in need of implementing 3D map. This paper proposes a method of extracting a building area by an improved semi-automatic snake algorithm. The method consists of 3-stage: pre-processing, initializing control points, and applying an improved snake algorithm. In the first stage, after transforming a satellite image to a gray image and detecting the approximate edge of the gray image, the method combines the gray image and the edge. In the second stage, the user looks for the center point of a building and the system sets the circular or rectangular initial control points by an procedural method. In the third stage, the enhanced snake algorithm extracts the building area. In particular, this paper sets the one tenn of the snake in a new way in order to use the proposed method for specializing building area extraction. Finally, this paper evaluated the performance of the proposed method using sky view satellite image and it showed that the matching percentage to the exact building area is 75%.