SDT压缩数据线性插值解压实现

最新推荐文章于 2023-09-18 11:31:59 发布

David丁

最新推荐文章于 2023-09-18 11:31:59 发布

阅读量998

点赞数 1

分类专栏：数据压缩算法文章标签：压缩数据解压线性插值旋转门 SDT

本文链接：https://blog.csdn.net/u014452539/article/details/73466150

版权

数据压缩算法专栏收录该内容

2 篇文章 1 订阅

订阅专栏

public struct point
    {
        public point(double pointx, double pointy)
        {
            this.x = pointx;
            this.y = pointy;
        }
        private double x;
        private double y;
        public double X
        {
            get
            {
                return x;
            }

            set
            {
                x = value;
            }
        }
        public double Y
        {
            get
            {
                return y;
            }

            set
            {
                y = value;
            }
        }
    }

/// <summary>
        /// 线性插值解压 
        /// </summary>
        /// <param name="originData">原始数据</param>
        /// <param name="SDTData">压缩数据</param>
        /// <param name="progress">进度</param>
        /// <param name="cancel">取消</param>
        /// <returns></returns>
        public List<point> SDTUncompress(List<point> originData,List<point> SDTData,IProgress<int> progress, CancellationToken cancel)
        {
            List<point> UncompreeDate=new List<point>();
            point newPoint=new point();
            int num = 0;
            if (SDTData.Count <= 1)
                return null;
            for (int i = 0; i <SDTData.Count-1; i++)
            {
                double k = (SDTData[i + 1].Y - (SDTData[i].Y))/(SDTData[i + 1].X - (SDTData[i].X));
                int startIndex = FindIndex(originData, SDTData[i].X);
                int endIndex = FindIndex(originData, SDTData[i + 1].X);
                for (int j = startIndex; j < endIndex; j++)
                {
                    newPoint.X = originData[j].X;
                    newPoint.Y=k*(originData[j].X - SDTData[i].X)
                    +SDTData[i].Y;
                    UncompreeDate.Add(newPoint);
                    num++;
                    cancel.ThrowIfCancellationRequested();
                    progress?.Report((num * 100 / originData.Count));
                }
            }
            if(UncompreeDate.Count<originData.Count)
            {
                int startIndex1 = FindIndex(originData, SDTData.LastOrDefault().X);
                for (int j = startIndex1; j < originData.Count; j++)
                {
                    newPoint.X = originData[j].X;
                    double k = (SDTData[SDTData.Count - 1].Y - (SDTData[SDTData.Count - 2].Y)) / (SDTData[SDTData.Count - 1].X - (SDTData[SDTData.Count - 2].X));
                    newPoint.Y = k * (originData[j].X - SDTData[SDTData.Count - 1].X)
                        + SDTData[SDTData.Count - 1].Y;
                    UncompreeDate.Add(newPoint);
                    num++;
                    cancel.ThrowIfCancellationRequested();
                    progress?.Report(num * 100 / originData.Count );
                }
            }
           
            return UncompreeDate;
        }
        private int FindIndex(List<point> list,double value)
        {
            int index = list.FindIndex(s => s.X==value);
            return index;
        }