我正在使用MATLAB进行自动图像过滤算法。 迄今为止,我已经下载了像我所铭记的那种来源代码,因此,我目前正在研究该守则如何运作。
问题在于,如果把两个或两个以上图像混为一谈,其肤色的强度很可能彼此不同,这样, st的海水就会被看上去...... 因此,现在,我试图找出如何利用图像梯度来重新描述其肤色强度,以便整个被困的形象将具有同样的色力。
我希望有人能够帮助我走出那里,如果是的话,会非常感谢你......
我正在使用MATLAB进行自动图像过滤算法。 迄今为止,我已经下载了像我所铭记的那种来源代码,因此,我目前正在研究该守则如何运作。
问题在于,如果把两个或两个以上图像混为一谈,其肤色的强度很可能彼此不同,这样, st的海水就会被看上去...... 因此,现在,我试图找出如何利用图像梯度来重新描述其肤色强度,以便整个被困的形象将具有同样的色力。
我希望有人能够帮助我走出那里,如果是的话,会非常感谢你......
If the images overlap by a significant amount, and the stitching algorithm does a very good job of registering the overlap region, a very simple solution would be to blend the pixel values from the two images together in the overlap region, using a weighted average with weights going from 0-1 depending on the distance from the edge of the overlap region.
blendedPixel = (imageApixel * weightA) + (imageBpixel * weightB)
重量 当我们更接近形象时,我们的做法就是一。 重叠区域的一方,重量 B办法1 重叠区域的B部分和加权总额 A和重量 B 始终是1。
以上解决办法并非特别有原则,而是取决于在重叠地区进行非常好的图像登记工作的 st算法。
Another, more principled solution to the problem would be to remove the source of the intensity difference, attempting to homogenize the response of the pixels across the image plane.
这种解决办法的形式将取决于强度差异的来源,而这种差异将取决于光学和现场照明条件。
例如,在处理从同一地点同时拍摄的户外照片时,主要效果可能是“变迁”效应,其原因多种多样,包括光线通过照相光学的不同途径之间的差别。
另一个例子是,在处理通过在斜角标出的样本缩微镜采集的照片时,主要效果可能在于最接近光线的图像部分与远处的图像不同。
重新定位通常表明,它是一种以透视镜的光学轴心预测为核心的辐射测量功能。 为了纠正错误,你应努力适应适当的辐射测量功能。
照明的变化可以采取不同的功能形式,但在许多情况下,适合直线近距离近似。
视现场情况以及现有图像的数量和变异性而定,你可能需要采用校准图像,以适当适应这些功能。
以上做法对强度差异源的功能形式作出假设,但不对情况或统计数字作出假设。
另一种做法可能是对现场作出一些假设,例如,所有重要信息都以高于某些门槛的空间频率表示。 然后,你可以消除所有低形象强度的空间频率组成部分。 这将“重新塑造”形象,消除低频率的定位和照明问题。
这种办法可能适用于微观影像、卫星图像或其他图像,其中多数利益在于细节,而不是组成戏剧。
有许多文件处理这一问题,许多文件在技术先进程度,而不是上述讨论之外。 For example, see D Goldman, “Vignette and Exposure Calibration and Compensation”, IEEE Trans patterns Analysis and organs Intelligence, vol 32, no 12, pp2276-2288
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...