• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2009.04a
• /
• pp.15-17
• /
• 2009

The line simplification method based on the turning function is studied in this paper for conversion of ground plan data to geospatial data to update the digital map. This method eliminate vertices effectively by estimating the length and the angle between the vertices based on the turning function which is useful to express the shape of linear feature. As the result, this method shows high shape similarity, high elimination rate of vertices and 100% of satisfaction degree to the drawing rules. Thus this line simplification method is judged to be effective in updating the digital map with ground plans.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1220-1230
• /
• 2015

An autonomous valet parking (AVP) system is designed to locate a vacant parking space and park the vehicle in which it resides on behalf of the driver, once the driver has left the vehicle. In addition, the AVP is able to direct the vehicle to a location desired by the driver when requested. In this paper, for an AVP system, we introduce technology to recognize a parking space using image sensors. The proposed technology is mainly divided into three parts. First, spatial analysis is carried out using a height map that is based on dense motion stereo. Second, modelling of road markings is conducted using a probability map with a new salient-line feature extractor. Finally, parking space recognition is based on a Bayesian classifier. The experimental results show an execution time of up to 10 ms and a recognition rate of over 99%. Also, the performance and properties of the proposed technology were evaluated with a variety of data. Our algorithms, which are part of the proposed technology, are expected to apply to various research areas regarding autonomous vehicles, such as map generation, road marking recognition, localization, and environment recognition.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.2
• /
• pp.94-103
• /
• 2019

Self Organizing Map (SOM) is a neural network that is effective in classifying patterns that form the feature map by extracting characteristics of the input data. In this study, we propose an algorithm to determine the cell formation and the machine layout within the cell for the cell formation problem with operation sequence using the SOM. In the proposed algorithm, the output layer of the SOM is a one-dimensional structure, and the SOM is applied to the parts and the machine in two steps. The initial cell is formed when the formed clusters is grouped largely by the utilization of the machine within the cell. At this stage, machine cell are formed. The next step is to create a flow matrix of the all machine that calculates the frequency of consecutive forward movement for the machine. The machine layout order in each machine cell is determined based on this flow matrix so that the machine operation sequence is most reflected. The final step is to optimize the overall machine and parts to increase machine layout efficiency. As a result, the final cell is formed and the machine layout within the cell is determined. The proposed algorithm was tested on well-known cell formation problems with operation sequence shown in previous papers. The proposed algorithm has better performance than the other algorithms.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.21-26
• /
• 2011

Feature ranking is useful to gain knowledge of data and identify relevant features. In this study, we proposed a use of feature ranking for classification of neuro-degeneration and vascular dementia in micro-Raman spectra of platelet. The entire region of the spectrum is divided into local region including several peaks, followed by Gaussian curve fitting method in the region to be modeled. Local minima select from the subregion and then remove the background based on the position by using interpolation method. After preprocessing steps, significant features were selected by feature ranking method to improve the classification accuracy and the computational complexity of classification system. PCA (principal component analysis) transform the selected features and the overall features that is used classification with the number of principal components. These were classified as MAP (maximum a posteriori) and it compared with classification result using overall features. In all experiments, the computational complexity of the classification system was remarkably reduced and the classification accuracy was partially increased. Particularly, the proposed method increased the classification accuracy in the experiment classifying the Parkinson's disease and normal with the average 1.7 %. From the result, it confirmed that proposed method could be efficiently used in the classification system of the neuro-degenerative disease and vascular dementia of platelet.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.3
• /
• pp.73-82
• /
• 2003

This paper proposes a work procedure for generalizing large-scale digital maps ver. 2.0(1/5,000) into a small-scale digital map(1/25,000). Unlike a existent digital map, the digital map ver. 2.0 has a variety of attribute data as well as graphic data. To perform an efficient map generalization with these structural properties, we establish a work procedure as follow; firstly, delete layers which don't exist in small-scale digital map's feature code, and secondly, generalize features which have been classified into 8 layers, and finally merge 8 layers which have been generalized into 1 layer. Therefore, we expect that a work procedure which is proposed in this paper will play a fundamental role in automated generalization system and will contribute to small-scale digital mapping and thematic mapping.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.239-248
• /
• 2010

Leukocyte in blood smear image provides significant information to doctors for diagnosis of patient health status. Therefore, it is necessary step to separate leukocyte from blood smear image among various blood cells for early disease prediction. In this paper, we present a saliency map and stepwise region merging based leukocyte segmentation method. Since leukocyte region has salient color and texture, we create a saliency map using these feature map. Saliency map is used for sub-image separation. Then, clustering is performed on each sub-image using mean-shift. After mean-shift is applied, stepwise region-merging is applied to particle clusters to obtain final leukocyte nucleus. The experimental results show that our system can indeed improve segmentation performance compared to previous researches with average accuracy rate of 71%.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2
• /
• pp.107-113
• /
• 1997

To achive a robust Korean word recognition system for both channel distortion and additive noise, maximum a posteriori estimation(MAP) adaptation is proposed and the effectiveness of environmental adaptation for improving recognition performance is investigated in this paper. To do this, recognition experiments using MAP adaptation are carried out for the three different speech ; 1) channel distortion is introduced, 2) environmental noise is added, 3) both channel distortion and additive noise are presented. Theeffectiveness of additive feature parameters, such as regressive coefficients and durations, for environmental adaptation are also investigated. From the speaker independent 100 words recognition tests, we had 9.0% of recognition improvement for the case 1), more than 75% for the case 2), and 11%~61.4% for the case 3) respectively, resulting that a MAP environmental adaptation is effective for both channel distorted and noise added speech recognition. But it turned out that duration information used as additive feature parameter did not played an important role in the tests.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.27 no.5
• /
• pp.49-56
• /
• 2023

This study proposed a damage location estimation method for automated image-based port infrastructure inspection. Memory efficiency was improved by calculating the homography matrix using feature detection technology and outlier removal technology, without going through the 3D modeling process and storing only damage information. To develop an algorithm specialized for port infrastructure, the algorithm was optimized through ground-truth coordinate pairs created using images of port infrastructure. The location errors obtained by applying this to the sample and concrete wall were (X: 6.5cm, Y: 1.3cm) and (X: 12.7cm, Y: 6.4cm), respectively. In addition, by applying the algorithm to the concrete wall and displaying it in the form of an exterior damage map, the possibility of field application was demonstrated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.861-866
• /
• 2007

A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.