• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.51-59
• /
• 1999

In this paper we propose the technique for tracking players and a ball and for obtaining players' ground traces using image mosaic in general soccer sequences. Here, general soccer sequences mean the case that there is no extreme zoom-in or zoom-out of TV camera. Obtaining player's ground traces requires that the following three main problems be solved. There main problems: (1) ground field extraction (2) player and ball tracking and team indentification (3) player positioning. The region of ground field is extracted on the basis of color information. Players are tracked by template matching and Kalman filtering. Occlusion reasoning between overlapped players in done by color histogram back-projection. To find the location of a player, a ground model is constructed and transformation between the input images and the field model is computed using four or more feature points. But, when feature points extracted are insufficient, image-based mosaic technique is applied. By this image-to-model transformation, the traces of players on the ground model can be determined. We tested our method on real TV soccer sequence and the experimental results are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.683-694
• /
• 2002

In this paper, a digital image compression codec using 2D DWT(Discrete Wavelet Transform) is designed using the FPGA technology for real time operation The implemented image compression codec using wavelet decomposition consists of a wavelet kernel part for wavelet filtering process, a quantizer/huffman coder for quantization and huffman encoding of wavelet coefficients, a memory controller for interface with external memories, a input interface to process image pixels from A/D converter, a output interface for reconstructing huffman codes, which has irregular bit size, into 32-bit data having regular size data, a memory-kernel buffer to arrage data for real time process, a PCI interface part, and some modules for setting timing between each modules. Since the memory mapping method which converts read process of column-direction into read process of the row-direction is used, the read process in the vertical-direction wavelet decomposition is very efficiently processed. Global operation of wavelet codec is synchronized with the field signal of A/D converter. The global hardware process pipeline operation as the unit of field and each field and each field operation is classified as decomposition levels of wavelet transform. The implemented hardware used FPGA hardware resource of 11119(45%) LAB and 28352(9％) ESB in FPGA device of APEX20KC EP20k600CB652-7 and mapped into one FPGA without additional external logic. Also it can process 33 frames(66 fields) per second, so real-time image compression is possible.

• Korean Journal of Optics and Photonics
• /
• v.16 no.4
• /
• pp.326-333
• /
• 2005

Phase-only encryption scheme using exclusive-OR rules in Fourier plane and a single path decryption system are presented. A zero-padded original image, multiplied by a random phase image, is Fourier transformed and its real-valued data is encrypted with key data by using XOR rules. A decryption is simply performed based on 2-1 setup with spatial filter by Fourier transform for multiplying phase-only encrypted data by phase-only key data, which are obtained by phase-encoding process, and spatial filtering for zero-order elimination in inverse-Fourier plane. Since the encryption process is peformed in Fourier plane, proposed encryption scheme is more tolerant to loss of key information by scratching or cutting than previous XOR encryption method in space domain. Compare with previous phase-visualization systems, due to the simple architecture without a reference wave, our system is basically robust to mechanical vibrations and fluctuations. Numerical simulations have confirmed the proposed technique as high-level encryption and simple decryption architecture.

• Journal of Ginseng Research
• /
• v.41 no.3
• /
• pp.339-346
• /
• 2017

Background: In this study, we investigated how to convert the Panax ginseng DNA sequence code and chemical fingerprints into a two-dimensional code. In order to improve the compression efficiency, GATC2Bytes and digital merger compression algorithms are proposed. Methods: HPLC chemical fingerprint data of 10 groups of P. ginseng from Northeast China and the internal transcribed spacer 2 (ITS2) sequence code as the DNA sequence code were ready for conversion. In order to convert such data into a two-dimensional code, the following six steps were performed: First, the chemical fingerprint characteristic data sets were obtained through the inflection filtering algorithm. Second, precompression processing of such data sets is undertaken. Third, precompression processing was undertaken with the P. ginseng DNA (ITS2) sequence codes. Fourth, the precompressed chemical fingerprint data and the DNA (ITS2) sequence code were combined in accordance with the set data format. Such combined data can be compressed by Zlib, an open source data compression algorithm. Finally, the compressed data generated a two-dimensional code called a quick response code (QR code). Results: Through the abovementioned converting process, it can be found that the number of bytes needed for storing P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can be greatly reduced. After GTCA2Bytes algorithm processing, the ITS2 compression rate reaches 75% and the chemical fingerprint compression rate exceeds 99.65% via filtration and digital merger compression algorithm processing. Therefore, the overall compression ratio even exceeds 99.36%. The capacity of the formed QR code is around 0.5k, which can easily and successfully be read and identified by any smartphone. Conclusion: P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can form a QR code after data processing, and therefore the QR code can be a perfect carrier of the authenticity and quality of P. ginseng information. This study provides a theoretical basis for the development of a quality traceability system of traditional Chinese medicine based on a two-dimensional code.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.161-168
• /
• 2007

Web attack uses structural, logical and coding error or web application rather than vulnerability to Web server itself. According to the Open Web Application Security Project (OWASP) published about ten types of the web application vulnerability to show the causes of hacking, the risk of hacking and the severity of damage are well known. The detection ability and response is important to deal with web hacking. Filtering methods like pattern matching and code modification are used for defense but these methods can not detect new types of attacks. Also though the security unit product like IDS or web application firewall can be used, these require a lot of money and efforts to operate and maintain, and security unit product is likely to generate false positive detection. In this research profiling method that attracts the structure of web application and the attributes of input parameters such as types and length is used, and by installing structural database of web application in advance it is possible that the lack of the validation of user input value check and the verification and attack detection is solved through using profiling identifier of database against illegal request. Integral security management system has been used in most institutes. Therefore even if additional unit security product is not applied, attacks against the web application will be able to be detected by showing the model, which the security monitoring log gathering agent of the integral security management system and the function of the detection of web application attack are combined.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.637-637
• /
• 1997

In this paper, format conversion filters are proposed, which have advantages in hardware implementation compared to the ones proposed in MPEG-4 Video Verification Model. since each coefficients of the proposed filters is constrained to have less than two non-zero digits in minimal signed digit representation, multiplication of input and the coefficient can be implemented by a single adder. As a result, the proposed filters have advantages in hardware complexity and speed, compared to the filters which are usually implemented by integer multiplier or carry save adders. Six kinds of filters are proposed in MPEG-4 Video Verification Model for size conversion of 2:1, 4:1, 5:3 and 5:6. We design 5 filters for the same purpose and compare the performance. The remaining one is very simple to implement. For comparing the filtering performance, we first compare the results of sine wave frequency conversion as an indirect but meaningful comparison. Second. We compute the PSNR of the images obtained from the proposed filters and the ones proposed by MPEG, with reference to the images obtained by using double precision arithmetic and high order filter. The results show that the performance of the proposed filters is almost the same as that of the filters proposed by MPEG. In conclusion, the peroformance of the proposed filters is comparable to that of the ones in MPEG-4, while requiring lower hardware complexity and providing high operating speed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.250-257
• /
• 2011

This experiment present the automatic detection algorithm of gastric cancer that take second place among all cancers. If an inflammation and a cancer are not examined carefully, early ones have difficulty in being diagnosed as illnesses than advanced ones. For diagnosis of gastric cancer, and progressing cancer in this study, present 4 algorithm. research team extracted an abnormal part in stomach through the endoscope image. At first, decide to use shading technique or not in each endoscope image for study. it make easy distinguish to whether tumor is existing or not by putting shading technique in or eliminate it by the color. Second. By passing image subjoin shading technique to erosion filter, eliminate noise and make give attention to diagnose. Third. Analyzing out a line and fillet graph from image adding surface shade and detect RED value according to degree of symptoms. Fourth. By suggesting this algorithm, that making each patient's endscope image into subdivision graph including RED graph value, afterward revers the color, revealing the position of tumor, this study desire to help to diagnosing gastric, other cancer and inflammation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.260-265
• /
• 1999

멀티빔 음향측심기(Multibeam Echo Sounder)는 기존의 단빔 음향측심기(Singlebeam Echo Sounder)와 달리 탐사선 진행방향의 수직(Crosstrack)으로 해저면을 주사(Swath)하여, 한 번의 송수신(Ping)으로 다중의 빔 자료 - 수심, 후방산란된 음압(Backscattered Amplitude), 사이드 스캔 소나(Side Scan Sonar) 자료 - 를 취득하는 장비이다. 멀티빔 음향 측심기를 이용한 해저면 탐사의 경우, 수심이 변함에 따라 주사폭(Swath width)이 변화하고, 각 빔의 수평 해상도(Footprint)는 수심과 더불어 빔폭(Beam width)에 의하여 동적으로 변화한다. 멀티빔 음향 측심기는 해저면을 전역탐사 할 수 있을 뿐만 아니라, 연속된 음향 탐사를 통하여 이웃한 핑 사이에 발생하는 전방중첩영역(Endlap)과 이웃 측선(Trackline)을 따라 겹쳐지는 측방중첩영역(Sidelap)의 자료들을 이용하여 멀티 뎀 자료들의 전반적인 정확도 및 신뢰도를 평가할 수 있다. 본 논문은 수로 측량(Hydrographic Survey)에서 사용되는 멀티빔 음향 측심기를 운영하여 얻어진 측심 자료를 처리하는 알고리즘 개발에 관한 연구이다. 본 논문에서는 L3사의 Sea Beam 2100 벌티빔 음향 측심기를 대상으로, 멀티빔의 측심 원리와 해저 지형에 대한 일반적 이해를 통하여 획득된 측심 자료의 통계적 특성을 파악하고, 오측심된 수심 자료를 제거하는 방법을 제안하며, 측심 구간의 대표격자 크기를 결정하는 기준을 제시한다. 또한, 항공원격탐사에서 고도 추정시 사용되고 있는, 평균보간법, 가중평균 보간법과, 본 논문에서 제안하는 격자 대표값 선정 알고리즘(Gridding Algorithms)의 결과를 비교하고, 최종적으로 얻어지는 해저 수치지형모델(DEM, Digital Elevation Model)과 후방산란 영상을 제시한다. 빠른 한지형잔디들이 지표면을 피복하도록 하고 여름의 고온기와 장마시기에는 뿌리전단력이 우수한 이러한 초종들로 지표면이 피복되도록 하는 것이 이상적이라 생각된다. 4. 혼파처리간의 토사유출량을 비교한 결과 토사 유출 억제효과는 한지형과 나지형잔디들의 혼합형(MixtureIII)과 자생처리구(MixtureV), Italian ryegrass와 자생식물의 혼합형(MixtureIV)등에서 비교적 낮은 수치를 토사유출량을 기록하였다. 이러한 결과는 자생식물들이 비록 초기생육속도는 외래도입초종에 떨어지지만 토사유출의 억제효과면에서는 이들 외래초종에 필적할 수 있음을 나타낸다고 할 수 있겠다.중량이 약 115kg/$m^2$정도로 나타났다.소 들(환경의 의미, 사람의 목적과 지식)보다 미학적 경험에 주는 영향이 큰 것으로 나타났으며, 모든 사람들에게 비슷한 미학적 경험을 발생시키는 것 이 밝혀졌다. 다시 말하면 모든 사람들은 그들의 문화적인 국적과 사회적 인 직업의 차이, 목적의 차이, 또한 환경의 의미의 차이에 상관없이 아름다 운 경관(High-beauty landscape)을 주거지나 나들이 장소로서 선호했으며, 아름답다고 평가했다. 반면에, 사람들이 갖고 있는 문화의 차이, 직업의 차 이, 목적의 차이, 그리고 환경의 의미의 차이에 따라 경관의 미학적 평가가 달라진 것으로 나타났다.corner$적 의도에 의한 경관구성의 일면을 확인할수 있지만 엄밀히 생각하여 보면 이러한 예의 경우도 최락의 총체적인 외형은 마찬가지로 $\ulcorner$순응$\lrcorner$의 범위를 벗어나지 않는다. 그렇기 때문에도 $\ulcorner$순응$\lrcorner$과 $\ulcorner$표현$\lrcorner$의 성격과 형태를 외형상으로 더욱이 공간상에서는 뚜렷하게 경계

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.821-830
• /
• 2006

As internet worms are spread out worldwide, the detection and filtering of worms becomes one of hot issues in the internet security. As one of implementation methods to detect worms, the Linux Netfilter kernel module can be used. Its basic operation for worm detection is a string matching where coming packet(s) on the network is/are compared with predefined worm signatures(patterns). A worm can appear in a packet or in two (or more) succeeding packets where some part of worm is in the first packet and its remaining part is in its succeeding packet(s). Assuming that the maximum length of a worm pattern is less than 1024 bytes, we need to perform a string matching up to two succeeding packets of 2048 bytes. To do so, Linux Netfilter keeps the previous packet in buffer and performs matching with a combined 2048 byte string of the buffered packet and current packet. As the number of concurrent connections to be handled in the worm detection system increases, the total size of buffer (memory) increases and string matching speed becomes low In this paper, to reduce the memory buffer size and get higher speed of string matching, we propose a string matching scheme without using buffer. The proposed scheme keeps the partial matching result of the previous packet with signatures and has no buffering for previous packet. The partial matching information is used to detect a worm in the two succeeding packets. We implemented the proposed scheme by modifying the Linux Netfilter. Then we compared the modified Linux Netfilter module with the original Linux Netfilter module. Experimental results show that the proposed scheme has 25% lower memory usage and 54% higher speed compared to the original scheme.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.538-542
• /
• 2018

Echo generated in digital hearing aid vent give rise to user's discomfort. For cancelling feedback echo in vent, it is required to estimate vent impulse response exactly. The vent impulse response has time varying and sparse characteristics. The IPNLMS has been known a useful adaptive algorithm to estimate vent impulse response with these characteristics. In this paper, subband sparse adaptive filter which applying IPNLMS to subband hearing aid structure is proposed to cancel echo of vent by estimating sparse vent impulse response. In the propose method, the decomposition of input signal to subband can pre-whiten each subband signal, so adaptive filter convergence speed can be improved. And the poly phase component decomposition of adaptive filter increases sparsity of each components, and the better echo cancellation can be possible without additional computation. To derive coefficients update equation of the adaptive filter, by defining the cost function based weight NLMS is defined, and the coefficient update equation of each subband is derived. For verifying performances of the adaptive filter, convergence speed, and steady state error by white signal input, and echo cancelling results by real speech input are evaluated by comparing conventional adaptive filters.