2010年MCM犯罪学问题评审commentary

本文详细探讨了数学模型在调查连环杀手案件中的应用,包括问题背景、模型构建、文档规范、图表使用、假设设定、总结与结论等关键环节。文章强调了创造力、敏感性分析、模型的现实世界应用、清晰的写作和解释,以及对犯罪地点预测的重要性。同时,提出了改进方向和未来研究建议。

Judges’Commentary:

TheOutstanding Geographic

ProfilingPapers

 

 

Marie Vanisko

Dept. ofMathematics, Engineering, and Computer Science

Carroll College

Helena, MT 59625

mvanisko@carroll.edu

 

 

Introduction

 

The stated problemthis year dealt with the issue of geographical profiling

in theinvestigation of serial criminals. International interest in this topic has

led to numerouspublications, many of which present mathematical models for

analyzing theproblems involved. Although it was entirely appropriate and

expected that teamsworking on this problem would review the literature on

the subject andlearn from their review, teams that simply presented published

schemes as theirmathematical models fell far short of what was expected. The

judges looked forsparks of creativity and carefully explained mathematical

model building withsensitivity analysis that went beyond what is found in the

literature. Thisfactor is what added value to a paper.

 

 

Documentationand Graphs

 

We observed anoticeable improvement in how references were identified

and in the specificprecision in documenting them within the papers. Consid-

ering the numerousonline resources available, proper documentation was an

especiallyimportant factor in this year’s problem.

Despite theimprovement, many papers contained charts and graphs from

Web sources with nodocumentation. All graphs and tables need labels and/or

legends, and theyshould provide information about what is referred to in the

paper. The bestpapers used graphs to help clarify their results and documented

trustworthyresources whenever used.

 

The UMAPJournal 31 (2) (2010)149–151. c Copyright 2010 by COMAP, Inc. All rights reserved.

Permission to makedigital or hard copies of part or all of this work for personal or classroomuse

is granted withoutfee provided that copies are not made or distributed for profit or commercial

advantage and thatcopies bear this notice. Abstracting with credit is permitted, but copyrights

for components ofthis work owned by others than COMAP must be honored. To copy otherwise,

to republish, topost on servers, or to redistribute to lists requires prior permission fromCOMAP.


 

 



 

 

The UMAP Journal 31.2 (2010)


 

 

Assumptions

 

In many cases,teams made tacit assumptions about the criminals being

considered but didnot state or justify critical mathematical assumptions that

were later usedimplicitly. Assumptions concerning probability distributions,

anchor points,distances, units, mathematical procedures, and how to measure

results weregenerally not discussed or justified.

Since this is amodeling contest, a lot of weight is put on whether or not the

model could beused, with modification, in the real world. Also, clear writing

and exposition isessential to motivate and explain assumptions and to derive

and test modelsbased on those assumptions.

 

 

Summary

 

The summary is ofcritical importance, especially in early judging. It should

motivate the readerand be polished with a good synopsis of key results. For

this problem, teamswere asked to add to their one-page summary (which can

have some technicaldetails) also a two-page executive summary appropriate

for the Chief ofPolice. Many teams seemed to assume that the Chief of Police

would haveimpressive mathematical credentials.

 

 

The Problemand Its Analysis

 

Teams were asked todevelop at least two different schemes for generating

geographicalprofiles and then to develop a technique for combining the results

of the differentschemes in such a way as to generate a useful prediction for law

enforcementofficers. Although the papers designated as Meritorious generally

developed interesting schemes, very few papers did an adequate job of testing

their results and doing sensitivity analysis.  

Most papers dealt with issues associated with the serial criminal’s home

base, usually referred to as the anchor point, and the buffer zone around that

point within whichthe criminal is unlikely to commit crimes. Locations were

identified using latitude and longitude and sometimes a time factor. Weights

were frequently assigned to data points, sometimes taking more recent crimes

into account moreheavily and sometimes incorporating qualitative factors into

the scheme. Teams used various metrics in describing “distances” between the

anchor point andcrime locations. Papers that rose to the top used well-defined

metrics that were clearly explained. One cannot measure the reliability or

validity of a model without clearly defined metrics.

Many teams mentioned that there was not a lot of data with which they could

validate their model, although they did find some specific location information

that included from13 to 20 crimes in a given series. Some teams used as their

only example theSutcliffe case cited in the problem. In almost all cases, teams

used their model to predict the location of the final crime based on all of the

previous locationsfor that criminal. They could easily have had many more

data points withwhich to validate their models. For example, if 13 crime

locations wereavailable, they could have used the first nlocations to predict

the location ofcrime n + 1, for each n = 7, . . . , 12. The judges agreed that this

problem did not lend itself to validation by simulation, as many other problems

do.

In describing thereliability of predicted results for proposed models, it

was sometimesdifficult to determine precisely how teams had arrived at their

results. Since theliterature is full of models and even computer models, it

would have beenworthy if teams had solved a problem via one of these meth-

ods and used thatas a baseline to compare the results of original models that

they proposed. Nota single team did this to the judge’s satisfaction. Judges

do not generallylook for computer code, but they definitely look for precise

algorithms thatproduce results based on a given model.

 

 

ConcludingRemarks

 

Mathematicalmodeling is an art. It is an art that requires considerable skill

and practice inorder to develop proficiency. The big problems that we face

now and in thefuture will be solved in large part by those with the talent,

the insight, andthe will to model these real-world problems and continuously

refine those models.Surely the issue of solving crimes involving serial killers

is an importantchallenge that we face.

The judges are veryproud of all participants in this Mathematical Contest

in Modeling and wecommend you for your hard work and dedication.

 

 

About theAuthor

 

Marie Vanisko is aMathematics Professor Emerita from Carroll College

in Helena, Montana,where she taught for more than 30 years. She was also a

Visiting Professorat the U.S. Military Academy at West Point and taught for five

years at CaliforniaState University Stanislaus. In both California and Montana,

she directed MAATensor Foundation grants on mathematical modeling for

high school girls.She also directs a mathematical modeling project for Montana

high school andcollege mathematics and science teachers through the Montana

Learning Center atCanyon Ferry, where she chairs the Board of Directors. She

has served as a judge for both the MCM and HiMCM.
### 光流法C++源代码解析与应用 #### 光流法原理 光流法是一种在计算机视觉领域中用于追踪视频序列中运动物体的方法。它基于亮度不变性假设,即场景中的点在时间上保持相同的灰度值,从而通过分析连续帧之间的像素变化来估计运动方向和速度。在数学上,光流场可以表示为像素位置和时间的一阶导数,即Ex、Ey(空间梯度)和Et(时间梯度),它们共同构成光流方程的基础。 #### C++实现细节 在给定的C++源代码片段中,`calculate`函数负责计算光流场。该函数接收一个图像缓冲区`buf`作为输入,并初始化了几个关键变量:`Ex`、`Ey`和`Et`分别代表沿x轴、y轴和时间轴的像素强度变化;`gray1`和`gray2`用于存储当前帧和前一帧的平均灰度值;`u`则表示计算出的光流矢量大小。 #### 图像处理流程 1. **初始化和预处理**:`memset`函数被用来清零`opticalflow`数组,它将保存计算出的光流数据。同时,`output`数组被填充为白色,这通常用于可视化结果。 2. **灰度计算**:对每一像素点进行处理,计算其灰度值。这里采用的是RGB通道平均值的计算方法,将每个像素的R、G、B值相加后除以3,得到一个近似灰度值。此步骤确保了计算过程的鲁棒性和效率。 3. **光流向量计算**:通过比较当前帧和前一帧的灰度值,计算出每个像素点的Ex、Ey和Et值。这里值得注意的是,光流向量的大小`u`是通过`Et`除以`sqrt(Ex^2 + Ey^2)`得到的,再乘以10进行量化处理,以减少计算复杂度。 4. **结果存储与阈值处理**:计算出的光流值被存储在`opticalflow`数组中。如果`u`的绝对值超过10,则认为该点存在显著运动,因此在`output`数组中将对应位置标记为黑色,形成运动区域的可视化效果。 5. **状态更新**:通过`memcpy`函数将当前帧复制到`prevframe`中,为下一次迭代做准备。 #### 扩展应用:Lukas-Kanade算法 除了上述基础的光流计算外,代码还提到了Lukas-Kanade算法的应用。这是一种更高级的光流计算方法,能够提供更精确的运动估计。在`ImgOpticalFlow`函数中,通过调用`cvCalcOpticalFlowLK`函数实现了这一算法,该函数接受前一帧和当前帧的灰度图,以及窗口大小等参数,返回像素级别的光流场信息。 在实际应用中,光流法常用于目标跟踪、运动检测、视频压缩等领域。通过深入理解和优化光流算法,可以进一步提升视频分析的准确性和实时性能。 光流法及其C++实现是计算机视觉领域的一个重要组成部分,通过对连续帧间像素变化的精细分析,能够有效捕捉和理解动态场景中的运动信息
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值