text:
FREEDOM'S STAND
High Line Plinth Proposal 2020
Freedom's Stand pays homage to the role of black newspapers while drawing inspiration from other influential community driven work like Chicago's Wall of Respect and the Community Mural Movement. Freedom's Stand takes its name from the Freedom's Journal. Founded in New York City in 1827, it is credited as being the first black owned and operated newspaper. At the time, Freedom's Journal provided a counter narrative to other New York newspapers that attacked African-Americans and encouraged slavery but it was also utilitarian as the founders wanted to help raise the literacy rate of free blacks across the United States
CHICAGO GRID
Kornfeld Galerie, 2019
Chicago Grid, the group show hosted by Jan Tichy in Project Space 68projects, brings together artists and teachers who have previously worked with Tichy and come from both sides of this education exchange. This exhibition questions the concept of the network in its manifold forms and meanings, an allusion to the Berlin Bauhaus writers, who were fascinated by the Chicago road network.
Hyde Park Art Center, 2018
Health Club presents work by Faheem Majeed along with artists: Nelly Agassi, Balas & Wax, Yane Calovski and Hristina Ivanoska, FieldWork, Charo Garaigorta, Kevin Miyazaki, and Bridget O'Gorman considering the interdependence of human wellness on constructed notions of place. Not in the obvious spots like the gym or the spa, but the seemingly benevolent locations like museums, hospitals, or parks, can we really examine how a society relies on the built environment to foster mental or physical health. Drawing, installation, painting, photography, and video included in the exhibition call attention to conflicting principles historically embedded in the architecture of such recreational places that nurture both public and private growth. As a result, we come to be more observant of the functions of these voluntary civic and leisure sites, how our bodies move through them, and question our role in realizing their intentions.
TUNED MASS
Chicago Cultural Center, 2018
Tuned Mass features "Board-up" and "Lean-to", the latest evolution of Faheem Majeed's Shacks and Shanties installation series. These current works speak to his interest in the signs of devaluing neighborhoods, the board-up initially serving to protect the investment of the house while serving as a clear notice of abandonment. The lean-to is the stripped-down form of the shack, the simplest form used for shelter and survival.
Andrew Rafacz Gallery, 2018
With his first commercial gallery exhibition in Chicago, Majeed presents two distinct bodies of work that are connected in their relationship to place and memory. For Majeed, "Impression" suggests a playful nod to the history of painting as well as the action that he takes as a core part of his practice. It also captures the ephemeral existence of his subject matter. Through the objects he makes, Majeed connects a rooted past to an often precarious present, creating a platform for the discussion of a more imminently possible future.
Cleave Carney Gallery, 2018
For "Unite," Majeed investigates how artists, objects, and cultural workers can hold differing notions of value to facilitate the creation of more equitable institutional structures in the arts [...] The works in "Unite" present a different arrangement of Majeed's ideas around value, structural systems, and equity. While the objects are still sculptural, they are now in a direct conversation with painting, in much the same way as Rauschenberg's Combines and similar hybrid works defy views of what objects might be deemed art and what materials might be used to.
Demise Shrouds
Referencing a previous series of work entitled Demise of the South Side Community Art Center (SSCAC), Demise Shroud is a 70' x 5' charcoal rubbing of the SSCAC's main gallery floors. The gallery, named after SSCAC founder Margaret Burroughs, is the centerpiece of the organization and has been the gathering place for thousands of artists and community members since 1938. In this regard, the floors have become a didactic instrument. The muslin and charcoal reference the capturing of tombstone engravings, exploring involuntary death or destruction, what it means to destroy and what can be lost or gained from destruction. The piece seeks to both memorialize history while providing an intimate critique on the survival of culturally specific institutions.
Fields of Our Fathers
I was invited to do an installation for part of Wormfarm's Fermentation Festival. After spending some time with the farmers and landowners, listening to them talk about their families' land, I was struck by the history and invisible boundaries this land carried, about the dimensions of history embedded in the dirt, and extended out into this space that blurred convoluted red tape and land laws with memory, with family history.
Museum of Contemporary Art: Faheem Majeed
Museum of Contemporary Art, 2015
In addition to presenting sculptural works and a room-sized installation, Majeed invites collaborators to activate the space through events and performances. In this way, the exhibition presents a plurality of voices, cultural perspectives, and art-making strategies that develop and expand organically, accumulating and metabolizing different materials and visitors' experiences. Even if only temporarily, the exhibition becomes a microcosm of the greater work the artist is doing, while also alluding and drawing attention to the work still to be done.
Shacks and Shanties
Installation spaces, ongoing, multiple locations
My intentions were to create visually engaging platforms for local concerns and initiatives. My hope was that the structures could create micro communities that could support each other's interest. I asked a diverse range of artists and organizations to engage with the structures in order to bring local and broader attention to important ideas.
Planting and Maintaining a Perennial Garden
Ongoing installation, multiple locations
Planting and Maintaining a Perennial Garden is a part of an ongoing series of work that utilizes cedar wood panels to host a variety of interventions. Reusing the cedar creates a layered history of all the previous locations and interventions, bringing them to each new setting and use.
www.faheemmajeed.com


text:
GeoSpock expands footprint in Asia with new offices in Singapore and Tokyo
By IBTimes SG Desk
June 19, 2019 09:44 +08
Singapore city Reuters
GeoSpock, the extreme-scale spatial big data integration company, has announced it is building on strong global growth with the opening of two new offices in Singapore and Japan. The offices will provide GeoSpock with a foothold to service clients in both regions, which include the Singapore Land Authority and X-locations, a Japanese-based artificial intelligence (AI) platform.
GeoSpock's expansion into Asia will see the company further deepen its existing partnerships and identify new opportunities for growth within smart cities, Internet of Things (IoT), enterprise, asset and logistics. Singapore will operate as the company's Asian headquarters and support GeoSpock in responding to the rapid growth in demand for robust data infrastructures that can support innovation.
"The world's population is set to grow by 2.2 billion between now and 2050 with 60 per cent of the global population living in Asia. As a result, we anticipate this is where we will see the largest growth in the Internet of Things and its associated sensors," commented Richard Baker, CEO of GeoSpock.
"However, to prepare for an increasingly connected world, organisations need a platform that can uncover insights within data to inform business decisions. As part of our expansion into Asia, we will use our expertise to support geospatial initiatives and the advancement of IoT technologies."
To drive GeoSpock's growth, Sean Kim has been appointed as Vice President of Asia and will be responsible for growing brand advocacy and revenues. Sean Kim is an experienced industry sales leader with nearly 30 years' experience in launching and expanding technology businesses in the Asia-Pacific including companies such as AirTies, Technicolor, ANT and Nagravision.
Sean Kim will be supported by the appointment of John Yam who will lead the Singapore office and Motohiro Watanbe who will manage the office in Japan. To help drive its ambition to become the leader in spatial big data management and analytics in the region, GeoSpock plans to add up to 30 people in commercial, technical and data science roles in Asia over the next two years.
"Across Asia, developments in infrastructure and smart cities are driving the need for access to dynamic contextual data. GeoSpock's technology is at the cutting edge of spatial big data and meets this demand," concluded Sean Kim, VP of Asia. "This role provides me with an exciting opportunity to play a unique role in supporting the company's continued expansion and I expect GeoSpock to contribute hugely to the geospatial market both in Asia and around the world."
Singapore's Sembcorp defers India energy IPO to inject capital
ERA Realty Network strengthens all-round research capabilities
Salesforce research reveals Singaporeans want connected, multi-channel engagement with companies

redpajama_set_name: RedPajamaCommonCrawl


text:
Koźle – wieś w Polsce położona w województwie łódzkim, w powiecie zgierskim, w gminie Stryków.

Wieś mieści się na skrzyżowaniu dróg do Strykowa, Głowna, Bratoszewic.

Historia i zabytki
We wsi znajduje się drewniany kościół parafialny pw. św. Szczepana, zbudowany w 1752 r. Jest kościół o konstrukcji zrębowej, jednonawowy, z dachem krytym gontem. We wnętrzu znajdują się barokowe ołtarze z I poł. XVIII w. oraz interesujący żyrandol. Obok czworoboczna drewniana dzwonnica o konstrukcji słupowej, nakryta dachem namiotowym z XVIII w., przeniesiona na obecne miejsce w 1908 r.

Na początku XIX w. we wsi mieszkał Bernard von Schuttenbach – mierniczy, kartograf i architekt.

W czasie I wojny światowej i II wojny światowej w pobliżu wsi toczyły się bitwy, czego śladem są mogiły żołnierskie z obu tych okresów. W pobliżu drogi do Woli Błędowej napotkać można na pojedyncze mogiły żołnierzy rosyjskich i niemieckich z 1915 r., natomiast w samej wsi jest cmentarz wojenny żołnierzy polskich poległych tu w czasie bitwy nad Bzurą we wrześniu 1939 r.

12 lub 13 września wkraczający do wsi żołnierze Wehrmachtu dokonali zbrodni na ludności cywilnej. Zamordowali kilkanaście osób (8 ofiar zostało zidentyfikowanych).

W latach 1954–1972 wieś należała i była siedzibą władz gromady Koźle. W latach 1975–1998 miejscowość administracyjnie należała do ówczesnego województwa łódzkiego.

Zobacz też
 Koźle

Przypisy

redpajama_set_name: RedPajamaWikipedia


At Meats by Linz we understand that your menu goes well beyond beef and so do we. Lamb is a staple for many of our customers and we make sure the source of that product meets Linz standards. Whether you're looking for the unique sizes and flavors of Domestic, Australian, or New Zealand lamb, Meats by Linz has what you need.
Speak with your rep. today about bringing lamb on to your menu.
Some of our lamb vendors include Mountain States Rosen and Grove Meat Company, two names that have earned a name for quality products.
Chops, slices, loins, and more... Meats by Linz is your go to for all things veal. Light in color with a soft texture, the milk-fed veal we provide to our customers is of the highest quality and always satisfies. Whether you're looking for a traditional chop or an osso buco, we are here to help.
We proudly work with Provimi Foods and Strauss to bring our customers a full range of quality veal products.
Meats by Linz works with several different suppliers in order to offer a full range of poultry. Our customers will find everything available from turkey, duck, chicken, and specialty game products like pheasant.
We have partnered with multiple suppliers like Miller Poultry and Gerber Amish Farms to offer all natural, humanely raised poultry to our customers.
Maple Leaf is our tried and true supplier for duck and is often referred to as the standard. Please speak with your Meats by Linz represtantitve today for any questions about adding poultry to your menu.


Discussion in 'Seasoned Marijuana Users' started by tokerExtremist, May 13, 2003.
example, happends a lot when i'm listening too some tripy music.
hahahaha..man once i was so fried and i was at a friends house listenin to some lil wyte.. and i was just blazed out of mindddd. you could punch me in the face and i would be like "sup?????" and then my friend came over and was like drink this.. i didnt think about it at all i just drank it and then i was like "what is this " and he told me the 'community tea'.. however his community is like really ghetto and dangerous.. i dont remeber the rest of the weekend.. i just woke up sunday at like 4 in the afternoon wonderin what day it was.. kinda tempted to drug test myself to see if there was actually something in the drink or if i just passed out or something.


Beau Morgan has been in radio since 2008 and currently produces The Morning Show with John Fricke & Hugh Douglas. He's also advanced from producer of the Atlanta Falcons Radio Network in 2010 to Executive Producer, a position he's held since 2015. He started at 92-9 the Game in 2014.


text:
EP2874118B1 - Computing camera parameters - Google Patents
Computing camera parameters Download PDF
EP2874118B1 EP13306576.3A EP13306576A EP2874118B1 EP 2874118 B1 EP2874118 B1 EP 2874118B1 EP 13306576 A EP13306576 A EP 13306576A EP 2874118 B1 EP2874118 B1 EP 2874118B1
Eloi Mehr
Vincent Guitteny
Mourad Boufarguine
Dassault Systemes SE
2013-11-18 Application filed by Dassault Systemes SE filed Critical Dassault Systemes SE
2013-11-18 Priority to EP13306576.3A priority Critical patent/EP2874118B1/en
238000005457 optimization Methods 0 claims description 16
238000005259 measurements Methods 0 claims description 8
238000003860 storage Methods 0 claims description 7
230000001360 synchronised Effects 0 claims description 4
230000002776 aggregation Effects 0 claims description 3
238000004220 aggregation Methods 0 claims description 3
230000001965 increased Effects 0 claims description 3
238000004519 manufacturing process Methods 0 description 10
230000004438 eyesight Effects 0 description 2
230000003993 interaction Effects 0 description 2
238000004088 simulation Methods 0 description 2
206010003830 Automatism Diseases 0 description 1
101700082140 CLC2 family Proteins 0 description 1
210000002216 Heart Anatomy 0 description 1
230000001427 coherent Effects 0 description 1
230000010006 flight Effects 0 description 1
230000007274 generation of a signal involved in cell-cell signaling Effects 0 description 1
238000009499 grossing Methods 0 description 1
238000004080 punching Methods 0 description 1
238000004805 robotics Methods 0 description 1
G06F30/00—
G06T15/00—3D [Three Dimensional] image rendering
G06T15/04—Texture mapping
G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
G06T17/10—Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes
G06T7/70—Determining position or orientation of objects or cameras
G06T7/73—Determining position or orientation of objects or cameras using feature-based methods
G06T7/75—Determining position or orientation of objects or cameras using feature-based methods involving models
G06T7/80—Analysis of captured images to determine intrinsic or extrinsic camera parameters, i.e. camera calibration
G06T2200/00—Indexing scheme for image data processing or generation, in general
G06T2200/04—Indexing scheme for image data processing or generation, in general involving 3D image data
G06T2200/08—Indexing scheme for image data processing or generation, in general involving all processing steps from image acquisition to 3D model generation
G06T2207/10024—Color image
G06T2207/10028—Range image; Depth image; 3D point clouds
G06T2207/30244—Camera pose
The invention relates to the field of computer programs and systems, and more specifically to a method, system and program for designing a 3D modeled object representing a real object.
A number of systems and programs are offered on the market for the design, the engineering and the manufacturing of objects. CAD is an acronym for Computer-Aided Design, e.g. it relates to software solutions for designing an object. CAE is an acronym for Computer-Aided Engineering, e.g. it relates to software solutions for simulating the physical behavior of a future product. CAM is an acronym for Computer-Aided Manufacturing, e.g. it relates to software solutions for defining manufacturing processes and operations. In such computer-aided design systems, the graphical user interface plays an important role as regards the efficiency of the technique. These techniques may be embedded within Product Lifecycle Management (PLM) systems. PLM refers to a business strategy that helps companies to share product data, apply common processes, and leverage corporate knowledge for the development of products from conception to the end of their life, across the concept of extended enterprise.
The PLM solutions provided by Dassault Systemes (under the trademarks CATIA, ENOVIA and DELMIA) provide an Engineering Hub, which organizes product engineering knowledge, a Manufacturing Hub, which manages manufacturing engineering knowledge, and an Enterprise Hub which enables enterprise integrations and connections into both the Engineering and Manufacturing Hubs. All together the system delivers an open object model linking products, processes, resources to enable dynamic, knowledge-based product creation and decision support that drives optimized product definition, manufacturing preparation, production and service.
In this context, the field of computer vision and computer graphics offers technologies which are more and more useful. Indeed, this field has applications to 3D reconstruction, and all domains where it is necessary to precisely build a 3D scene with exact geometry using as input, for example, the information in a set of photographs. 3D reconstruction from video stream and photographs set analysis is addressed in two different approaches in the state of the art, depending on the type of sensors used for the input data.
The first approach uses "receiver" sensors. This notably concerns 3D reconstruction from RGB images analysis. Here, 3D reconstruction is obtained by multi-view analysis of RGB color information contained in each of the image planes. The following papers relate to this approach:
R. Hartley and A. Zisserman: Multiple View Geometry in Computer Vision, Cambridge Univ. Press 2004;
R. Szeliski: Computer Vision: Algorithms and Applications, Edition Springer 2010; and
O. Faugeras: Three-Dimensional Computer Vision: A Geometric viewpoint, MIT Press 1994.
The second approach uses "emitter-receiver" sensors. This notably concerns 3D reconstruction from RGB-Depth images analysis. This kind of sensors gives additional depth data to standard RGB data, and it is depth information that is mainly used in the reconstruction process. The following papers relate to this approach:
Yan Cui et al.: 3D Shape Scanning with a Time-of-Flight Camera, CVPR 2010;
RS. Izadi et al.: KinectFusion: Real-Time Dense Surface Mapping and Tracking, Symposium ISMAR 2011; and
R. Newcombe et al.: Live Dense Reconstruction with a Single Moving Kamera, IEEE ICCV2011.
Moreover, several academic and industrial players now offer software solutions for 3D reconstruction, by RGB image analysis, such as Acute3D, Autodesk, VisualSFM, or by RGB-Depth analysis, such as ReconstructMe or Microsoft's SDK for Kinect (registered trademarks).
Multi-view photogrammetry reconstruction methods use the sole information contained in the image plans of a video sequence (or a series of snapshots) in order to estimate 3D geometry of the scene. The matching of interest points between different ones of the 2D views yields the relative positions of the camera. An optimized triangulation is then used to compute the 3D points corresponding to the matching pair. Depth-map analysis reconstruction methods are based on disparity maps or approximated 3D point clouds. Those disparity maps are obtained using stereovision or structured light (see the 'Kinect' device for example) or 'Time of Flight' 3D-cameras. These state-of-the-art reconstruction methods then typically output a discrete 3D representation of the real object, most often a 3D mesh. The 3D model derives from the in fine volume closing off the resulting 3D point cloud.
A further step known from the prior art is to produce a texture for each polygon on the 3D mesh. In order to ensure photo-realism, prior art requires that the rendering use standard images from high-quality devices capturing the scene simultaneously. This is explained in the paper by T. Hanusch, A new texture mapping algorithm for photorealistic Reconstruction of 3D objects, in ISPRS journal of photogrammetry and remote sensing.
FIG. 1 illustrates a common approach used to texture a 3D model with a photograph, which is the well-known projective texture mapping method. This method is described for example in the paper by P. Debevec, C. Taylor and J. Malik, Modeling and Tendering Architecture atom Photographs: A hybrid geometry- and image-based approach, in SIGGRAPH 1996. This method uses image projection data associated to a 2D view (relative to the 3D model) to compute the mapping to the 3D model. FIG. 1 shows such a view-dependent 3D model texturing principle for 3D meshed model 102 and calibrated image 104: a projection texture mapping (represented by bundle 106, computed from camera projection matrix and departing from optical center 108) is used to estimate the texture coordinate for each triangle vertex.
Now, as illustrated on FIG. 2, the texturing quality by projection onto the 3D model is highly dependent on camera pose estimation. Indeed, FIG. 2 illustrates the 3D model texturing problematic: on the left, accurate calibration data allows coherent texturing 104 by projection on 3D model 102, whereas, on the right, inaccurate calibration data induces a drift in the projection of texturing 104 relative to 3D model 102. In other words, the estimation of camera rotation and translation at the time of the snapshot has a high impact on the final texturing. Obviously, any bias on the camera pose translates onto the re-projection and deteriorates the texturing process. Such a bias is usual particularly significant in the case of depth-map analysis methods. It generally originates from a shift in synchronizing between the depth sensor and the RGB sensor, corrupting the camera trajectory estimation. But it may also originate from an outside shot from an independent camera whose relative position to the 3D model cannot be estimated with sufficient accuracy because there is no rigid dependency to the depth sensor. "Simultaneous 2D images and 3D geometric model registratoin for texture mapping utilizing reflectance attribute" by Ryo Kurazume et al., ACCV 2002, discloses covering a 3D geometric model by texture based on registration using a 2D-3D edge correspondence approach.
Within this context, there is still a need for an improved solution for designing a 3D modeled object representing a real object.
The invention is therefore as defined by the appended claims. In particular there is provided a computer-implemented method for designing a 3D modeled object representing a real object as defined in claim 1. Summarily speaking, the method comprises the step of providing a 3D representation of the real object. The method also comprises the step of identifying occurrences of a geometric feature at 3D positions of the 3D representation. The method also comprises the step of providing at least one 2D view of the real object. The method also comprises the step of identifying occurrences of a graphic feature at 2D positions of the 2D view, the geometric feature corresponding to the graphic feature. The method also comprises the step of computing camera parameters that minimize a distance between a set of projections of the 3D positions on the 2D view and a set of 2D positions. Again summarily speaking, the method also relates to the following:
the geometric feature relates to the 3D curvature and the graphic feature relates to a pixel gradient, the 2D view being an image of the real object;
the geometric feature is a 3D curvature above a predetermined threshold and the graphic feature is a pixel gradient above a predetermined threshold;
the method further comprises determining a texture mapping between the 3D representation and the 2D view based on the computed camera parameters;
the identifying of occurrences of the graphic feature includes first applying a Gaussian blur on the 2D view;
the method further comprises, prior to the computing, filtering 3D positions of the 3D representation according to criteria evaluated according to a predetermined estimation of the camera parameters;
the criteria include visibility on the 2D view and/or distance of the projection with borders of the 2D view;
the identifying of occurrences of the graphic feature is iterated, with an increasing number of occurrences of the graphic feature at each iteration, and the computing of camera parameters includes an iterative optimization algorithm;
the identifying of occurrences of the graphic feature is iterated over resized versions of the 2D view, that are ordered from the smallest to the largest;
the intrinsic camera parameters are predetermined, the computed camera parameters thereby being the extrinsic camera parameters;
providing the 3D representation of the real object comprises reconstructing the 3D representation from measurements of at least one depth sensor; and/or
the 2D view is an image captured by a high resolution camera and/or by a camera synchronous to the depth sensor.
It is further provided a computer program comprising instructions for performing the method.
It is further provided a computer readable storage medium having recorded thereon the computer program.
It is further provided a system comprising a processor coupled to a memory and a graphical user interface, the memory having recorded thereon the computer program.
Embodiments of the invention, whose scope is only limited by the appended claims, will now be described, by way of non-limiting example, and in reference to the accompanying drawings, where:
FIGS. 1-2 illustrate the prior art;
FIG. 3 shows a flowchart of an example of the method;
FIG. 4 shows an example of a graphical user interface of the system;
FIG. 5 shows an example of the system; and
FIGS. 6-11 illustrate an example of the method.
With reference to the flowchart of FIG. 3, it is proposed a computer-implemented method for designing a 3D modeled object. The 3D modeled object designed by the method represents a real object. The method comprises the step of providing S10 a 3D representation of the real object. The method also comprises the step of identifying S20 occurrences of a geometric feature at 3D positions of the 3D representation. The method also comprises the step of providing S30 at least one 2D view of the real object. The method also comprises identifying S40 occurrences of a graphic feature at 2D positions of the 2D view. The geometric feature corresponds to the graphic feature. The method eventually comprises computing S50 camera parameters that minimize a distance between a set of projections of the 3D positions on the 2D view and a set of 2D positions. Such a method improves the design of a 3D modeled object representing a real object.
Notably, the method respectively identifies at S20 and S40 occurrences of a geometric feature (in 3D) and of a graphic feature (in 2D) that correspond to each other, respectively in terms of 3D positions and 2D positions. Said correspondence information is then used to compute at S50 camera parameters. Indeed, the camera parameters are computed such that they minimize a distance between a set of projections of (at least some of) the 3D positions and a set of (at least some of the) 2D positions. The projections of the 3D positions depend on the camera parameters, the latter being thereby involved as an argument of an optimization problem. The method indeed solves an optimization problem which captures the predetermined constraint that the geometric feature corresponds to the graphic feature. Said constraint is known beforehand, and the method applies this knowledge to the provided geometry. As for the implementation, specifically, the method identifies occurrences of said geometric and graphic features and describes said occurrences in terms of 3D and 2D positions to later simply minimize a distance. Therefore, the method makes use of geometric information contained in the 3D representation, of graphic information contained in the 2D view, and of their correspondence, in order to compute camera parameters, relatively accurately and fast. The camera parameters may then be used for different applications involving the 2D view, and also possibly the 3D representation, including texturing the 3D representation according to the 2D view. Thanks to the method providing relatively accurate camera parameters, these applications are performed relatively accurately.
The method is computer-implemented. This means that the steps (or substantially all the steps) of the method are executed by at least one computer, or any system alike. Thus, steps of the method are performed by the computer, possibly fully automatically, or, semi-automatically. In examples, the triggering of at least some of the steps of the method may be performed through user-computer interaction. The level of user-computer interaction required may depend on the level of automatism foreseen and put in balance with the need to implement the user's wishes. In examples, this level may be user-defined and/or pre-defined. For instance, the step of identifying S20 and/or the step of identifying S40 may fully automatic, as discussed later, but they may alternatively involve some manual user-interaction. The user may indeed directly identify/add occurrences of geometric features and/or graphic features on the 3D representation and/or the 2D view.
A typical example of computer-implementation of the method is to perform the method with a system adapted for this purpose. The system may comprise a processor coupled to a memory and a graphical user interface (GUI), the memory having recorded thereon a computer program comprising instructions for performing the method. The memory may also store a database. The memory is any hardware adapted for such storage, possibly comprising several physical distinct parts (e.g. one for the program, and possibly one for the database).
The method generally manipulates modeled objects. A modeled object is any object defined by data stored in the database. By extension, the expression "modeled object" designates the data itself. According to the type of the system, the modeled objects may be defined by different kinds of data. The system may indeed be any combination of a CAD system, a CAE system, a CAM system, a PDM system and/or a PLM system. In those different systems, modeled objects are defined by corresponding data. One may accordingly speak of CAD object, PLM object, PDM object, CAE object, CAM object, CAD data, PLM data, PDM data, CAM data, CAE data. However, these systems are not exclusive one of the other, as a modeled object may be defined by data corresponding to any combination of these systems. A system may thus well be both a CAD and PLM system, as will be apparent from the definitions of such systems provided below.
By CAD system, it is meant any system adapted at least for designing a modeled object on the basis of a graphical representation of the modeled object, such as CATIA. In this case, the data defining a modeled object comprise data allowing the representation of the modeled object. A CAD system may for example provide a representation of CAD modeled objects using edges or lines, in certain cases with faces or surfaces. Lines, edges, or surfaces may be represented in various manners, e.g. non-uniform rational B-splines (NURBS). Specifically, a CAD file contains specifications, from which geometry may be generated, which in turn allows for a representation to be generated. Specifications of a modeled object may be stored in a single CAD file or multiple ones. The typical size of a file representing a modeled object in a CAD system is in the range of one Megabyte per part. And a modeled object may typically be an assembly of thousands of parts.
In the context of CAD, a modeled object may typically be a 3D modeled object, e.g. representing a real object such as a product such as a part or an assembly of parts, or possibly an assembly of products. By "3D modeled object", it is meant any object which is modeled by data allowing at least its 3D representation (the 3D representation in the case of the method). A 3D representation allows the viewing of the part from all angles. For example, the 3D representation may be handled and turned around any of its axes, or around any axis in the screen on which the representation is displayed. This notably excludes 2D icons, which are not 3D modeled. The display of a 3D representation facilitates design (i.e. increases the speed at which designers statistically accomplish their task). This speeds up the manufacturing process in the industry, as the design of the products is part of the manufacturing process.
By PLM system, it is meant any system adapted for the management of a modeled object representing a physical manufactured product. In a PLM system, a modeled object is thus defined by data suitable for the manufacturing of a physical object. These may typically be dimension values and/or tolerance values. For a correct manufacturing of an object, it is indeed better to have such values.
CAM stands for Computer-Aided Manufacturing. By CAM solution, it is meant any solution, software of hardware, adapted for managing the manufacturing data of a product. The manufacturing data generally includes data related to the product to manufacture, the manufacturing process and the required resources. A CAM solution is used to plan and optimize the whole manufacturing process of a product. For instance, it can provide the CAM users with information on the feasibility, the duration of a manufacturing process or the number of resources, such as specific robots, that may be used at a specific step of the manufacturing process; and thus allowing decision on management or required investment. CAM is a subsequent process after a CAD process and potential CAE process. Such CAM solutions are provided by Dassault Systèmes under the trademark DELMIA®.
CAE stands for Computer-Aided Engineering. By CAE solution, it is meant any solution, software of hardware, adapted for the analysis of the physical behavior of modeled object. A well-known and widely used CAE technique is the Finite Element Method (FEM) which typically involves a division of a modeled objet into elements which physical behaviors can be computed and simulated through equations. Such CAE solutions are provided by Dassault Systèmes under the trademark SIMULIA®. Another growing CAE technique involves the modeling and analysis of complex systems composed a plurality components from different fields of physics without CAD geometry data. CAE solutions allows the simulation and thus the optimization, the improvement and the validation of products to manufacture. Such CAE solutions are provided by Dassault Systèmes under the trademark DYMOLA®.
PDM stands for Product Data Management. By PDM solution, it is meant any solution, software of hardware, adapted for managing all types of data related to a particular product. A PDM solution may be used by all actors involved in the lifecycle of a product: primarily engineers but also including project managers, finance people, sales people and buyers. A PDM solution is generally based on a product-oriented database. It allows the actors to share consistent data on their products and therefore prevents actors from using divergent data. Such PDM solutions are provided by Dassault Systèmes under the trademark ENOVIA®.
FIG. 4 shows an example of the GUI of the system, wherein the system is a CAD system.
The GUI 2100 may be a typical CAD-like interface, having standard menu bars 2110, 2120, as well as bottom and side toolbars 2140, 2150. Such menu- and toolbars contain a set of user-selectable icons, each icon being associated with one or more operations or functions, as known in the art. Some of these icons are associated with software tools, adapted for editing and/or working on the 3D modeled object 2000 displayed in the GUI 2100. The software tools may be grouped into workbenches. Each workbench comprises a subset of software tools. In particular, one of the workbenches is an edition workbench, suitable for editing geometrical features of the modeled product 2000. In operation, a designer may for example pre-select a part of the object 2000 and then initiate an operation (e.g. change the dimension, color, etc.) or edit geometrical constraints by selecting an appropriate icon. For example, typical CAD operations are the modeling of the punching or the folding of the 3D modeled object displayed on the screen.
The GUI may for example display data 2500 related to the displayed product 2000. In the example of FIG. 2, the data 2500, displayed as a "feature tree", and their 3D representation 2000 pertain to a brake assembly including brake caliper and disc. The GUI may further show various types of graphic tools 2130, 2070, 2080 for example for facilitating 3D orientation of the object, for triggering a simulation of an operation of an edited product or render various attributes of the displayed product 2000. A cursor 2060 may be controlled by a haptic device to allow the user to interact with the graphic tools.
FIG. 5 shows an example of the system, wherein the system is a client computer system, e.g. a workstation of a user.
The client computer of the example comprises a central processing unit (CPU) 1010 connected to an internal communication BUS 1000, a random access memory (RAM) 1070 also connected to the BUS. The client computer is further provided with a graphical processing unit (GPU) 1110 which is associated with a video random access memory 1100 connected to the BUS. Video RAM 1100 is also known in the art as frame buffer. A mass storage device controller 1020 manages accesses to a mass memory device, such as hard drive 1030. Mass memory devices suitable for tangibly embodying computer program instructions and data include all forms of nonvolatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks 1040. Any of the foregoing may be supplemented by, or incorporated in, specially designed ASICs (application-specific integrated circuits). A network adapter 1050 manages accesses to a network 1060. The client computer may also include a haptic device 1090 such as cursor control device, a keyboard or the like. A cursor control device is used in the client computer to permit the user to selectively position a cursor at any desired location on display 1080. In addition, the cursor control device allows the user to select various commands, and input control signals. The cursor control device includes a number of signal generation devices for input control signals to system. Typically, a cursor control device may be a mouse, the button of the mouse being used to generate the signals. Alternatively or additionally, the client computer system may comprise a sensitive pad, and/or a sensitive screen.
The computer program may comprise instructions executable by a computer, the instructions comprising means for causing the above system to perform the method. The program may be recordable on any data storage medium, including the memory of the system. The program may for example be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The program may be implemented as an apparatus, for example a product tangibly embodied in a machine-readable storage device for execution by a programmable processor. Method steps may be performed by a programmable processor executing a program of instructions to perform functions of the method by operating on input data and generating output. The processor may thus be programmable and coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. The application program may be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired. In any case, the language may be a compiled or interpreted language. The program may be a full installation program or an update program. Application of the program on the system results in any case in instructions for performing the method.
"Designing a 3D modeled object" designates any action or series of actions which is at least part of a process of elaborating a 3D modeled object. Thus, the method may comprise creating the 3D modeled object from scratch. Alternatively, the method may comprise providing a 3D modeled object previously created, and then modifying the 3D modeled object.
The method may be included in a manufacturing process, which may comprise, after performing the method, producing a physical product corresponding to the modeled object. In any case, the modeled object designed by the method may represent a manufacturing object. The modeled object may thus be a modeled solid (i.e. a modeled object that represents a solid). The manufacturing object may be a product, such as a part, or an assembly of parts. Because the method improves the design of the modeled object, the method also improves the manufacturing of a product and thus increases productivity of the manufacturing process.
The providing S10 of a 3D representation of the real object is now discussed.
As known from the prior art, a real object may be represented by a CAD system in 3D with different data structures that correspond to different geometries. In the case of the method, the 3D representation (which may also be called "3D model" in the following) provided at S10 may be any representation, including discrete representations or parameterized representations.
A discrete representation is defined referring to the fact that such a representation describes a 3D modeled object as a discrete aggregation of geometrical components that locally represent the geometry (e.g. the surface) describing the object. This aggregation provides a comprehensive description of the object, meaning than no other data or little other data is needed. Typically, a discrete 3D representation may be any or a combination of a point cloud, a mesh, a depth map and/or an implicit function, that describe the 3D modeled object as an outer surface and/or as a solid. These representations are well known from the prior art.
Prior art 3D reconstruction techniques provide such a discrete 3D representation, as known. Examples of such techniques generally include performing measurements on a real object with sensors, and inferring the discrete 3D representation from the measurements. The technique may be structure from motion analysis, meaning that multi-view images of the real object are captured to infer the discrete 3D representation via a mathematical model. The first approach (only RGB data) and the second approach (RGB and depth data) presented in the prior art constitute structure from motion analysis foreseen for the method. The discrete 3D representation may also be obtained by laser triangulation, and/or acoustic propagation analysis, combinations of different techniques being also foreseen.
In the case of a structure from motion analysis consisting of 3D Reconstruction from RGB images, the method may comprise matching interest 2D points between images. Then the method may calibrate the cameras, e.g. by estimating the position relative to the observed scene (extrinsic calibration) and estimate physical parameters of the sensors (e.g. focal, distortion- intrinsic calibration). Then the method may triangulate the match point with calibration data to estimate 3D positions (e.g. point cloud generation). Then the method may build a 3D mesh model from all 3D triangulated points, thereby reaching the discrete 3D representation. Reference is made to previously cited papers Hartley and Zisserman, Szeliski, and Faugeras for details on the above steps.
In the case of a structure from motion analysis consisting of 3D Reconstruction from RGB-Depth, the method may mainly use depth images (i.e. image that contains disparity information for each pixel). The method may first build the 3D scene from a first depth image (i.e. 3D point cloud generation from disparity values). The method may then, for each new depth image, estimate extrinsic camera calibration (e.g. -rotation and translation- of camera from previous point of view) . The method may update the global 3D point cloud. The method may finally generate a 3D mesh model from point cloud analysis, thereby reaching the discrete 3D representation. Reference is made to previously cited papers Cui et al. and Newcombe et al. for details on the above steps.
The providing S10 may thus result from applying such a technique, within the method or prior to the method. The system may thus comprise at least one sensor coupled to the processor to provide sensing measurements, the system comprising instructions in its programs to determine the discrete 3D representation according to the measurements. Preferably, the system comprises at least one depth sensor, such that the method may perform depth measurements that output a relatively accurate 3D representation of the real object. This is known from the prior art, as discussed earlier.
Alternatively, the 3D representation may be a parametric representation. A parameterized representation is defined referring to the fact that such a representation describes a 3D modeled object as a parameterized function that outputs the geometry (e.g. the surface) describing the object when entering parameter values chosen in a predetermined domain. An example of a parameterized representation is a set of parametric 3D curves to represent the real object. Such a representation may actually be derived from a discrete representation as the ones discussed above.
Indeed, the parameterized representation may for example be obtained by a process that comprises the step of providing a discrete 3D representation of the real object. The process also comprises the step of providing at least one calibrated 2D view of the real object (e.g. the view provided at S30 and discussed later). The process also comprises the step of defining parametric 2D curves on the 2D view. Then, the process comprises the step of mapping the 2D curves on the discrete 3D representation. Moreover, the process comprises the step of fitting the result of the mapping with parametric 3D curves. The 3D curves thereby represent the real object. This process may be performed according to a European patent application number 13306573.0 filed by the same Applicant and on the priority date of the present application.
Such a process outputs parametric 3D curves to represent the real object starting from a discrete 3D representation. In other words, the process transforms a discrete representation of the real object into a parameterized representation, thereby achieving advantages well-known in 3D CAD. First of all, the representation of the real object as parametric 3D curves is lighter than a discrete representation, such as a mesh. This allows space saving and CPU saving when handling the modeled object, for example for performing modifications. For example, the memory space occupied by the set of parametric 3D curves representing the real object and fitted may be lower than a tenth of the memory space occupied by the discrete representation provided. In another example, the number of parametric 3D curves fitted may be lower than ten, a hundred or even at least a thousand times the number of components of the discrete representation provided (e.g. triangles in case of a triangle mesh). Furthermore, providing a parameterized representation of the real object allows computing exact positions for any point of the outer surface of the real object, whereas such positions are approximated in case of a discrete representation such as a mesh (by small plane triangles in such a case). This achieves many advantages, including the possibility to zoom in the 3D representation without appearance of any artifacts or unwished discontinuities (similarly to the zoom in of an image represented by vector graphics rather than pixels). Also, the process smartly takes advantage of at least one calibrated 2D view of the real object to output the set of parametric 3D curves representing the real object. This is done by the defining, the mapping and the fitting which make use of the 2D view. Defining 2D curves on the 2D view allows to simply arrive at parametric 3D curves via a correspondence between 3D curves and 2D curves, such correspondence being ensured by the way the mapping and then the fitting operate. Making use of such a 2D view allows eventually achieving a result which is close to the real object in terms of accuracy. The process may thus be used to "correct" the 3D representation provided, meaning that the method may increase the accuracy of the 3D representation by constructing the parametric 3D curves, for example by discarding holes and/or outliers in the discrete representation. Also, the process may "smoothen" the discrete representation, by switching from a discrete representation to a parametric representation.
The providing S30 of at least one 2D view of the real object is now discussed.
A view of the real object is any graphical representation of the real object, such as an image, a photo, a picture. A 2D view is thus a 2D representation allowing the viewing of the real object from only one angle/point of view, as opposed to the definition of 3D representation provided earlier. The providing S30 may generally be performed independently of the providing S10, such that it may be performed concomitant, prior or after the providing 10.
In the case of the method, the 2D view provided at S30 may be calibrated or un-calibrated. A calibrated view is one that is provided together with information ("calibration information") that allows the correspondence between positions on the 2D view and positions in a corresponding 3D representation, e.g. the 3D representation provided at S10. For example, such information may comprise camera parameters, which are parameters that represent the configuration of a camera having captured the 2D view (possibly virtually). In other words, the camera parameters constitute information that allow an a posterior description of a camera that could have captured the 2D view, relative to the 3D representation. In case the 2D view provided at S30 is un-calibrated or calibrated relative to a representation from the 3D representation provided at S10, the method allows calibrating the 2D view, relative to the 3D representation provided at S10, by computing at S50 said camera parameters. In case the 2D view provided at S30 is already calibrated relative to the 3D representation provided at S10, the method allows improving the calibration of the 2D view by computing at S50 camera parameters that are more accurate (in other words, by optimizing the previous camera parameters). In both cases this is done relative to the 3D representation, starting from the hypothesis that the 3D representation is a relatively accurate representation of the real object.
In the case the discrete 3D representation is an output of a structure from motion analysis, the 2D view of the real object may be captured during this structure from motion analysis. In other words, structure from motion analysis may be used for the providing S10, involving at least one 2D view, e.g. an RGB image, and said 2D view may efficiently be the one provided at S30 (which in this case depends on the providing S10). Indeed, the structure from motion analysis, based on at least one 2D view as input, outputs data describing projection from the discrete 3D representation onto the input 2D view. However, although the 2D view is calibrated in this case (i.e. positions of the 2D view correspond to positions of the 3D representation according to the calibration information, as they both correspond to the real positions of the real object when performing the structure from motion analysis), said calibration data is not perfectly accurate, and the method therefore advantageously corrects said data by computing at S50 relatively accurate camera parameters (i.e. by optimizing the previous camera parameters). This is particularly true in the case the 3D representation of the real object is provided by reconstructing the 3D representation from measurements of at least one depth sensor. In such a case indeed, the depth data are mainly used for determining the 3D representation, and 2D data, such as RGB images, are mainly used for other purposes (such as texturing the 3D representation). For this reason, the 2D view may be captured by a high resolution camera (providing data with at least higher resolution than the depth sensor or other cameras capturing images used to reconstruct the initial 3D representation). Thus, although the 2D view is captured by a camera synchronous to the depth sensor, there may be a shift leading to a lack of accuracy, as explained above. The method therefore computes camera parameters that are more accurate for said RGB images.
The camera parameters that are computed at S50 are now discussed.
These camera parameters allow the correspondence between positions on the 2D view and positions in the 3D representation provided at S10. The camera parameters are thus associated to the 2D view, and relative to the 3D representation provided at S10. For that, the camera parameters may include a projection matrix (e.g. describing projection from the 3D representation to the 2D view). The projection matrix may be based on a referential associated to the 3D representation and on a referential associated to the 2D view. As known, the projection matrix may include extrinsic parameters, such as 3D position of point of view, e.g. camera position, and/or orientation, e.g. rotation and translation data, and/or intrinsic parameters, such as focal length, skew parameter, principal point, and/or distortion parameters. The intrinsic parameters are parameters related to the sensor (e.g. focal, optical center projection, distortion) and are generally estimated in the prior art by an offline process as defined in the paper by Z. Zhang, A Flexible New Technique for Kamera Calibration, in International Conference on Computer Vision 1999. The extrinsic parameter, also called "pose parameters", are related to the position (e.g. rotation matrix and translation vector) of the image in the referential of the 3D scene (here the 3D reconstructed model). A classical way to estimate these pose parameters known from the prior art is to approximate them during a reconstruction process such as the ones mentioned above, as in RGB-Depth based reconstruction (such as described in the previously mentioned paper by Izadi et al), where RGB pose is deduced from depth camera positioning. This is made possible because both sensors (RGB and depth) are rigidly connected, that so there is only relative transformation to change referential axis.
In the case of the method, camera parameters associated to the 2D view may be predetermined or not. For example, intrinsic camera parameters may be predetermined, by being previously estimated, not necessarily accurately, e.g. acquired via any offline process known from the prior art, and/or extrinsic camera parameters may be predetermined, e.g. approximated through deduction from depth camera positioning (for example in the case of the 3D representation is provided at S10 after performing a reconstruction that is a motion from structure analysis based on RGB-Depth data and the 2D view provided at S30 is an RGB image captured during said reconstruction by a camera synchronous to the depth sensor) or manually estimated. However, the method computes at S50 camera parameters such that the newly computed camera parameters are more accurate than the predetermined ones, e.g. leading to an accurate texturing.
A specific case is one wherein the intrinsic camera parameters are predetermined. In this case, the camera parameters computed at S50 may be (only) the extrinsic camera parameters. Indeed, techniques that predetermine camera parameters provide a relatively accurate result in the case of intrinsic parameters. Thus, focusing on improving the accuracy of the extrinsic camera parameters only provides a good tradeoff between increase of accuracy and time required to perform the improvement.
The identifying S20 and the identifying S40 are now discussed, in order to highlight how exactly the camera parameters are computed at S50.
The method comprises identifying at S20 and S40 occurrences of features. As known in the field of computer science, objects may be defined by a type, and then be instantiated with specific parameter values. In the case of the method, these types comprise geometric features and graphic features. The method may thus comprise searching a predetermined list of geometric features and/or a predetermined list of graphic features, to evaluate if such features are instantiated in the data provided at S10 and/or S30 (i.e. to find "occurrences", or in other words "instances", of a feature). Thus, the identifying S20 and/or S40 may be performed fully automatically, according to evaluations classic in the field of computer science.
In specific, the identified occurrences are associated to positions of the 3D representation and/or the 2D view. This means that the method provides positions/locations of the 3D representation at S20 that are associated to the geometric feature and positions/locations of the 2D view at S40 that are associated to the graphic feature.
The feature of which occurrences are identified at S20 is a geometric feature. A geometric feature is any predetermined feature that characterizes the shape, or geometry, of the 3D representation. In an example provided below, the geometric feature relates to the 3D curvature of the 3D representation, meaning that the geometric feature describes particular information regarding the 3D curvature of the 3D representation. It is particularly easy to detect occurrences of this type of geometric feature. In the example, the geometric feature is specifically a 3D curvature above a predetermined threshold. In other words, the geometric feature occurs each time the 3D curvature of the 3D representation is above a threshold (that can be anything, provided it is predetermined). This makes the method work particularly efficiently.
The feature of which occurrences are identified at S40 is a graphic feature. A geometric feature is any predetermined feature that characterizes the graphics, or the visual aspect, of the 2D view. In the example provided below, the 2D view is an image of the real object (e.g. an RGB image) and the graphic feature relates to a pixel gradient, meaning that the graphic feature describes particular information regarding the pixel gradient (thus related to color gradient) of the 2D view. It is particularly easy to detect occurrences of this type of graphic feature. In the example, the graphic feature is specifically a pixel gradient above a predetermined threshold. In other words, the graphic feature occurs each time the pixel gradient of the 2D view is above a threshold (that is predetermined, and corresponds to the threshold predetermined and discussed above for the 3D curvature). Such a graphic feature corresponds to the geometric feature discussed above, the exact values of the predetermined thresholds being a matter of implementation.
Although examples that will be more extensively discussed later have already been provided, it has to be understood that the geometric feature and the graphic feature may be any predetermined features (of which occurrences are identified at S20 and S40 in any way), provided that they correspond to each other. By corresponding to each other, it is meant that the geometric feature corresponds to 3D positions/locations of the real object that result in the graphic feature when transposing the real object into 2D (by providing the 2D view). Continuing with the example provided above, a fold on the real object will generally result in a high curvature in the 3D representation (and thus occurrence of the geometric feature of the example) and it will generally result in a high gradient in the 2D view (and thus occurrence of the graphic feature of the example, that is considered by the method of the example as corresponding to the geometric feature). The method thus implements a predetermined knowledge that the geometric feature corresponds to the graphic feature. This knowledge can come from anywhere, and only one single example is discussed below. For example, this knowledge can result from experimentations within a specific application field of the method, the features thus depending on the field. Actually, this knowledge may comprise several geometric features and/or several graphic features, provided that it also comprises correspondences between them. And the method "matches" in a specific way (explained below) occurrences of the geometric feature with occurrences of the graphic feature to retrieve camera parameters (in a form of "reverse engineering"), so as to make efficient use of said knowledge.
Indeed, the method determines the camera parameters at S50 by computing the values of them that minimize a distance between a set of projections of the 3D positions on the 2D view and a set of 2D positions. In other words, a predetermined distance between two general sets of 2D points is considered, the two sets having the same number of elements or not (any distance may be contemplated, a specific example being provided later), and the camera parameters computed at S50 are the argument of the minimum of said distance evaluated between the set of projections of the 3D positions (obtained by projecting 3D positions on the 2D view provided at S30 according to the camera parameters associated to said 2D view -the camera parameters being the variable of the optimization problem-, e.g. the camera parameters taking the form of a projection matrix) and the set of 2D positions. As will be apparent later, the 3D positions identified at S20 and the 2D positions identified at S40 are not necessarily all involved in the minimization. Indeed, for any foreseen reason, some of these positions may be discarded for the minimization. The specific way that the computing S50 is performed ensures that the predetermined knowledge of the fact that the geometric feature corresponds to the graphic feature is taken into account to determine the camera parameters in a relatively fast and simple way, said knowledge itself ensuring accuracy.
The method thus allows a fast determination of accurate camera parameters associated to the 2D view relative to the 3D representation. Said camera parameters may then be used for any application (e.g. known from the prior art) thereby improving accuracy of such application. For example, the method may further comprise determining a texture mapping between the 3D representation and the 2D view based on the computed camera parameters. In other words, the method determines information (i.e. the texture mapping) that allows texturing the 3D representation according to the graphic information (e.g. applying pixel information such as color information to the 3D model) contained in the 2D view, in a way that avoids shifts as presented with reference to FIG. 2, thanks to possessing information (i.e. the camera parameters) that translate accurately positions of the 2D view onto the 3D model.
An example of the method is now discussed with reference to FIGS. 6-11.
In this example, the method allows getting high quality textured 3D models by merging an RGB image with inaccurate pose (i.e. extrinsic camera parameters) and a 3D representation (i.e. 3D model). The algorithm consists in an optimization of the initial pose, based on an energy (i.e. distance) which is minimal when the 3D points of strong curvatures are projected onto the image on pixels of strong gradients. First, the method detects at S20 the visible 3D points of strong curvatures on the 3D model, and at S40 the pixels of strong gradients on the image. Then the method minimizes at S50 over the extrinsic parameters (which determine the pose of the camera) the sum of the squared distances between each selected 3D point projected onto the image and the nearest pixel among the selected pixels. The method of the example thus builds from the idea of having an approximate camera pose for the picture intended to texture the model.
FIG. 6 shows the global process overview of the example in two levels, with LEVEL 1 representing 3D reconstruction of a scene (containing at least one real object) and LEVEL 2 representing automatic texturing of the 3D model (i.e. 3D representation of the scene). FIG. 6 thus presents the two major levels of the global textured 3D reconstruction pipeline:
The first one consists in reconstructing the 3D scene with RGB or RGB-Depth sensors. RGB images can thus be extracted from RGB-D stream or from an external RGB sensor. An initial guess for extrinsic camera parameters is then provided with the 3D mesh model. These techniques are largely described in the literature, e.g. in the previously mentioned papers by Izadi et al, by Szeliski, and by Hartley, whose teaching regarding this specific aspect can be included to the method of the example.
The second level, at the heart of the method of the example, is dedicated to the RGB pose camera optimization for the texturing process. The proposed algorithm compares edges from the 3D model - as seen from the image - and coincides them to pixel zones of high gradients. The method of the example then defines an energy function related to the distance between projected 3D curvatures extracted on the mesh and 2D primitives on images (2D curvatures, i.e. images high gradients), and then minimizes iteratively this energy with gauss-Newton algorithm.
As will appear in the following discussion, compared to state of the art approaches, the presented solution allows the use of an un-calibrated RGB image to get a high quality textured 3D model. This optimization process is fast (in an example implemented by the inventors, about a few milliseconds for a High Definition image).
As already explained, the method of the example builds from the idea of having an approximate camera pose estimation. Pose camera in computer vision and in robotics is defined as the position of the camera in the scene. In the case of the method of the example, the rotation and the translation of the camera in the 3D reconstructed scene are contemplated (e.g. three angles for rotation and three coordinates for the translation vector). FIG. 7 illustrates the pose camera. FIG. 7 shows translation and rotation 72 of pose camera in the 3D representation 76 of a scene including a tree and a house that results in 2D view 78, based on 3D reconstructed scene referential 74.
The following discussion focuses on the description of the image alignment process, which corresponds to LEVEL 2-A of FIG. 6 and is detailed in FIG. 8. The algorithm discussed below is divided into the following major steps:
1/ Pre-process: robust curvatures extraction on the 2D image and the 3D model.
2/ Optimization process:
i. Update the pose by minimizing the sum of the distances (Gauss-Newton) between each selected 3D point projected onto the image and the nearest neighbor selected pixel.
ii. Iterate steps 1/ and 2/ until convergence criteria satisfaction.
The identifying S20 and S40 of the example are now discussed. This corresponds to STEP 1 of FIG. 8, that is, the pre-processing of robust curvature extraction on image and 3D model.
The 3D curvature extraction from a mesh at S20 is first discussed.
Referring to FIG. 9 which illustrates curvature estimation of a point on a triangular mesh, let x denote a 3D point on the mesh and {x1... xn} its immediate neighbors, implying that for every point in {x1, ..., xn} there exists an edge in the mesh leading to x. Let {y1... yn} denote the x-translated set of neighbors, so that x becomes the origin. Let Z be the normal of the mesh at point x. If it does not yet exist, the method may average normal of neighboring triangles. The method may then assume an arbitrary direction X normal to Z and complete the orthonormal basis by Y = Z^X. We call {z, z1... zn}, the projected set {x, x1... xn} in the new base. The surface within the set is then estimated by a least square fitting paraboloid, from which the method deduces a curvature and direction at point z estimation.
Following the orthogonal basis, we can describe the paraboloid with (a,b,c) so that: z = ax 2 + bxy + cy 2
The least-square method on coefficients a, b and c yields: a b c = argmin a ′ , b ′ , c ′ ∑ i = 1 n z i 3 − a ′ z i 1 2 + b ′ z i 1 z i 2 + c ′ z i 2 2 2
Let X be the n*3 matrix whose row i equals to (zi(1)2, zi(1)zi(2), zi(2)2) and J the n-sized vector (zi(3))i. Then the linear least-square solution is: a b c = X T X − 1 X T J
As the surface of the example is regular, the principal curvatures are the Eigen values to the hessian matrix H. The mean curvature m is defined as the sum of the two principal curvatures, i.e. m = tr(H). The Gaussian curvature g being the product of the two principal curvatures, g = det(H). Since H = 2 a b b 2 c , m = 2 a + c and g = 4 ac − b 2 .
Let c1 and c2 be the Eigen values of H at x. By definition m = c1+c2 and g = clc2. Let Δ = m2 - 4g, and we get: c 1 = m + Δ 2 et c 2 = m − Δ 2
Obvious bounds to the surface curvature at x are [min(c1,c2) ; max(c1,c2)]. Therefore the curvature of highest value at x is approximated by max(|c1|,|c2|). The curvature at x may be considered to be equal to this value. 3D points x with a curvature of highest value above a predetermined threshold may then be selected.
The 2D curvatures extraction in the image at S40 is now discussed.
The identifying S40 of the example includes first applying a Gaussian blur on the 2D view. The Gaussian blur is a widely known filter that smoothens pixels of an image by averaging them with neighboring pixels. This prior smoothing improves correspondence to the geometric feature and therefore improves accuracy of the final result, for example by removing artifacts.
Then, to compute the 2D gradients in an image, the method may use the Sobel operator. The Sobel operator used two 3x3 kernels, Gx and Gy, which are convolved with the image in order to compute the gradient for each pixel in both directions, x and y. We denote I the image.
For the Sobel operator : G x = 1 0 − 1 2 0 − 2 1 0 − 1 G y = 1 2 1 0 0 0 − 1 − 2 − 1
Then the method may compute the image of all the gradients in the x direction: gradIx = Gx * I, and in the y direction : gradIy = Gy * I, where * denotes the convolution.
Finally to extract the strongest edges on the image, the method just has to compute for each pixel the norm of the gradient (also called "curvature" in the following): G = (gradIx2 + gradIy2)^(1/2), and then select the pixels whose G is above a specific predetermined threshold.
The computing S50 of the example is now discussed. This corresponds to STEP 2 of FIG. 8, that is, the pose camera optimization for texturing.
The method is to project image I onto a surface S with knowledge of camera intrinsic K (predetermined intrinsic parameters) and approximate camera pose P (previously determined approximate extrinsic parameters). The algorithm of the example iteratively updates P. In other words, the computing of camera parameters includes iteration of an optimization algorithm (which is itself iterative in the example, as illustrated later). This type of implementation allows reaching the result faster, as the iteration may be stopped when the method reaches convergence. Details of implementation are provided later.
For that, it is noted that the method of the example further comprises, prior to the computing S50 itself, filtering 3D positions of the 3D representation according to criteria evaluated according to a predetermined estimation of the camera parameters. In other words, among all 3D positions identified at S20, some positions are filtered, i.e. discarded, according to criteria that depend on the approximate knowledge provided by the current extrinsic parameters. This optimizes the method in terms of computing time and reached accuracy, by making efficient use of the available knowledge, even if it is approximate.
In specific, the criteria include visibility on the 2D view and/or distance of the projection with borders of the 2D view. The idea is that 3D points that are not visible on the 2D view, for example because of the perspective (i.e. 3D points that are obviously on a side of the real object not represented on the 2D view, according to the current approximation of the extrinsic parameters), are not required for the computation S50. Also, points which are to be projected close to the borders of the 2D view are believed to create artifacts in the optimization, such that discarding them for the computation S50 actually improves accuracy.
A way of doing so is to use a Z-Buffer (one could use OpenGL to that effect) in order to compute points of S visible in image I according to camera pose P. The method then filters points that are too close to the image border reprojection-wise. A further filtering may then occur for points for which the estimated curvature is lower than a given threshold, which actually consists in performing S20 at that time. Let {x1... xs} be the remaining set of points.
In the example, the computing S50 is actually interlaced with the identifying S40. For that, the identifying S40 is iterated, with an increasing number of occurrences of the graphic feature at each iteration. The optimization algorithm is thus run after each such iteration. As already mentioned, this type of implementation makes the method faster. More precisely, working on relatively few occurrences of the graphic features makes one iteration of the method faster. However, until convergence is reached, there is room to improve accuracy of the computed camera parameters. Thus, additional occurrences of the graphic feature may be added, based on the principle that when there are more data, there should generally be higher precision.
Specifically, in the example the identifying S40 is iterated over resized versions of the 2D view. These versions are naturally ordered from the smallest to the largest. In other words, the level of details of the 2D view provided at S20 increases as the method is iterated, e.g. until convergence is reached. Of course, the case where there is no convergence may be handled in any way, e.g. by setting a limit in terms of number of loops or in terms of time.
The method thus computes a set of images I1, ..., In, as following. I1 is the original image on which the method applied Gaussian blur. I2 is the original image resized by coefficient ½ on which the method applied Gaussian blur, and so on until In is the original image resized by coefficient 1/2n-1 and blurred. The method may be based on a predetermined n chosen so that In has less than 800 pixels.
The iterative optimization algorithm of the example uses t iterations per image, going upward from image In to image I1.
Let image Im be the running image and the current pose P = [R T] where R is the camera rotation matrix and T its translation vector. The method adjusts the intrinsic matrix K intro matrix K' to take into account the change of scale at image Im. This actually means to divide the intrinsic parameters by coefficient 2m-1. The rotation matrix R is uniquely associated with Euler angles α, β, γ that are easier to work with. One can easily switch from one representation to another.
So from image Im, the method selects all pixels p1, ..., pr of curvature higher than an empiric threshold. Those pixels are then classified using a kd-tree structure A (which is, as known per se, a binary tree where each node divides the space so that each part contains an equal number of points). Such a nearest-neighbor structure makes it possible to find, for a given pixel, the nearest neighbor within the tree at a logarithmic cost (instead of linear).
Each point xi projected onto the running image is associated to the its nearest neighbor within A. Point xi is then associated with pixel pg(i).
The method then minimizes a sum of the square distances between projections of the retained 3D positions identified at S20 and their respective closest 2D positions among those identified at S40, i.e. function f: f tx ′ , ty ′ , tz ′ , α ′ , β ′ , γ ′ = ∑ i = 1 s ‖ K ′ P tx ′ , ty ′ , tz ′ , α ′ , β ′ , γ ′ x i − p g i ‖ 2 = ∑ i = 1 s r i tx ′ , ty ′ , tz ′ , α ′ , β ′ , γ ′ 2
It is noted that alternatively, distance terms that are too high (e.g. above a predetermined threshold) may be discarded.
By minimizing f, the method aims to match points from S of high curvature to points of Im that have strong gradient within the image. The method does so by tweaking extrinsic parameters, meaning the camera pose. Here α',β',γ' are the tree angles corresponding to the camera extrinsic rotation, and tx',ty',tz' its translation vector. P denotes here the function computing the camera from those scalar values and K'P the function projecting a 3D point on the image.
The minimization criteria is thereby a non-linear least-squared, that may be solved through Gauss-Newton algorithm. In order to compute the gradient of each function ri used by the algorithm finite differences as an approximation. Of course one could refine that approximation for ri. The finite differences yields gradient Ji . Let J be the matrix of size s*6 so that the row i be Ji, and Y the s-sized vector so that Y(i) =- ri(tx,ty,tz,α,β,γ) where tx,ty,tz,α,β,γ are the running pose extrinsic parameters. The Gauss-Newton algorithm yields: dtx dty dtz dα dβ dγ = J T J − 1 J T Y
The extrinsic parameters are updated using: xu = x + dtx, ..., γu = γ + dγ. Thus another extrinsic matrix is computed Pu and serves as the new P matrix. A few run of the algorithm are computed on every image using that same logic. Once the final optimized pose is computed, the method simply projects the targeted texture in a classic fashion onto the mesh to finalize its purpose.
The global process is illustrated on FIGS. 10-11, which show the optimization process for accurate texturing description. FIG. 10 shows extraction 118 of 2D primitives on RGB Image 116 and extraction 114 of 3D primitives on 3D model 112. FIG. 11 shows how the method iterates the projection 120 of 3D primitives from extraction 114 on RGB image 116 (with new estimate of camera pose), resulting in projected points 122. This is iterated until satisfaction of predetermined error criteria.
From here, one might also want to take image distortion into account when projecting a 3D point onto the image to further improve accuracy. Another variation would be to include intrinsic parameters into the minimization, but that would result in a higher order of complexity for the Gauss-Newton algorithm.
A computer-implemented method for designing a 3D modeled object representing a real object, comprising the steps of:
• providing (S10) a 3D representation of the real object, wherein the 3D representation is a discrete representation consisting of a discrete aggregation of geometrical components that locally represent the geometry of the real object as an outer surface and/or as a solid, or wherein the 3D representation is a parametric representation consisting of a parametric function that outputs the geometry of the real object for parameter values chosen in a predetermined domain,
• identifying (S20), by fully automatic detection, occurrences of a geometric feature at 3D positions of the 3D representation, the geometric feature occurring and being detected each time a 3D curvature of the 3D representation is above a predetermined threshold,
• providing (S30) at least one 2D view of the real object, wherein the 2D view is an image of the real object,
• identifying (S40), by fully automatic detection, occurrences of a graphic feature at 2D positions of the 2D view, the geometric feature corresponding to the graphic feature, the graphic feature relating to a pixel gradient of the 2D view,
• computing (S50) camera parameters, including a projection matrix which describes projection from the 3D representation to the 2D view, that minimize a distance between a set of projections of the 3D positions of the geometric feature on the 2D view and a set of the 2D positions of the graphic feature, wherein the distance is a predetermined distance between two general sets of 2D points.
The method of claim 1, wherein the graphic feature is a pixel gradient above a predetermined threshold.
The method of claim 2, wherein the method further comprises determining a texture mapping between the 3D representation and the 2D view based on the computed camera parameters.
The method of any of claims 1-3, wherein the identifying of occurrences of the graphic feature includes first applying a Gaussian blur on the 2D view.
The method of any of claims 1-4, wherein the method further comprises, prior to the computing, filtering 3D positions of the 3D representation according to criteria evaluated according to a predetermined estimation of the camera parameters.
The method of claim 5, wherein the criteria include visibility on the 2D view and/or distance of the projection with borders of the 2D view.
The method of any of claims 1-6, wherein the identifying of occurrences of the graphic feature is iterated, with an increasing number of occurrences of the graphic feature at each iteration, and the computing of camera parameters includes an iterative optimization algorithm.
The method of claim 7, wherein the identifying of occurrences of the graphic feature is iterated over resized versions of the 2D view, that are ordered from the smallest to the largest.
The method of any of claim 1-8, wherein the intrinsic camera parameters are predetermined, the computed camera parameters thereby being the extrinsic camera parameters.
The method of any of claims 1-9, wherein providing the 3D representation of the real object comprises reconstructing the 3D representation from measurements of at least one depth sensor.
The method of claim 10, wherein the 2D view is an image captured by a high resolution camera and/or by a camera synchronous to the depth sensor.
A computer program comprising instructions according to the method of any of claims 1-11 such that a computer executing the program's instructions performs said method.
A computer readable storage medium having recorded thereon the computer program of claim 12.
A system comprising a processor coupled to a memory and a graphical user interface, the memory having recorded thereon the computer program of claim 12.
EP13306576.3A 2013-11-18 2013-11-18 Computing camera parameters Active EP2874118B1 (en)
EP13306576.3A EP2874118B1 (en) 2013-11-18 2013-11-18 Computing camera parameters
US14/541,860 US9886530B2 (en) 2013-11-18 2014-11-14 Computing camera parameters
EP13306576.3A Active EP2874118B1 (en) 2013-11-18 2013-11-18 Computing camera parameters
EP2811463B1 (en) 2013-06-04 2018-11-21 Dassault Systèmes Designing a 3d modeled object with 2d views
US9619933B2 (en) 2014-06-16 2017-04-11 Occipital, Inc Model and sizing information from smartphone acquired image sequences
EP3032495B1 (en) 2014-12-10 2019-11-13 Dassault Systèmes Texturing a 3d modeled object
EP3188033A1 (en) 2015-12-31 2017-07-05 Dassault Systèmes Reconstructing a 3d modeled object
CN105809734B (en) * 2016-03-10 2018-12-25 杭州师范大学 A kind of mechanical model three-dimensional modeling method based on multi-angle of view interactive mode
US10192347B2 (en) * 2016-05-17 2019-01-29 Vangogh Imaging, Inc. 3D photogrammetry
US20180005015A1 (en) * 2016-07-01 2018-01-04 Vangogh Imaging, Inc. Sparse simultaneous localization and matching with unified tracking
EP3293705A1 (en) 2016-09-12 2018-03-14 Dassault Systèmes 3d reconstruction of a real object from a depth map
US10380762B2 (en) 2016-10-07 2019-08-13 Vangogh Imaging, Inc. Real-time remote collaboration and virtual presence using simultaneous localization and mapping to construct a 3D model and update a scene based on sparse data
US10289935B2 (en) * 2016-11-08 2019-05-14 Nec Corporation Advanced driver-assistance system with landmark localization on objects in images using convolutional neural networks
WO2018187611A1 (en) * 2017-04-05 2018-10-11 Aerion Intellectual Property Management Corporation Solid modeler that provides spatial gradients of 3d cad models of solid objects
US10282860B2 (en) * 2017-05-22 2019-05-07 Honda Motor Co., Ltd. Monocular localization in urban environments using road markings
US10408939B1 (en) * 2019-01-31 2019-09-10 StradVision, Inc. Learning method and learning device for integrating image acquired by camera and point-cloud map acquired by radar or LiDAR corresponding to image at each of convolution stages in neural network and testing method and testing device using the same
US20020172413A1 (en) * 2001-04-03 2002-11-21 Chen George Q. Methods and apparatus for matching multiple images
WO2012048304A1 (en) * 2010-10-07 2012-04-12 Sungevity Rapid 3d modeling
JP3162630B2 (en) 1996-07-31 2001-05-08 トヨタ自動車株式会社 Surface defining the method and apparatus of the wire frame model
US6549201B1 (en) 1999-11-23 2003-04-15 Center For Advanced Science And Technology Incubation, Ltd. Method for constructing a 3D polygonal surface from a 2D silhouette by using computer, apparatus thereof and storage medium
US7084868B2 (en) * 2000-04-26 2006-08-01 University Of Louisville Research Foundation, Inc. System and method for 3-D digital reconstruction of an oral cavity from a sequence of 2-D images
US6654027B1 (en) 2000-06-09 2003-11-25 Dassault Systemes Tool for three-dimensional analysis of a drawing
US6850233B2 (en) 2002-05-01 2005-02-01 Microsoft Corporation Systems and methods for optimizing geometric stretch of a parametrization scheme
US7546156B2 (en) 2003-05-09 2009-06-09 University Of Rochester Medical Center Method of indexing biological imaging data using a three-dimensional body representation
US7565029B2 (en) * 2005-07-08 2009-07-21 Seiko Epson Corporation Method for determining camera position from two-dimensional images that form a panorama
US8259101B2 (en) 2006-06-07 2012-09-04 Carnegie Mellon University Sketch-based design system, apparatus, and method for the construction and modification of three-dimensional geometry
KR100969764B1 (en) 2008-02-13 2010-07-13 삼성전자주식회사 Method for coding and decoding 3d data implemented as mesh model
US8570343B2 (en) 2010-04-20 2013-10-29 Dassault Systemes Automatic generation of 3D models from packaged goods product images
CN102884799B (en) 2010-05-11 2015-11-25 汤姆森许可贸易公司 For comfort noise and the film grain process of 3 dimension videos
EP2400410B1 (en) 2010-05-25 2014-01-08 Dassault Systèmes Computing of a resulting closed triangulated polyhedral surface from a first and a second modeled object
US9235891B2 (en) * 2011-01-10 2016-01-12 Rutgers, The State University Of New Jersey Boosted consensus classifier for large images using fields of view of various sizes
US20150172628A1 (en) * 2011-06-30 2015-06-18 Google Inc. Altering Automatically-Generated Three-Dimensional Models Using Photogrammetry
US9031356B2 (en) 2012-03-20 2015-05-12 Dolby Laboratories Licensing Corporation Applying perceptually correct 3D film noise
US9218685B2 (en) * 2012-06-05 2015-12-22 Apple Inc. System and method for highlighting a feature in a 3D map while preserving depth
CN104395929B (en) 2012-06-21 2017-10-03 微软技术许可有限责任公司 Constructed using the incarnation of depth camera
US9183666B2 (en) * 2013-03-15 2015-11-10 Google Inc. System and method for overlaying two-dimensional map data on a three-dimensional scene
US9483703B2 (en) * 2013-05-14 2016-11-01 University Of Southern California Online coupled camera pose estimation and dense reconstruction from video
US9378576B2 (en) 2013-06-07 2016-06-28 Faceshift Ag Online modeling for real-time facial animation
US9524582B2 (en) 2014-01-28 2016-12-20 Siemens Healthcare Gmbh Method and system for constructing personalized avatars using a parameterized deformable mesh
US9299195B2 (en) 2014-03-25 2016-03-29 Cisco Technology, Inc. Scanning and tracking dynamic objects with depth cameras
US9613298B2 (en) 2014-06-02 2017-04-04 Microsoft Technology Licensing, Llc Tracking using sensor data
US20180268237A1 (en) 2014-10-01 2018-09-20 Apple Inc. Method and system for determining at least one property related to at least part of a real environment
US10110881B2 (en) 2014-10-30 2018-10-23 Microsoft Technology Licensing, Llc Model fitting from raw time-of-flight images
CN104794722A (en) 2015-04-30 2015-07-22 浙江大学 Dressed human body three-dimensional bare body model calculation method through single Kinect
CN105657402B (en) 2016-01-18 2017-09-29 深圳市未来媒体技术研究院 A kind of depth map restoration methods
HELIN DUTAGACI ET AL: "Evaluation of 3D interest point detection techniques via human-generated ground truth", THE VISUAL COMPUTER ; INTERNATIONAL JOURNAL OF COMPUTER GRAPHICS, SPRINGER, BERLIN, DE, vol. 28, no. 9, 29 June 2012 (2012-06-29), pages 901 - 917, XP035094452, ISSN: 1432-2315, DOI: 10.1007/S00371-012-0746-4 *
KOLOMENKIN M ET AL: "On edge detection on surfaces", 2009 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION : CVPR 2009 ; MIAMI [BEACH], FLORIDA, USA, 20 - 25 JUNE 2009, IEEE, PISCATAWAY, NJ, 20 June 2009 (2009-06-20), pages 2767 - 2774, XP031607044, ISBN: 978-1-4244-3992-8 *
Seitz et al. 2006 A comparison and evaluation of multi-view stereo reconstruction algorithms
US8861840B2 (en) 2014-10-14 Identifying and filling holes across multiple aligned three-dimensional scenes
Gal et al. 2010 Seamless montage for texturing models
Furukawa et al. 2006 Carved visual hulls for image-based modeling
Newcombe et al. 2010 Live dense reconstruction with a single moving camera
Sinha et al. 2008 Interactive 3D architectural modeling from unordered photo collections
US8791941B2 (en) 2014-07-29 Systems and methods for 2-D to 3-D image conversion using mask to model, or model to mask, conversion
US6795069B2 (en) 2004-09-21 Free-form modeling of objects with variational implicit surfaces
KR101388133B1 (en) 2014-04-23 Method and apparatus for creating a 3D model from 2D photograph image
JP2004502249A (en) 2004-01-22 System and method for depth map median value fusion
Hiep et al. 2009 Towards high-resolution large-scale multi-view stereo
US9251623B2 (en) 2016-02-02 Glancing angle exclusion
Lhuillier et al. 2005 A quasi-dense approach to surface reconstruction from uncalibrated images
Tauber et al. 2007 Review and preview: Disocclusion by inpainting for image-based rendering
JP4392507B2 (en) 2010-01-06 3D surface generation method
Furukawa et al. 2009 Accurate, dense, and robust multiview stereopsis
US8896665B2 (en) 2014-11-25 Camera calibration method and medium and 3D object reconstruction method and medium using the same
Franco et al. 2003 Exact polyhedral visual hulls
Zaharescu et al. 2007 Transformesh: a topology-adaptive mesh-based approach to surface evolution
US20150178988A1 (en) 2015-06-25 Method and a system for generating a realistic 3d reconstruction model for an object or being
JP3954211B2 (en) 2007-08-08 Method and apparatus for restoring shape and pattern in 3D scene
AU2008200277B2 (en) 2013-11-14 Methodology for 3D scene reconstruction from 2D image sequences
US8675951B2 (en) 2014-03-18 Method and system for generating a 3D model
Van Den Hengel et al. 2007 VideoTrace: rapid interactive scene modelling from video
Extension state: BA ME
Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR
2017-02-22 RIC1 Information provided on ipc code assigned before grant
Ipc: G06T 19/20 20110101ALN20170118BHEP
Ipc: G06T 7/00 20170101AFI20170118BHEP
2017-04-05 INTG Intention to grant announced
Ref country code: CH
Ref legal event code: EP
Ref country code: AT
Ref legal event code: REF
Ref document number: 915248
Country of ref document: AT
Kind code of ref document: T
Ref country code: IE
Ref document number: 602013024306
Ref legal event code: MP
Ref legal event code: MK05
Ref country code: LT
Ref legal event code: MG4D
2018-01-31 PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]
Ref country code: HR
Ref country code: NO
Ref country code: FI
Ref country code: LV
Ref country code: GR
Ref country code: IS
Ref country code: RS
Ref country code: PL
Ref country code: BG
Ref country code: CZ
Ref country code: DK
Ref country code: RO
Ref country code: SK
Ref country code: SM
Ref country code: EE
Ref country code: MC
Ref country code: LI
Ref country code: LU
Ref country code: SI
Ref country code: BE
Ref legal event code: MM
Ref legal event code: MM4A
Ref country code: MT
2019-01-31 PGFP Annual fee paid to national office [announced from national office to epo]
Ref country code: HU
Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO
Ref country code: CY
Ref country code: MK


text:
Q: Feature Event has 'null' objects public class Feature1EventReceiver : SPFeatureReceiver
{

    public override void FeatureInstalled(SPFeatureReceiverProperties properties)
    {

        string sContextNull = (SPContext.Current == null) ? "Context is NULL" : "Context is OK";
        string sFeatureNull = (properties.Feature == null) ? "Feature is NULL" : "Feature is OK";

        // Some code here
        ...
        ...
    {
}

The feature has successfully installed (without error in logs). My problem is that sContextNull always returns "Context is NULL". And sFeatureNull always returns "Feature is NULL" too. Is there a way to get not null values of SPContext.Current and properties.Feature?
Another method FeatureActivated returns Context is NULL and Feature is OK. WTF?

A: SPContext.Current
http://msdn.microsoft.com/en-us/library/microsoft.sharepoint.spcontext.current.aspx
Gets the context of the current HTTP request in Microsoft SharePoint Foundation.
SPFeatureReceiver.FeatureInstalled is executing when a feature is installed into a farm, which is done with a deploy/install command from stsadm or powershell, which then usually triggers the timer job to do the work. At this point there is no HTTP request, so SPContext.Current returns null.

A: Probably properties.Feature in method FeatureInstalled is a bug. I have tried the next code and it works for me:
public class Feature1EventReceiver : SPFeatureReceiver
{
    public override void FeatureActivated(SPFeatureReceiverProperties properties)
    {
        string sFeatureNull = (properties.Feature == null) ? "Feature is NULL" : "Feature is OK";

        // Some code here
        ...
        ...
    {
}

this method return Feature is OK.
Please avoid using properties.Feature in the method FeatureInstalled and FeatureUninstalling!!!

A: I think you need to get the web which contains this feature so try to use
(properties.Feature.Parent as SPWeb)

It works fine with me
Note:Try to cast it to SPSite if the feature scope is site

redpajama_set_name: RedPajamaStackExchange


Graphic representation of average selling prices for homes and condos in Corte Madera through June 2013.
Year to year comparison of how many dollars per square foot condominiums are selling for in Corte Madera, on average.
Quarter to quarter comparison of how many dollars per square foot residences in Corte Madera (SFR and condos) are selling for through June 2013.
Comparison of how many condo units are being sold in Corte Madera from year to year.
Visual display of the number of residential properties in Corte Madera (SFR and condos) that have been sold from quarter to quarter from January 2007 through June 2013.
Assessment of the value of a condominium property's location in Corte Madera through the use of Southern Marin Real Estate Blog's proprietary formula and unique data set.
Display of what condo properties in Corte Madera are valued at per square foot without taking into account their location. This data is exclusive to the Southern Marin Real Estate Blog.


In nautical terms, the wind rose is the foundation of a compass enabling sailors to find their way, stay on course, and lead the race.
The Wind Rose, a firm founded in 2008 by Constance Colombier, offers prestigious Houses worldwide a holistic approach to professional retail consulting and training that highlights the importance of exceptional craftsmanship, the art of conversation, the role of emotions and the value of exquisite manners.
At The Wind Rose, we invite you on a voyage across our archipelago, an odyssey navigated by a uniquely talented crew, wholly focused on helping your teams succeed.