• Management & Information Systems Review
• /
• v.4
• /
• pp.257-284
• /
• 2000

According as the drivers increase who have their cars, the comprehensive studies on the automobile for the traffic safety have been raised as the important problems. Visual Recognition System for radio-controled driving is a part of the sensor processor of Unmanned Autonomous Vehicle System. When a driver drives his car on an unknown highway or general road, it produces a model from the successively inputted road traffic information. The suggested Recognition System of the Road Traffic Safety Information Board is to recognize and distinguish automatically a Road Traffic Safety Information Board as one of road traffic information. The whole processes of Recognition System of the Road Traffic Safety Information Board suggested in this study are as follows. We took the photographs of Road Traffic Safety Information Board with a digital camera in order to get an image and normalize bitmap image file with a size of $200{\times}200$ byte with Photo Shop 5.0. The existing True Color is made up the color data of sixteen million kinds. We changed it with 256 Color, because it has large capacity, and spend much time on calculating. We have practiced works of 30 times with erosion and dilation algorithm to remove unnecessary images. We drawing out original image with the Region Splitting Technique as a kind of segmentation. We made three kinds of grouping(Attention Information Board, Prohibit Information Board, and Introduction Information Board) by RYB( Red, Yellow, Blue) color segmentation. We minimized the image size of board, direction, and the influence of rounding. We also minimized the Influence according to position. and the brightness of light and darkness with Eigen Vector and Eigen Value. The data sampling this feature value appeared after building the learning Code Book Database. The suggested Recognition System of the Road Traffic Safety Information Board firstly distinguished three kinds of groups in the database of learning Code Book, and suggested in order to recognize after comparing and judging the board want to recognize within the same group with Nearest Neighborhood Decision Making.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.11
• /
• pp.66-78
• /
• 2015

With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.

• Geomechanics and Engineering
• /
• v.11 no.1
• /
• pp.77-94
• /
• 2016

A forked tunnel, as a special complicated underground structure, is composed of big-arch tunnel, multi-arch tunnel, neighborhood tunnels and separate tunnels according to the different distances between two separate tunnels. Due to the complicated process of design and construction, surrounding jointed rock mass stability of the big-arch tunnel which belongs to the forked tunnel during excavation is a hot issue that needs special attentions. In this paper, an elasto-plastic damage constitutive model for jointed rock mass is proposed based on the coupling method considering elasto-plastic and damage theories, and the irreversible thermodynamics theory. Based on this elasto-plastic damage constitutive model, a three dimensional elasto-plastic damage finite element code (D-FEM) is implemented using Visual Fortran language, which can numerically simulate the whole excavation process of underground project and perform the structural stability of the surrounding rock mass. Comparing with a popular commercial computer code, three dimensional fast Lagrangian analysis of continua (FLAC3D), this D-FEM has advantages in terms of rapid computing process, element grouping function and providing more material models. After that, FLAC3D and D-FEM are simultaneously used to perform the structural stability analysis of the surrounding rock mass in the forked tunnel considering three different computing schemes. The final numerical results behave almost consistent using both FLAC3D and D-FEM. But from the point of numerically obtained damage softening areas, the numerical results obtained by D-FEM more closely approach the practical behaviors of in-situ surrounding rock mass.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.624-631
• /
• 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 has 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 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.

• Journal of Digital Contents Society
• /
• v.16 no.4
• /
• pp.583-593
• /
• 2015

Today, caused by the growth of computer and communication technology, multimedia, especially image data are being used in different application divisions. JPEG2000 that is widely used these days provides a Region-of-Interest(ROI) technique. The extraction of ROI has to be rapidly executed and automatically extracted in a huge amount of image because of being seen preferentially to the users. For this purpose, this paper proposes a method about preferential processing and automatic extraction of ROI using the distribution of edge in the code block of JPEG2000. The steps are the extracting edges, automatical extracting of a practical ROI, grouping the ROI using the ROI blocks, generating the mask blocks and then quantization, ROI coding which is the preferential processing, and EBCOT. In this paper, to show usefulness of the method, we experiment its performance using other methods, and executes the quality evaluation with PSNR between the images not coding an ROI and coding it.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.623-630
• /
• 2004

The adaptive modulation along with SFBC transmit diversity is a very effective method to increase the capacity of an OFDM system. However, severe performance degradation is resulted when inter-symbol interference is applied due to frequency-selective fading in mobile communications. In this paper, we have proposed and analyzed an OFDM system with SFBC transmit diversity and adaptive modulation scheme based on pre-equalization methods, in order to increase the data transmission rate in the downlink without much increase in system complexity. By introducing subchannel grouping and the pre-equalization method among adjacent subchannels, we could enhance the efficiency of the adaptive modulation a lot. By computer simulation, it has been proven that the proposed schemes show a better BER and throughput performance than the conventional schemes under severely time-varying multipath fading channel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1554-1563
• /
• 2008

As the interests on RFID technologies increase, a lot of research activities on RFID middleware systems to handle the data acquired by RFID readers are going on actively. Meanwhile, even though various kinds of RFID middleware methodologies and related techniques have been proposed, the common data type which is dealt with in those systems is an EPC code, mainly. Also, there are few researches of the implementation of collecting the stream data queued from RFID readers endlessly and without blocking, classifying the data into some groups according to usage, and sending the resulting data to specific applications. In this paper, we propose the method of data handling in RFID middleware to efficiently process an EPC event stream data using detail filtering, checking of data modification, creation of data set to transfer, data grouping, and various kinds of RFID data format transform. Our method is based on a de facto international standard interface defined in the ALE middleware specification by EPCglobal, and application and service users can directly set various kinds of conditions to handle the stream data.

• Nuclear Engineering and Technology
• /
• v.25 no.2
• /
• pp.193-203
• /
• 1993

A new heuristic method for loading pattern search has been developed to overcome short-comings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length(MCL) and minimizing power-peaking factor(MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.1-9
• /
• 2006

In this paper, we propose a MIMO-OFDMA (Multi Input Multi Output-Orthogonal Frequency Division Multiple Access) system based on beamforming for performance improvement of downlink real-time traffic transmission in harsh channel conditions with low CIR (Carrier-to-Interference Ratio). In the proposed system, we first consider the M-GTA-SBA (Modified-Grouped Transmit Antenna-Simple Bit Allocation) using effective CSI (Channel State Information) calculation procedure based on spatial resource grouping, which is adequate for the combination of MRT (Maximum Ratio Transmission) in the transmitter and MRC (Maximum Ratio Combining) in the receiver. In addition, to reduce feedback information for the beamforming, we also apply QEGT (Quantized Equal Gain Transmission) based on quantization of amplitudes and phases of beam weights. Furthermore, considering multi-user environments, we propose the P-SRA (Proposed-Simple Resource Allocation) algorithm for fair and efficient resource allocation. Simulation results reveal that the proposed MIMO-OFDMA system achieves significant improvement of spectral efficiency in low CRI region as compared to a typical open-loop MIMO-OFDMA system using pseudo-orthogonal space time block code and H-ARQ IR (Hybrid-Automatic Repeat Request Incremental Redundancy).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.97-104
• /
• 2016

Because of rapid growth of data size, the number of data storage has been increased. When using multiple data storages, a distribute file system is essential to insure the availability of data files. The power consumption is a major problem when using a distributed file system with many data storages. Previous works have aimed at reducing the energy consumption with efficient file block layout by changing some data servers into stand-by mode. The file block migration has not been seriously considered because migration causes large cost. But when we consider addition of a new data server or file, file block migration is needed. This paper formulates the minimization of data block migration as an ILP optimization problem and solves it using branch-and-bound method. Using this technique, we can maximize the number of stand-by data servers with the minimum number of file block movement. However, computation time of branch-and-bound method of an ILP optimization problem increases exponentially as the problem size grows. Therefore this paper also proposes a data block and data server grouping method to solve many small ILP problems.