• <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).

    久热久热在线精品观看| 国产免费福利视频在线观看| 精品人妻偷拍中文字幕| 久久久久视频综合| 我的亚洲天堂| 人妻少妇偷人精品九色| 日韩一区二区视频免费看| 90打野战视频偷拍视频| 26uuu在线亚洲综合色| 搡老乐熟女国产| a级毛片黄视频| 男女午夜视频在线观看| 成人亚洲欧美一区二区av| 街头女战士在线观看网站| 大片电影免费在线观看免费| 天天躁日日躁夜夜躁夜夜| 亚洲国产成人一精品久久久| 人人妻人人爽人人添夜夜欢视频| 午夜av观看不卡| 97在线视频观看| 丝袜美足系列| 一级黄片播放器| 免费少妇av软件| 国产熟女欧美一区二区| 亚洲天堂av无毛| 成人影院久久| 色婷婷久久久亚洲欧美| 久久久久久久亚洲中文字幕| 制服丝袜香蕉在线| 久久久国产一区二区| 久久午夜福利片| 中文字幕亚洲精品专区| 成人免费观看视频高清| 亚洲欧美成人综合另类久久久| 精品少妇久久久久久888优播| 久久精品夜色国产| 午夜福利,免费看| 亚洲av中文av极速乱| xxx大片免费视频| 亚洲综合精品二区| 国产xxxxx性猛交| 国产熟女欧美一区二区| 自拍欧美九色日韩亚洲蝌蚪91| 大片免费播放器 马上看| 国产精品久久久久久精品古装| 亚洲精华国产精华液的使用体验| 亚洲精品,欧美精品| 精品一区在线观看国产| 久久久久久免费高清国产稀缺| 午夜福利一区二区在线看| 黄频高清免费视频| 免费久久久久久久精品成人欧美视频| 人妻少妇偷人精品九色| 久久精品熟女亚洲av麻豆精品| 日本-黄色视频高清免费观看| 亚洲综合色惰| 热re99久久国产66热| 18禁动态无遮挡网站| 亚洲成av片中文字幕在线观看 | 久久热在线av| 一边摸一边做爽爽视频免费| 国产精品不卡视频一区二区| 看非洲黑人一级黄片| 国产成人免费无遮挡视频| 久久久久久人人人人人| 最近中文字幕2019免费版| 日韩一卡2卡3卡4卡2021年| 99久久综合免费| 伊人久久国产一区二区| 边亲边吃奶的免费视频| 国产精品女同一区二区软件| 成年av动漫网址| 性高湖久久久久久久久免费观看| 日韩大片免费观看网站| 免费在线观看视频国产中文字幕亚洲 | 黄色一级大片看看| 99久久中文字幕三级久久日本| 中文字幕精品免费在线观看视频| 美女视频免费永久观看网站| 人人妻人人澡人人爽人人夜夜| 日韩制服骚丝袜av| 超碰成人久久| 日韩电影二区| 国产精品 国内视频| 日韩不卡一区二区三区视频在线| www.熟女人妻精品国产| 卡戴珊不雅视频在线播放| 婷婷色综合www| 在线免费观看不下载黄p国产| 免费黄网站久久成人精品| 亚洲三级黄色毛片| 99re6热这里在线精品视频| 熟女电影av网| 超色免费av| 十分钟在线观看高清视频www| av天堂久久9| 国语对白做爰xxxⅹ性视频网站| 三级国产精品片| 天天躁狠狠躁夜夜躁狠狠躁| 18禁国产床啪视频网站| 制服丝袜香蕉在线| 亚洲国产av影院在线观看| 国产精品一区二区在线不卡| 一区二区三区激情视频| 国产精品二区激情视频| 国产精品国产三级专区第一集| 熟女少妇亚洲综合色aaa.| 久久午夜福利片| 久久人人97超碰香蕉20202| 黄网站色视频无遮挡免费观看| 18禁国产床啪视频网站| 欧美日韩成人在线一区二区| 午夜免费鲁丝| 国产精品一二三区在线看| 国产探花极品一区二区| 国产精品成人在线| 欧美精品国产亚洲| 女性被躁到高潮视频| 女人高潮潮喷娇喘18禁视频| 最近最新中文字幕大全免费视频 | 亚洲第一区二区三区不卡| 大码成人一级视频| 日韩免费高清中文字幕av| 18禁动态无遮挡网站| 亚洲成人av在线免费| 日本色播在线视频| 欧美人与性动交α欧美软件| 国产精品久久久av美女十八| 青草久久国产| 丰满迷人的少妇在线观看| 中文乱码字字幕精品一区二区三区| 两个人免费观看高清视频| 国产成人精品久久久久久| 97在线视频观看| 777久久人妻少妇嫩草av网站| av在线老鸭窝| a级毛片在线看网站| 国产精品免费大片| 久久久久久久大尺度免费视频| 国产探花极品一区二区| 日韩三级伦理在线观看| 一二三四在线观看免费中文在| 国产亚洲av片在线观看秒播厂| 亚洲一码二码三码区别大吗| 欧美少妇被猛烈插入视频| 一级黄片播放器| 亚洲视频免费观看视频| 欧美精品一区二区大全| 久久97久久精品| 婷婷色av中文字幕| 制服丝袜香蕉在线| 97在线视频观看| 女人被躁到高潮嗷嗷叫费观| 久久久久久久久久人人人人人人| 国产片内射在线| 秋霞在线观看毛片| 精品人妻熟女毛片av久久网站| 国产一区二区在线观看av| 热re99久久国产66热| 国产色婷婷99| 高清黄色对白视频在线免费看| 可以免费在线观看a视频的电影网站 | 校园人妻丝袜中文字幕| 乱人伦中国视频| 最近最新中文字幕大全免费视频 | 欧美亚洲 丝袜 人妻 在线| 亚洲色图综合在线观看| 韩国精品一区二区三区| 男女下面插进去视频免费观看| 2018国产大陆天天弄谢| 亚洲国产精品成人久久小说| 日韩熟女老妇一区二区性免费视频| 最新中文字幕久久久久| 男人爽女人下面视频在线观看| 日韩精品免费视频一区二区三区| 视频区图区小说| 王馨瑶露胸无遮挡在线观看| 精品亚洲乱码少妇综合久久| 亚洲精品,欧美精品| 日韩成人av中文字幕在线观看| 新久久久久国产一级毛片| 熟女电影av网| 丰满迷人的少妇在线观看| 国产精品久久久久久久久免| 成人免费观看视频高清| 国产亚洲午夜精品一区二区久久| 亚洲欧美日韩另类电影网站| 久久国产精品大桥未久av| 一级毛片 在线播放| 侵犯人妻中文字幕一二三四区| 久久久欧美国产精品| 亚洲精品久久久久久婷婷小说| 毛片一级片免费看久久久久| 天天影视国产精品| 日韩伦理黄色片| 男男h啪啪无遮挡| 午夜福利乱码中文字幕| 欧美亚洲 丝袜 人妻 在线| 久久久久久久久免费视频了| 精品亚洲乱码少妇综合久久| 久久久亚洲精品成人影院| 国产精品三级大全| 性色av一级| 捣出白浆h1v1| 777米奇影视久久| 久久久久精品性色| 国产精品不卡视频一区二区| 桃花免费在线播放| 最近2019中文字幕mv第一页| 香蕉丝袜av| 国产成人精品婷婷| 久久人人爽av亚洲精品天堂| 亚洲精品一区蜜桃| 中文字幕人妻丝袜制服| 啦啦啦在线免费观看视频4| 久久精品国产亚洲av天美| 天天躁夜夜躁狠狠久久av| 黑人猛操日本美女一级片| 少妇人妻精品综合一区二区| 亚洲图色成人| 在线观看免费视频网站a站| 日韩,欧美,国产一区二区三区| 免费人妻精品一区二区三区视频| 国产成人91sexporn| 中国国产av一级| a级毛片黄视频| 人人妻人人爽人人添夜夜欢视频| 日韩av不卡免费在线播放| 在线观看三级黄色| 国产精品久久久久久av不卡| 久久人人爽人人片av| 一级爰片在线观看| 国产av码专区亚洲av| 国产一区二区三区av在线| 国产精品免费大片| 国产成人aa在线观看| 国产精品麻豆人妻色哟哟久久| 国产免费现黄频在线看| 26uuu在线亚洲综合色| 中国国产av一级| 久久国产亚洲av麻豆专区| 国产男女内射视频| 成年人午夜在线观看视频| 成人黄色视频免费在线看| 亚洲欧洲国产日韩| 欧美人与性动交α欧美软件| 一区福利在线观看| 国产精品无大码| 我的亚洲天堂| 精品亚洲成a人片在线观看| 日韩一本色道免费dvd| 两个人看的免费小视频| 天天躁夜夜躁狠狠躁躁| 国产熟女欧美一区二区| 亚洲av.av天堂| 久久精品夜色国产| 女人久久www免费人成看片| 亚洲av男天堂| 日韩 亚洲 欧美在线| 在线精品无人区一区二区三| 免费观看a级毛片全部| 亚洲av免费高清在线观看| 午夜福利一区二区在线看| 亚洲av成人精品一二三区| 日本爱情动作片www.在线观看| 少妇精品久久久久久久| 日韩人妻精品一区2区三区| av一本久久久久| 999久久久国产精品视频| 免费女性裸体啪啪无遮挡网站| 久久ye,这里只有精品| 99久久人妻综合| 亚洲精品aⅴ在线观看| 成人18禁高潮啪啪吃奶动态图| 亚洲国产成人一精品久久久| av.在线天堂| 中文字幕色久视频| 男人爽女人下面视频在线观看| 男人添女人高潮全过程视频| 亚洲精品日韩在线中文字幕| 国产精品一区二区在线不卡| 18禁动态无遮挡网站| 十八禁网站网址无遮挡| 中文字幕人妻熟女乱码| av卡一久久| 久久久久国产网址| av在线观看视频网站免费| √禁漫天堂资源中文www| 97人妻天天添夜夜摸| 久久亚洲国产成人精品v| 这个男人来自地球电影免费观看 | 国产一区二区激情短视频 | 久久久久久伊人网av| 亚洲色图综合在线观看| 美女视频免费永久观看网站| 美女高潮到喷水免费观看| 免费观看a级毛片全部| 午夜福利视频精品| 女人被躁到高潮嗷嗷叫费观| 波野结衣二区三区在线| 亚洲欧美成人综合另类久久久| 春色校园在线视频观看| av在线老鸭窝| 国产成人精品在线电影| 久久精品国产自在天天线| 久久久久久久久免费视频了| 9热在线视频观看99| 免费黄频网站在线观看国产| 亚洲经典国产精华液单| 哪个播放器可以免费观看大片| 欧美另类一区| 国产日韩欧美视频二区| 日韩一区二区视频免费看| 欧美精品一区二区大全| 国产高清国产精品国产三级| 春色校园在线视频观看| 丝袜喷水一区| 伊人亚洲综合成人网| 丁香六月天网| 国产欧美亚洲国产| 国产精品秋霞免费鲁丝片| 9色porny在线观看| 成人国产av品久久久| 日韩一区二区视频免费看| 国产精品无大码| 春色校园在线视频观看| 蜜桃在线观看..| 人人妻人人澡人人看| 久久久久精品性色| 国产在线视频一区二区| 中文字幕色久视频| 精品国产超薄肉色丝袜足j| 久久国产精品大桥未久av| 亚洲欧洲日产国产| 纯流量卡能插随身wifi吗| 国产成人精品久久二区二区91 | 成人影院久久| 国产午夜精品一二区理论片| 国产高清国产精品国产三级| 亚洲国产精品999| www.熟女人妻精品国产| 18+在线观看网站| 亚洲内射少妇av| 午夜影院在线不卡| 一边亲一边摸免费视频| 精品一品国产午夜福利视频| 多毛熟女@视频| 美女中出高潮动态图| 日韩三级伦理在线观看| 国产又爽黄色视频| 国产精品亚洲av一区麻豆 | 在线天堂最新版资源| av卡一久久| 国产白丝娇喘喷水9色精品| 久久精品久久精品一区二区三区| 久久精品国产亚洲av涩爱| 丰满迷人的少妇在线观看| 国产又色又爽无遮挡免| av一本久久久久| 日韩一区二区视频免费看| 大片电影免费在线观看免费| 久久久精品免费免费高清| 日韩av免费高清视频| 久久久a久久爽久久v久久| 国产成人91sexporn| 亚洲少妇的诱惑av| 少妇的丰满在线观看| 国产精品久久久av美女十八| 在线观看三级黄色| 久热这里只有精品99| 一边亲一边摸免费视频| 国产又色又爽无遮挡免| 在线观看美女被高潮喷水网站| 18+在线观看网站| 日韩av免费高清视频| 亚洲第一av免费看| 中文精品一卡2卡3卡4更新| videos熟女内射| 亚洲综合色惰| 高清在线视频一区二区三区| 日韩大片免费观看网站| 天天影视国产精品| 熟女少妇亚洲综合色aaa.| 巨乳人妻的诱惑在线观看| 日韩大片免费观看网站| 少妇精品久久久久久久| 国产成人精品婷婷| 一区二区日韩欧美中文字幕| av一本久久久久| 两个人免费观看高清视频| 国产精品三级大全| 免费看不卡的av| 激情五月婷婷亚洲| 亚洲精品一二三| 欧美少妇被猛烈插入视频| 免费少妇av软件| 桃花免费在线播放| 国产野战对白在线观看| 1024视频免费在线观看| 一边摸一边做爽爽视频免费| 亚洲欧美一区二区三区黑人 | 亚洲欧美一区二区三区黑人 | 岛国毛片在线播放| 国产精品一区二区在线不卡| kizo精华| 搡老乐熟女国产| 免费少妇av软件| 色婷婷av一区二区三区视频| 香蕉国产在线看| 看免费成人av毛片| 久久99一区二区三区| av免费观看日本| av女优亚洲男人天堂| av有码第一页| 黑人欧美特级aaaaaa片| 精品一品国产午夜福利视频| 日韩免费高清中文字幕av| 黑人欧美特级aaaaaa片| 老汉色∧v一级毛片| 永久网站在线| 成人漫画全彩无遮挡| 亚洲少妇的诱惑av| 国产女主播在线喷水免费视频网站| 久久精品久久精品一区二区三区| 日韩制服丝袜自拍偷拍| 亚洲精品日韩在线中文字幕| 免费高清在线观看视频在线观看| 国产高清国产精品国产三级| av不卡在线播放| 亚洲国产日韩一区二区| 久久人妻熟女aⅴ| 综合色丁香网| 亚洲美女搞黄在线观看| 男女啪啪激烈高潮av片| 久久综合国产亚洲精品| 少妇精品久久久久久久| 汤姆久久久久久久影院中文字幕| av电影中文网址| 尾随美女入室| 大片电影免费在线观看免费| 久久久久国产精品人妻一区二区| 久久久久久久久久人人人人人人| 国产亚洲欧美精品永久| 少妇 在线观看| 岛国毛片在线播放| 国产精品免费大片| 狠狠精品人妻久久久久久综合| 久久国产精品大桥未久av| 亚洲综合色网址| 91成人精品电影| 日韩av免费高清视频| 18+在线观看网站| 色视频在线一区二区三区| 成人亚洲精品一区在线观看| av卡一久久| 国产av码专区亚洲av| 久久国产亚洲av麻豆专区| 中文字幕另类日韩欧美亚洲嫩草| 国产av国产精品国产| 久久av网站| 久久久精品免费免费高清| 国产国语露脸激情在线看| 国产野战对白在线观看| 亚洲国产欧美在线一区| 国产淫语在线视频| 精品久久蜜臀av无| 亚洲精华国产精华液的使用体验| 免费观看无遮挡的男女| 蜜桃在线观看..| 免费高清在线观看日韩| 午夜福利视频在线观看免费| 寂寞人妻少妇视频99o| 欧美中文综合在线视频| 亚洲欧美精品综合一区二区三区 | 免费在线观看视频国产中文字幕亚洲 | 精品人妻熟女毛片av久久网站| 精品一区在线观看国产| 一级爰片在线观看| 伦理电影免费视频| 国产一区二区激情短视频 | 成人午夜精彩视频在线观看| 欧美精品国产亚洲| 国产淫语在线视频| 国产亚洲午夜精品一区二区久久| 老汉色av国产亚洲站长工具| 精品国产国语对白av| 久久久国产精品麻豆| 在现免费观看毛片| 欧美精品一区二区大全| 另类精品久久| 亚洲一区二区三区欧美精品| 韩国精品一区二区三区| 日韩av免费高清视频| 亚洲三级黄色毛片| 日本爱情动作片www.在线观看| 精品人妻熟女毛片av久久网站| 黄色怎么调成土黄色| 99国产综合亚洲精品| 午夜91福利影院| 天天躁夜夜躁狠狠久久av| 99久国产av精品国产电影| 国产精品偷伦视频观看了| 十八禁高潮呻吟视频| 日韩一卡2卡3卡4卡2021年| 午夜免费观看性视频| 国产精品三级大全| 女性生殖器流出的白浆| 免费日韩欧美在线观看| 人成视频在线观看免费观看| 999精品在线视频| 日本vs欧美在线观看视频| 亚洲欧美色中文字幕在线| 久久热在线av| 国产毛片在线视频| 免费观看性生交大片5| 日韩在线高清观看一区二区三区| 男女国产视频网站| 中文字幕人妻丝袜一区二区 | 国产精品国产三级国产专区5o| 美女主播在线视频| 亚洲精品国产av蜜桃| 777米奇影视久久| 成年动漫av网址| 免费观看性生交大片5| 国产av码专区亚洲av| 国产片特级美女逼逼视频| 亚洲色图 男人天堂 中文字幕| 欧美亚洲日本最大视频资源| 成年女人毛片免费观看观看9 | 成人手机av| 精品亚洲乱码少妇综合久久| 国产精品亚洲av一区麻豆 | 国产免费现黄频在线看| 9热在线视频观看99| 寂寞人妻少妇视频99o| 美女视频免费永久观看网站| 欧美日韩一级在线毛片| 欧美av亚洲av综合av国产av | 午夜91福利影院| 日韩av在线免费看完整版不卡| 狂野欧美激情性bbbbbb| 精品久久久久久电影网| 十八禁高潮呻吟视频| 久久久久国产一级毛片高清牌| 十八禁网站网址无遮挡| 啦啦啦视频在线资源免费观看| 母亲3免费完整高清在线观看 | 成人亚洲精品一区在线观看| 国产日韩一区二区三区精品不卡| 大陆偷拍与自拍| 少妇熟女欧美另类| 日本av免费视频播放| 亚洲国产毛片av蜜桃av| 欧美日韩亚洲国产一区二区在线观看 | 欧美日韩精品成人综合77777| 丝袜在线中文字幕| 免费高清在线观看视频在线观看| 麻豆精品久久久久久蜜桃| 久久久久久久久久久久大奶| av不卡在线播放| 欧美最新免费一区二区三区| 中文字幕精品免费在线观看视频| 精品国产一区二区三区久久久樱花| 亚洲av免费高清在线观看| 色94色欧美一区二区| av国产久精品久网站免费入址| 欧美激情 高清一区二区三区| 国产亚洲最大av| 秋霞伦理黄片| 亚洲欧洲日产国产| av在线app专区| 一本色道久久久久久精品综合| 婷婷成人精品国产| 大话2 男鬼变身卡| www日本在线高清视频| 亚洲人成77777在线视频| 在线观看免费高清a一片| 1024香蕉在线观看| 色吧在线观看| 亚洲国产成人一精品久久久| 久久久国产精品麻豆| 欧美精品av麻豆av| 成年av动漫网址| 美女国产视频在线观看| 久久精品国产鲁丝片午夜精品| 2022亚洲国产成人精品| 91精品伊人久久大香线蕉| 免费看不卡的av| 欧美日韩一级在线毛片| 欧美国产精品va在线观看不卡| 90打野战视频偷拍视频| 免费久久久久久久精品成人欧美视频| 久久久久久久亚洲中文字幕| 亚洲av成人精品一二三区| 国产一级毛片在线| 久久免费观看电影| 最近2019中文字幕mv第一页| 欧美xxⅹ黑人| 亚洲欧美精品综合一区二区三区 | 精品国产一区二区三区久久久樱花| 午夜日韩欧美国产| 18禁动态无遮挡网站| 最近中文字幕2019免费版| 亚洲色图综合在线观看| 国产成人精品福利久久| 亚洲国产最新在线播放| 丝袜美足系列| 99国产综合亚洲精品| 春色校园在线视频观看| 日韩av不卡免费在线播放| 亚洲精品日本国产第一区| 亚洲精品自拍成人| 午夜福利影视在线免费观看| 亚洲第一青青草原| 国产亚洲最大av|