• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.829-831
• /
• 2022

포인트 클라우드 콘텐츠는 움직임이 있는 콘텐츠를 연속된 프레임에 3 차원 위치정보와 대응하는 색상으로 기록한 데이터이다. 강체 포인트 클라우드 데이터를 정합하기 위해서는 고전적인 방법이지만 강력한 ICP 정합 알고리즘을 사용한다. 그러나 국소적인 모션 벡터가 있는 비 강체 포인트 클라우드 콘텐츠는 기존의 ICP 정합 알고리즘을 통해서는 프레임 간 정합이 불가능하다. 본 논문에서는 비 강체 포인트 클라우드 콘텐츠를 지역적 확률 모델을 사용하여 프레임 간 포인트의 쌍을 맺고 개별 포인트 간의 모션벡터를 구해 정합 하는 방법을 제안한다. 정합 대상의 데이터를 2 차원 투영을 하여 구조화시키고 정합 할 데이터를 투영하여 후보군 포인트를 선별한다. 선별된 포인트에서 깊이 값 비교와 좌표 및 색상 유사도를 측정하여 적절한 쌍을 찾아준다. 쌍을 찾은 후 쌍으로 모션 벡터를 더하여 정합을 수행하면 비 강체 포인트 클라우드 콘텐츠 데이터에 대해서도 정합이 가능해진다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_2
• /
• pp.613-623
• /
• 2007

The main purpose of this study is to investigate the coordinate transformation based on two different systems between local geodetic datum(tokyo datum) and international geocentric datum(new Korea geodetic datum). For this purpose, three methods were used to determine seven parameters as follows: Bursa-Wolf model, Molodensky-Badekas model, and Veis model. Also, we adopted multiple regression equation method to convert from Tokyo datum to KTRF. We used 935 control points as a common points and applied gross error analysis for detecting the outlier among those control points. The coordinate transformation was carried out using similarity transformation applied the obtained seven parameters and the precision of transformed coordinate was evaluated about 9,917 third or forth order control points. From these results, it was found that Bursa-Wolf model and Molodensky-Badekas model are more suitable than other for the determination of transformation parameters in Korea. And, transforming accuracy using MRE is lower than other similarity transformation model.

• Journal of the Economic Geographical Society of Korea
• /
• v.13 no.2
• /
• pp.181-195
• /
• 2010

The policy of industrial complexes (innovative clusters) is being changed to build the linkage structure within Mega Economic Region according to the national policy of Mega Economic Region. The aim of this analysis is to draw the hypothetical linkage structure of industrial complexes in the internal and external Capital Region. First, with the survey data of firms located in the industrial complexes, we can catch the regional linkages of firms in the local area and internal and external Mega Economic Region. Next, the measure of structural similarity between industrial complexes is calculated with the number of employees by industrial sectors. After considering the geographical distance between industrial complexes, the percentage of industrial sectors and the location quotient synthetically, the idea of hub-and-spoke type linkage structure between clusters is deduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.816-822
• /
• 2016

Content-Based image retrieval is a method to search by image features such as local color, texture, and other image content information, which is different from conventional tag or labeled text-based searching. In real life data, the number of images having tags or labels is relatively small, so it is hard to search the relevant images with text-based approach. Existing image search method only based on image feature similarity has limited performance and does not ensure that the results are what the user expected. In this study, we propose and validate a machine learning based approach to improve the performance of the image search engine. We note that when users search relevant images with a query image, they would expect the retrieved images belong to the same category as that of the query. Image classification method is combined with the traditional image feature similarity method. The proposed method is extensively validated on a public PASCAL VOC dataset consisting of 11,530 images from 20 categories.

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

With the wide application of hyperspectral images, it becomes more and more important to compress hyperspectral images. Conventional recursive least squares (CRLS) algorithm has great potentiality in lossless compression for hyperspectral images. The prediction accuracy of CRLS is closely related to the correlations between the reference bands and the current band, and the similarity between pixels in prediction context. According to this characteristic, we present an improved CRLS with adaptive band selection and adaptive predictor selection (CRLS-ABS-APS). Firstly, a spectral vector correlation coefficient-based k-means clustering algorithm is employed to generate clustering map. Afterwards, an adaptive band selection strategy based on inter-spectral correlation coefficient is adopted to select the reference bands for each band. Then, an adaptive predictor selection strategy based on clustering map is adopted to select the optimal CRLS predictor for each pixel. In addition, a double snake scan mode is used to further improve the similarity of prediction context, and a recursive average estimation method is used to accelerate the local average calculation. Finally, the prediction residuals are entropy encoded by arithmetic encoder. Experiments on the Airborne Visible Infrared Imaging Spectrometer (AVIRIS) 2006 data set show that the CRLS-ABS-APS achieves average bit rates of 3.28 bpp, 5.55 bpp and 2.39 bpp on the three subsets, respectively. The results indicate that the CRLS-ABS-APS effectively improves the compression effect with lower computation complexity, and outperforms to the current state-of-the-art methods.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.5
• /
• pp.19-27
• /
• 2017

In this paper, we propose an automatic segmentation method of the mandible using shape-constrained information in cranio-maxillo-facial CBCT images. The proposed method consists of the following two steps. First, the mandible segmentation based on the global shape information is performed through the statistical shape model generated using the MDCT images. Second, improvement of mandible segmentation is performed considering the local shape information and intensity characteristics of the mandible. To evaluate the performance of the proposed method, the proposed method was evaluated qualitatively and quantitatively based on the results of manual segmentation by expert. Experimental results show that the Dice Similarity Coefficient of the proposed method was 95.64% and 90.97%, respectively, in the mandible body region including the narrow region of large curvature and the condyle region with large positional variance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.154-161
• /
• 2015

A novel multiframe super-resolution (SR) algorithm is presented to overcome the limitation of existing single-image SR algorithms using motion information from adjacent frames in a video. The proposed SR algorithm consists of three steps: i) definition of a local region using interframe motion vectors, ii) multiscale patch generation and adaptive selection of multiple optimum patches, and iii) combination of optimum patches for super-resolution. The proposed algorithm increases the accuracy of patch selection using motion information and multiscale patches. Experimental results show that the proposed algorithm performs better than existing patch-based SR algorithms in the sense of both subjective and objective measures including the peak signal-to-noise ratio (PSNR) and structural similarity measure (SSIM).

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.37-46
• /
• 2011

Recently in the field of GIS(Geographic Information System), data integration from various sources has become an important topic in order to use spatial data effectively. In general, the integration of spatial data is accomplished by navigating corresponding space object and combining the information interacting with each object. But it is very difficult to navigate an object which has correspondence with one in another dataset. Many matching methods have been studied for navigating spatial object. The purpose of this paper is development of method for searching correspondent spatial object considering local position error which is remained even after coordinate transform ation when two different building data sets integrated. To achieve this goal, we performed coordinate transformation and overlapped two data sets and generated blocks which have similar position error. We matched building objects within each block using similarity and ICP algorithm. Finally, we tested this method in the aspect of applicability.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.211-218
• /
• 2011

Because antique Korean Peninsula maps have many historical signification, we can estimate historical evidences by analyzing them. However, it is very difficult to compare antique maps with modern maps because the antique maps were made by arranging local regions. To resolve this difficulty, we transform antique maps by rotating, scaling and translating to compare with a reference map. Each antique map is rotated in the difference of principal axis angles of the target and the reference maps, and its width and height are scaled asymmetrically using width and height ratios of bounding boxes. Finally, the two regions are overlaid by adjusting their centroids, and then the antique map is evaluated by two similarity equations. Experimental results show that the similarities of region ratio and different angle are properly computed according to era. Therefore, the proposed method can be widely used to analyze the antique Korean Peninsula maps.

• Journal of Biomedical Engineering Research
• /
• v.19 no.4
• /
• pp.361-367
• /
• 1998

We student tow image characteristics, the smoothness and the similarity, which give rise to local and global redundancy in image representation. The smoothness means that the gray level values within a given block vary gradually rather than abruptly. The similarity means that any patterns in an image repeat itself anywhere in the rest of the image. In this sense, we proposed a lossless medical image compression scheme which exploits both types of redundancy. The proposed method segments the image into variable size blocks and encodes them depending on characteristics of the blocks. The proposed compression schemes works better 10~40[%] than other compression scheme such as the Huffman, the arithmetic, the Lempel-Ziv, HINT(Hierachical Interpolation) and the lossless scheme of JPEG with one predictor.