• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.407-414
• /
• 2014

The Internet is a highly distributed and complex system consisting of billion devices and has become the field of various kinds of conflicts during the last two decades. As a matter of fact, various actors utilise the Internet for illicit purposes, such as for performing distributed denial of service attacks (DDoS) and for spreading various types of aggressive malware. Despite the fact that numerous services provide information regarding the threat level of the Internet, they are mostly based on information acquired by their sensors or on offline statistical sampling of various security applications (antivirus software, intrusion detection systems, etc.). This paper introduces proactive threat observatory system (PROTOS), an open-source early warning system that does not require a commercial license and is capable of estimating the threat level across the Internet. The proposed system utilises both a global and a local approach, and is thus able to determine whether a specific host is under an imminent threat, as well as to provide an estimation of the malicious activity across the Internet. Apart from these obvious advantages, PROTOS supports a large-scale installation and can be extended even further to improve the effectiveness by incorporating prediction and forecasting techniques.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.246-248
• /
• 2021

This paper proposes a new general-purpose automatic fire detection system. And it deals with the contents of related research on how to design and develop for this system. The proposed system automatically notifies the user and the nearby fire department when a fire breaks out in a place where a fire alarm is installed. If this is the case, the nearby fire department can quickly confirm this fact and extinguish the fire at an early stage, thereby reducing human and property damage. The main targets of this system are houses and small buildings. The proposed fire alarm functions as a conventional fire alarm, and if a fire occurs, this fact is immediately transmitted to a nearby receiver through wireless data communication. The receiver in this paper communicates data using Korea's firefighting communication frequency band, and establishes one own network by installing it in various places to quickly receive fire alarm data at any time.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.87-94
• /
• 2008

In this paper, we propose a new vision-based fire detection method for a real-life application. Most previous vision-based methods using color information and temporal variation of pixel produce frequent false alarms because they used a lot of heuristic features. Furthermore there is also computation delay for accurate fire detection. To overcome these problems, we first detected candidated fire regions by using background modeling and color model of fire. Then we made probabilistic models of fire by using a fact that fire pixel values of consecutive frames are changed constantly and applied them to a Bayesian Network. In this paper we used two level Bayesian network, which contains the intermediate nodes and uses four skewnesses for evidence at each node. Skewness of R normalized with intensity and skewnesses of three high frequency components obtained through wavelet transform. The proposed system has been successfully applied to many fire detection tasks in real world environment and distinguishes fire from moving objects having fire color.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.111-119
• /
• 2016

Most commercial digital cameras acquire the colors of an image through the color filter array, and interpolate missing pixels of the image. Because of this fact, original pixels and interpolated pixels have different statistical characteristics. If colors of an image are modified, the color filter array pattern that consists of RGB channels is changed. Using this pattern change, a color forgery detection method were presented. The conventional method uses the number of pixels that exceeds the maximum or minimum value of pre-defined block by only exploiting green component. However, this algorithm cannot remove the flat area which is occurred when color is changed. And the conventional method has demerit that cannot detect the forged image with rare green pixels. In this paper, we propose an enhanced color forgery detection algorithm using the normalization and weighted sum of the color components. Our method can reduce the detection error by using all color components and removing flat area. Through simulations, we observe that our proposed method shows better detection performance compared to the conventional method.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.949-958
• /
• 2004

race detection using a boosting based algorithm requires a very large size of face and nonface data. In addition, the fact that there always occurs a need for adding additional training data for better detection rates demands an efficient incremental teaming algorithm. In the design of incremental teaming based classifiers, the final classifier should represent the characteristics of the entire training dataset. Conventional methods have a critical problem in combining intermediate classifiers that weight updates depend solely on the performance of individual dataset. In this paper, for the purpose of application to face detection, we present a new method to combine an intermediate classifier with previously acquired ones in an optimal manner. Our algorithm creates a validation set by incrementally adding sampled instances from each dataset to represent the entire training data. The weight of each classifier is determined based on its performance on the validation set. This approach guarantees that the resulting final classifier is teamed by the entire training dataset. Experimental results show that the classifier trained by the proposed algorithm performs better than by AdaBoost which operates in batch mode, as well as by ${Learn}^{++}$.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.191-200
• /
• 2005

The brilliant achievements in computers and the internet technology make it easy for users to get useful information. But at the same time, the damages caused by intrusions and denial of service attacks are getting more worse. Specially because denial of service attacks by internet worm incapacitate computers and networks, we should draw up a disposal plan against it. So far many rule-based intrusion detection systems have been developed, but these have the limits of these ability to detect new internet worms. In this paper, we propose a system to detect intrusion and generate detection rule against scan-based internet worm, paying attention to the fact that internet worms scan network to infect hosts. The system detects internet worms using detection rule. And if it detects traffic causing by a new scan-based internet worm, it generates new detection nile using traffic information that is gathered. Therefore it can response to new internet worms early. Because the system gathers packet payload, when it is being necessary only, it can reduce system's overhead and disk space that is required.

• Journal of Digital Contents Society
• /
• v.13 no.4
• /
• pp.531-538
• /
• 2012

Visual cryptography is a scheme that recovers secret image through human vision by overlapping distributed share images without cryptographic operations. Distribution methods are still being developed for improving quality of shared images keeping size of images invariant and enhancing robustness against resize of images. Since visual cryptography only uses shared images, this fact is exploited to attack. From this fact, a scheme safe for sharing distributed images is needed. In this paper, a new visual cryptographic scheme using cover image is proposed. This scheme reduces the chance of detection against steganalysis and increases security. In addition, this paper shows that the proposed scheme can completely decrypt secret image without creating noise.

• Asian Journal for Public Opinion Research
• /
• v.9 no.1
• /
• pp.48-82
• /
• 2021

This research article attempts to understand the current situation of fake news on social media in India. The study focused on four characteristics of fake news based on four research questions: subject matter, presentation elements of fake news, debunking tool(s) or technique(s) used, and the social media site on which the fake news story was shared. A systematic sampling method was used to select a sample of 90 debunked fake news stories from two Indian fact-checking websites, Alt News and Factly, from December 2019 to February 2020. A content analysis of the four characteristics of fake news stories was carefully analyzed, classified, coded, and presented. The results show that most of the fake news stories were related to politics in India. The majority of the fake news was shared via a video with text in which narrative was changed to mislead users. For the largest number of debunked fake news stories, information from official or primary sources, such as reports, data, statements, announcements, or updates were used to debunk false claims.

• Speech Sciences
• /
• v.10 no.4
• /
• pp.117-124
• /
• 2003

Speaker recognition is the technology that confirms the identification of speaker by using the characteristic of speech. Such technique is classified into speaker identification and speaker verification: The first method discriminates the speaker from the preregistered group and recognize the word, the second verifies the speaker who claims the identification. This method that extracts the information of speaker from the speech and confirms the individual identification becomes one of the most efficient technology as the service via telephone network is popularized. Some problems, however, must be solved for the real application as follows; The first thing is concerning that the safe method is necessary to reject the imposter because the recognition is not performed for the only preregistered customer. The second thing is about the fact that the characteristic of speech is changed as time goes by, So this fact causes the severe degradation of recognition rate and the inconvenience of users as the number of times to utter the text increases. The last thing is relating to the fact that the common characteristic among speakers causes the wrong recognition result. The silence parts being included the center of speech cause that identification rate is decreased. In this paper, to make improvement, We proposed identification rate can be improved by removing silence part before processing identification algorithm. The methods detecting speech area are zero crossing rate, energy of signal detect end point and starting point of the speech and process DTW algorithm by using two methods in this paper. As a result, the proposed method is obtained about 3% of improved recognition rate compare with the conventional methods.

• Journal of Intelligence and Information Systems
• /
• v.25 no.3
• /
• pp.201-220
• /
• 2019

Fake news has emerged as a significant issue over the last few years, igniting discussions and research on how to solve this problem. In particular, studies on automated fact-checking and fake news detection using artificial intelligence and text analysis techniques have drawn attention. Fake news detection research entails a form of document classification; thus, document classification techniques have been widely used in this type of research. However, document summarization techniques have been inconspicuous in this field. At the same time, automatic news summarization services have become popular, and a recent study found that the use of news summarized through abstractive summarization has strengthened the predictive performance of fake news detection models. Therefore, the need to study the integration of document summarization technology in the domestic news data environment has become evident. In order to examine the effect of extractive summarization on the fake news detection model, we first summarized news articles through extractive summarization. Second, we created a summarized news-based detection model. Finally, we compared our model with the full-text-based detection model. The study found that BPN(Back Propagation Neural Network) and SVM(Support Vector Machine) did not exhibit a large difference in performance; however, for DT(Decision Tree), the full-text-based model demonstrated a somewhat better performance. In the case of LR(Logistic Regression), our model exhibited the superior performance. Nonetheless, the results did not show a statistically significant difference between our model and the full-text-based model. Therefore, when the summary is applied, at least the core information of the fake news is preserved, and the LR-based model can confirm the possibility of performance improvement. This study features an experimental application of extractive summarization in fake news detection research by employing various machine-learning algorithms. The study's limitations are, essentially, the relatively small amount of data and the lack of comparison between various summarization technologies. Therefore, an in-depth analysis that applies various analytical techniques to a larger data volume would be helpful in the future.