• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.27-33
• /
• 2005

In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The binary image using the threshold values is applied in the preprocessing stage and then The proposed method is applied to obtain the improved image of skeleton line. We used the existing skeleton methods and SPTA(Shin's Parallel Thinning Algorithm) method for the comparison. The demerits of the existing skeleton methods have a result of noise branch, expansion and contraction. and then we are proposed a SPTA method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.703-707
• /
• 2001

디지털 워터마킹은 데이터 내부에 지각적으로 인식되지 않는 신호를 삽입하여 저작권을 보호하기 위한 방법으로 압축, 기하학적 변환, 크기변환 등의 공격도 영상 데이터가 견고한 특성을 나타낼 수 있는 방법을 중심으로 연구되어 왔으나 프린6트 영상에 대하여 저작권을 보호하는 연구는 그다지 활발하지 않았다. 본 논문에서는 이진 프린트 영상에 워터마크를 삽입하는 새로운 방법을 제안한다. 제안방법은 영상을 디더링 한 후 8 8 블록에서 1(백화소)의 개수를 카운팅하고 카운팅 배열을 2 2 블록씩 나누어 워터마크 값에 따라 다르게 정의된 기준 블록 패턴과 비교함으로 워터마크를 삽입한다. 워터마크 정보는 1 과 0 의 두가지를 사용하여 동일한 워터마크 비트로 더 많은 정보를 표현할 수 있다. 워터마크 검출을 워터마크가 삽입된 영상과 기준 블록패턴을 이용해 워터마크 정보를 재구성하고, 재구성된 워터마크와 디더 영상에 삽입된 원본의 워터마크 정보와 비교함으로 가능하다. 성능평가는 워터마크 삽입영상을 프린트 한 후 스캔하여 기존의 방법과 검출 성능을 비교하였다.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.378-383
• /
• 2012

This paper presents the implementation of an automatic road sign recognizer for an intelligent transport system. In this system, lists of road signs are processed with actions such as line segmentation, single sign segmentation, and storing an artificial sign in the database. The process of taking the video stream and extracting the road sign and storing in the database is called the road sign recognition. This paper presents a study on recognizing traffic sign patterns using a segmentation technique for the efficiency and the speed of the system. The image is converted from one scale to another scale such as RGB to grayscale or grayscale to binary. The images are pre-processed with several image processing techniques, such as threshold techniques, Gaussian filters, Canny edge detection, and the contour technique.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.204-206
• /
• 2008

In this paper, we proposed the recognition method that automatically extracts cracks from a surface image acquired by a digital camera and recognizes the directions (horizontal, vertical, -45 degree, and 45 degree) of cracks using the fuzzy single layer perceptron. We compensate an effect of light on a concrete surface image by applying the closing operation, which is one of the morphological techniques, extract the edges of cracks by Sobel masking, and binarize the image by applying the iterated binarization technique. Two times of noise reduction are applied to the binary image for effective noise elimination. After the specific regions of cracks are automatically extracted from the preprocessed image by applying Glassfire labeling algorithm to the extracted crack image, the cracks of the specific region are enlarged or reduced to $30{\times}30$ pixels and then used as input patterns to the fuzzy single layer perceptron. The experiments using concrete crack images showed that the cracks in the concrete crack images were effectively extracted and the fuzzy single layer perceptron was effective in the recognition of the extracted cracks directions.

• Journal of Industrial Technology
• /
• v.29 no.B
• /
• pp.9-15
• /
• 2009

In the case of traditional binary encoding technique, it takes long time to converge the optimal solutions and brings about complexity of the systems due to encoding and decoding procedures. However, the ROGAs (real-coded genetic algorithms) do not require these procedures, and the k-means clustering algorithm can avoid global searching space. Thus, this paper proposes a new approach by using their advantages. The proposed method constructs the multiple predictors using the optimal differences that can reveal the patterns better and properties concealed in non-stationary time series where the k-means clustering algorithm is used for data classification to each predictor, then selects the best predictor. After selecting the best predictor, the cluster centers of the predictor are tuned finely via RCGKA in secondary tuning procedure. Therefore, performance of the predictor can be more enhanced. Finally, we verifies the prediction performance of the proposed system via simulating typical time series examples.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.38.2-38.2
• /
• 2017

별의 생성단계나 황혼기에는 성간운에 둘러싸여 있어 그 중심부에 별이 쌍을 이루고 있는지를 관측하기가 쉽지 않다. 항성계 통계 조사는 주로 별의 진화단계 상 장년기에 해당하는 주계열에서 이루어졌는데, 그 결과로 전체 항성계의 절반은 쌍성계 혹은 다성계임이 알려져있다. 한편, 대표적인 황혼기 현상인 행성상성운은 늙은 별 주변물질이 마지막 별빛을 받아 밝게 빛나는 것으로, 같은 종류의 천체 현상이라 믿기 어려울만큼 복잡다양한 모습들을 띄고 있다. 이와 같은 다양한 성운의 형태는 그 중심부 별이 하나 뿐일 경우로는 설명하기가 어렵다. 따라서 늙은 별 연구 커뮤니티는 최근 수 십년간 행성상성운을 바라보는 주 관점을 쌍성계로 돌리고 있다. 특히, 많은 행성상성운의 외각부분에 반복되는 고리 모양 구조(3차원으로는 나선구각구조)가 발견이 되었는데, 이를 분석하면 행성상성운에 이르기까지의 시기에 중심부 쌍성이 어떤 궤도운동을 해왔는지를 알아낼 수 있을 것으로 예상하고, 이론 및 관측으로 그 실효성을 따져보고 있다. 늙은별의 동반성을 직접 관측하고 그 궤도요소를 알아내는 것이 어려운 이유를 살펴보고, 나선구각구조를 이용함으로써 밝혀낼 수 있는 동반성의 범주를 알아본다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3534-3549
• /
• 2020

The traditional method of smoke image recognition has low accuracy. For this reason, we proposed an algorithm based on the good group of IMFOA which is GMFOA to optimize the parameters of SVM. Firstly, we divide the motion region by combining the three-frame difference algorithm and the ViBe algorithm. Then, we divide it into several parts and extract the histogram of oriented gradient and volume local binary patterns of each part. Finally, we use the GMFOA to optimize the parameters of SVM and multiple kernel learning algorithms to Classify smoke images. The experimental results show that the classification ability of our method is better than other methods, and it can better adapt to the complex environmental conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.616-621
• /
• 2005

In this paper. digital watermarking algorithm based on human visual system and transform domain is presented. Firstly, original image is separated into RGB thannels, watermark is embedded into the coefficients of DCT so as to consider a contrast sensitivity and texture degrees. In preprocessing, DCT domain based transform is involved and binary image of visually recognizable patterns is utilized as a watermark. Consequently, experimental results showed that proposed algorithm is robust and imperceptibility such destruction attack as JPEG compression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2023-2032
• /
• 1996

In this paper, we calculate average bit error probabilities of asynchronous hybrid DS/FH-SSMA systems in AWGN chnnel and nonselective Rayleigh fading channel. We analyze and compare the performance of systems in AWGN channel and Rayleigh fading channel by using linear correlation receiver and hard limiting correlation receiver(nonlinear correlation receiver). Binary PSK scheme is considered and random spreading code sequences and random hopping patterns are used. Bit error probabilities of the systems with/without near-far problem under the same bandwidth expansion are calculated. the result shows that the performance of hard limiting correlation receiver is better than that of linear correlation receiver over nonselective Rayleigh fading channel.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.344-351
• /
• 2014

In order to accomplish complex navigational commands, humanoid robot should be able to modify its walking period, step length and direction independently. In this paper, a novel walking pattern generation algorithm is proposed to satisfy these requirements. Modification of the walking pattern can be considered as a transition between two periodic walking patterns, which follows each navigational command. By assuming the robot as a linear inverted pendulum, the equations of motion between ZMP(Zero Moment Point) and CM(Center of Mass) state is easily derived and analyzed. After navigational command is translated into the desired CM state, corresponding CM motion is generated to achieve the desired state by using simple ZMP functions. Moreover, when the command is not feasible, feasible command is alternated by using binary search algorithm. Subsequently, corresponding CM motion is generated. The effectiveness of the proposed algorithm is verified by computer simulation.