• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Convex decomposition of concave clouds for the ultra-short-term power prediction of distributed photovoltaic system①

    2016-12-05 06:39:01CaiShibo蔡世波TongJianjunBaoGuanjunPanGuobingZhangLibinXuFang
    High Technology Letters 2016年3期

    Cai Shibo (蔡世波):Tong Jianjun:Bao Guanjun:Pan Guobing:Zhang Libin:Xu Fang

    (Key Laboratory of E&M (Zhejiang University of Technology):Ministry of Education & Zhejiang Province:Hangzhou 310032:P.R.China)

    ?

    Convex decomposition of concave clouds for the ultra-short-term power prediction of distributed photovoltaic system①

    Cai Shibo (蔡世波):Tong Jianjun:Bao Guanjun:Pan Guobing:Zhang Libin:Xu Fang*To whom correspondence should be addressed.E-mail:fangx@zjut.edu.cnReceived on Aug.12,2015

    (Key Laboratory of E&M (Zhejiang University of Technology):Ministry of Education & Zhejiang Province:Hangzhou 310032:P.R.China)

    Concave clouds will cause miscalculation by the power prediction model based on cloud features for distributed photovoltaic (PV) plant.The algorithm for decomposing concave cloud into convex images is proposed.Adopting minimum polygonal approximation (MPP) to demonstrate the contour of concave cloud:cloud features are described and the subdivision lines of convex decomposition for the concave clouds are determined by the centroid point scattering model and centroid angle function:which realizes the convex decomposition of concave cloud.The result of MATLAB simulation indicates that the proposed algorithm can accurately detect cloud contour corners and recognize the concave points.The proposed decomposition algorithm has advantages of less time complexity and decomposition part numbers compared to traditional algorithms.So the established model can make the convex decomposition of complex concave clouds completely and quickly:which is available for the existing prediction algorithm for the ultra-short-term power output of distributed PV system based on the cloud features.

    distributed photovoltaic (PV) system,cloud features model,centroid point scattering model,convex decomposition

    0 Introduction

    The power output of a photovoltaic (PV) system mainly depends on the sun radiation received by the PV panels when the photoelectric conversion efficiency for the PV models is stable.The sun radiation received by the PV system will be decreased because of the cloud shielding.The cumulus in the 3km sky can shelter 72% of sun radiation[1].The sun radiation sheltered by the random moving cloud will result in a distributed PV system power output fluctuation[2].The recent research on power prediction for PV system mainly focuses on short-term prediction at a scale of 24 hours[3].The distributed PV systems were usually deployed in the user side:which is smaller than PV plant in size and power generation.They are easy to be affected by the moving cloud clusters because of the fluctuation of the received sun radiation resulting from cloud shielding:which often happens in the second time scale[4].The timescale of short-term prediction is still relatively too large to predict the distributed PV system power output fluctuation:which is so sharp that it may influence or even damage sensitive electrical devices.The prediction of distributed PV power output fluctuation will be realized by real-time monitoring and analysis on dynamic characteristics of clouds:which aims to estimate the shielding effect to the sun radiation[5].The model of cloud prediction based on the quadratic polynomial approximation can realize the prediction of cloud features at a scale of 8 seconds.

    There is a big error when the quadratic polynomial approximation is applied in the forecast model of existing cloud features because of the complex concave cloud contour.The results may be greatly different from the actual cloud contour.In actual weather condition:cloud contour will change according to the wind and can’t keep convex all the time.The complex concave polygons with big concavity are very common.It is necessary to apply convex decomposition to make this kind of cloud be adapted to the existing forecast model for cloud features.

    There are lots of researchers studying on the convex decomposition of concave clouds.There are two kinds of convex decompositions for the polygons.The subdivision lines are just applied to remove the current pits when we do the convex decomposition:which is called the local subdivision algorithm.A best subdivision line is selected from all the points according to some convex rules:which is called global subdivision algorithm[6].Ref.[7] proposed a new simple polygon subdivision algorithm called Delaunnay based on judgments on convex or concave points.It has a good application on surface reconstruction.This algorithm is not adaptable to the convex decomposition of complex concave clouds:because the complex points instead of simple straight lines make up the cloud contour.According to the relation between the neighboring concave points:Ref.[8] classified the polygons first and then realized the completely convex decomposition of polygons through applying recursive decomposition.This algorithm is efficient and the time complexity is relatively low.But the computational complexity is high.Through the comparison of various algorithms:Song Xiaomei strongly recommended using vector product method and slope method[9].A rapid convex decomposition algorithm based on neighboring concave points bisectors was proposed by He[10]:who analyzed and summarized the existing algorithms.There is no need to add new vertexes:the quantity of subdivision results is small:and the size and shape of the submaps are satisfying.This algorithm is efficient for the polygons that consist of simple straight lines:while it doesn’t work well to clouds that have complex points.

    This paper analyzes the characteristics of cloud contour in detail.The definition of complex concave clouds is proposed.The subdividing method for concave clouds and the corner recognition algorithms based on centroid point scattering model are proposed and simulated.

    1 Definition of complex concave clouds and simple convex clouds

    The ultra-short-term power prediction model based on machine vision is shown in Fig.1.And the key to prediction for the distributed ultra-short-term PV power output is the ultra-short-term prediction for cloud features.

    Fig.1 Ultra-short-term power prediction model based on machine vision for distributed photovoltaic system

    Cloud features can also be considered as cloud shape features:which is the visual representation on the horizontal plane projected by clouds.The cloud features directly determine the projection orientation and the shielding area of cloud shadows according to different sun elevation angle and solar azimuth.Cloud features are changing during the different phases of clouds such as growing:developing and disappearing.The changing speed and amplitude reflect the change of weather to a certain extent.The key to the cloud feature research for the ultra-short-term power prediction of distributed PV system is the modeling:identification and evolution forecast.Recently:the quadratic polynomial was mainly applied to the research of cloud prediction in meteorology.The sampling points on cloud contour are used to fit and predict the response position at next moment.Then the whole cloud contour would be predicted.

    1.1 Definition of complex concave clouds contour

    Cloud features in the near future can be accurately predicted by the existing cloud shape and velocity fitting models according to many cloud images in a timing series.But when there is larger concavity on cloud contour:the connection between the centroid and the outer point on the contour will have several nodes.For example:the connection between feature pointFand centroidOhas two nodes with the concave contour:shown in Fig.2.Larger error will arise when quadratic polynomial approximation is applied to the forecast model of existing cloud features in this condition.

    Shown in Fig.2:the centroid is set as basic point (BP):if any rays eliciting counter-clockwise and starting from BP have more than two (including two) nodes with clouds contour:the clouds contour is defined as complex concave clouds.

    Fig.2 The diagrammatic drawing of concave cloud

    1.2 Definition of simple convex clouds

    The centroid is set as BP:if any rays eliciting counter-clockwise and starting from BP have only one node with clouds contour:the clouds contour is defined as simple convex clouds:shown in Fig.3.

    Fig.3 The diagrammatic drawing of convex cloud

    2 Convex decomposition of complex concave clouds

    Essentially:cloud is a visible macroscopic phenomenon formed by countless different particle diameter vapor molecules gathering.So there are dense edge points on the contour of the cloud binary images and contour images that are obtained after threshold.The bumpiness on the contour is so tiny that it has no influence on the mathematical description and appearance recognition of cloud contour.It is unnecessary to do convex decomposition when there are too many detected points.So it is necessary to reduce the number of points through internal polygonal approximation.

    2.1 Minimum polygonal approximation

    It is optimum for polygonal approximation to show the basic contour of given boundary by polylines as fewer as possible:which increases the time consuming on iterative and computational burden if more polylines are applied:while it can express the shape features of given boundary most closely.The computational burden is light if fewer polylines are applied:while it can’t express features in detail.Even though there are dense edge points:and they hardly affect the recognition of contour and the quadratic polynomial approximation.Therefore:moderate minimum polygonal approximation (MPP) is adopted to approximately express the internal boundary.

    MPP was first proposed by Sklansky to find a region or a boundary for simple polygon[11]:who used a series of quadrangular elements (named as cell mosaics) to form an enclosed boundary.On the edge of the enclosed boundary:the quadrangular elements make up a 4-connected path.Then the boundary of the image can be represented by a polygon deduced by the quadrangular elements according to the angle at each point.Readers can refer to Ref.[12] for more detailed information.In MATLAB:MPP algorithm is mainly achieved by the following[13]:

    [X:Y:R]=im2minperpoly(f:cellsize)

    wherefis a binary image containing only a single zone.Thecellsizedetermines the size of square units which are used to enclose the zone.Column vectorsXandYrepresent theX-axisandY-axisthat include the vertexes of MPP.The binary image enclosed by cells is represented byR.

    Fig.4 shows the clouds image:the clouds binary image and MPP images whose unit sizes are 2:9 and 15.It is obvious that in Fig.4 (a) there are dense points on the contour without dealing by MPP.They increase great computational burden on detection of edge points.As shown in the pictures:clouds contour still contain many details dealt by square unit 2:while some concavity lost when dealt by square unit 15:neither of them were applied.Next step is to determine the basis for evaluation that represents the effect.The position extraction and calculated velocity vector are set as the input of the ultra-short-term power prediction of distributed PV system.They have strong influence on the accuracy of the ultra-short-term power prediction.So the minimum centroid point deviation valueσis set as the basis for evaluation.

    Fig.4 Simulation of MPP polygon approximation

    (1)

    The centroid point coordinates of clouds picture are set as (x0:y0):and the approximate centroid point coordinates of square unit 2:9 and 15 are set as (xn:yn)(n= 2:9:15).

    In order to decrease the edge corners and iterative computational quantity:the basic information of clouds contour is shown as much as possible:when the same timeσis adopted.As shown in Table 1:square unit 9 is relatively reasonable to approximate the internal polygons.

    Table 1 The centroid point deviation of different square units

    2.2 Convex decomposition of complex concave clouds

    Convex decomposition of concave polygons is one of the important issues in the research of computer graphics geometry:which is widely applied in computer graphics:rapid manufacturing scan:etc.There are two basic schemes on algorithms for convex decomposition of concave polygons[10].The first scheme aims to split the concave polygons into many Delaunnay triangles.The second scheme aims to find the pits on concave polygons:then connect these pits from split lines through some regulation.After dividing the concave polygons along split lines:you should find if any pit exists in the submaps.Repeating the algorithms until there is no pit any more.Finally:convex decomposition of concave polygons is done.

    The three main steps for convex decomposition of concave polygons are shown as:

    a) All the corners of concave polygons are calculated.Looking for the position of pits.

    b) The split lines are determined by some regulation:and the mother figure is divided into two subfigures along the split line.

    c) All the corners of subfigures are calculated.Repeating the steps until there are no pits any more.Then the convex decomposition is done.

    2.2.1 Corner detection on cloud contour

    Corners include all the pits and bumps.To search for the pits on contour is the biggest computational burden during convex decomposition of concave polygons.It is convenient to do corner detection on cloud contour to find pits.

    Corner detection aims to find split lines which are used for convex decomposition of concave clouds.The lost corners result in the lost of split lines easily.Harris-Stephens corner detection is an improvement based on the method proposed by Moravec[14].Its anti-noise and stability are strong:and the corners extracted are reasonable.The figure of corner detection obtained by the above mentioned method is shown in Fig.5.The white points in the figure are the corners.

    2.2.2 Recognition of pits on cloud contour

    The corners that include pits and bumps detected by corner detection are signed aspn(n=1:2:3:4 … ) in counter-clockwise.The straight section betweenpn-1andpnis defined as vectora:and the straight section betweenpnandpn+1is defined as vectorb.Vectorcis the cross product generated byaandb:

    c=a×b

    (2)

    Suppose that a=(ax:ay):b=(bx:by):then:

    |c|=ax·by-bx·ay

    (3)

    Fig.5 The drawing of Corner detection results

    And:

    |c|=|a||b|sinθ

    (4)

    Then:

    (5)

    whereθstands for the angle between vector a and b.The value is positive for sinθ when angle ranges in (0:π):while it is negative when angle ranges in (π:2π).Therefore:whetherpnis pit can refer to the value of sinθ.

    2.2.3 Determination of split lines

    After all the pits are detected:the next step is to determine the split lines which match with pits through certain regulation.The concave polygons can be divided into many convex polygons through appropriate regulation in the condition of the minimum amount of calculation.The regulation for split lines introduced in Section 2.2 is usually applied in simple concave polygons which contain fewer pits and polylines.There are lots of pits on the contour even though the clouds contour is dealt with the internal polygonal approximation.It has little influence on the recognition of clouds contour because most pits have small concavity.In fact:convex decomposition of concave clouds contour aims to avoid the problem described in Section 1.1.The centroid is set as the basic point.And rays eliciting from the basic point will have many nodes with clouds contour if the concavity is big enough:which will affect the accuracy of the quadratic polynomial prediction.

    Therefore:split lines are determined by the clouds centroid point scattering model.The concrete algorithm is introduced as follows combined with Fig.6.The cloud centroidsOandQare set as BP.Rays go straightly in the horizontal right direction from the BPs.There are 360 rays elicited from BP counterclockwise in the step angle of one degree.The circumferential span between two neighboring rays increasing results from the increasing distance between the centroid and cloud contour.There areNrays passing throughNpits and bumps in order to avoid the omission of pits and bumps.The total quantity of rays is 360 plusN.Every ray has one node with clouds contour when it is convex contour.There are at least three nodes when the contour has larger concavity.More nodes appear if complex details are contained in cloud boundary.More complex details will not appear after dealing with internal polygonal approximation.

    Therefore:there are two kinds of the determination of split lines depending on the condition of clouds.

    Firstly:as shown in Fig.6(a):the ray in the horizontal right direction starts to scan counter-clockwise.There is only one node with the contour.Then:the nodes increase to two and three:the node decreases to one finally.Every node is signed aspn(n=1:2:3:… ).

    The quantity of nodes establishes a sequence:1:1:1:…:2:3:…:2:1:… .The most important coordinates are the second point whose nodes are two:that is the point signed as 1 in Fig.6(a).The ray passing through that point is the split line of the concave clouds.

    Fig.6 The model of the center of mass point scattering

    As shown in Fig.6(b):the same scattering model is applied in scan.The sequence is 1:1:…:2:3:…:2:1:…:2:3:…:2:1:… .The most important coordinates are the second and the third points whose nodes are two:that is the point signed as 3 and 5 in Fig.6(b).The straight line connecting points 3 and 5 is the split line for convex decomposition of clouds contour:which divides the clouds contour into two subfigures.The scattering model is applied in the two subfigures until each ray has only one note with the contour.

    The clouds contour can be divided into many subfigures after the split lines are determined.Convex decomposition aiming at the quantity of nodes in the mass point scattering models is one:which means the quadratic polynomial approximation can be applied in the prediction for cloud features.

    The black point in the cloud contour is the centroid:shown in Fig.7(a).And the black line is the split line.The cloud contour is divided into three sub-regions along the split line.One of the sub-regions is too small and located on the edge.There is little influence on sun radiation from these edge portions.Thus the Fig.7(b) and (c) are reasonable.

    Fig.7 The result of the convex decomposition of complex concave polygon

    3 Algorithm validation and discussion

    3.1 Convex decomposition of cloud

    This algorithm is applied in the simulation for the convex decomposition of another concave cloud in order to testify the effect and applicability of the convex decomposition on complex concave clouds contour.The cloud picture is shown in Fig.8.

    Fig.8 The picture of the complex concave cloud

    Image preprocessing including mathematical morphology is applied in Fig.8:which aims to fill the broken holes:smooth the profile and eliminate influences caused by chiffon-like clouds.The cloud binary image is shown in Fig.9.

    Fig.9 The profile after preprocessing

    The features of clouds contour are extracted firstly according to the internal polygonal approximation described in Section 2.1.Simple polylines are applied to approximate the clouds contour.The black point represents the position of mass point of clouds.The clouds boundary extraction and internal polygon approximation are shown in Fig.10 and Fig.11.

    Fig.10 Clouds boundary extraction

    Fig.11 Internal polygon approximation

    The split line of convex decomposition is obtained through pits recognition and principle of certainty for split lines described in Section 2.2.The internal straight line is the split line:shown in Fig.12.

    Fig.12 The split line of convex decomposition

    Finally:Fig.12 is divided into two subfigures by the split line:shown in Fig.13.Fig.13(a) and (b) satisfy the definition of simple convex clouds put in Section 1.2.They are adaptable to the ultra-short-term power prediction of distributed PV system based on mathematical models for cloud features.

    Fig.13 The result of convex decomposition

    3.2 Comparison and discussion

    As defined in Section 1:a complex concave cloud must have at least one ray from the centroid to the outside:which has more than one cross nodes with the clouds contour.This definition is suitable for the application of sheltering area calculation for PV power station ultra-short-term output prediction.Actually:there are different definitions for different applications.In Ref.[10]:the authors used the concave polygon from geometry for earthwork calculation.Thus:the concave polygon is decided by the inner angle at all the vertexesPi.

    It is clear that the definition for concave shape cloud in this paper is entirely different from conventional geometry terminology.Then:the decomposition algorithm has its own advantages for the PV system ultra-short-term power output prediction:such as time complexity and decomposition part numbers.For the cloud shown in Fig.8:it is decomposed into two subfigures using the proposed method:consuming 0.01s to segment the image into two convex clouds.The image size is 425(345 pixels and the algorithm was programmed in MATLAB and executed on an ASUS K50I laptop computer with Pentium Dual-core 2.2GHz CPU and 2G RAM.While using the rapid convex decomposition algorithm based on neighboring concave points bisectors[10]:it needs 2.32s to segment the same cloud image into 12 parts shown in Fig.14:using MATLAB on the same computer.The great difference of time-consuming between the two methods lies on the algorithmic complexity and decomposition sub-image numbers.

    Fig.14 Decomposition results of algorithm in Ref.[10]

    It can be seen from the above analysis that the proposed cloud image decomposition algorithm can segment the concave clouds into convex images as quickly as possible:without redundant or over decomposition for the PV ultra-short-term power output prediction.And the time needed for the decomposition process is in the level of micro-second:which is critical and suitable for the expected application of the proposed algorithm.

    4 Conclusions

    The sun radiation received by the PV panels decreases greatly because of clouds sheltering:which causes the violent fluctuation of the power output for distributed PV system.This paper analyzes convex decomposition of concave clouds on the basis of the ultra-short-term power prediction of distributed PV system.The purpose and expected application is to eliminate the negative effects on the ultra-short-term power prediction of distributed PV system:which result from complex concave clouds.

    (1) The mass point scattering model is established:which helps to define complex concave clouds and simple convex clouds.

    (2) The minimum polygonal approximation is adopted to establish the concave clouds contour models because the concave clouds contour is complex after preprocessing.

    (3) The subdivision lines of convex decomposition for the concave clouds are determined by the centroid point scattering model and centroid angle function.The regulation is proposed.

    The result of MATLAB simulation indicates that the proposed algorithm can accurately detect the cloud contour corners and realize the concave points recognition.The established model can make the convex decomposition of the complex concave clouds completely and rapidly:making it available for the existing prediction algorithm for the ultra-short-term power of distributed PV system based on the cloud features.

    [1] Zhao S Q:Wang M Y:Hu Y Q:et al.Research on the prediction of PV output based on uncertainty theory.TransactionsofChinaElectrotechnicalSociety:2015:30(16):213-220 (In Chinese)

    [2] Zhang X L:Liu Q H:Ma H M:et al.Analysis of influencing factors of output power of photovoltaic power plant.PowerSystemandCleanEnergy:2012:28(5):75-81 (In Chinese)

    [3] Wang F.Power Forecasting Approach and System of Grid-connected PV Plant:[Ph.D dissertation].Beijing:School of Electrical and Electronic Engineering:North China Electric Power University:2013.26-27 (In Chinese)

    [4] Jayadevan:V T :Lonij:V P A:Rodriguez:J J:et al.Forecasting solar power intermittency using ground-based cloud imaging.In:Proceedings of the World Renewable Energy Forum:Denver:USA:2012.312-218

    [5] Bao G J:Tian L B:Cai S B:et al.An ultra-short-term power prediction model based on machine vision for distributed photovoltaic system.In:Proceeding of the 2015 IEEE International Conference on Information and Automation:Lijiang:China:2015.1148-1152

    [6] Zhang Q:Zhou H Q:Wang X T.The application of concave colygon cubdivision algorithm to rapid prototyping.Electromachining&Mould:2012:(5):41-44 (In Chinese)

    [7] Ma X H:Pan Z G:Shi J Y.Delaunay triangulation of simple polygon based on determination of convex-concave vertices.JournalofComputerAidedDesignandComputerGraphics:1999:(1):1-6 (In Chinese)

    [8] Dong J H:Zhu Y F.A convex decomposition algorithm of simple polygon based on its adjacent concave point connection.JournalofHuanggangNormalUniversity:2007:27(3):7-10 (In Chinese)

    [9] Song X M:Cheng C X:Zou C H.An analysis and investigation of algorithms for identifying convexity-concavity of a simple polygon.RemoteSensingforLand&Resources:2011:19(3):25-31 (In Chinese)

    [10] He L H:Bao Q S:Wang Z J.Research and application on algorithm for decomposing a concave polygon into convex polygons of adjacent angle bisector of concave point and vertex of polygon.JournalofNanjingForestryUniversity(NaturalSciencesEdition):2013:37(5):165-168 (In Chinese)

    [11] Sklansky J:Chazin R L:Hahsen B J.Minimum-perimeter polygons of digitized silhouettes:IEEETransactionsonComputers.1972:C-21(3):260-268

    [12] Kim C E.On the cellular convexity of complexes.IEEETransactionsonPatternAnalysisandMachineIntelligence:1981:PAMI-3(6):617-625

    [13] Gonzalez R C,Woods R E,Eddins S L.Digital Image Processing Using MATLAB.Second Edition.Beijing:Electronic Industry Press:2013.328-330

    [14] Gonzalez R C:Woods R E.Digital Image Processing.NJ:Pearson Prentice Hall:2003.460-463

    Cai Shibo:born in 1981.He received his B.S.and M.S.degrees from Zhejiang University of Technology in 2003 and 2010 respectively.His research interests include the photovoltaic (PV) power generation prediction and robot control.

    10.3772/j.issn.1006-6748.2016.03.010

    ①Supported by the National High Technology Research and Development Programme of China (No.2013AA050405):Doctoral Fund of Ministry of Education (No.20123317110004):Foundation of Zhejiang Province Key Science and Technology Innovation Team (No.2011R50011) and the Natural Science Foundation of Zhejiang Province (No.LY15E070004).

    午夜视频国产福利| 国产精品亚洲一级av第二区| 日本在线视频免费播放| 极品教师在线视频| 成人亚洲精品av一区二区| 精品99又大又爽又粗少妇毛片 | 成人国产综合亚洲| 少妇熟女aⅴ在线视频| 免费看光身美女| 国语自产精品视频在线第100页| 亚洲精品一卡2卡三卡4卡5卡| 国产一区二区三区av在线 | 中文字幕免费在线视频6| 欧洲精品卡2卡3卡4卡5卡区| 一本精品99久久精品77| 99精品在免费线老司机午夜| 日韩在线高清观看一区二区三区 | 午夜福利欧美成人| 日本 av在线| 久久中文看片网| 亚洲内射少妇av| 亚洲无线在线观看| 免费观看人在逋| 成人午夜高清在线视频| 男人和女人高潮做爰伦理| 岛国在线免费视频观看| 人人妻人人看人人澡| 欧美成人免费av一区二区三区| 日韩 亚洲 欧美在线| 国产真实乱freesex| 午夜福利视频1000在线观看| 成人无遮挡网站| 在线a可以看的网站| 如何舔出高潮| 老司机福利观看| 蜜桃亚洲精品一区二区三区| 可以在线观看的亚洲视频| 欧美日韩乱码在线| 国产欧美日韩精品一区二区| 精品久久久久久久久久久久久| 成人二区视频| 嫩草影院入口| 大型黄色视频在线免费观看| 赤兔流量卡办理| 99精品在免费线老司机午夜| 草草在线视频免费看| 我的老师免费观看完整版| 亚洲欧美日韩东京热| 亚洲无线观看免费| 亚洲中文日韩欧美视频| 赤兔流量卡办理| 色尼玛亚洲综合影院| 免费搜索国产男女视频| 午夜免费男女啪啪视频观看 | 狠狠狠狠99中文字幕| 国产蜜桃级精品一区二区三区| 国产精品久久久久久久久免| 欧美色欧美亚洲另类二区| 精品无人区乱码1区二区| 1024手机看黄色片| 久久婷婷人人爽人人干人人爱| 欧美最黄视频在线播放免费| 老司机深夜福利视频在线观看| 夜夜看夜夜爽夜夜摸| 人人妻,人人澡人人爽秒播| 亚洲美女视频黄频| 国产成人福利小说| 久久久久久久精品吃奶| 99在线视频只有这里精品首页| 亚洲成人久久爱视频| 女的被弄到高潮叫床怎么办 | 精品人妻偷拍中文字幕| 亚洲色图av天堂| 麻豆一二三区av精品| 九九爱精品视频在线观看| 一进一出抽搐动态| 成人无遮挡网站| 深爱激情五月婷婷| 亚洲自偷自拍三级| eeuss影院久久| 在线观看av片永久免费下载| 99久久九九国产精品国产免费| 精品国内亚洲2022精品成人| 午夜福利成人在线免费观看| 亚洲国产色片| 久久亚洲真实| 欧美性猛交╳xxx乱大交人| 91麻豆精品激情在线观看国产| 亚洲精品在线观看二区| 久久香蕉精品热| av在线亚洲专区| 99热这里只有是精品50| 人妻丰满熟妇av一区二区三区| 伦精品一区二区三区| 国产精品久久久久久久电影| av在线观看视频网站免费| 色综合亚洲欧美另类图片| 国国产精品蜜臀av免费| 夜夜爽天天搞| 少妇人妻精品综合一区二区 | 亚洲欧美日韩无卡精品| 亚洲一级一片aⅴ在线观看| 91久久精品国产一区二区三区| 欧美成人a在线观看| 美女 人体艺术 gogo| 日韩欧美在线二视频| a级一级毛片免费在线观看| 日本熟妇午夜| 我的老师免费观看完整版| 国产不卡一卡二| 亚洲精品粉嫩美女一区| 91久久精品国产一区二区成人| 可以在线观看的亚洲视频| 日本三级黄在线观看| 中文字幕高清在线视频| .国产精品久久| av天堂在线播放| 高清日韩中文字幕在线| 超碰av人人做人人爽久久| 国产精品嫩草影院av在线观看 | 黄色日韩在线| av天堂在线播放| 深夜精品福利| 一区二区三区四区激情视频 | 国产主播在线观看一区二区| 丰满乱子伦码专区| 最后的刺客免费高清国语| 夜夜夜夜夜久久久久| 久久久精品大字幕| 黄色配什么色好看| 日本免费一区二区三区高清不卡| 精品一区二区免费观看| 极品教师在线免费播放| 亚洲av免费高清在线观看| 色av中文字幕| 人人妻人人看人人澡| 国产一区二区亚洲精品在线观看| 欧美成人性av电影在线观看| 乱系列少妇在线播放| 国内久久婷婷六月综合欲色啪| 日韩在线高清观看一区二区三区 | 九色成人免费人妻av| 色精品久久人妻99蜜桃| 日本撒尿小便嘘嘘汇集6| 又黄又爽又刺激的免费视频.| 人妻制服诱惑在线中文字幕| 久久久久久九九精品二区国产| 色综合亚洲欧美另类图片| 午夜亚洲福利在线播放| 精品人妻熟女av久视频| 国产aⅴ精品一区二区三区波| 伦精品一区二区三区| ponron亚洲| 色吧在线观看| 国产伦人伦偷精品视频| 国产麻豆成人av免费视频| 国产综合懂色| 网址你懂的国产日韩在线| 国产精品福利在线免费观看| 床上黄色一级片| 性色avwww在线观看| 成熟少妇高潮喷水视频| netflix在线观看网站| 国内精品美女久久久久久| 草草在线视频免费看| 日本爱情动作片www.在线观看 | 亚洲欧美精品综合久久99| 久久久久久久久中文| 免费观看在线日韩| 国产蜜桃级精品一区二区三区| 观看美女的网站| 亚洲人成伊人成综合网2020| 亚洲欧美日韩高清在线视频| 一个人看的www免费观看视频| 色在线成人网| 久久人人爽人人爽人人片va| 极品教师在线免费播放| 日本 欧美在线| 精品午夜福利视频在线观看一区| 18+在线观看网站| 亚洲成人久久性| 在线免费观看的www视频| 欧美黑人巨大hd| 国产精品久久久久久久久免| 搡老熟女国产l中国老女人| 大型黄色视频在线免费观看| 长腿黑丝高跟| 国产亚洲av嫩草精品影院| 久久精品国产鲁丝片午夜精品 | 亚洲国产精品成人综合色| 成年免费大片在线观看| a级一级毛片免费在线观看| 三级国产精品欧美在线观看| 国产精品,欧美在线| 欧美在线一区亚洲| 老司机午夜福利在线观看视频| 亚洲午夜理论影院| 日韩精品青青久久久久久| 国产av不卡久久| 亚洲最大成人手机在线| 久久国产精品人妻蜜桃| 欧美日韩综合久久久久久 | 国模一区二区三区四区视频| 欧美极品一区二区三区四区| 国产精品乱码一区二三区的特点| 亚洲成人精品中文字幕电影| 99九九线精品视频在线观看视频| 午夜激情欧美在线| a级一级毛片免费在线观看| 1000部很黄的大片| АⅤ资源中文在线天堂| 性色avwww在线观看| 尤物成人国产欧美一区二区三区| 成年版毛片免费区| 国产一区二区在线观看日韩| 亚洲av第一区精品v没综合| 亚洲欧美激情综合另类| 精品久久久久久久人妻蜜臀av| 91久久精品电影网| 国产男人的电影天堂91| 亚洲欧美日韩高清专用| 国产成人a区在线观看| 久久精品91蜜桃| 欧美黑人欧美精品刺激| 亚洲四区av| 久久久久久久亚洲中文字幕| 欧美区成人在线视频| 黄色女人牲交| 国产精品久久久久久av不卡| 蜜桃久久精品国产亚洲av| 人妻制服诱惑在线中文字幕| av国产免费在线观看| 男女之事视频高清在线观看| 中出人妻视频一区二区| 亚洲最大成人中文| 午夜福利欧美成人| 69av精品久久久久久| 人妻久久中文字幕网| 欧美不卡视频在线免费观看| 国内揄拍国产精品人妻在线| 欧美成人a在线观看| 亚洲第一电影网av| 国产亚洲精品久久久久久毛片| 日韩欧美一区二区三区在线观看| 久久午夜福利片| 亚洲第一电影网av| 全区人妻精品视频| 国产精品一区二区三区四区久久| 久久午夜亚洲精品久久| 成人一区二区视频在线观看| 国产爱豆传媒在线观看| 丰满乱子伦码专区| 97超级碰碰碰精品色视频在线观看| 欧美日本视频| 日本色播在线视频| 亚洲aⅴ乱码一区二区在线播放| 中文字幕免费在线视频6| 婷婷精品国产亚洲av| 亚洲综合色惰| 久久国内精品自在自线图片| 国产精品美女特级片免费视频播放器| 欧美一级a爱片免费观看看| 两个人的视频大全免费| 有码 亚洲区| 51国产日韩欧美| 韩国av一区二区三区四区| 国产午夜精品久久久久久一区二区三区 | 国产淫片久久久久久久久| 免费观看精品视频网站| 久久精品人妻少妇| 国产一区二区三区在线臀色熟女| 桃色一区二区三区在线观看| 欧美绝顶高潮抽搐喷水| 一区福利在线观看| 性色avwww在线观看| 国产精品久久电影中文字幕| 99在线视频只有这里精品首页| 美女被艹到高潮喷水动态| 又粗又爽又猛毛片免费看| 婷婷精品国产亚洲av在线| 老司机深夜福利视频在线观看| 深爱激情五月婷婷| 噜噜噜噜噜久久久久久91| 天天躁日日操中文字幕| 99国产精品一区二区蜜桃av| 精品久久国产蜜桃| 中亚洲国语对白在线视频| 国产综合懂色| 成人av一区二区三区在线看| 亚洲国产欧美人成| 无人区码免费观看不卡| 国产伦在线观看视频一区| 色噜噜av男人的天堂激情| 一区二区三区免费毛片| 又黄又爽又刺激的免费视频.| 两个人的视频大全免费| 久久久久久大精品| 欧美丝袜亚洲另类 | 成年女人永久免费观看视频| 国内精品久久久久久久电影| 亚洲一区高清亚洲精品| 伊人久久精品亚洲午夜| 深夜a级毛片| 亚洲av一区综合| 嫩草影院精品99| 中文字幕精品亚洲无线码一区| 麻豆一二三区av精品| 国产精品98久久久久久宅男小说| 夜夜看夜夜爽夜夜摸| 国产一区二区激情短视频| 我要搜黄色片| 亚洲一区高清亚洲精品| 久久久久精品国产欧美久久久| 中文在线观看免费www的网站| 12—13女人毛片做爰片一| 黄色视频,在线免费观看| 在线观看美女被高潮喷水网站| 老司机午夜福利在线观看视频| 国产精品1区2区在线观看.| av在线蜜桃| 我要看日韩黄色一级片| 床上黄色一级片| 欧美3d第一页| av福利片在线观看| 免费在线观看影片大全网站| 精品乱码久久久久久99久播| 乱码一卡2卡4卡精品| 国内少妇人妻偷人精品xxx网站| 午夜福利欧美成人| 男人和女人高潮做爰伦理| 看片在线看免费视频| 久久精品国产亚洲av涩爱 | 成人亚洲精品av一区二区| 日韩欧美在线乱码| 国产精品人妻久久久久久| 亚洲国产精品久久男人天堂| 亚洲一区二区三区色噜噜| 免费看美女性在线毛片视频| 久久精品国产鲁丝片午夜精品 | 亚洲精品粉嫩美女一区| 男人和女人高潮做爰伦理| 国产大屁股一区二区在线视频| 在线观看av片永久免费下载| 久久人人爽人人爽人人片va| 免费看美女性在线毛片视频| 深夜精品福利| 久久国产精品人妻蜜桃| 夜夜看夜夜爽夜夜摸| 少妇人妻一区二区三区视频| 3wmmmm亚洲av在线观看| 一区二区三区高清视频在线| 国产精品久久久久久精品电影| 在线观看av片永久免费下载| 国产私拍福利视频在线观看| 日韩欧美三级三区| 欧美又色又爽又黄视频| 国产午夜精品论理片| 哪里可以看免费的av片| a在线观看视频网站| 国产伦一二天堂av在线观看| 国产成年人精品一区二区| 精品免费久久久久久久清纯| 成年免费大片在线观看| 三级毛片av免费| 一个人看的www免费观看视频| 有码 亚洲区| 欧洲精品卡2卡3卡4卡5卡区| 国产爱豆传媒在线观看| 69av精品久久久久久| 大又大粗又爽又黄少妇毛片口| 国产午夜精品久久久久久一区二区三区 | 嫩草影视91久久| 日韩av在线大香蕉| 精品国内亚洲2022精品成人| 五月伊人婷婷丁香| 在线免费十八禁| 少妇高潮的动态图| 麻豆国产97在线/欧美| 中出人妻视频一区二区| 亚洲一区二区三区色噜噜| 男女之事视频高清在线观看| 亚洲在线观看片| 精品久久久久久,| 真人一进一出gif抽搐免费| 国产精品亚洲美女久久久| 亚洲av免费在线观看| 啦啦啦啦在线视频资源| 12—13女人毛片做爰片一| 乱人视频在线观看| 亚洲av日韩精品久久久久久密| 国产精品久久电影中文字幕| 99久久久亚洲精品蜜臀av| 丝袜美腿在线中文| 国产亚洲精品久久久com| 又黄又爽又免费观看的视频| 日韩国内少妇激情av| 久久人人爽人人爽人人片va| 久久精品国产亚洲av天美| 成人国产一区最新在线观看| 国产高清有码在线观看视频| 欧美潮喷喷水| 久久精品国产清高在天天线| 一本久久中文字幕| 午夜老司机福利剧场| 国产精品亚洲美女久久久| 日本与韩国留学比较| 精品欧美国产一区二区三| 美女被艹到高潮喷水动态| 久久亚洲精品不卡| 免费在线观看成人毛片| 最新在线观看一区二区三区| 永久网站在线| 有码 亚洲区| 如何舔出高潮| 国产欧美日韩精品一区二区| 精品人妻偷拍中文字幕| 听说在线观看完整版免费高清| 国产aⅴ精品一区二区三区波| 最新在线观看一区二区三区| 久久精品91蜜桃| 日本a在线网址| 午夜精品久久久久久毛片777| 亚洲午夜理论影院| 亚洲乱码一区二区免费版| 免费不卡的大黄色大毛片视频在线观看 | 老女人水多毛片| 国产精品乱码一区二三区的特点| 88av欧美| 麻豆成人午夜福利视频| 成年版毛片免费区| 天堂av国产一区二区熟女人妻| www.色视频.com| 欧美中文日本在线观看视频| 夜夜看夜夜爽夜夜摸| 亚洲欧美日韩卡通动漫| x7x7x7水蜜桃| 国产精品一区二区性色av| 少妇裸体淫交视频免费看高清| 成年人黄色毛片网站| 国产精品久久久久久久久免| 国内精品一区二区在线观看| 久久人人爽人人爽人人片va| 色在线成人网| 久9热在线精品视频| 国产亚洲欧美98| 亚洲一区二区三区色噜噜| 嫩草影院入口| 看免费成人av毛片| 日本免费一区二区三区高清不卡| 丰满乱子伦码专区| 精品人妻熟女av久视频| 日本黄色视频三级网站网址| 色吧在线观看| 欧美高清性xxxxhd video| 97碰自拍视频| 免费观看人在逋| 99精品在免费线老司机午夜| 国产精品一及| 亚洲一区高清亚洲精品| 色综合色国产| 久久精品国产亚洲av香蕉五月| 俺也久久电影网| 99久久九九国产精品国产免费| 成人毛片a级毛片在线播放| 久久久久国内视频| 久久人妻av系列| 欧美潮喷喷水| 丰满人妻一区二区三区视频av| 国产精品久久电影中文字幕| 亚洲av二区三区四区| 免费不卡的大黄色大毛片视频在线观看 | 看免费成人av毛片| 露出奶头的视频| 特大巨黑吊av在线直播| 国产男靠女视频免费网站| 男人的好看免费观看在线视频| 真人一进一出gif抽搐免费| 国产熟女欧美一区二区| 久久6这里有精品| 日日夜夜操网爽| 国内精品美女久久久久久| 一区二区三区四区激情视频 | 国产精品久久久久久av不卡| 少妇的逼水好多| 久久精品国产亚洲av香蕉五月| 校园春色视频在线观看| 日韩中字成人| 精品午夜福利在线看| 毛片女人毛片| 搞女人的毛片| 听说在线观看完整版免费高清| 少妇的逼水好多| 波野结衣二区三区在线| 亚洲七黄色美女视频| 欧美日韩国产亚洲二区| 舔av片在线| 成人二区视频| 12—13女人毛片做爰片一| 成年人黄色毛片网站| 中文资源天堂在线| 国产一级毛片七仙女欲春2| 国内毛片毛片毛片毛片毛片| 欧美+日韩+精品| 99热只有精品国产| 亚洲国产精品久久男人天堂| 精品久久久久久久久亚洲 | 精品久久久噜噜| 日本 av在线| 91麻豆av在线| 12—13女人毛片做爰片一| 俄罗斯特黄特色一大片| 久久精品国产鲁丝片午夜精品 | 蜜桃久久精品国产亚洲av| 波多野结衣高清无吗| 久久精品国产亚洲网站| 久久欧美精品欧美久久欧美| 亚洲国产色片| 亚洲av不卡在线观看| 五月伊人婷婷丁香| 国产亚洲欧美98| 亚洲第一区二区三区不卡| 亚洲av免费高清在线观看| 成人精品一区二区免费| 色综合站精品国产| 国产在线男女| 伦理电影大哥的女人| 免费人成视频x8x8入口观看| 两性午夜刺激爽爽歪歪视频在线观看| 精品久久久久久久久亚洲 | 婷婷色综合大香蕉| 免费在线观看成人毛片| 波野结衣二区三区在线| 国产精品自产拍在线观看55亚洲| 亚洲性久久影院| 九九热线精品视视频播放| 午夜精品一区二区三区免费看| АⅤ资源中文在线天堂| 99热这里只有精品一区| 看片在线看免费视频| 成人国产麻豆网| 久久精品国产鲁丝片午夜精品 | 欧美极品一区二区三区四区| 午夜a级毛片| 国产麻豆成人av免费视频| 波多野结衣高清无吗| 日本黄色片子视频| 国产综合懂色| 亚洲av免费在线观看| 日本在线视频免费播放| 97人妻精品一区二区三区麻豆| videossex国产| 又紧又爽又黄一区二区| 给我免费播放毛片高清在线观看| 成人国产综合亚洲| 欧美性感艳星| 人妻制服诱惑在线中文字幕| 性插视频无遮挡在线免费观看| 直男gayav资源| 深夜精品福利| 久久久久精品国产欧美久久久| 亚洲av美国av| 成人av在线播放网站| 国产三级中文精品| 麻豆av噜噜一区二区三区| 国产男靠女视频免费网站| 欧美中文日本在线观看视频| 亚洲欧美日韩东京热| 夜夜爽天天搞| 国产精品久久久久久久电影| 久久久久国内视频| 中文亚洲av片在线观看爽| 麻豆成人午夜福利视频| av在线蜜桃| 久久精品国产亚洲网站| 亚洲成人久久性| a在线观看视频网站| 日本-黄色视频高清免费观看| 精品欧美国产一区二区三| 人妻夜夜爽99麻豆av| 天美传媒精品一区二区| 国产毛片a区久久久久| 女人十人毛片免费观看3o分钟| 精品人妻一区二区三区麻豆 | 人妻夜夜爽99麻豆av| 88av欧美| 日日摸夜夜添夜夜添小说| 听说在线观看完整版免费高清| 99精品在免费线老司机午夜| 成年版毛片免费区| 免费观看的影片在线观看| 成人国产一区最新在线观看| 嫩草影院新地址| 一级黄色大片毛片| 麻豆成人午夜福利视频| 亚洲精品亚洲一区二区| 国产精品伦人一区二区| 麻豆成人av在线观看| 日韩av在线大香蕉| 国产亚洲精品久久久久久毛片| 亚洲精品久久国产高清桃花| 麻豆成人av在线观看| 麻豆国产av国片精品| 国产在线精品亚洲第一网站| 成年女人永久免费观看视频| 熟妇人妻久久中文字幕3abv| 日日啪夜夜撸| 一卡2卡三卡四卡精品乱码亚洲| 99热只有精品国产| 久久久久久久久中文| av视频在线观看入口| 99热精品在线国产| 久久久久久久久久黄片| 看黄色毛片网站| 国产高清激情床上av| 一本精品99久久精品77|