scholarly journals Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

2010 ◽  
Vol 310 (22) ◽  
pp. 3267-3275 ◽  
Author(s):  
Efraim Laksman ◽  
Håkan Lennerstad ◽  
Magnus Nilsson
2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shumpei Haginoya ◽  
Aiko Hanayama ◽  
Tamae Koike

Purpose The purpose of this paper was to compare the accuracy of linking crimes using geographical proximity between three distance measures: Euclidean (distance measured by the length of a straight line between two locations), Manhattan (distance obtained by summing north-south distance and east-west distance) and the shortest route distances. Design/methodology/approach A total of 194 cases committed by 97 serial residential burglars in Aomori Prefecture in Japan between 2004 and 2015 were used in the present study. The Mann–Whitney U test was used to compare linked (two offenses committed by the same offender) and unlinked (two offenses committed by different offenders) pairs for each distance measure. Discrimination accuracy between linked and unlinked crime pairs was evaluated using area under the receiver operating characteristic curve (AUC). Findings The Mann–Whitney U test showed that the distances of the linked pairs were significantly shorter than those of the unlinked pairs for all distance measures. Comparison of the AUCs showed that the shortest route distance achieved significantly higher accuracy compared with the Euclidean distance, whereas there was no significant difference between the Euclidean and the Manhattan distance or between the Manhattan and the shortest route distance. These findings give partial support to the idea that distance measures taking the impact of environmental factors into consideration might be able to identify a crime series more accurately than Euclidean distances. Research limitations/implications Although the results suggested a difference between the Euclidean and the shortest route distance, it was small, and all distance measures resulted in outstanding AUC values, probably because of the ceiling effects. Further investigation that makes the same comparison in a narrower area is needed to avoid this potential inflation of discrimination accuracy. Practical implications The shortest route distance might contribute to improving the accuracy of crime linkage based on geographical proximity. However, further investigation is needed to recommend using the shortest route distance in practice. Given that the targeted area in the present study was relatively large, the findings may contribute especially to improve the accuracy of proactive comparative case analysis for estimating the whole picture of the distribution of serial crimes in the region by selecting more effective distance measure. Social implications Implications to improve the accuracy in linking crimes may contribute to assisting crime investigations and the earlier arrest of offenders. Originality/value The results of the present study provide an initial indication of the efficacy of using distance measures taking environmental factors into account.


Author(s):  
Poonam Fauzdar ◽  
Sarvesh Kumar

In this paper we applianced an approach for segmenting brain tumour regions in a computed tomography images by proposing a multi-level fuzzy technique with quantization and minimum computed Euclidean distance applied to morphologically divided skull part. Since the edges identified with closed contours and further improved by adding minimum Euclidean distance, that is why the numerous results that are analyzed are very assuring and algorithm poses following advantages like less cost, global analysis of image, reduced time, more specificity and positive predictive value.


2014 ◽  
Vol 989-994 ◽  
pp. 3675-3678
Author(s):  
Xiao Fen Wang ◽  
Hai Na Zhang ◽  
Xiu Rong Qiu ◽  
Jiang Ping Song ◽  
Ke Xin Zhang

Self-adapt distance measure supervised locally linear embedding solves the problem that Euclidean distance measure can not apart from samples in content-based image retrieval. This method uses discriminative distance measure to construct k-NN and effectively keeps its topological structure in high dimension space, meanwhile it broadens interval of samples and strengthens the ability of classifying. Experiment results show the ADM-SLLE date-reducing-dimension method speeds up the image retrieval and acquires high accurate rate in retrieval.


2013 ◽  
Vol 457-458 ◽  
pp. 1064-1068
Author(s):  
Dan Li ◽  
Xin Bao Li

K-means Algorithm is a popular method in cluster analysis, and it is most based on the Euclidean distance. In this paper, a modified version of the K-means algorithm based on the shape similarity distance (SSD-K-means) is presented. The shape similarity distance is one kind of non-metric distance measure for similarity estimation based on the characteristic of differences. To demonstrate the effectiveness of the method we proposed, this new algorithm has been tested on three shape data datasets. Experiment results prove that the performance of the SSD-K-means is better than those of the classical K-means algorithm based on the traditional Euclidean and Manhattan distances.


2014 ◽  
Vol 599-601 ◽  
pp. 1360-1363
Author(s):  
Xiang Yan Liang ◽  
Zhen Hua Tang ◽  
Ya Dan Luo ◽  
Tuan Fa Qin

In order to improve the accuracy of correlated noise (CN) model for distributed video coding (DVC), this paper proposes a novel distribution parameter fitting algorithm based on the minimum Euclidean distance. The presented method can obtain the final fitted distribution parameter by using the minimum Euclidean distance to compare the Laplace probability density function (PDF) with the PDF computed utilizing the actual residual frame data. Experiment results show that the proposed distribution parameter fitting algorithm can improve the rate-distortion (R-D) performance of DVC significantly.


Sign in / Sign up

Export Citation Format

Share Document