• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.631-644
• /
• 2002

In this paper efficient algorithms for content-based video retrieval using motion information are proposed, including temporal scale-invariant retrieval and temporal scale-absolute retrieval. In temporal scale-invariant video retrieval, the distance transformation is performed on each trail image in database. Then, from a given que교 trail the pixel values along the query trail are added in each distance image to compute the average distance between the trails of query image and database image, since the intensity of each pixel in distance image represents the distance from that pixel to the nearest edge pixel. For temporal scale-absolute retrieval, a new coding scheme referred to as Motion Retrieval Code is proposed. This code is designed to represent object motions in the human visual sense so that the retrieval performance can be improved. The proposed coding scheme can also achieve a fast matching, since the similarity between two motion vectors can be computed by simple bit operations. The efficiencies of the proposed methods are shown by experimental results.

• Korean Journal of Environment and Ecology
• /
• v.29 no.2
• /
• pp.221-227
• /
• 2015

This study was carried out to measure seasonal changes in the community structure and species composition of marobenthos in the intertidal area of Dokdo. The macrobenthos identified during this study was comprised of 36 species: predominately 25 species of mollusks(69.4 %), 6 species of arthropods(16.7 %), 3 species of echinodermata(8.3 %) and 1 species of cnidaria (5.6 %). The number of marobenthos species ranged from 27 in Spring to 33 in Autumn. In terms of the top 10 dominant species, there were 7 species of mollusks and 3 species of arthropods in the this study. After analyzing the bray-curtis similarity, it was divided into two large groups(A, B). Such group classification matched the SIMPROF(Similarity Profile Analysis) and the one-way ANOSIM(Analysis of similarities) analysis.

• Journal of Information Technology Services
• /
• v.11 no.sup
• /
• pp.177-189
• /
• 2012

We developed the ocean disaster detection system(OD2S) which copes with the occurrences of ocean disasters (e. g. the red and green tide, the oil spill, the typhoon, and the sea ice) by converging and integrating the ocean color remote sensing using the satellite and the information technology exploiting the mass data processing and the pattern recognitions. This system which is based on the cosine similarity detects the ocean disasters in real time. The existing ocean color sensors which are operated in the polar orbit platforms cannot conduct the real time observation of ocean environments because they support the low temporal resolutions of one observation a day. However, geostationary ocean color imager(GOCI), the first geostationary ocean color sensor in the world, produces the ocean color images(e. g. the chlorophyll, the colored dissolved organic matter(CDOM), and the total suspended solid(TSS)), with high temporal resolutions of hourly intervals up to eight observations a day. The evaluation demonstrated that the OD2S can detect the excessive concentration of chlorophyll, CDOM, and TSS. Based on these results, it is expected that OD2S detects the ocean disasters in real time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.40-47
• /
• 2009

A motion adaptive video noise reduction scheme is proposed by cascading a temporal filter and a spatial filter. After a noise-robust motion detection is performed with a pre-spatial filter, the strength of the motion adaptive temporal filter is controlled by the amount of temporal movement. In order to fully utilize the temporal correlation of video signal, noisy input image is processed first by the temporal filter, therefore, image details of temporally stationary region are quite well preserved while undesired noises are suppressed. In contrast to the pre-spatial filter used for the robust motion detection, the cascaded post-spatial filter removes the remained noises by considering the strength of the temporal filter and the spatial self-similarity search results obtained from the pre-spatial filter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2851-2865
• /
• 2014

To improve the rate-distortion performance of distributed video compressive sensing (DVCS), the adaptive sparse basis and nonlocal similarity of video are proposed to jointly reconstruct the video signal in this paper. Due to the lack of motion information between frames and the appearance of some noises in the reference frames, the sparse dictionary, which is constructed using the examples directly extracted from the reference frames, has already not better obtained the sparse representation of the interpolated block. This paper proposes a method to construct the sparse dictionary. Firstly, the example-based data matrix is constructed by using the motion information between frames, and then the principle components analysis (PCA) is used to compute some significant principle components of data matrix. Finally, the sparse dictionary is constructed by these significant principle components. The merit of the proposed sparse dictionary is that it can not only adaptively change in terms of the spatial-temporal characteristics, but also has ability to suppress noises. Besides, considering that the sparse priors cannot preserve the edges and textures of video frames well, the nonlocal similarity regularization term has also been introduced into reconstruction model. Experimental results show that the proposed algorithm can improve the objective and subjective quality of video frame, and achieve the better rate-distortion performance of DVCS system at the cost of a certain computational complexity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.3
• /
• pp.269-276
• /
• 2010

In this paper, we present the detection method of moving objects based on two background models. These background models support to understand multi layered environment belonged in images taken by shaking camera and each model is MBM(Multiple Background Model) and TMBM (Temporal Median Background Model). Because two background models are Pixel-based model, it must have noise by camera movement. Therefore correlation coefficient calculates the similarity between consecutive images and measures camera motion vector which indicates camera movement. For the calculation of correlation coefficient, we choose the selected region and searching area in the current and previous image respectively then we have a displacement vector by the correlation process. Every selected region must have its own displacement vector therefore the global maximum of a histogram of displacement vectors is the camera motion vector between consecutive images. The MBM classifies the intensity distribution of each pixel continuously related by camera motion vector to the multi clusters. However, MBM has weak sensitivity for temporal intensity variation thus we use TMBM to support the weakness of system. In the video-based experiment, we verify the presented algorithm needs around 49(ms) to generate two background models and detect moving objects.

• 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.

• Journal of Internet Computing and Services
• /
• v.16 no.6
• /
• pp.79-88
• /
• 2015

The web search engines are exposed to the issue of uncertainty because of ambiguous queries, being input for retrieving the accurate results. Ambiguous queries constitute a significant fraction of such instances and pose real challenges to web search engines. Moreover, web search has created an interest for the researchers to deal with search by considering context in terms of location perspective. Our proposed disambiguation approach is designed to improve user experience by using context in terms of location relevance with the document relevance. The aim is that providing the user a comprehensive location perspective of a topic is informative than retrieving a result that only contains temporal or context information. The capacity to use this information in a location manner can be, from a user perspective, potentially useful for several tasks, including user query understanding or clustering based on location. In order to carry out the approach, we developed a Java based prototype to derive the contextual information from the web results based on the queries from the well-known datasets. Among those results, queries are further classified in order to perform search in a broad way. After the result provision to users and the selection made by them, feedback is recorded implicitly to improve the web search based on contextual information. The experiment results demonstrate the outstanding performance of our approach in terms of precision 75%, accuracy 73%; recall 81% and f-measure 78% when compared with generic temporal evaluation approach and furthermore achieved precision 86%, accuracy 71%; recall 67% and f-measure 75% when compared with web document clustering approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.875-885
• /
• 2010

CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.99-105
• /
• 2017

Generally, stereo matching methods are used to estimate depth information based on color and spatial similarity. However, most depth estimation methods suffer from the occlusion region because occlusion regions cause inaccurate depth information. Moreover, they do not consider the temporal dimension when estimating the disparity. In this paper, we propose a temporal stereo matching method, considering occlusion and disregarding inaccurate temporal depth information. First, we apply a global stereo matching algorithm to estimate the depth information, we segment the image to occlusion and non-occlusion regions. After occlusion detection, we fill the occluded region with a reasonable disparity value that are obtained from neighboring pixels of the current pixel. Then, we apply a temporal disparity estimation method using the reliable information. Experimental results show that our method detects more accurate occlusion regions, compared to a conventional method. The proposed method increases the temporal consistency of estimated disparity maps and outperforms per-frame methods in noisy images.