• Title/Summary/Keyword: Difference of Gaussian

Search Result 248, Processing Time 0.035 seconds

Evaluation of Robust Classifier Algorithm for Tissue Classification under Various Noise Levels

  • Youn, Su Hyun;Shin, Ki Young;Choi, Ahnryul;Mun, Joung Hwan
    • ETRI Journal
    • /
    • v.39 no.1
    • /
    • pp.87-96
    • /
    • 2017
  • Ultrasonic surgical devices are routinely used for surgical procedures. The incision and coagulation of tissue generate a temperature of $40^{\circ}C-150^{\circ}C$ and depend on the controllable output power level of the surgical device. Recently, research on the classification of grasped tissues to automatically control the power level was published. However, this research did not consider the specific characteristics of the surgical device, tissue denaturalization, and so on. Therefore, this research proposes a robust algorithm that simulates noise to resemble real situations and classifies tissue using conventional classifier algorithms. In this research, the bioimpedance spectrum for six tissues (liver, large intestine, kidney, lung, muscle, and fat) is measured, and five classifier algorithms are used. A signal-to-noise ratio of additive white Gaussian noise diversifies the testing sets, and as a result, each classifier's performance exhibits a difference. The k-nearest neighbors algorithm shows the highest classification rate of 92.09% (p < 0.01) and a standard deviation of 1.92%, which confirms high reproducibility.

Post Processing to Reduce Wrong Matches in Stereo Matching

  • Park, Hee-Ju;Lee, Suk-Bae
    • Korean Journal of Geomatics
    • /
    • v.1 no.1
    • /
    • pp.43-49
    • /
    • 2001
  • Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

  • PDF

Integer Ambiguity Search Technique Using SeparatedGaussian Variables

  • Kim, Do-Yoon;Jang, Jae-Gyu;Kee, Chang-Don
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.5 no.2
    • /
    • pp.1-8
    • /
    • 2004
  • Real-Time Kinematic GPS positioning is widely used for many applications.Resolving ambiguities is the key to precise positioning. Integer ambiguity resolution isthe process of resolving the unknown cycle ambiguities of double difference carrierphase data as integers. Two important issues of resolving are efficiency andreliability. In the conventional search techniques, we generally used chi-squarerandom variables for decision variables. Mathematically, a chi-square random variableis the sum of mutually independent, squared zero-mean unit-variance normal(Gaussian) random variables. With this base knowledge, we can separate decisionvariables to several normal random variables. We showed it with related equationsand conceptual diagrams. With this separation, we can improve the computationalefficiency of the process without losing the needed performance. If we averageseparated normal random variables sequentially, averaged values are also normalrandom variables. So we can use them as decision variables, which prevent from asudden increase of some decision variable. With the method using averaged decisionvalues, we can get the solution more quicklv and more reliably.To verify the performance of our proposed algorithm, we conducted simulations.We used some visual diagrams that are useful for intuitional approach. We analyzedthe performance of the proposed algorithm and compared it to the conventionalmethods.

The Demodulation for Bipolar Delta Driven GMSK (바이폴라 델타 구동 GMSK에 대한 복조)

  • Bang, Seung-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.10
    • /
    • pp.824-831
    • /
    • 2013
  • The delta driven GMSK is a modulation scheme to generate the gaussian pulse by the bipolar delta signal and to modulate the phase function with the differential gaussian pulse between $+T_b/2$ and $-T_b/2$. The demodulation of delta driven GMSK differs from conventional GMSK schemes. This paper proposed a demodulation with the differential phase detector at the end of each bit interval. A designed detector then finds the one of the possible region by hard decision, in which the phase difference lies. Finally the binary data can be recovered by state transition process. Through the BER simulation for AWGN channel, it was found that the proposed demodulation effected by the run length of binary data. The simulated BER degradation of about 2[dB] was analyzed, as compared to the theoretical coherent demodulation with $BT_b$=0.3.

Population Dose Assessment for Radiation Emergency in Complex Terrain (복잡 지형에서의 주민선량 계산)

  • Yoon, Yea-Chang;Ha, Chung-Woo
    • Journal of Radiation Protection and Research
    • /
    • v.12 no.2
    • /
    • pp.28-36
    • /
    • 1987
  • Gaussian plume model is used to assess environmental dose for abnormal radioactive release in nuclear facility, but there has a problem to use it for complex terrain. In this report, MATTEW and WIND04 Codes which had been verified were used to calculate wind field in the complex terrain. Under the base of these codes principle, wind fields were obtained from the calculation of the finite difference approximation for advection-diffusion equations which satisfy the mass-conservative law. Particle concentrations and external doses were calculated by using PIC model which approximate the particle to radioactive cloud, and atmospheric diffusion of the particles from the random walk method. The results show that the adjusted wind fields and the distributions of the exposure dose vary with the topography of the complex terrain.

  • PDF

Cast-Shadow Elimination of Vehicle Objects Using Backpropagation Neural Network (신경망을 이용한 차량 객체의 그림자 제거)

  • Jeong, Sung-Hwan;Lee, Jun-Whoan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.1
    • /
    • pp.32-41
    • /
    • 2008
  • The moving object tracking in vision based observation using video uses difference method between GMM(Gaussian Mixture Model) based background and present image. In the case of racking object using binary image made by threshold, the object is merged not by object information but by Cast-Shadow. This paper proposed the method that eliminates Cast-Shadow using backpropagation Neural Network. The neural network is trained by abstracting feature value form training image of object range in 10-movies and Cast-Shadow range. The method eliminating Cast-Shadow is based on the method distinguishing shadow from binary image, its Performance is better(16.2%, 38.2%, 28.1%, 22.3%, 44.4%) than existing Cast-Shadow elimination algorithm(SNP, SP, DNM1, DNM2, CNCC).

  • PDF

Trellis-coded MDPSK with Sliding Multiple Symbol Detection (슬라이딩(Sliding) 다중 심벌 간파를 이용한 드렐리스 부호화된 MDPSK)

  • 박이홍;전찬우;박성경;김종일;강창언
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.6
    • /
    • pp.1-8
    • /
    • 1994
  • In this paper, in order to apply the idea MDPSK to TCM, we use signal set expansion and set partition by phase differences. Through this we propose the trellis-coded MDPSK. And the Viterbi decoder containing branch metrics of the squared Euclidean distance of the Lth order phase difference as well as the first order phase difference is introduced in order to improve the bit error rate(BER) in the differential detection of the trellis-coded MDPSK. The proposed Viterbi decoder is conceptually same to the sliding multiple symbol dection method which uses the branch metric with the first and Lth order phase differences. We investigate the performance of the uncoded DQPSK and the trallis-coded D8PSK in additive white Gaussian noise (AWGN) through the Monte Carlo simulation under the two cases of using and not using the Lth order phase difference metric. The study shows that trellis-coded 8DPSK is an attractive scheme for power and bandlimited systems while also improving the BER performance when the Viterbi decoder is employed to the Lth order phase order difference metric. This performance improvement has been obtained without sacrificing the bandwidth or the power efficiency.

  • PDF

Detection of Gradual Transitions in MPEG Compressed Video using Hidden Markov Model (은닉 마르코프 모델을 이용한 MPEG 압축 비디오에서의 점진적 변환의 검출)

  • Choi, Sung-Min;Kim, Dai-Jin;Bang, Sung-Yang
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.3
    • /
    • pp.379-386
    • /
    • 2004
  • Video segmentation is a fundamental task in video indexing and it includes two kinds of shot change detections such as the abrupt transition and the gradual transition. The abrupt shot boundaries are detected by computing the image-based distance between adjacent frames and comparing this distance with a pre-determined threshold value. However, the gradual shot boundaries are difficult to detect with this approach. To overcome this difficulty, we propose the method that detects gradual transition in the MPEG compressed video using the HMM (Hidden Markov Model). We take two different HMMs such as a discrete HMM and a continuous HMM with a Gaussian mixture model. As image features for HMM's observations, we use two distinct features such as the difference of histogram of DC images between two adjacent frames and the difference of each individual macroblock's deviations at the corresponding macroblock's between two adjacent frames, where deviation means an arithmetic difference of each macroblock's DC value from the mean of DC values in the given frame. Furthermore, we obtain the DC sequences of P and B frame by the first order approximation for a fast and effective computation. Experiment results show that we obtain the best detection and classification performance of gradual transitions when a continuous HMM with one Gaussian model is taken and two image features are used together.

Performance of ACL/SCO Packet Data in Bluetooth Wireless Ad/hoc Network (블루투스 무선 Ad-hoc망에서 ACL/SCO 패킷 데이터의 성능)

  • 김도균;노재성;조성언;조성준
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.29-32
    • /
    • 2001
  • This paper has simulated the PER(Packet Error Rate), ratio of received packet and payload BER of Bluetooth system with packet types of ACL(Asynchronous Connection Less) and SCO(Synchronous Connection Oriented) link over wireless Ad-hoc environment. AWGN(Additive White Gaussian Noise) and Rayleigh fading are considered as channel model, and the analysis is based on the baseband model of Bluetooth system. In terms of PER and ratio of received packet, performance of DM1 packet is almost same as those of HV1, HV2 and HV3 packets, the performances of the other packets depend on the packet types. In terms of payload BER performance, there is no difference among HV2 packet of SCO link and DM1, DM3, DM5 packets of ACL link. Moreover, there is no difference among HV3 packet of SCO link and DM1, DM3, DM5 packets of ACL link, too.

  • PDF

Entropy-based Similarity Measures for Memory-based Collaborative Filtering

  • Kwon, Hyeong-Joon;Latchman, Haniph
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.5 no.2
    • /
    • pp.5-10
    • /
    • 2013
  • We proposed a novel similarity measure using weighted difference entropy (WDE) to improve the performance of the CF system. The proposed similarity metric evaluates the entropy with a preference score difference between the common rated items of two users, and normalizes it based on the Gaussian, tanh and sigmoid function. We showed significant improvement of experimental results and environments. These experiments involved changing the number of nearest neighborhoods, and we presented experimental results for two data sets with different characteristics, and results for the quality of recommendation.