Diseño de código de filtro aritmético C #

Escriba un filtro aritmético y trate los errores aleatorios gaussianos cuando piense en hacer que los datos sean más suaves y razonables. No es lo suficientemente alto, pero escríbalo aquí para mejorar la eficiencia de su trabajo. Una gran copia del código del mundo, la difusión de ideas. . . A continuación, se usa C #, que es simple y claro, y no se explica el principio de la fórmula. Me gusta copiar.

 class currentDPointLocClass
    {
        private float currentpointX;
        private float currentpointY;
        private float currentpointZ;
        private int enNumber;
        private float diffx;
        private float diffy;
        private List<locationClassconfig> currentPtList;

        public currentDPointLocClass()
        {
            currentpointX = 0;
            currentpointY = 0;
            currentpointZ = 0;
            enNumber = 8;
            diffx =8.4f;
            diffy = 8.4f;
            currentPtList = new List<locationClassconfig>();

        }




        public void addPtPool(float pdx, float pdy ,float pdz)
        {
            if (Math.Abs(pdx - currentpointX) > diffx || Math.Abs(pdy - currentpointY) > diffy)
            {
                currentPtList.Clear();
                currentpointX = pdx;
                currentpointY = pdy;
                currentpointZ = pdz;

            }
            else {

                if (currentPtList.Count > enNumber)
                {
                    currentPtList.RemoveRange(0,2);

                }
                locationClassconfig mlocpt = new locationClassconfig(pdx, pdy, pdz);
                currentPtList.Add(mlocpt);


                int listsize = currentPtList.Count;


                if (listsize > 3)
                {

                    float tmpsize = listsize;
                    float tmpdf = 1.0f / (tmpsize * 2.0f);

                    float tmpdc = (2.0f * tmpsize - 1) / (tmpsize * tmpsize - tmpsize);

                    float sumx = 0;
                    float sumy = 0;
                    float sumz = 0;

                    for (int i = 0; i < listsize; i++)
                    {
                        sumx += currentPtList[i].get_locX() * (tmpdf + tmpdc * i) / tmpsize;
                        sumy += currentPtList[i].get_locY() * (tmpdf + tmpdc * i) / tmpsize;
                        sumz += currentPtList[i].get_locZ() * (tmpdf + tmpdc * i) / tmpsize;
                    }
                    currentpointX = sumx;
                    currentpointY = sumy;
                    currentpointZ = sumz;

                }
                else
                {
                    float sumx = 0;
                    float sumy = 0;
                    float sumz = 0;

                    for (int i = 0; i < listsize; i++)
                    {
                        sumx += currentPtList[i].get_locX();
                        sumy += currentPtList[i].get_locY();
                        sumz += currentPtList[i].get_locZ();
                    }
                    currentpointX = sumx / listsize;
                    currentpointY = sumy / listsize;
                    currentpointZ = sumz / listsize;

                }




            }

        }

        public float get_currentpointX()
        {
            return currentpointX;
        }

        public float get_currentpointY()
        {
            return currentpointY;
        }
        public float get_currentpointZ()
        {
            return currentpointZ;
        }

        public  void set_sumNumber(int num)
        {


            if (num < 3)
            {
                enNumber = 3;
            }
            else {
                enNumber = num;

            }


        }

        public void set_diffxy(float dfxy)
        {
            diffx = dfxy;
            diffy = dfxy;
        }
        public void set_diffx(float dfx)
        {
            diffx = dfx;
        }
        public void set_diffy(float dfy)
        {
            diffy = dfy;
        }

    }

 

Supongo que te gusta

Origin blog.csdn.net/sun19890716/article/details/100767189
Recomendado
Clasificación