The present invention relates to non-destructive examination, and more particularly, to three-dimensional visualization and analysis for automatic non-destructive examination of solid rotors using ultrasound.
A rotor is a rotating component of a turbine or a generator and its reliability is a major concern to users such as electric utilities. To promote operation safety and prevent potential failures, Non-Destructive Examinations (NDEs) are performed regularly to inspect the integrity of rotors. One of the examinations is boresonic inspection in which ultrasound is used to detect defects and flaws in a rotor.
In a boresonic inspection, defects and flaws, if present in the rotor, are detected using ultrasound and reported as digital data. This digital information is evaluated to determine the size and extent of defects and flaws such as material discontinuities. Performing this determination is not a trivial task and involves engineering know-how as well as experience. However, even with this know-how and experience, many assumptions are typically made and safety factors accounted for in order to make a representative assessment of rotor integrity. As a result, many boresonic inspection systems have a high degree of conservatism in data analysis, causing inaccurate flaw size estimation. Accordingly, a more accurate and user friendly method for boresonic inspection of rotors is desirable.
The present invention provides a method and apparatus for visualization and analysis for automatic non-destructive examination of a solid rotor using ultrasound.
In one embodiment, a method for generating a three dimensional visualization of a solid rotor based on a plurality of two dimensional ultrasound scans of the solid comprises associating each of a plurality of sample points of a plurality of two dimensional ultrasound scans with a corresponding 3D image point of a regular grid. A kernel function for each of the plurality of sample points defining a size and shape of a kernel located at the corresponding image point is determined. A weight is assigned to each kernel, in one embodiment, based on the sample point value. A value for each image point of the regular 3D grid is determined based on kernels overlapping each image point. In one embodiment, a three-dimensional volume representing the solid rotor is then visualized.
These and other advantages of the invention will be apparent to those of ordinary skill in the art by reference to the following detailed description and the accompanying drawings.
The present invention relates to a method and apparatus for visualization and analysis for automatic non-destructive examination of solid rotors using ultrasound. A digital image is often composed of digital representations of one or more objects (or shapes). The digital representation of an object is often described herein in terms of identifying and manipulating the objects. Such manipulations are virtual manipulations accomplished in the memory or other circuitry/hardware of a computer system. Accordingly, is to be understood that embodiments of the present invention may be performed within a computer system using data stored within the computer system. Embodiments of the present invention are described herein to give an understanding of the visualization and analysis method and apparatus.
A rotor is the rotating part of a mechanical device. Rotors generally comprise a shaft with a plurality of blades extending radially from the shaft. Typically, a working fluid, such as air or water, may move or be moved by the rotor blades. In one application, water is directed toward the rotor blades to turn the rotor. The shaft of a rotor in these types of applications is connected to an electricity producing device such as a generator. Rotor shafts may be solid or hollow. In present disclosure, the term solid rotor refers to a solid rotor shaft.
A 3D volume conversion process, such as the conversion process performed by conversion module 104 of
Ultrasound data representing a solid rotor is captured by scanning a solid rotor. Scanning a solid rotor differs from scanning a rotor bore in that a solid rotor has no hollow center section to facilitate insertion of a scanning tool such as an unitrasonic capturing device. The scanning operation for a solid rotor is further complicated by turbine blades attached about the circumference of the solid rotor. The characteristics of a phased array allow it to be utilized to scan a solid rotor without removal of attached turbine blades. Phased array ultrasound provides a representation of a solid rotor by capturing a reflection signal as a two dimensional (2D) B-Scan. A phased array transducer (also referred to as a capturing device) has an array of crystal elements wherein each element can be driven independent from the other elements. Using a certain delay pattern while driving the array, different focal laws can be realized. Compared to a one-dimensional A-Scan transducer, a flaw is hit by many more ultrasound beams from different directions when using a phased array transducer. This provides more information pertaining to a flaw and enables a lower degree of conservatism in flaw analysis and more accurate flaw size estimation.
A phased array transducer is capable of transmitting and receiving sound waves from almost any angle thereby allowing the capture of data pertaining to sections of a rotor beneath turbine blades.
The number of capture positions around the axis and the number of B-scans at different angles of incidence at each capture position may vary. Further, different capturing devices and angles of incidence may be used in different axial positions. To account for these differences, acquisition set-up data and the captured data of each axial position are stored in an individual RDTiff file.
It should be noted that each 2D B-Scan, at each angle of incidence can be seen as a composition of individual one-dimensional (1D) A-Scans. As a consequence, the sampling grid may be highly irregular in that different areas of solid rotor 204 may be scanned with different sampling densities. This irregularity makes high demands on the reconstruction algorithm. In order to visualize the volume represented by the plurality of 2D B-Scans, a reconstruction algorithm need to resample the data to a regular 3D grid.
A backward mapping algorithm maps an image to a data space by searching the nearest sample positions in the data space. The data acquired during data acquisition results in a highly irregular sampling grid which results in the backward mapping algorithm being very time consuming. In a worst case scenario the position of every individual 1D A-Scan position has to do determined to check whether it affects an image sampling point. Further, the given geometry can lead to ambiguities in the computation.
A forward mapping algorithm maps data to an image space by identifying the image space sample positions which are affected by a data space sampling position.
In one embodiment, a forward mapping algorithm is used to map sample point data to an image space in which an assumption is made that every sample point in the data space represents a signal of a certain region. When the sample point is mapped to the image space, a particular sample point can affect multiple image space points but the influence of the particular sample point decreases over distance.
At step 302, each of the plurality of sample points of the plurality of two dimensional ultrasound scans are associated with a corresponding 3D image point of a regular 3D grid (e.g. a 3D space comprised of multiple stacked layers of cubes (or cuboids) arranged in columns and rows). The regular 3D grid is the framework which is used to construct a volume representing the scanned solid rotor. A particular sample point can be associated with a particular image point using data acquisition set up information contained in the RDTiff file with a related B-Scan. The data acquisition set up information describes how the plurality of scans are related to the solid rotor allowing the entire solid rotor to be accurately reconstructed in three dimensions on the regular 3D grid. It should be noted that each sample point can be associated with a particular corresponding image point on the 3D regular grid. Thus, every sample point has a corresponding image point. However, because of sampling constraints, not every image point of the 3D grid may have a corresponding sample point. Values for image points not having a corresponding sample point may be generated by interpolation using kernel functions.
Since different B-Scans can include data pertaining the same section of a solid rotor, multiple sampling points may represent the same portions of a solid rotor from different angles. Because these sample points describe reflection properties at different angles, no information should be omitted. However, since high amplitudes indicate a flaw or crack boundary in the solid rotor, high amplitudes are of more interest than low amplitudes. From these two considerations two different approaches are used. Specifically, a maximum and an average algorithm.
The maximum algorithm suppresses low amplitudes and conserves only the maximum within a certain region. The maximum algorithm is expressed as the equation:
In the average algorithm, the influence of a sampling point does not depend on its value but only on its distance to a grid point. The average algorithm is expressed as the equation:
The weighting functions wmax, f, a, s(i, j, k) and wavg, f, a, s(i, j, k) determine the energy spread of each sampling points, or in other words, the influence of each sampling point in the reconstructed volume, for both equations, respectively.
Returning to
The Gaussian function is expressed as the equation:
where Σf, a, s determines the shape and ratio of the Gaussian function.
The speed of the process may also be optimized using what is referred to as a fast algorithm. In the fast algorithm, each sample point is associated with a voxel. If two sample points are associated with a single voxel, the sample points are fused using either the average or maximum algorithm. A kernel with a fixed size and shape is then applied to every voxel to spread each sampling point's affect within each voxel. Although this fast algorithm is less accurate because a kernel's size and shape are fixed and not determined based on sampling, the fast algorithm allows quick reconstruction allowing a user to identify regions of interest which can then be reconstructed using a more accurate technique.
Returning to
At step 308, a value for each of a plurality of image points on the regular 3D grid is determined based on kernels overlapping each image point. Each kernel may cover multiple image points and many image points may be covered by multiple overlapping kernels. The value for each image point in the 3D grid is determined based on the value assigned to that image point by the kernels overlapping that image point. The sampling along a radial axis is typically dense resulting in multiple overlapping kernels along the radial axis. The circumferential spacing between sampling points is typically larger than the radial spacing of the sampling points and in some cases may be ten to one hundred times larger. Kernel size and shape may be adapted to compensate for radial and circumferential sampling density.
The steps are repeated as necessary for each image point to visualize a desired volume or section of a volume representing the solid rotor. This process is referred to as elliptical weighted average volume splatting (EWA volume splatting). It should be noted that the process described above uses a triangle kernel function to optimize the speed at which the process can be performed. However, the present invention is not limited thereto, and other types of functions, such as a Gaussian kernel function could also be used.
Modifying image points based on overlapping kernels can cause averaging which can lead to the erosion of single signal peaks (e.g., cracks which can only be seen from one angle) which may cause a flaw not to be visualized in the 3D volume. In order to ensure that single signal peaks appear in the final volume visualization regardless of the surrounding data, in one embodiment, a conservative maximum approach can be used to determine the value of each image point based on overlapping kernels. The conservative maximum approach suppresses low amplitude signals and conserves only the maximum within a certain region. In one embodiment, an average approach is used in which the influence of a particular image point does not depend on the value of the image point but only on the image point's distance to a particular grid point.
The kernel extent is important to prevent holes, aliasing, and over-blur. Usually, the sampling along the A-scan axis is very dense, whereas the distance between two neighboring A-scans might be ten to hundreds of times larger. In one embodiment, the kernel size is chosen to be twice the length to the neighboring A-scan or sampling point in each dimension.
Accurate determination of flaw size, shape, and orientation requires high accuracy in the determination of data acquisition settings such as the speed of sound in the object being scanned and the wedge angle of the phased array transducer signals.
As depicted in
Due to the large number of RDTiff files involved in one project according to one embodiment, the file size of each RDTiff file affects the speed of reconstruction. The size of the RDTiff files is determined in part by the sampling rate.
Returning to
In one embodiment, a portion of the total volume of a solid rotor can be displayed at a lower resolution to compensate for limitations of hardware used to support GUI 802 and increase the speed of reconstruction. Particular regions of a volume can be selected by a user to be reproduced in a higher resolution to provide a more detailed view of the particular region which aids in flaw analysis. After defining a region of interest, a table is generated displaying which channels and RDTiff files have been used for the reconstruction of the particular regions.
The above-described methods for three-dimensional visualization and analysis for AutoNDE-SR using ultrasonic phased array may be implemented on a computer using well-known computer processors, memory units, storage devices, computer software, and other components. A high level block diagram of such a computer is illustrated in
The foregoing Detailed Description is to be understood as being in every respect illustrative and exemplary, but not restrictive, and the scope of the invention disclosed herein is not to be determined from the Detailed Description, but rather from the claims as interpreted according to the full breadth permitted by the patent laws. It is to be understood that the embodiments shown and described herein are only illustrative of the principles of the present invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention. Those skilled in the art could implement various other feature combinations without departing from the scope and spirit of the invention.
This application claims the benefit of U.S. Provisional Application No. 61/248,545, filed Oct. 5, 2009, the disclosure of which is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5408884 | Sabourin | Apr 1995 | A |
5601083 | Anderson | Feb 1997 | A |
5880961 | Crump | Mar 1999 | A |
6175655 | George et al. | Jan 2001 | B1 |
7106322 | Deering | Sep 2006 | B2 |
7302851 | Czerw et al. | Dec 2007 | B2 |
7328620 | Howard et al. | Feb 2008 | B2 |
7499050 | Wu et al. | Mar 2009 | B2 |
7500396 | Bentzel | Mar 2009 | B2 |
7606445 | Howard | Oct 2009 | B2 |
7643604 | Jupiter et al. | Jan 2010 | B2 |
8010315 | Wu et al. | Aug 2011 | B2 |
8290303 | Washburn et al. | Oct 2012 | B2 |
8326011 | Star-Lack et al. | Dec 2012 | B2 |
20070217672 | Shannon et al. | Sep 2007 | A1 |
20090307628 | Metala et al. | Dec 2009 | A1 |
20120055252 | Boehm et al. | Mar 2012 | A1 |
20120113508 | Coleman et al. | May 2012 | A1 |
Number | Date | Country | |
---|---|---|---|
20110109627 A1 | May 2011 | US |
Number | Date | Country | |
---|---|---|---|
61248545 | Oct 2009 | US |