• Journal of The Geomorphological Association of Korea
• /
• v.26 no.2
• /
• pp.1-14
• /
• 2019

This study analyzed the relativity between block stream and talus distributions by employing a likelihood ratio approach. Possible distribution sites for each debris slope landform were extracted by applying a spatial integration model, in which we combined fuzzy set model, Bayesian predictive model, and logistic regression model. Moreover, to verify model performance, a success rate curve was prepared by cross-validation. The results showed that elevation, slope, curvature, topographic wetness index, geology, soil drainage, and soil depth were closely related to the debris slope landform sites. In addition, all spatial integration models displayed an accuracy of over 90%. The accuracy of the distribution potential area map of the block stream was highest in the logistic regression model (93.79%). Eventually, the accuracy of the distribution potential area map of the talus was also highest in the logistic regression model (97.02%). We expect that the present results will provide essential data and propose methodologies to improve the performance of efficient and systematic micro-landform studies. Moreover, our research will potentially help to enhance field research and topographic resource management.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.867-870
• /
• 1998

Video data is usually stored in a compressed format in order to reduce the storage space. For efficient browsing, searching, and retrieval of compressed video sequences, size-reduced images (or DC images which are formed with block DC coefficients) are generally preferred to avoid unnecessary computational complexity. In this paper, we propose a DC image extraction scheme appropriate for scene analysis and efficient browsing of compressed video sequences. The proposed algorithm utilizes predicted low frequency AC coefficients to achieve better approximation and to reduce the error drift. Due to the AC prediction based on a quadratic surface model, the proposed scheme requires no additional memory compared with the previous zero-order or first-order approximation scheme. Simulation results show that the proposed scheme achieves better subjective and objective quality with minor additional operations.

• Journal of Korea Multimedia Society
• /
• v.18 no.10
• /
• pp.1180-1188
• /
• 2015

In this paper, a parallel cell contour line extraction algorithm using CUDA, which has no inner contour lines, is proposed. The contour of a cell is very important in a cell image analysis. It could be obtained by a conventional serial contour tracing algorithm or parallel morphology operation. However, the cell image has various damages in acquisition or dyeing process. They could be turn into several inner contours, which make a cell image analysis difficult. The proposed algorithm introduces a min-max coordinates table into each CUDA thread block, and removes the inner contour in parallel. It is 4.1 to 7.6 times faster than a conventional serial contour tracing algorithm.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.773-776
• /
• 1998

In this paper, we propose an efficient multi-view images coding algorithm which finds the optimal texture from the restricted number of multi-view images. The X-Y plane of the normalized object space is divided into triangular patches. The depth value of the node is determined by applying the block based disparity compensation method and then the texture of the each patch is extracted by applying the affine transformation patch is extracted by applying the affine transformation based disparity compensation method to the multi-view images. We restricted the number of images contributed to determining the texture comapred to traditional methods which use all the multi-view images in the texture extraction. Experimental results show that the SNR of images encoded by the proposed algorithm is better than that of imaes encoded by the traditional method by the amount about 0.2dB for the test sets of multi-view images called dragon, kid, city and santa. The recovered images from the encoded data by the proposed method show the better visual images than the recovered images from the encoded data by the traditional methods.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.552-555
• /
• 1999

In this paper, a method for extracting the fingerprint regions and the table from fingerprint document which is the size of A4 including ten fingerprints images in a table is presented. The extraction of each fingerprint region is carried out by segmenting the foreground fingerprint region using a block filtering method and detecting its center point. The table extraction, by detecting a horizontal line using line tracing, and detecting a vertical line by its orthogonal equation. Here, T-shaped mask is proposed for finding the starting points of the vertical line intersecting horizontal line by the form of 'T'. Experimental results show above 95% correct rate of extracting the fingerprint region and table.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.85-100
• /
• 2012

The Hartley transform based feature extraction method is proposed for fingerprint matching. Hartley transform is applied on a smaller region that has been cropped around the core point. The performance of this proposed method is evaluated based on the standard database of Bologna University and the database of the FVC2002. We used the city block distance to compute the similarity between the test fingerprint and database fingerprint image. The results obtained are compared with the discrete wavelet transform (DWT) based method. The experimental results show that, the proposed method reduces the false acceptance rate (FAR) from 21.48% to 16.74 % based on the database of Bologna University and from 31.29% to 28.69% based on the FVC2002 database.

• Korean Journal of Remote Sensing
• /
• v.18 no.5
• /
• pp.263-271
• /
• 2002

Recently, spatial information technologies using remotely sensed imagery and functionality of GIS (Geographic Information Systems) have been widely utilized to various types of transportation-related applications. In this study, extraction programs of some practical indices, to be effectively used in transportation reference planning problem, were designed and implemented as prototyped extensions in GIS development environment: traffic flow estimation (TFL/TFB), urban rural index (URI), and accessibility index (AI). In TFL/TFB, user can obtain quantitative results on traffic flow estimation at link/block using high-resolution satellite imagery. Whereas, URI extension provides urban-rural characteristics related to road system, being considered one of important factors in transportation planning. Lastly, AI extension helps to obtain accessibility index between nodes of road segments and surrounding district areas touched or intersected with the road network system, and it also provides useful information for transportation planning problems. This approach is regarded as one of RS-T (Remote Sensing in Transportation), and it is expected to expand as new application of remotely sensed imagery.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.639-645
• /
• 2019

This paper proposes a salient chromagram components extraction method based on the temporal discrete cosine transform of a chromagram block to improve cover song retrieval accuracy. The proposed salient chromagram emphasizes tonal contents of music, which are well-preserved between an original song and its cover version, while reducing the effects of timbre difference. We apply the proposed salient chromagram extraction method as a preprocessing step for the Fourier-transform based cover song matching. Experiments on two cover song datasets confirm that the proposed salient chromagram improves the cover song search accuracy.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.927-936
• /
• 2002

This paper presents the extraction of a feature by motion vector for efficient content-based retrieval for digital video. in this paper, divided by general size block for the current frame by video, using BMA(block matching algorithm) for an estimate by block move based on a time frame. but in case BMA appeared on a different pattern fact of motion in the vector obtain for the BMA. solve in this a problem to application for full search method this method is detected by of on many calculations. I propose an alternative plan in this paper Limit the search region to $\pm$15 and search is a limit integer pixel. a result, in this paper is make an estimate motion vector in more accurately using motion vector in adjoin in blocks. however, refer to the block vector because occurrence synchronism. Such addition information is get hold burden receive to transmit therefore, forecasted that motion feature each block and consider for problems for establish search region. in this paper Algorithm based to an examination Motion Estimation method by for motion Compensation is proposed.