• Journal of Korea Technical Association of The Pulp and Paper Industry
• /
• v.47 no.4
• /
• pp.177-186
• /
• 2015

Until Mandelbrot introduced the concept of fractal geometry and fractal dimension in early 1970s, it has been generally considered that the geometry of nature should be too complex and irregular to describe analytically or mathematically. Here fractal dimension indicates a non-integer number such as 0.5, 1.5, or 2.5 instead of only integers used in the traditional Euclidean geometry, i.e., 0 for point, 1 for line, 2 for area, and 3 for volume. Since his pioneering work on fractal geometry, the geometry of nature has been found fractal. Mandelbrot introduced the concept of fractal geometry. For example, fractal geometry has been found in mountains, coastlines, clouds, lightning, earthquakes, turbulence, trees and plants. Even human organs are found to be fractal. This suggests that the fractal geometry should be the law for Nature rather than the exception. Fractal geometry has a hierarchical structure consisting of the elements having the same shape, but the different sizes from the largest to the smallest. Thus, fractal geometry can be characterized by the similarity and hierarchical structure. A process requires driving energy to proceed. Otherwise, the process would stop. A hierarchical structure is considered ideal to generate such driving force. This explains why natural process or phenomena such as lightning, thunderstorm, earth quakes, and turbulence has fractal geometry. It would not be surprising to find that even the human organs such as the brain, the lung, and the circulatory system have fractal geometry. Until now, a normal frequency distribution (or Gaussian frequency distribution) has been commonly used to describe frequencies of an object. However, a log-normal frequency distribution has been most frequently found in natural phenomena and chemical processes such as corrosion and coagulation. It can be mathematically shown that if an object has a log-normal frequency distribution, it has fractal geometry. In other words, these two go hand in hand. Lastly, applying fractal principles is discussed, focusing on pulp and paper industry. The principles should be applicable to characterizing surface roughness, particle size distributions, and formation. They should be also applicable to wet-end chemistry for ideal mixing, felt and fabric design for papermaking process, dewatering, drying, creping, and post-converting such as laminating, embossing, and printing.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.48-60
• /
• 2007

In previous researches for iris feature extraction, they transform a original iris image into rectangular one by stretching and interpolation, which causes the distortion of iris patterns. Consequently, it reduce iris recognition accuracy. So we are propose the method that extracts iris feature by using polar coordinates without distortion of iris patterns. Our proposed method has three strengths compared with previous researches. First, we extract iris feature directly from polar coordinate circular iris image. Though it requires a little more processing time, there is no degradation of accuracy for iris recognition and we compares the recognition performance of polar coordinate to rectangular type using by Hamming Distance, Cosine Distance and Euclidean Distance. Second, in general, the center position of pupil is different from that of iris due to camera angle, head position and gaze direction of user. So, we propose the method of iris feature detection based on polar coordinate circular iris region, which uses pupil and iris position and radius at the same time. Third, we overcome override point from iris patterns by using polar coordinates circular method. each overlapped point would be extracted from the same position of iris region. To overcome such problem, we modify Gabor filter's size and frequency on first track in order to consider low frequency iris patterns caused by overlapped points. Experimental results showed that EER is 0.29%, d' is 5,9 and EER is 0.16%, d' is 6,4 in case of using conventional rectangular image and proposed method, respectively.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.77-82
• /
• 2003

Virtual colonoscopy is a non-invasive computerized procedure to detect polyps by examining the colon from a CT data set. To fly through the inside of colons. the extraction of a suitable flight-path is necessary to Provide the viewpoint and view direction of a virtual camera. However. manual path extraction by Picking Points is a very time-consuming and difficult task due 1,c, the long and complex shape of colon. Also, existing automatic methods are computationally complex. and tend to generate an improper and/or discontinuous path for complicated regions. In this paper, we propose a fast flight-path generation algorithm using the distance and order maps. The order map Provides all Possible directions of a path. The distance map assigns the Euclidean distance value from each inside voxel to the nearest background voxel. By jointly using these two maps. we can obtain a proper centerline regardless of thickness and curvature of an object. Also, we Propose a simple smoothing technique that guarantees not to collide with the surface of an object. The phantom and real colon data are used for experiments. Experimental results show that for a set of human colon data, the proposed algorithm can provide a smoothened and connected flight-path within a minute on an 800MHz PC. And it is proved that the obtained flight-Path provides successive volume-rendered images satisfactory for virtual navigation.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.117-130
• /
• 2008

This paper proposes a stable and robust method to distinct the color similarity for clothes using the LBG algorithm under various light sources, Since the conventional methods, such as the histogram intersection and the accumulated histogram, are profoundly sensitive to the changing of light environments, the distinction of color similarity for the same cloth can be different due to the complicated light sources. To reduce the effects of the light sources, the properties of hue and saturation which consistently sustain the characteristic of the color under the various changes of light sources are analyzed to define the characteristic of the color distribution. In a two-dimensional space determined by the properties of hue and saturation, the LBG algorithm, a non-parametric clustering approach, is applied to examine the color distribution of images for each clothes. The color similarity of images is defined by the average of Euclidean distance between the mapping clusters which are calculated from the result of clustering of both images. To prove the stability of the proposed method, the results of the color similarity between our method and the traditional histogram analysis based methods are compared using a dozen of cloth examples that obtained under different light environments. Our method successively provides the classification between the same cloth image pair and the different cloth image pair and this classification of color similarity for clothe images obtains the 91.6% of success rate.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.643-652
• /
• 2006

Decision trees are mainly used for the classification and prediction in data mining. The distribution of spatial data and relationships with their neighborhoods are very important when conducting classification for spatial data mining in the real world. Spatial decision trees in previous works have been designed for reflecting spatial data characteristic by rating Euclidean distance. But it only explains the distance of objects in spatial dimension so that it is hard to represent the distribution of spatial data and their relationships. This paper proposes a decision tree based on spatial entropy that represents the distribution of spatial data with the dispersion and dissimilarity. The dispersion presents the distribution of spatial objects within the belonged class. And dissimilarity indicates the distribution and its relationship with other classes. The rate of dispersion by dissimilarity presents that how related spatial distribution and classified data with non-spatial attributes we. Our experiment evaluates accuracy and building time of a decision tree as compared to previous methods. We achieve an improvement in performance by about 18%, 11%, respectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.5
• /
• pp.3378-3384
• /
• 2015

The problem of fast search for raman spectrum has attracted much attention recently. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet codeword. To overcome this problem, The fast codeword search algorithm based on the mean pyramids of codewords is currently used in image coding applications. In this paper, we present three new methods for the fast algorithm to search for the closet codeword. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely codewords and save a great deal of computation time. The Experiment results show about 42.8-55.2% performance improvement for the 1DMPS+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

• Journal of the Korean Regional Science Association
• /
• v.40 no.1
• /
• pp.89-110
• /
• 2024

REITs are very closely related to real estate management, but there have been no prior studies analyzing the location of REITs assets. Therefore, this study analyzed the location characteristics of REITs assets in two aspects to clarify the location characteristics by using spatial information of REITs assets. First, the characteristics of the type of city where REITs assets are distributed were analyzed, and second, the characteristics of the zoning where REITs assets are distributed were analyzed. As a result of analyzing the characteristics of the city where REITs assets are distributed by type, it was analyzed that in the case of the capital area, both the ratio of cities with REITs assets location and the intensity of REITs assets location (number of REITs assets per city) have location characteristics by city hierarchy in the order of metropolitan city > big city > small and medium-sized city. In the case of non-capital area's metropolitan and large cities, the ratio of REITs assets location cities is similar to that of the capital area, but the location intensity of REITs assets was analyzed to be significantly lower than that of the capital area. As a result of the analysis of REITs assets by type, housing REITs assets tend to be located in the old downtown commercial zoning and the new downtown residential zoning, office REITs assets are characterized by concentration of location in specific commercial zoning of Seoul, and retail REITs assets are located mainly in the old downtown station area. In addition, it was found that logistics REITs assets tend to be located in management zoning, centering on key logistics hub cities in the region.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.562-569
• /
• 2019

Raman spectroscopy has been receiving increased attention as a standoff explosive detection technique. In addition, there is a growing need for a fast search method that can identify raman spectrum for measured chemical substances compared to known raman spectra in large database. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet spectra. To overcome this problem, we presented the MPS Sort with Sorted Variance+PDS method for the fast algorithm to search for the closet spectra in the last paper. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely spectra and save a great deal of computation time. In this paper, we present two new methods for the fast algorithm to search for the closet spectra. the PCA+PDS algorithm reduces the amount of computation by reducing the dimension of the data through PCA transformation with the same result as the distance calculation using the whole data. the Hierarchical Cluster Tree algorithm makes a binary hierarchical tree using PCA transformed spectra data. then it start searching from the clusters closest to the input spectrum and do not calculate many spectra that can not be candidates, which save a great deal of computation time. As the Experiment results, PCA+PDS shows about 60.06% performance improvement for the MPS Sort with Sorted Variance+PDS. also, Hierarchical Tree shows about 17.74% performance improvement for the PCA+PDS. The results obtained confirm the effectiveness of the proposed algorithm.