Location:
Search - fast pixel
Search list
Description: When I wrote this function my problem was to replace one color by an other on transparent bitmaps. My images were resources bitmaps, which I store in an ImageList for easy transparency.
There is no easy way to directly access a Bitmap s pixel on Win32. If you re interested in, this article may help you to understand the usage of CreateDIBSection.
If you have to load a bitmap from resource and made many color replacements, or if you have to change a color in a HBITMAP this function is for you.
If you have a bitmap in resource and want to replace one or more color on load, it s better to use CreateMappedBitmap. You can found in the sample program a ReplaceColor function which use CreateMappedBitmap.
I ve made the same code using only BitBlt. All BitBlt are really fast but the creation of the mask bitmap is so slow than the whole function is twice slower than the code using CreateDIBSection. ( sources are in the sample )
-When I wrote this function was to my problem replace one color by an other on transparent bit maps. My images were resources bitmaps, which I store in an ImageList for easy transpare ncy. There is no easy way to directly access a Bit 's pixel map on Win32. If you're interested in, this article may help you to understand the risques e of CreateDIBSection. If you have to load a bitm ap from resource and made many color replacemen ts. or if you have to change a color in a HBITMAP this f unction is for you. If you have a bitmap in resour ce and want to replace one or more color on load, it's better to use CreateMappedBitmap. You can f ound in the sample program a ReplaceColor funct ion which use CreateMappedBitmap. I've made the same code using only BitBlt. All are real BitBlt
Platform: |
Size: 6770 |
Author: 孙磊 |
Hits:
Description: When I wrote this function my problem was to replace one color by an other on transparent bitmaps. My images were resources bitmaps, which I store in an ImageList for easy transparency.
There is no easy way to directly access a Bitmap s pixel on Win32. If you re interested in, this article may help you to understand the usage of CreateDIBSection.
If you have to load a bitmap from resource and made many color replacements, or if you have to change a color in a HBITMAP this function is for you.
If you have a bitmap in resource and want to replace one or more color on load, it s better to use CreateMappedBitmap. You can found in the sample program a ReplaceColor function which use CreateMappedBitmap.
I ve made the same code using only BitBlt. All BitBlt are really fast but the creation of the mask bitmap is so slow than the whole function is twice slower than the code using CreateDIBSection. ( sources are in the sample )
-When I wrote this function was to my problem replace one color by an other on transparent bit maps. My images were resources bitmaps, which I store in an ImageList for easy transpare ncy. There is no easy way to directly access a Bit 's pixel map on Win32. If you're interested in, this article may help you to understand the risques e of CreateDIBSection. If you have to load a bitm ap from resource and made many color replacemen ts. or if you have to change a color in a HBITMAP this f unction is for you. If you have a bitmap in resour ce and want to replace one or more color on load, it's better to use CreateMappedBitmap. You can f ound in the sample program a ReplaceColor funct ion which use CreateMappedBitmap. I've made the same code using only BitBlt. All are real BitBlt
Platform: |
Size: 6144 |
Author: 孙磊 |
Hits:
Description: 三步法哪l是一种较好的搜索算法，快速而且高效，它是在对数法的基础上对
其进行了改进，提出在每一步搜索后搜索步长均减半的算法。它基本保持了FS的
性能，但其计算量只有FS的10％左右。TSS在会议电视和可视电话中应用较多，
它通过三步搜索，逐步较小搜索步长。若最大搜索范围为士7，搜索精度取一个像
素，则步长为4、2、1，共需三步即可满足要求，从而得名。
-L three-step method which is a better search algorithm, fast and efficient, it is on the basis of the number of law be improved, made in every step of the search after the search step of the algorithm are reduced by half. It basically maintained the performance of FS, but the calculation is only about 10 of FS. TSS at the meeting on television and video telephony in the application of more three-step search through progressively smaller search step. If the maximum search range of disabilities 7, search for a pixel accuracy, the step size for the 4,2,1, a total of three steps to meet the requirements, thus its name.
Platform: |
Size: 2048 |
Author: 赵光 |
Hits:
Description: 这是一篇讲述运动估计中快速亚像素运动估计算法的文章，其中利用相邻匹配点匹配误差值减少待检测匹配点的方法有效地提高了算法的速度。-This is a fast motion estimation on the sub-pixel motion estimation algorithm of the article, in which the use of adjacent match points to reduce the matching error to be the method of detection of matching points effectively improve the speed of the algorithm.
Platform: |
Size: 414720 |
Author: 张颖 |
Hits:
Description: You probably have heard about fractals before. They are beautiful pictures such as the one shown above. Any fractal can be described using iterative formulas. So you can generate a fractal by evaluating these formulas and finding the color of each pixel. That is a large computational task, and drawing a fractal needs a fast CPU and a carefully optimized program.
Platform: |
Size: 38912 |
Author: srhg |
Hits:
Description: C Implementation of 2D Poisson Solver using Neumann Boundary Conditions: Based on a direct analytical solution using sine transforms Single iteration, no magic numbers, no convergence issues. Extremely fast, couple of seconds for 1M pixel image-C Implementation of 2D Poisson Solver
Platform: |
Size: 1037312 |
Author: jason |
Hits:
Description: 用块匹配法求超分辨率复原中的运动矩阵!提出了一种快速，半像素的三步法！-Block-matching method using super-resolution recovery of movement in the matrix! Presents a fast, three-step half-pixel!
Platform: |
Size: 96256 |
Author: allen |
Hits:
Description: OpenGL编程指南第六版 ,英文电子书pdf格式-he OpenGL? Programming Guide, Sixth Edition, provides definitive and comprehensive information on OpenGL and the OpenGL Utility Library. The previous edition covered OpenGL through Version 2.0. This sixth edition of the best-selling "red book" describes the latest features of OpenGL Version 2.1. You will find clear explanations of OpenGL functionality and many basic computer graphics techniques, such as building and rendering 3D models interactively viewing objects from different perspective points and using shading, lighting, and texturing effects for greater realism. In addition, this book provides in-depth coverage of advanced techniques, including texture mapping, antialiasing, fog and atmospheric effects, NURBS, image processing, and more. The text also explores other key topics such as enhancing performance, OpenGL extensions, and cross-platform techniques.
Using server-side pixel buffer objects for fast pixel rectangle download and retrieval
Discussion of the sRGB texture f
Platform: |
Size: 15385600 |
Author: 陆天华 |
Hits:
Description: Fast Implementation of Pixel Purity Index Algorithm
Platform: |
Size: 468992 |
Author: Fast Implementation |
Hits:
Description: Watermarking embeds information into a digital signal like
audio, image, or video. Reversible image watermarking can restore the
original image without any distortion after the hidden data is extracted.
In this paper, we present a novel reversible watermarking scheme using
an interpolation technique, which can embed a large amount of covert
data into images with imperceptible modification. Different from previous
watermarking schemes, we utilize the interpolation-error, the difference
between interpolation value and corresponding pixel value
Platform: |
Size: 2541568 |
Author: isclor |
Hits:
Description: 立体视觉Gaussian Super-pixel Based Fast Image Segmentation Using Graph Cuts.-Gaussian Super-pixel Based Fast Image Segmentation Using Graph Cuts.
Platform: |
Size: 6949888 |
Author: 周雷 |
Hits:
Description: 在图形中提取图像中的角点，为了提高精度进行亚像素检测并进行图像匹配-Extract images in the graphics in the corners, in order to improve the accuracy of sub-pixel detection and image matching
Platform: |
Size: 241664 |
Author: ljj |
Hits:
Description: 图像梯度方向应用干旋转不变性模板匹配时存在计算量较大的问题，由此提出一种改进的基于梯度方向码的旋转不变模板匹配
方法，通过计算积分直方图降低统计直方图的计算填，采用像素跳跃的匹配方法减少大量无效的匹配运算。实验结果表明，该方法在保证
匹配准确性的前提下，匹配速度提高了3倍至6倍，可以达到实时性要求。-it uses integral histogram to reduce the
computing COSTS of computer histograms，and uses pixel-jump method to reduce a lot of ineffective matching operalions．Experimental result shows
that the method Can speed up from 3 to 6 times in the premise of ensuring matching accuracy，SO it Can meet real-time requirement．
Platform: |
Size: 316416 |
Author: chen |
Hits:
Description: 中值滤波的基本原理是把数字图像或数字序列中一点的值用该点的一个邻域中各点值的中值代替，让周围的像素值接近的真实值，从而消除孤立的噪声点。-The basic principles of the median filter is the value of digital image or sequence of numbers in a neighborhood of the point value of the median instead, so that the surrounding pixel values close to the true value, thereby eliminating isolated noise points.
Platform: |
Size: 10240 |
Author: kristena |
Hits:
Description: 匹配过程只要对编码值进行相等比较，而且可以采用快速的比较算法。新算法对像素灰度的变化与噪声具有鲁棒性。-The matching process as long as the coded values are equal, and can quickly compare algorithms. The new algorithm is robust to the change and noise of the pixel gray.
Platform: |
Size: 11264 |
Author: kristena |
Hits:
Description: 刘丽华提出基于多方向形态算子的快速边缘跟踪算法，主要解决了利用边缘方向信息进行边缘像素编码、边缘像素跟踪最小方向计算和非连续点判断方法等算法关键问题。-Liu Lihua proposed morphological operators based on the multi-directional fast edge tracking algorithm to solve the key problems using edge direction information edge pixel encoding, the edge pixels to track the minimum direction of computing and non-continuous point judgment algorithm.
Platform: |
Size: 1635328 |
Author: 朱磊 |
Hits:
Description: Fast Fractal Image Compression Based on Domain-Range Pixel Value Difference
Platform: |
Size: 928768 |
Author: raju |
Hits:
Description: 基于像素的背景建模方法速度较快但不能很好地描述背景运动，光流能准确描述物体运动但计算量大，难以满足实时的要求．提出一种结合基于像素的背景建模方法速度快以及光流描述物体运动准确优点的背景建模和目标检测方法．具体来说，为静止背景建立传统基于像素的灰度背景模型，为运动背景建立光流背景模型，通过２种背景模型的有效结合快速准确地实现目标检测．实验结果表明，提出的方法建模速度与基于像素背景建模方法相当，同时，又有光流准确描述背景运动的优点，综合性能超越上述２种方法．-Faster but not a good description of the background motion background modeling method based on the speed of the pixel, the optical flow can accurately describe the movement of objects but computationally intensive, difficult to meet real-time requirements. Proposed background modeling method based on a combination of speed and a fast pixel optical flow motion of an object accurately describe the advantages of background modeling and object detection methods. Specifically, the establishment of the traditional pixel-based gray background model to establish the background model optical flow motion background, quickly and accurately achieved through the effective combination of two kinds of background model of target detection is still background. Experimental results show that the proposed method of modeling the speed of the pixel-based background modeling method is quite the same time, another advantage of accurately describe the background of the optical flow motion, the overall perform
Platform: |
Size: 887808 |
Author: |
Hits:
Description: 背景建模是实现运动目标检测与跟踪的关键技术之一。在实时视频监控系统中，对背景建模算法的运行时间及所提取出的背景图像的实时性有很高的要求，针对这一问题，提出了一种基于切比雪夫不等式的自适应阈值背景建模算法。算法利用切比雪夫不等式计算像素点色度变化的概率估计值，提出了一种自适应阈值分类方法，它将像素点快速分类为前景点、背景点及可疑点，再利用核密度估计方法对可疑点进行进一步分类，最后利用背景更新算法提取实时背景图像。实验结果证明，该算法能快速有效地区分特征明显的背景点与前景点，提高了背景图像提取的速度，对可疑点利用核密度估计方法降低了背景分割的误差，背景建模效果理想，运算速度快，适用于实时视频监控系统。-Background modeling is a key technology to realize the moving target detection and tracking. In real-time video surveillance system, there are high demands on uptime and background modeling algorithm is proposed to remove the background image in real time, for this problem, a Chebyshev inequality based on adaptive threshold background modeling algorithm. Cut algorithm uses to calculate the probability of Chebyshev inequality pixel color change estimates, an adaptive threshold classification method, it will be classified as pre-fast pixel of interest, background points and suspicious points, re-use kernel density estimation method suspicious point for further classification. Finally, background updating algorithm to extract real-time background image. Experimental results show that the algorithm can quickly and efficiently in the background of significant features of the region of interest with the previous point, improving the speed of extraction of the background image, the point of s
Platform: |
Size: 1972224 |
Author: |
Hits:
Description: 本文提出一种基于图像边缘几何特征的快速模板匹配算法。算法利用边缘
点的位置和梯度方向作为匹配信息进行相似度计算。可以很好的避免因图像明
暗变化、光照不均匀、旋转所带来的影响，且对于部分遮挡的情况，亦可以得
到良好的匹配结果。为了得到边缘点坐标和梯度方向，本文根据曲面拟合原理，
通过平移变换，推导出精确梯度方向和亚像素边缘坐标的快速算法。既加快了
算法的处理速度，也是匹配算法高精度的前提保证。为了使匹配算法满足实时
性要求，主要采用阈值判断和图像金字塔算法的搜索策略。在阈值判断方面，
通过选择一些特殊的边缘点作为试探点，加快了匹配度计算的效率，而且，很
好的避免了在部分遮挡情况下简单阈值判断方法的误判。最后，算法利用最小
二乘平差理论，通过一次近似处理，详细推导出快速获得亚像素级的定位和精
确的旋转精度方法-A fast template matching algorithm based on geometric features of image edges is presented in this paper. Algorithm using edge
The similarity calculation of the position and the gradient direction is used as the matching information. Can be very good to avoid because of the image
The effects of dark changes, illumination and rotation are not uniform.
To a good matching result. In order to obtain the coordinates of the edge points and the gradient direction, this paper is based on the surface fitting principle,
A fast algorithm for accurate gradient orientation and sub pixel edge coordinates is derived by using the translation transformation. Not only speed up
The processing speed of the algorithm is also the premise guarantee of the high precision of the matching algorithm. In order to satisfy the matching algorithm in real time
The search strategy of the threshold judgment and the image Pyramid algorithm is mainly used in the performance requirements. In the threshold judgment,
Platform: |
Size: 2213888 |
Author: liu |
Hits: