• KSCI Review
• /
• v.14 no.1
• /
• pp.255-264
• /
• 2006

Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with ${\chi}^2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

• Journal of Astronomy and Space Sciences
• /
• v.36 no.3
• /
• pp.133-147
• /
• 2019

Challenging Minisatellite Payload (CHAMP) satellite magnetic data are used to investigate the latitudinal variation of the storm-time meso-scale field-aligned currents by defining a new metric called the FAC range. Three major geomagnetic storm events are considered. Alongside SymH, the possible contributions from solar wind dynamic pressure and interplanetary magnetic field (IMF) $B_Z$ are also investigated. The results show that the new metric predicts the latitudinal variation of FACs better than previous studies. As expected, the equatorward expansion and poleward retreat are observed during the storm main phase and recovery phase respectively. The equatorward shift is prominent on the northern duskside, at ${\sim}58^{\circ}$ coinciding with the minimum SymH and dayside at ${\sim}59^{\circ}$ compared to dawnside and nightside respectively. The latitudinal shift of FAC range is better correlated to IMF $B_Z$ in northern hemisphere dusk-dawn magnetic local time (MLT) sectors than in southern hemisphere. The FAC range latitudinal shifts responds better to dynamic pressure in the duskside northern hemisphere and dawnside southern hemisphere than in southern hemisphere dusk sector and northern hemisphere dawn sector respectively. FAC range exhibits a good correlation with dynamic pressure in the dayside (nightside) southern (northern) hemispheres depicting possible electrodynamic similarity at day-night MLT sectors in the opposite hemispheres.

• Journal of Soil and Groundwater Environment
• /
• v.25 no.4
• /
• pp.87-97
• /
• 2020

In this study, the applicability of the geostatistical evolution strategy as an inverse analysis method of estimating hydraulic properties of small-scale basin was tested. The geostatistical evolution strategy is a type of data assimilation method that can effectively estimate aquifer hydraulic conductivity by combining a global optimization model of the evolution strategy and a local optimization model of the ensemble Kalman filtering. In the applicability test, the geometry, hydraulic boundary conditions, and the distribution of groundwater monitoring wells of Hanlim-Eup were employed. On the other hand, a synthetic hydraulic conductivity distribution was generated and used as the reference property for ease of estimation quality assessment. In the estimations, two different cases were tested where, in Case I, both groundwater levels and hydraulic conductivity measurements were assumed to be available, and only the groundwater levels were available, in Case II. In both cases, the reference and estimated hydraulic conductivity fields were found to show reasonable similarity, even though the prior information for estimation was not accurate. The ability to estimate hydraulic conductivity without accurate prior information suggests that this method can be used effectively to estimate mathematical properties in real-world cases, many of which little prior information is available for the aquifer conditions.

• Journal of IKEEE
• /
• v.24 no.4
• /
• pp.1148-1155
• /
• 2020

Fire must be extinguished as quickly as possible because they cause a lot of economic loss and take away precious human lives. Especially, the detection of smoke, which tends to be found first in fire, is of great importance. Smoke detection based on image has many difficulties in algorithm research due to the irregular shape of smoke. In this study, we introduce a new real-time smoke detection algorithm that reduces the detection of false positives generated by irregular smoke shape based on faster r-cnn of factory-installed surveillance cameras. First, we compute the global frame similarity and mean squared error (MSE) to detect the movement of smoke from the input surveillance camera. Second, we use deep learning algorithm (Faster r-cnn) to extract deferred candidate regions. Third, the extracted candidate areas for acting are finally determined using space and temporal features as smoke area. In this study, we proposed a new algorithm using the space and temporal features of global and local frames, which are well-proposed object information, to reduce false positives based on deep learning techniques. The experimental results confirmed that the proposed algorithm has excellent performance by reducing false positives of about 99.0% while maintaining smoke detection performance.

• Nuclear Engineering and Technology
• /
• v.55 no.5
• /
• pp.1821-1829
• /
• 2023

The temperature distribution of the reactor pool under natural circulation induced by the RVACS operation was experimentally studied. According to the Bo' based similarity law, which could reproduce the temperature distribution of the working fluid under natural circulation, SINCRO-2D facility was designed based on the PGSFR. It was reduced to 1 : 25 in length scale, having water as a simulant of the sodium, which is the original working fluid. In general, temperature was stratified, however, effect of the natural circulation flow could be observed by the entrainment of the stratified temperature. Relative cooling contribution of the upper plenum (narrow gap) and lower plenum was approximately 0.2 and 0.8, respectively. In the range of decay heat from 0.2% to 1.0%, only the magnitude of the temperature was changed, while the normalized temperature maintained. Boundary temperature distribution change made a global temperature offset of the pool, without a significant local change. Therefore, the decay heat and cooling boundary condition had no significant effect on temperature distribution characteristics of the pool within the given range of the decay heat and boundary temperature distribution.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.417-426
• /
• 2023

To improve the effect of image restoration and solve the image detail loss, an image dehazing enhancement algorithm based on mean guided filtering is proposed. The superpixel calculation method is used to pre-segment the original foggy image to obtain different sub-regions. The Ncut algorithm is used to segment the original image, and it outputs the segmented image until there is no more region merging in the image. By means of the mean-guided filtering method, the minimum value is selected as the value of the current pixel point in the local small block of the dark image, and the dark primary color image is obtained, and its transmittance is calculated to obtain the image edge detection result. According to the prior law of dark channel, a classic image dehazing enhancement model is established, and the model is combined with a median filter with low computational complexity to denoise the image in real time and maintain the jump of the mutation area to achieve image dehazing enhancement. The experimental results show that the image dehazing and enhancement effect of the proposed algorithm has obvious advantages, can retain a large amount of image detail information, and the values of information entropy, peak signal-to-noise ratio, and structural similarity are high. The research innovatively combines a variety of methods to achieve image dehazing and improve the quality effect. Through segmentation, filtering, denoising and other operations, the image quality is effectively improved, which provides an important reference for the improvement of image processing technology.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.27 no.2
• /
• pp.256-264
• /
• 2024

In the last 10 years, AI has made rapid progress, and image classification, in particular, are showing excellent performance based on deep learning. Nevertheless, due to the nature of deep learning represented by a black box, it is difficult to actually use it in critical decision-making situations such as national defense, autonomous driving, medical care, and finance due to the lack of explainability of judgement results. In order to overcome these limitations, in this study, a model description algorithm capable of local interpretation was applied to the inception network-derived AI to analyze what grounds they made when classifying national defense data. Specifically, we conduct a comparative analysis of explainability based on confidence values by performing LIME analysis from the Inception v2_resnet model and verify the similarity between human interpretations and LIME explanations. Furthermore, by comparing the LIME explanation results through the Top1 output results for Inception v3, Inception v2_resnet, and Xception models, we confirm the feasibility of comparing the efficiency and availability of deep learning networks using XAI.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.63-70
• /
• 2014

Process of recognizing objects in binary images consists of image segmentation and pattern matching. If binary objects in the image are assumed to be separated, global features such as area, length of perimeter, or the ratio of the two can be used to recognize the objects in the image. However, if such an assumption is not valid, the global features can not be used but local features such as points or line segments should be used to recognize the objects. In this paper points with large curvature along the perimeter are chosen to be the feature points, and pairs of points selected from them are used as local features. Similarity of two local features are defined using elastic deformation energy for making the lengths and angles between gradient vectors at the end points same. Neighbour support value is defined and used for robust recognition of partially occluded binary objects. An experiment on Kimia-25 data showed that the proposed algorithm runs 4.5 times faster than the maximum clique algorithm with same recognition rate.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.421-427
• /
• 2011

The importance of the real-time object recognition and tracking field has been growing steadily due to rapid advancement in the computer vision applications industry. As is well known, the mean-shift algorithm is widely used in robust real-time object tracking systems. Since the mentioned algorithm is easy to implement and efficient in object tracking computation, many say it is suitable to be applied to real-time object tracking systems. However, one of the major drawbacks of this algorithm is that it always converges to a local mode, failing to perform well in a cluttered environment. In this paper, an Optical Flow-based algorithm which fits for real-time recognition of multiple moving objects is proposed. Also in the tests, the newly proposed method contributed to raising the similarity of multiple moving objects, the similarity was as high as 0.96, up 13.4% over that of the mean-shift algorithm. Meanwhile, the level of pixel errors from using the new method keenly decreased by more than 50% over that from applying the mean-shift algorithm. If the data processing speed in the video surveillance systems can be reduced further, owing to improved algorithms for faster moving object recognition and tracking functions, we will be able to expect much more efficient intelligent systems in this industrial arena.