• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.337-342
• /
• 2002

This paper proposes a new adaptive image labeling algorithm fur object analysis of the binary images. The proposed labeling algorithm need not merge/order of complex equivalent labels like classical labeling algorithm and the processing is done during only 1 Pass. In addition, this algorithm can be extended for gray-level image easily. Experiment result with HIPR image library shows that the proposed algorithm process more than 2 times laster than compared algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.955-961
• /
• 2010

In this paper, we describe a study of a vehicle detection method based on a Boosting Classifier which uses Histogram of Oriented Gradient (HOG) features and Image Segmentation techniques. An input image is segmented by means of a split and merge algorithm. Then, the two largest segmented regions are removed in order to reduce the search region and speed up processing time. The HOG features are then calculated for each pixel in the search region. In order to detect the vehicle region we used the AdaBoost (adaptive boost) method, which is well known for classifying samples with two classes. To evaluate the performance of the proposed method, 537 training images were used to train and learn the classifier, followed by 500 non-training images to provide the recognition rate. From these experiments we were able to detect the proper image 98.34% of the time for the 500 non-training images. In conclusion, the proposed method can be used for detecting the location of a vehicle in an intelligent vehicle control system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.741-745
• /
• 1991

This paper describes a feature extraction in digitized chest X-ray image and CT head Image. There are Extraction, Thresholding, Region G rowing, Split-Merge and Relaxation in feature extraction technique. In this study, Region Growing System was realized and Fuzzy Set Theory was applied in order to extract the vague region which the conventional method has difficulties in extracting. The performance of proposed algorithm was proved by being applied to chest X-ray image and CT head image.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.925-927
• /
• 1995

The purpose of extaction of edges of buildings is an extraction of 3-dimensional imformation. The performance of an exact extraction of edges of buildings using several classic algorithms was not so good. In this study we merged several exposed algorithms-----split-and-merge, anisotropic diffusion, modified canny operation, least mean sqare. Results of this extraction algorithm show better performance than any other detection algorithms of edges of buildings.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.386-395
• /
• 2002

In this paper, we suggest dynamic genetic tree-maps(DGTM) using optimal features on recognizing data. The DGTM uses the genetic algorithm about the importance of features rarely considerable on conventional neural networks and introduces GTM(genetic tree-maps) using tree structure according of the priority of features. Hence, we propose the extended formula, DGTM(dynamic GTM) has dynamic functions to separate and merge the neuron of neural network along the similarity of features.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.487-490
• /
• 2011

This paper presents splitting and merging algorithm based on adaptive thresholding. The algorithm first divides the image into blocks, and then compares each block using the calculated thresholding value. The blocks which are same are merged using the certain threshold value and different blocks are split unless it satisfies the threshold value. When the block has been merged, maximum and minimum block sizes are determined then the average block size is determined. After the average block size is determined the average intensity and standard deviation of average block is calculated. The process of thresholding is applied to binarize the image. Finally, the experimental results show that the proposed method distinguishes clearly the background with text in the document image.

• Proceedings of the KOSOMBE Conference
• /
• v.1989 no.05
• /
• pp.19-22
• /
• 1989

This paper represents a syntactic peak detection algorithm which detects peaks in the ECG signal. In the algorithm, the input waveform is linearly approximated by "split-and-merge" method, and then each line segment is symbolized with primitive set. The peeks in the symbolized input waveform are recognized by the finite-state automata, which the deterministic finite-state language is parsed by. This proposed algorithm correctly detects peaks in a normal ECG signal as well as in the abnormal ECG signal such as tachycardia and the contaminated signal with noise.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1677-1685
• /
• 1988

In this paper, a new contour coding algorithm is investigated for use in region based image coding. Generally the contour data may be encoded by its chain codes or chain difference codes. But the data compression efficiency is low because of heavy burden for initial absolute coordinates of each chain. To alleviate this problem, the depth first search in graph traversal algorithm, is applied to the chain difference coding method. The proposed coding scheme is shown to be very efficient for contour images obtained by split-merge segmentation. Finally, we can reuce data about 60% in comparison with modified chain difference coding.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.1-5
• /
• 2010

정렬 알고리즘에서 사용한 원소 간 비교횟수를 기준으로, 비교횟수가 많게 되는 순열을 최악의 인스턴스(worst-case instance)라 명명하고 이를 찾기 위해 유전 알고리즘(genetic algorithm)을 사용하였다. 잘 알려진 퀵 정렬(quick sort), 머지 정렬(merge sort), 힙 정렬(heap sort), 삽입 정렬(insertion sort), 쉘 정렬(shell sort), 개선된 퀵 정렬(advanced quick sort)에 대해서 실험하였다. 머지 정렬과 삽입 정렬에 대해 탐색한 인스턴스는 최악의 인스턴스에 거의 근접하였다. 퀵 정렬은 크기가 증가함에 따라 최악의 인스턴스 탐색이 어려웠다. 나머지 정렬에 대해서 찾은 인스턴스는 최악의 인스턴스인지 이론적으로 보장할 수 없지만, 임의의 1,000개 순열을 정렬해서 얻은 비교횟수들의 평균치보다는 훨씬 높았다. 본 논문의 최악의 인스턴스를 탐색하는 시도는 알고리즘의 성능 검증을 위한 테스트 데이터를 생성한다는 점에서 의미가 크다.

• Korean Journal of Remote Sensing
• /
• v.11 no.2
• /
• pp.43-57
• /
• 1995

This paper presents reconstruction of disparity in images. To achieve this, the algorithm was made up of two different procedures - one is extraction of boundaries for man-made structures and the other is matching of the structures. In the extraction of boundaries for man-made structures, we assume that man-made structures are composed of lines and the lines make up closed polygon. The convertional algorithms of the edges extraction may not perceive man-made structures and have problems that matching algorithms were too complex. This paper proposed sub-pixel boundaries extraction algorithm that fused split-and-merge and image improvement algorithms to overcome complexity. In matching procedure, feature-based algorithm that minimize the proposed cost function are used and the cost fuction considers movement of mid-points for left and right images to match structures. Because we could not obtain disparity of inner parts for the man-made structures, interpolation method was used. The experiment showed good results.