• Title/Summary/Keyword: Local feature

Search Result 932, Processing Time 0.021 seconds

Image Denoising via Fast and Fuzzy Non-local Means Algorithm

  • Lv, Junrui;Luo, Xuegang
    • Journal of Information Processing Systems
    • /
    • v.15 no.5
    • /
    • pp.1108-1118
    • /
    • 2019
  • Non-local means (NLM) algorithm is an effective and successful denoising method, but it is computationally heavy. To deal with this obstacle, we propose a novel NLM algorithm with fuzzy metric (FM-NLM) for image denoising in this paper. A new feature metric of visual features with fuzzy metric is utilized to measure the similarity between image pixels in the presence of Gaussian noise. Similarity measures of luminance and structure information are calculated using a fuzzy metric. A smooth kernel is constructed with the proposed fuzzy metric instead of the Gaussian weighted L2 norm kernel. The fuzzy metric and smooth kernel computationally simplify the NLM algorithm and avoid the filter parameters. Meanwhile, the proposed FM-NLM using visual structure preferably preserves the original undistorted image structures. The performance of the improved method is visually and quantitatively comparable with or better than that of the current state-of-the-art NLM-based denoising algorithms.

Analysis of Marine Traffic Feature for Safety Assessment at Southern Entrance of the Istanbul Strait-I

  • Aydogdu, Volkan;Park, Jin-Soo;Keceli, Yavuz;Park, Young-Soo
    • Journal of Navigation and Port Research
    • /
    • v.32 no.7
    • /
    • pp.521-527
    • /
    • 2008
  • The Istanbul Strait is one of the important waterways in the world. And its southern entrance has a highly congested local traffic. Till now there are several studies regarding how the Istanbul Strait is dangerous to navigate and how those dangers can be mitigated. But there is no study regarding local traffic which is posing great collision risk. In a certain traffic area, marine traffic safety assessment parameters are traffic volume, frequency of collision avoidance maneuver, traffic density, traffic flow and potential encounter, In this paper local traffic volume, traffic flow and potential encounter number of local traffic vessels and possibility of collision are investigated in order to find degree of danger at the southern entrance of the Istanbul Strait. Finally by utilizing those, risky areas are determined for southern entrance of the Istanbul Strait. Results have been compared to a previous study regarding risk analysis at congested areas of the Istanbul Strait (Aydogdu, 2006) and consistency of the results were presented.

Surface Approximation Utilizing Orientation of Local Surface

  • Ko, Myeong-Cheol;Sohn, Won-Sung;Choy, Yoon-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.4
    • /
    • pp.698-706
    • /
    • 2003
  • The primary goal of surface approximation is to reduce the degree of deviation of the simplified surface from the original surface. However it is difficult to define the metric that can measure the amount of deviation quantitatively. Many of the existing studies analogize it by using the change of the scalar quantity before and after simplification. This approach makes a lot of sense in the point that the local surfaces with small scalar are relatively less important since they make a low impact on the adjacent areas and thus can be removed from the current surface. However using scalar value alone there can exist many cases that cannot compute the degree of geometric importance of local surface. Especially the perceptual geometric features providing important clues to understand an object, in our observation, are generally constructed with small scalar value. This means that the distinguishing features can be removed in the earlier stage of the simplification process. In this paper, to resolve this problem, we present various factors and their combination as the metric for calculating the deviation error by introducing the orientation of local surfaces. Experimental results indicate that the surface orientation has an important influence on measuring deviation error and the proposed combined error metric works well retaining the relatively high curvature regions on the object's surface constructed with various and complex curvatures.

  • PDF

A Lightweight Real-Time Small IR Target Detection Algorithm to Reduce Scale-Invariant Computational Overhead (스케일 불변적인 연산량 감소를 위한 경량 실시간 소형 적외선 표적 검출 알고리즘)

  • Ban, Jong-Hee;Yoo, Joonhyuk
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.4
    • /
    • pp.231-238
    • /
    • 2017
  • Detecting small infrared targets from the low-SCR images at a long distance is very hard. The previous Local Contrast Method (LCM) algorithm based on the human visual system shows a superior performance of detecting small targets by a background suppression technique through local contrast measure. However, its slow processing speed due to the heavy multi-scale processing overhead is not suitable to a variety of real-time applications. This paper presents a lightweight real-time small target detection algorithm, called by the Improved Selective Local Contrast Method (ISLCM), to reduce the scale-invariant computational overhead. The proposed ISLCM applies the improved local contrast measure to the predicted selective region so that it may have a comparable detection performance as the previous LCM while guaranteeing low scale-invariant computational load by exploiting both adaptive scale estimation and small target feature feasibility. Experimental results show that the proposed algorithm can reduce its computational overhead considerably while maintaining its detection performance compared with the previous LCM.

The Robust Derivative Code for Object Recognition

  • Wang, Hainan;Zhang, Baochang;Zheng, Hong;Cao, Yao;Guo, Zhenhua;Qian, Chengshan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.272-287
    • /
    • 2017
  • This paper proposes new methods, named Derivative Code (DerivativeCode) and Derivative Code Pattern (DCP), for object recognition. The discriminative derivative code is used to capture the local relationship in the input image by concatenating binary results of the mathematical derivative value. Gabor based DerivativeCode is directly used to solve the palmprint recognition problem, which achieves a much better performance than the state-of-art results on the PolyU palmprint database. A new local pattern method, named Derivative Code Pattern (DCP), is further introduced to calculate the local pattern feature based on Dervativecode for object recognition. Similar to local binary pattern (LBP), DCP can be further combined with Gabor features and modeled by spatial histogram. To evaluate the performance of DCP and Gabor-DCP, we test them on the FERET and PolyU infrared face databases, and experimental results show that the proposed method achieves a better result than LBP and some state-of-the-arts.

Dual-Encoded Features from Both Spatial and Curvelet Domains for Image Smoke Recognition

  • Yuan, Feiniu;Tang, Tiantian;Xia, Xue;Shi, Jinting;Li, Shuying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2078-2093
    • /
    • 2019
  • Visual smoke recognition is a challenging task due to large variations in shape, texture and color of smoke. To improve performance, we propose a novel smoke recognition method by combining dual-encoded features that are extracted from both spatial and Curvelet domains. A Curvelet transform is used to filter an image to generate fifty sub-images of Curvelet coefficients. Then we extract Local Binary Pattern (LBP) maps from these coefficient maps and aggregate histograms of these LBP maps to produce a histogram map. Afterwards, we encode the histogram map again to generate Dual-encoded Local Binary Patterns (Dual-LBP). Histograms of Dual-LBPs from Curvelet domain and Completed Local Binary Patterns (CLBP) from spatial domain are concatenated to form the feature for smoke recognition. Finally, we adopt Gaussian Kernel Optimization (GKO) algorithm to search the optimal kernel parameters of Support Vector Machine (SVM) for further improvement of classification accuracy. Experimental results demonstrate that our method can extract effective and reasonable features of smoke images, and achieve good classification accuracy.

Collecting Health Data from Wearable Devices by Leveraging Salient Features in a Privacy-Preserving Manner

  • Moon, Su-Mee;Kim, Jong-Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.10
    • /
    • pp.59-67
    • /
    • 2020
  • With the development of wearable devices, individuals' health status can be checked in real time and risks can be predicted. For example, an application has been developed to detect an emergency situation of a patient with heart disease and contact a guardian through analysis of health data such as heart rate and electrocardiogram. However, health data is seriously damaging when it is leaked as it relates to life. Therefore, a method to protect personal information is essential in collecting health data, and this study proposes a method of collecting data while protecting the personal information of the data owner through a LDP(Local Differential Privacy). The previous study introduced a technique of transmitting feature point data rather than all data to a data collector as an algorithm for searching for fixed k feature points. Next, this study will explain how to improve the performance by up to 75% using an algorithm that finds the optimal number of feature points k.

Registration Method between High Resolution Optical and SAR Images (고해상도 광학영상과 SAR 영상 간 정합 기법)

  • Jeon, Hyeongju;Kim, Yongil
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.5
    • /
    • pp.739-747
    • /
    • 2018
  • Integration analysis of multi-sensor satellite images is becoming increasingly important. The first step in integration analysis is image registration between multi-sensor. SIFT (Scale Invariant Feature Transform) is a representative image registration method. However, optical image and SAR (Synthetic Aperture Radar) images are different from sensor attitude and radiation characteristics during acquisition, making it difficult to apply the conventional method, such as SIFT, because the radiometric characteristics between images are nonlinear. To overcome this limitation, we proposed a modified method that combines the SAR-SIFT method and shape descriptor vector DLSS(Dense Local Self-Similarity). We conducted an experiment using two pairs of Cosmo-SkyMed and KOMPSAT-2 images collected over Daejeon, Korea, an area with a high density of buildings. The proposed method extracted the correct matching points when compared to conventional methods, such as SIFT and SAR-SIFT. The method also gave quantitatively reasonable results for RMSE of 1.66m and 2.45m over the two pairs of images.

A Study on Facial Expression Recognition using Boosted Local Binary Pattern (Boosted 국부 이진 패턴을 적용한 얼굴 표정 인식에 관한 연구)

  • Won, Chulho
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.12
    • /
    • pp.1357-1367
    • /
    • 2013
  • Recently, as one of images based methods in facial expression recognition, the research which used ULBP block histogram feature and SVM classifier was performed. Due to the properties of LBP introduced by Ojala, such as highly distinction capability, durability to the illumination changes and simple operation, LBP is widely used in the field of image recognition. In this paper, we combined $LBP_{8,2}$ and $LBP_{8,1}$ to describe micro features in addition to shift, size change in calculating ULBP block histogram. From sub-windows of 660 of $LBP_{8,1}$ and 550 of $LBP_{8,2}$, ULBP histogram feature of 1210 were extracted and weak classifiers of 50 were generated using AdaBoost. By using the combined $LBP_{8,1}$ and $LBP_{8,2}$ hybrid type of ULBP histogram feature and SVM classifier, facial expression recognition rate could be improved and it was confirmed through various experiments. Facial expression recognition rate of 96.3% by hybrid boosted ULBP block histogram showed the superiority of the proposed method.

Region Decision Using Modified ICM Method (변형된 ICM 방식에 의한 영역판별)

  • Hwang Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.5 s.311
    • /
    • pp.37-44
    • /
    • 2006
  • In this paper, a new version of the ICM method(MICM, modified ICM) in which the contextual information is modelled by Markov random fields (MRF) is introduced. To extract the feature, a new local MRF model with a fitting block neighbourhood is proposed. This model selects contextual information not only from the relative intensity levels but also from the geometrically directional position of neighbouring cliques. Feature extraction depends on each block's contribution to the local variance. They discriminates it into several regions, for example context and background. Boundaries between these regions are also distinctive. The proposed algerian performs segmentation using directional block fitting procedure which confines merging to spatially adjacent elements and generates a partition such that pixels in unified cluster have a homogeneous intensity level. From experiment with ink rubbed copy images(Takbon, 拓本), this method is determined to be quite effective for feature identification. In particular, the new algorithm preserves the details of the images well without over- and under-smoothing problem occurring in general iterated conditional modes (ICM). And also, it may be noted that this method is applicable to the handwriting recognition.