• Ocean and Polar Research
• /
• v.35 no.3
• /
• pp.239-247
• /
• 2013

Digital image processing is a process to analyze a large volume of information on digital images. In this study, Artemia hatching rate was measured by automatically classifying and counting cysts and larvae based on color imaging data from cyst hatching experiments using an image processing technique. The Artemia hatching rate estimation consists of a series of processes; a step to convert the scanned image data to a binary image data, a process to detect objects and to extract their shape information in the converted image data, an analysis step to choose an optimal discriminant function, and a step to recognize and classify the objects using the function. The function to classify Artemia cysts and larvae is optimally estimated based on the classification performance using the areas and the plan-form factors of the detected objects. The hatching rate using the image data obtained under the different experimental conditions was estimated in the range of 34-48%. It was shown that the maximum difference is about 19.7% and the average root-mean squared difference is about 10.9% as the difference between the results using an automatic counting (this study) and a manual counting were compared. This technique can be applied to biological specimen analysis using similar imaging information.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.200-203
• /
• 2006

Cloud detection algorithm is being developed as major one of the 16 baseline products of CMDPS (COMS Meteorological Data Processing System), which is under development for the real-time application of data will be observed from COMS Meteorological Imager. For cloud detection from satellite data, we studied two different algorithms. One is threshold technique based algorithm, which is traditionally used, and another is artificial neural network model. MPEF scene analysis algorithm is the basic idea of threshold cloud detection algorithm, and some modifications are conducted for COMS. For the neural network, we selected MLP with back-propagation algorithm. Prototype software of each algorithm was completed and evaluated by using the MTSAT-1R and GOES-9 data. Currently the software codes are standardized using Fortran90 language. For the preparation as an operational algorithm, we will setup the validation strategy and tune up the algorithm continuously. This paper shows the outline of the two cloud detection algorithm and preliminary test result of both algorithms.

• Korean Journal of Remote Sensing
• /
• v.22 no.5
• /
• pp.367-372
• /
• 2006

Cloud detection algorithm is being developed as primary one of the 16 baseline products of CMDPS (COMS Meteorological Data Processing System), which is under development for the real-time application of data will be observed from COMS Meteorological Imager. For cloud detection from satellite data, we studied two different algorithms. One is threshold technique based algorithm, which is traditionally used, and another is artificial neural network model. MPEF scene analysis algorithm is the basic idea of threshold cloud detection algorithm, and some modifications are conducted for COMS. For the neural network, we selected MLP with back-propagation algorithm. Prototype software of each algorithm was completed and evaluated by using the MTSAT-IR and GOES-9 data. Currently the software codes are standardized using Fortran90 language. For the preparation as an operational algorithm, we will setup the validation strategy and tune up the algorithm continuously. This paper shows the outline of the two cloud detection algorithms and preliminary test results of both algorithms.

• Geophysics and Geophysical Exploration
• /
• v.20 no.2
• /
• pp.61-71
• /
• 2017

Recently, ground-penetrating radar (GPR) surveys have been actively carried out for precise subsurface void investigation because of the rapid increase of subsidence in urban areas. However, since the interpretation of GPR data was conducted based on the interpreter's subjective decision after applying only the basic data processing, it can result in reliability problems. In this research, to solve these problems, we analyzed the difference between the events generated from subsurface voids and those of strong diffraction sources such as the buried pipeline by applying the edge detection technique, which is one of image processing technologies. For the analysis, we applied the image processing technology to the GRP field data containing events generated from the cavity or buried pipeline. As a result, the main events by the subsurface void or diffraction source were effectively separated using the edge detection technique. In addition, since subsurface voids associated with the subsidence has a relatively wide scale, it is recorded as a gentle slope event unlike the event caused by the strong diffraction source recorded with a sharp slope. Therefore, the directional analysis of amplitude variation in the image enabled us to effectively separate the events by the subsurface void from those by the diffraction source. Interpretation based on these kinds of objective analysis can improve the reliability. Moreover, if suggested techniques are verified to various GPR field data sets, these approaches can contribute to semiautomatic interpretation of large amount of GPR data.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.4
• /
• pp.24-33
• /
• 2004

Advances in remote sensing technologies are resulting in the rapid increase of the number of spectral channels, and thus, growing data volumes. This creates a need for developing faster techniques for processing such data. One application in which such fast processing is needed is the dimension reduction of the multispectral data. Principal component transformation is perhaps the mostpopular dimension reduction technique for multispectral data. In this paper, we discussed the processing procedures of principal component transformation. And we presented and discussed the results of the principal component transformation of the multispectral data. Moreover principal components image data are classified by the Maximum Likelihood method and Multilayer Perceptron method. In addition, the performances of two classification methods and data reduction effects are evaluated and analyzed based on the experimental results.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.59-69
• /
• 2005

Data mining technique is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. It has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on off-line or on-line and so on. We analyze Gyeongnam social indicator survey data by 2001 using twostep clustering technique for environment information. The twostep clustering is classified as a partitional clustering method. We can apply these twostep clustering outputs to environmental preservation and improvement.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.269-280
• /
• 2004

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expresses it as a B+-tree. By solving the problem of search time complexity the pyramid technique also prevents the effect of "phenomenon of dimensional curse" which is caused by treatment of hypercube range query in n-dimensional data space. The SPY-TEC applies the space division strategy in pyramid method and uses spherical range query suitable for similarity search so that Improves the search performance. However, nearest neighbor query is more efficient than range query because it is difficult to specify range in similarity search. Previously proposed index methods perform well only in the specific distribution of data. In this paper, we propose an efficient searching technique for nearest neighbor object using PdR-Tree suggested to improve the search performance for high dimensional data such as multimedia data. Test results, which uses simulation data with various distribution as well as real data, demonstrate that PdR-Tree surpasses both the Pyramid-Technique and SPY-TEC in views of search performance.rformance.

• The Journal of the Korean dental association
• /
• v.38 no.4 s.371
• /
• pp.357-368
• /
• 2000

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.335-344
• /
• 2005

Recently open data mining methods focusing on a data stream that is a massive unbounded sequence of data elements continuously generated at a rapid rate are proposed actively. Knowledge embedded in a data stream is likely to be changed over time. Therefore, identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. This paper proposes a sliding window technique for finding recently frequent itemsets, which is applied efficiently in open data mining. In the proposed technique, its memory usage is kept in a small space by delayed-insertion and pruning operations, and its mining result can be found in a short time since the data elements within its target range are not traversed repeatedly. Moreover, the proposed technique focused in the recent data elements, so that it can catch out the recent change of the data stream.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.54-65
• /
• 1992

A huge amount of multiplications is required for 2-D filtering on the image data, making it difficult to implement a real-time quincuncial interpolator. In this paper, efficient design technique and VLSI structures for 2-D multipleierless filter are presented. In the filter design, by introducing an efficient scheme for discretizing the frequency response of the prototype filter, it is shown that a significant amount of the computational burden required in the conventional techniques, such as local search, branch and bound techniques, could be saved. In the case of 5$\times$5 filter, it is found that the design technique described in this paper could save about 80% of the computation time, compared to the conventional methods, while providing a comparable performance. For a hardware implementation, two different VLSI structures for 2-D multiplierless filter are also introduced in the paper : One is for block parallel processing and the other for scan-line parallel processing. In both structure, the AP(area-period) figure improves over Wu's structure[4].