• Title/Summary/Keyword: distance transform algorithm

Search Result 147, Processing Time 0.027 seconds

Forensic Classification of Median Filtering by Hough Transform of Digital Image (디지털 영상의 허프 변환에 의한 미디언 필터링 포렌식 분류)

  • RHEE, Kang Hyeon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.5
    • /
    • pp.42-47
    • /
    • 2017
  • In the distribution of digital image, the median filtering is used for a forgery. This paper proposed the algorithm of a image forensics detection for the classification of median filtering. For the solution of this grave problem, the feature vector is composed of 42-Dim. The detected quantity 32, 64 and 128 of forgery image edges, respectively, which are processed by the Hough transform, then it extracted from the start-end point coordinates of the Hough Lines. Also, the Hough Peaks of the Angle-Distance plane are extracted. Subsequently, both of the feature vectors are composed of the proposed scheme. The defined 42-Dim. feature vector is trained in SVM (Support Vector Machine) classifier for the MF classification of the forged images. The experimental results of the proposed MF detection algorithm is compared between the 10-Dim. MFR and the 686-Dim. SPAM. It confirmed that the MF forensic classification ratio of the evaluated performance is 99% above with the whole test image types: the unaltered, the average filtering ($3{\times}3$), the JPEG (QF=90 and 70)) compression, the Gaussian filtered ($3{\times}3$ and $5{\times}5$) images, respectively.

A Distance Relaying Algorithm Using an Improved Technique for Removing DC-offset (DC-Offset 제거 기능을 향상시킨 거리계전 알고리즘)

  • No, Jae-Keun;Kang, Sang-Hee;Nam, Soon-Ryul;Park, Jong-Keun
    • Proceedings of the KIEE Conference
    • /
    • 2001.11b
    • /
    • pp.118-120
    • /
    • 2001
  • This paper presents a distance relaying algorithm based on the Discrete Fourier Transform(DFT) for elimination of DC-Offset. When the DFT is applied to current signal. the real and imaginary parts of fundamental component consist of fundamental component itself and DC-Offset. The DC-Offset is calculated by four consecutive values of the imaginary components, so that the fundamental component can be accurately estimated. Performance evaluation is presented for A-phase ground faults on 154kV 80km overhead transmission line. The proposed algorithm is inspected by software simulation and hardware simulation.

  • PDF

A Novel Method for Virtual Machine Placement Based on Euclidean Distance

  • Liu, Shukun;Jia, Weijia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2914-2935
    • /
    • 2016
  • With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

A Colony Counting Algorithm based on Distance Transformation (거리 변환에 기반한 콜로니 계수 알고리즘)

  • Mun, Hyeok;Lee, Bok Ju;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.15 no.3
    • /
    • pp.24-29
    • /
    • 2016
  • One of the main applications of digital image processing is the estimation of the number of certain types of objects (cells, seeds, peoples etc.) in an image. Difficulties of these counting problems depends on various factors including shape and size variation, degree of object clustering, contrast between object and background, object texture and its variation, and so on. In this paper, a new automatic colony counting algorithm is proposed. We focused on the two applications: counting the bacteria colonies on the agar plate and estimating the number of seeds from images captured by smartphone camera. To overcome the shape and size variations of the colonies, we adopted the distance transformation and peak detection approach. To estimate the reference size of the colony robustly, we also used k-means clustering algorithm. Experimental results show that our method works well in real world applications.

A Study on the Obstacle Avoidance and Path Planning Algorithm of Multiple Mobile Robot (다중이동로봇의 장애물 회피 및 경로계획 알고리즘에 관한 연구)

  • 박경진;이기성;이종수
    • Proceedings of the IEEK Conference
    • /
    • 2000.06e
    • /
    • pp.31-34
    • /
    • 2000
  • In this paper, we design an optimal path for multiple mobile robots. For this purpose, we propose a new method of path planning for multiple mobile robots in dynamic environment. First, every mobile robot searches a global path using a distance transform algorithm. Then we put subgoals at crooked path points and optimize them. And finally to obtain an optimal on-line local path, ever)r mobile robot searches a new path with static and dynamic obstacle avoidance.

  • PDF

High-speed Hardware Design for the Twofish Encryption Algorithm

  • Youn Choong-Mo;Lee Beom-Geun
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.4
    • /
    • pp.201-204
    • /
    • 2005
  • Twofish is a 128-bit block cipher that accepts a variable-length key up to 256 bits. The cipher is a 16­round Feistel network with a bijective F function made up of four key-dependent 8-by-8-bit S-boxes, a fixed 4­by-4 maximum distance separable matrix over Galois Field$(GF (2^8)$, a pseudo-Hadamard transform, bitwise rotations, and a carefully designed key schedule. In this paper, the Twofish is modeled in VHDL and simulated. Hardware implementation gives much better performance than software-based approaches.

Structural Quality Defect Discrimination Enhancement using Vertical Energy-based Wavelet Feature Generation (구조물의 품질 결함 변별력 증대를 위한 수직 에너지 기반의 웨이블릿 Feature 생성)

  • Kim, Joon-Seok;Jung, Uk
    • Journal of Korean Society for Quality Management
    • /
    • v.36 no.2
    • /
    • pp.36-44
    • /
    • 2008
  • In this paper a novel feature extraction and selection is carried out in order to improve the discriminating capability between healthy and damaged structure using vibration signals. Although many feature extraction and selection algorithms have been proposed for vibration signals, most proposed approaches don't consider the discriminating ability of features since they are usually in unsupervised manner. We proposed a novel feature extraction and selection algorithm selecting few wavelet coefficients with higher class discriminating capability for damage detection and class visualization. We applied three class separability measures to evaluate the features, i.e. T test statistics, divergence, and Bhattacharyya distance. Experiments with vibration signals from truss structure demonstrate that class separabilities are significantly enhanced using our proposed algorithm compared to other two algorithms with original time-based features and Fourier-based ones.

An Accurate Edge-Based Matching Using Subpixel Edges (서브픽셀 에지를 이용한 정밀한 에지기반 정합)

  • Cho, Tai-Hoon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.5
    • /
    • pp.493-498
    • /
    • 2007
  • In this paper, a 2-dimensional accurate edge-based matching algorithm using subpixel edges is proposed that combines the Generalized Hough Transform(GHT) and the Chamfer matching to complement the weakness of either method. First, the GHT is used to find the approximate object positions and orientations, and then these positions and orientations are used as starting parameter values to find more accurate position and orientation using the Chamfer matching with distance interpolation. Finally, matching accuracy is further refined by using a subpixel algorithm. Testing results demonstrate that greater matching accuracy is achieved using subpixel edges rather than edge pixels.

A Study on Pitch Period Detection Algorithm Based on Rotation Transform of AMDF and Threshold

  • Seo, Hyun-Soo;Kim, Nam-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.4
    • /
    • pp.178-183
    • /
    • 2006
  • As a lot of researches on the speech signal processing are performed due to the recent rapid development of the information-communication technology. the pitch period is used as an important element to various speech signal application fields such as the speech recognition. speaker identification. speech analysis. or speech synthesis. A variety of algorithms for the time and the frequency domains related with such pitch period detection have been suggested. One of the pitch detection algorithms for the time domain. AMDF (average magnitude difference function) uses distance between two valley points as the calculated pitch period. However, it has a problem that the algorithm becomes complex in selecting the valley points for the pitch period detection. Therefore, in this paper we proposed the modified AMDF(M-AMDF) algorithm which recognizes the entire minimum valley points as the pitch period of the speech signal by using the rotation transform of AMDF. In addition, a threshold is set to the beginning portion of speech so that it can be used as the selection criteria for the pitch period. Moreover the proposed algorithm is compared with the conventional ones by means of the simulation, and presents better properties than others.

  • PDF

A Robust Algorithm for Tracking Non-rigid Objects Using Deformed Template and Level-Set Theory (템플릿 변형과 Level-Set이론을 이용한 비강성 객체 추적 알고리즘)

  • 김종렬;나현태;문영식
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.3
    • /
    • pp.127-136
    • /
    • 2003
  • In this paper, we propose a robust object tracking algorithm based on model and edge, using deformed template and Level-Set theory. The proposed algorithm can track objects in case of background variation, object flexibility and occlusions. First we design a new potential difference energy function(PDEF) composed of two terms including inter-region distance and edge values. This function is utilized to estimate and refine the object shape. The first step is to approximately estimate the shape and location of template object based on the assumption that the object changes its shape according to the affine transform. The second step is a refinement of the object shape to fit into the real object accurately, by using the potential energy map and the modified Level-Set speed function. The experimental results show that the proposed algorithm can track non-rigid objects under various environments, such as largely flexible objects, objects with large variation in the backgrounds, and occluded objects.