Characteristics of fault zones and their control on remaining oil distribution at the fault edge: a case study from the northern Xingshugang Anticline in the Daqing Oilfield,China

Most major oil zones in the Daqing Oilfield have reached a later, high water cut stage, but oil recovery is still only approximately 35 %, and 50 % of reserves remain to be recovered. The remaining oil is primarily distributed at the edge of faults, in poor sand bodies, and in insufficiently injected and produced areas. Therefore, the edge of faults is a major target for remaining oil enrichment and potential tapping. Based on the dynamic change of production from development wells determined by the injection–recovery relationship at the edge of faults, we analyzed the control of structural features of faults on remaining oil enrichment at the edge. Our results show that the macroscopic structural features and their geometric relationship with sand bodies controlled remaining oil enrichment zones like the edges of NNE-striking faults, the footwalls of antithetic faults, the hard linkage segments (two faults had linked together with each other to form a bigger through-going fault), the tips of faults, and the oblique anticlines of soft linkages. Fault edges formed two types of forward microamplitude structures: (1) the tilted uplift of footwalls controlled by inverse fault sections and (2) the hanging-wall horizontal anticlines controlled by synthetic fault points. The remaining oil distribution was controlled by microamplitude structures. Consequently, such zones as the tilted uplift of the footwall of the NNW-striking antithetic faults with a fault throw larger than 40 m, the hard linkage segments, the tips of faults, and the oblique anticlines of soft linkage were favorable for tapping the remaining oil potential. Multi-target directional drilling was used for remaining oil development at fault edges. Reasonable fault spacing was determined on the basis of fault combinations and width of the shattered zone. Well core and log data revealed that the width of the shattered zone on the side of the fault core was less than 15 m in general; therefore, the distance from a fault to the development target should be larger than 15 m. Vertically segmented growth faults should take the separation of the lateral overlap of faults into account. Therefore, the safe distance of remaining oil well deployment at the fault edge should be larger than the sum of the width of shattered zone in faults and the separation of growth faults by vertical segmentation.     

Image segmentation by a contrario simulation

Segmenting an image into homogeneous regions generally involves a decision criterion to establish whether two adjacent regions are similar. Decisions should be adaptive to get robust and accurate segmentation algorithms, avoid hazardous a priori and have a clear interpretation. We propose a decision process based on a contrario reasoning: two regions are meaningfully different if the probability of observing such a difference in pure noise is very low. Since the existing analytical methods are intractable in our case, we extend them to allow a mixed use of analytical computations and Monte-Carlo simulations. The resulting decision criterion is tested experimentally through a simple merging algorithm, which can be used as a post-filtering and validation step for existing segmentation methods.     

A multidimensional segmentation evaluation for medical image data

Evaluation of segmentation methods is a crucial aspect in image processing, especially in the medical imaging field, where small differences between segmented regions in the anatomy can be of paramount importance. Usually, segmentation evaluation is based on a measure that depends on the number of segmented voxels inside and outside of some reference regions that are called gold standards. Although some other measures have been also used, in this work we propose a set of new similarity measures, based on different features, such as the location and intensity values of the misclassified voxels, and the connectivity and the boundaries of the segmented data. Using the multidimensional information provided by these measures, we propose a new evaluation method whose results are visualized applying a Principal Component Analysis of the data, obtaining a simplified graphical method to compare different segmentation results. We have carried out an intensive study using several classic segmentation methods applied to a set of MRI simulated data of the brain with several noise and RF inhomogeneity levels, and also to real data, showing that the new measures proposed here and the results that we have obtained from the multidimensional evaluation, improve the robustness of the evaluation and provides better understanding about the difference between segmentation methods.     

Seeing the Objects Behind the Dots: Recognition in Videos from a Moving Camera

Category-level object recognition, segmentation, and tracking in videos becomes highly challenging when applied to sequences from a hand-held camera that features extensive motion and zooming. An additional challenge is then to develop a fully automatic video analysis system that works without manual initialization of a tracker or other human intervention, both during training and during recognition, despite background clutter and other distracting objects. Moreover, our working hypothesis states that category-level recognition is possible based only on an erratic, flickering pattern of interest point locations without extracting additional features. Compositions of these points are then tracked individually by estimating a parametric motion model. Groups of compositions segment a video frame into the various objects that are present and into background clutter. Objects can then be recognized and tracked based on the motion of their compositions and on the shape they form. Finally, the combination of this flow-based representation with an appearance-based one is investigated. Besides evaluating the approach on a challenging video categorization database with significant camera motion and clutter, we also demonstrate that it generalizes to action recognition in a natural way. Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users. This work was supported in part by the Swiss national science foundation under contract no. 200021-107636.     

一种车牌自动识别系统设计方法

通过对连续视频流分析的方法判断并捕获车牌图像帧;基于数学形态学方法和边缘特征分析来进行车牌定位,进行二值化、引入多指标联合评价函数判断反色等处理;最后基于连通体分析的方法切分字符。实验表明本系统设计方法是可行的。     

Hypergraph imaging: an overview

Hypergraph theory as originally developed by Berge (Hypergraphe, Dunod, Paris, 1987) is a theory of finite combinatorial sets, modeling lot of problems of operational research and combinatorial optimization. This framework turns out to be very interesting for many other applications, in particular for computer vision. In this paper, we are going to survey the relationship between combinatorial sets and image processing. More precisely, we propose an overview of different applications from image hypergraph models to image analysis. It mainly focuses on the combinatorial representation of an image and shows the effectiveness of this approach to low level image processing; in particular to segmentation, edge detection and noise cancellation.     

A segmentation approach for file broadcast scheduling

We study the broadcast scheduling problem in which clients send their requests to a server in order to receive some files available on the server. The server may be scheduled in a way that several requests are satisfied in one broadcast. When files are transmitted over computer networks, broadcasting the files by fragmenting them provides flexibility in broadcast scheduling that allows the optimization of per user response time. The broadcast scheduling algorithm, then, is in charge of determining the number of segments of each file and their order of transmission in each round of transmission. In this paper, we obtain a closed form approximation formula which approximates the optimal number of segments for each file, aiming at minimizing the total response time of requests. The obtained formula is a function of different parameters including those of underlying network as well as those of requests arrived at the server. Based on the obtained approximation formula we propose an algorithm for file broadcast scheduling which leads to total response time which closely conforms to the optimum one. We use extensive simulation and numerical study in order to evaluate the proposed algorithm which reveals high accuracy of obtained analytical approximation. We also investigate the impact of various headers that different network protocols add to each file segment. Our segmentation approach is examined for scenarios with different file sizes at the range of 100 KB to 1 GB. Our results show that for this range of file sizes the segmentation approach shows on average 13% tolerance from that of optimum in terms of total response time and the accuracy of the proposed approach is growing by increasing file size. Besides, using proposed segmentation in this work leads to a high Goodput of the scheduling algorithm.     

Systematic review on privacy categorisation

In the modern digital world users need to make privacy and security choices that have far-reaching consequences. Researchers are increasingly studying people’s decisions when facing with privacy and security trade-offs, the pressing and time consuming disincentives that influence those decisions, and methods to mitigate them. This work aims to present a systematic review of the literature on privacy categorisation, which has been defined in terms of profile, profiling, segmentation, clustering and personae. Privacy categorisation involves the possibility to classify users according to specific prerequisites, such as their ability to manage privacy issues, or in terms of which type of and how many personal information they decide or do not decide to disclose. Privacy categorisation has been defined and used for different purposes. The systematic review focuses on three main research questions that investigate the study contexts, i.e. the motivations and research questions, that propose privacy categorisations; the methodologies and results of privacy categorisations; the evolution of privacy categorisations over time. Ultimately it tries to provide an answer whether privacy categorisation as a research attempt is still meaningful and may have a future.     

图像处理中关于汉字粘连字符的分割的背景算法

本文提出了一种基于汉字结构特征的手写体汉字字符切分算法。根据两个组件之间的上下、左右和包围关系,对组件进行合并形成完整的汉字图像。分析整个汉字字符串中组件的宽度和相邻组件的间距,形成字符串的特征估计,指导左右关系组件的合并。     

基于SVM的花岗岩薄片图像石英分割方法研究

花岗岩薄片不同矿物成分在图像中可能存在相同灰度分布甚至相似纹理。通过结合正交偏光镜镜下图片干涉色信息和单偏光镜图片信息分析,提高了花岗岩薄片石英分割的准确率。方法是从单偏光镜和正交偏光镜下图片中提取图像块的特征信息,运用支持向量机分类方法对图像块进行分类,在分类为石英的图像块中选取种子,再根据两张图片信息,用区域生长方法完成石英分割。该方法实现了自动化分割,分割准确率高,实验证明该方法切实可行。