• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.06a
• /
• pp.102-105
• /
• 2019

In the classical single-image super-resolution (SISR) reconstruction method using convolutional neural networks, the extracted features are not fully utilized, and the training time is too long. Aiming at the above problems, we proposed an improved SISR method based on a residual network. Our proposed method uses a feature fusion technology based on improved residual blocks. The advantage of this method is the ability to fully and effectively utilize the features extracted from the shallow layers. In addition, we can see that the feature fusion can adaptively preserve the information from current and previous residual blocks and stabilize the training for deeper network. And we use the global residual learning to make network training easier. The experimental results show that the proposed method gets better performance than classic reconstruction methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.405-408
• /
• 2010

This paper presents a new feature extraction technique, correlation coefficient and Manhattan distance (MD) based method for recognition of rotated object in an image. This paper also represented a new concept of intensity invariant. We extracted global features of an image and converts a large size image into a one-dimensional vector called circular feature vector's (CFVs). An especial advantage of the proposed technique is that the extracted features are same even if original image is rotated with rotation angles 1 to 360 or rotated. The proposed technique is based on fuzzy sets and finally we have recognized the object by using histogram matching, correlation coefficient and manhattan distance of the objects. The proposed approach is very easy in implementation and it has implemented in Matlab7 on Windows XP. The experimental results have demonstrated that the proposed approach performs successfully on a variety of small as well as large scale rotated images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.3
• /
• pp.653-669
• /
• 2024

Dynamic scene deblurring is a complex computer vision problem owing to its difficulty to model mathematically. In this paper, we present a novel approach for image deblurring with the help of the sharp reference image, which utilizes the reference image for high-quality and high-frequency detail results. To better utilize the clear reference image, we develop an encoder-decoder network and two novel modules are designed to guide the network for better image restoration. The proposed Reference Extraction and Aggregation Module can effectively establish the correspondence between blurry image and reference image and explore the most relevant features for better blur removal and the proposed Spatial Feature Fusion Module enables the encoder to perceive blur information at different spatial scales. In the final, the multi-scale feature maps from the encoder and cascaded Reference Extraction and Aggregation Modules are integrated into the decoder for a global fusion and representation. Extensive quantitative and qualitative experimental results from the different benchmarks show the effectiveness of our proposed method.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.4
• /
• pp.60-74
• /
• 2007

For quantitative analysis of spatio-temporal distribution pattern on marine environment, spatial autocorrelation statistics on the both global and local aspects was applied to the observed data obtained from Gwangyang Bay in South Sea of Korea. Global indexes such as Moran's I and General G were used for understanding environmental distribution pattern in the whole study area. LISAs (local indicators of spatial association) such as Moran's I ($I_i$) and $G_i{^*}$ were considered to find similarity between a target feature and its neighborhood features and to detect hot spot and/or cold spot. Additionally, the significance test on clustered patterns by Z-scores was carried out. Statistical results showed variations of spatial patterns quantitatively in the whole year. Then all of general water quality, nutrients, chlorophyll-a and phytoplankton had strong clustered pattern in summer. When global indexes showed strong clustered pattern, the front region with a negative $I_i$ which means a strong spatial variation was observed. Also, when global indexes showed random pattern, hot spot and/or cold spot were/was found in the small local region with a local index $G_i{^*}$. Therefore, global indexes were useful for observing the strength and time series variations of clustered patterns in the whole study area, and local indexes were useful for tracing the location of hot spot and/or cold spot. Quantification of both spatial distribution pattern and clustering characteristics may play an important role to understand marine environment in depth and to find the reasons for spatial pattern.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.25-35
• /
• 2014

This paper proposes a method of boosting-based classification for the purpose of real-time face detection. The proposed method uses depth images to ensure strong performance of face detection in response to changes in lighting and face size, and uses the depth difference feature to conduct learning and recognition through the I-MCTBoost classifier. I-MCTBoost performs recognition by connecting the strong classifiers that are constituted from weak classifiers. The learning process for the weak classifiers is as follows: first, depth difference features are generated, and eight of these features are combined to form the weak classifier, and each feature is expressed as a binary bit. Strong classifiers undergo learning through the process of repeatedly selecting a specified number of weak classifiers, and become capable of strong classification through a learning process in which the weight of the learning samples are renewed and learning data is added. This paper explains depth difference features and proposes a learning method for the weak classifiers and strong classifiers of I-MCTBoost. Lastly, the paper presents comparisons of the proposed classifiers and the classifiers using conventional MCT through qualitative and quantitative analyses to establish the feasibility and efficiency of the proposed classifiers.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.1
• /
• pp.43-55
• /
• 2011

We here investigate the Liouville type theorems of slow diffusion differential inequality and its coupled system with variable coefficients in cone. First, we give the definition of global weak solution, and then we establish the universal estimate (does not depend on the initial value) of solution by constructing test function. At last, we obtain the nonexistence of non-negative non-trivial global weak solution within the appropriate critical exponent. The main feature of this method is that we need not use comparison theorem or the maximum principle.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.262-270
• /
• 2002

Although most image indexing schemes ate based on global image features, they have limited discrimination capability because they cannot capture local variations of the image. In this paper, we propose a new region-based image retrieval system that can extract important regions in the image using salient point extraction and image segmentation techniques. Our experimental results show that color and texture information in the region provide a significantly improved retrieval performances compared to the global feature extraction methods.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.5
• /
• pp.577-583
• /
• 2007

Simultaneous Localization and Mapping (SLAM) is the process of building a map of an unknown environment and simultaneously localizing a robot relative to this map. SLAM is very important for the indoor navigation of a mobile robot and much research has been conducted on this subject. Although feature-based SLAM using an Extended Kalman Filter (EKF) is widely used, it has shortcomings in that the computational complexity grows in proportion to the square of the number of features. This prohibits EKF-SLAM from operating in real time and makes it unfeasible in large environments where many features exist. This paper presents an algorithm which reduces the computational complexity of EKF-SLAM by using topological information (TI) extracted through a thinning process. The global map can be divided into local areas using the nodes of a thinning-based topological map. SLAM is then performed in local instead of global areas. Experimental results for various environments show that the performance and efficiency of the proposed EKF-SLAM/TI scheme are excellent.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.11
• /
• pp.1053-1059
• /
• 2010

This paper treats the DIS (Digital Image Stabilization) problem subject to base motions such as translation, rotation and zoom. For the local motion estimation from a raw image, the Harris corner detection algorithm is exploited to extract feature points, and comparing those of consecutive images, the zoom ratio (scale factor) is computed. For the global motion estimation, an equivalent model is derived to account for a 3-dimensional composite motion from which the center point and Euler angle can be determined. Finally, the motion compensation follows. To show the effectiveness of the present DIS scheme, experimental results for synthetic images are illustrated.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.55-61
• /
• 2009

In this paper, we propose a hierarchical method for segmenting a given 3D mesh, which hierarchically clusters sharp vertices of the mesh using the metric of geodesic distance among them. Sharp vertices are extracted from the mesh by analyzing convexity that reflects global geometry. As well as speeding up the computing time, the sharp vertices of this kind avoid the problem of local optima that may occur when feature points are extracted by analyzing the convexity that reflects local geometry. For obtaining more effective results, the sharp vertices are categorized according to the priority from the viewpoint of cognitive science, and the reasonable number of clusters is automatically determined by analyzing the geometric features of the mesh.