10 Pages

IJCIM-V131-pp6SeededRegionGrowing

Course: CS 6825, Fall 2008
School: CSU East Bay
Rating:
 
 
 
 
 

Word Count: 3316

Document Preview

Region Seeded Growing Features Extraction Algorithm Seeded Region Growing Features Extraction Algorithm; Its Potential Use in Improving Screening for Cervical Cancer N. A. Mat-Isa1, M. Y. Mashor2, and N. H. Othman3 1,2 Control and Electronic Intelligent System (CELIS) Research Group, School of Electrical & Electronic Engineering, Universiti Sains Malaysia, Engineering Campus Seri Ampangan, 14300 Nibong...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> CSU East Bay >> CS 6825

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Region Seeded Growing Features Extraction Algorithm Seeded Region Growing Features Extraction Algorithm; Its Potential Use in Improving Screening for Cervical Cancer N. A. Mat-Isa1, M. Y. Mashor2, and N. H. Othman3 1,2 Control and Electronic Intelligent System (CELIS) Research Group, School of Electrical & Electronic Engineering, Universiti Sains Malaysia, Engineering Campus Seri Ampangan, 14300 Nibong Tebal, Seberang Perai Selatan, Malaysia. E-mail 1: ashidi75@yahoo.co.uk, E-mail 2: yusof@eng.usm.my 3 Pathology Department, School of Medical Science Universiti Sains Malaysia, 16150 Kubang Kerian, Kelantan, Malaysia. E-mail3: hayati@kb.usm.my Abstract Region growing algorithm has successfully been used as a segmentation technique of digital images. The current study went one step further by utilizing the potential use of thresholding the region growing algorithm as features extraction technique. The proposed features extraction algorithm is called seeded region growing features extraction (SRGFE). This algorithm was used to extract four features of cervical cells; size of nucleus, size of cytoplasm, grey level of nucleus and grey level of cytoplasm. Correlation test was applied between data extracted using the proposed SRGFE algorithm with the data extracted manually by cytotechnologists. The high correlation value obtained in the correlation test show that the SRGFE algorithm is suitable and has high capability to be used as an image extraction technique to extract important features of cervical cells. This would assist cytopathologists and cytotechnologists in the cervical cancer screening by providing accurate value of size and grey level of nuclear and cytoplasmic features. Keywords Seeded region growing features extraction (SRGFE), cervical cells, Pap smear, medical imaging, features extraction. 1. Introduction Cervical cancer is the second common form of cancer among women (Othman, 2003, WebMD, 2003). Cervical cancer is a silent cancer. Unlike other cancers that cause pain, noticeable lumps or other early symptoms, cervical cancer has no telltale symptoms until it is so advanced that is usually unresponsive to treatment (WebMD, 2003). Only in its late stage, cervical cancer causes pain in the lower abdominal or back regions. However, most cervical cancer takes many years to develop from normal to dangerous stage. The mortality related to cervical cancer can be substantially reduced through early detection and treatment. Currently, Pap test is the most popular method to detect the presence of abnormal International Journal of The Computer, the Internet and Management Vol. 13#1 (January April, 2005) pp 61 -70 61 N. A. Mat-Isa, M. Y. Mashor, N. H. Othman cells arising from the cervix. Several previous studies by Cohn & Herzog (2001), Breen et al. (2001), Framer (2001), Kuie (1996) and Adami et al. (1994) showed that the chances for a woman acquiring cervical cancer is reduced if she has Pap test regularly. A computer model analysis has found that the proportion of cervical cancer reduction is approximately 30% for a smear taken once every 10 years, 80% for one done every five years, 90% for every three years, 91% for every two years and 92% for an annual smear (Kuie, 1996). Cervical cancer has been classified in a variety of ways. The new and commonly used is the Bethesda system. Abnormal cervical cells are classified into two types; low-grade squamous intraepithelial lesions (LSIL) and high-grade squamous intraepithelial lesions (HSIL) (WebMD, 2003, Stoler, 2002, Kuie, 1996). Cytopathologists differentiate both types of abnormal cervical cells and normal cells based on several morphologies. The abnormal cervical cells show changes in nucleocytoplasmic ratio. The cytoplasm size decreases but the nucleus size increases from normal cells to HSIL cells through LSIL cells (Crum, 1994, Govan et al., 1986). This phenomenon increases the nucleocytoplasmic ratio. Besides that, the abnormal cervical cells also show changes in colour (grey level) of nucleus and cytoplasm (WebMD, 2003, Crum, 1994). The grey levels for the cells' structures become darker from normal cells to HSIL cells through LSIL cells. Some studies (Nanda et al., 2000, Othman et al., 1997, Kuie, 1996, Hislop et al., 1994) proved that sometimes the Pap test is not effective. The determination of abnormal cervical cells can sometimes be missed in certain situation. Generally, the accuracy of Pap test depends on the quality of the Pap smear samples. The heavily stained Pap smear may be masked by menstrual blood, vaginal discharge, air artefacts etc thus obscuring the abnormal cervical cells. Sometimes, overexposing or underexposing to the microscope light may also blur the Pap smear images. Thus, the cytopathologists may have difficulty in extracting the important morphologies of cervical cells due to these problems. In this study, feature extraction algorithm based on region growing is proposed to extract the size and grey level of the region of interest. The algorithm is called seeded region growing features extraction (SRGFE). Then, the SRGFE algorithm will be used to extract the size of nucleus and cytoplasm of cervical cells as well as their grey level. 2. Region Growing Based Features Extraction Various medical imaging modalities such as X-ray, computer tomography (CT) and magnetic resonance imaging (MRI) are widely available and used in routine clinical practice. It has been generally accepted that visual interpretation of such images is highly subjective. As a result, there is a great need for image processing techniques that must be applied on medical images to assist the pathologists and radiologists for easier and better diseases diagnosis. One of the common image processing techniques is features extraction. Applications of various features extraction techniques in medical images have grown in recent years (Christoyianni et al., 1999, Chen et al., 1998, Pham et al., 1997, El-Faramawy et al., 1996, Chitre et al., 1993). In medical field, region growing algorithm has successfully been used as segmentation technique of medical images (Ngah et al., 2002, Venkatachalam et al., 2002, Tuduki et al., 2000, Ooi et al., 2000, Justice & Stokely, 1997). The current study 62 Seeded Region Growing Features Extraction Algorithm will utilize the potential use of thresholding the region growing algorithm as features extraction technique. The proposed algorithm is called seeded region growing features extraction (SRGFE). As shown in Figure 1, the SRGFE is used to extract the size and grey level of certain region of interest on a digital image. 1. Apply three preprocessing techniques to the image, which are median filter, histogram normalization and histogram equalization. 2. Determine the threshold value. 3. Click mouse in the region of interest. (Note: The pixel, which mouse is clicked on it will be used as initial seed pixel) 4. Choose N N neighbourhood as shown in Figure 2 (for N = 5 ) (Note: Initial seed point must be located at the centre of all its neighbours and N must be an odd number) 0 0 1 2 3 4 Figure 1: The region of interest for features extraction process. Referring to Figure 1, the size of the region is calculated as a total number of pixels in the region and given by the following equation. Size = Total of pixels in the region (1) 1 2 3 4 The grey level of the region is calculated as mean value of all pixels in the region and given by the following equation. Grey level = Total of grey level for all pixels in the region Total of pixels in the region Figure 2: Location of initial seed pixel (point) and its 5 5 neighbourhood (2) In the SRGFE algorithm, the user needs to determine the region of interest by clicking mouse on any pixels in the region. The user also needs to determine the threshold value. The algorithm of the proposed SRGFE algorithm can be implemented as: 5. Set the initial value for Total of pixels in the region with 1 and Total of grey level for all pixels in the region with original grey level value of the initial seed pixel. 6. Calculate the mean value, x (which is known as region mean) and standard deviation, of the N N neighbourhood using Equation 3 and 4 respectively. International Journal of The Computer, the Internet and Management Vol. 13#1 (January April, 2005) pp 61 -70 63 N. A. Mat-Isa, M. Y. Mashor, N. H. Othman x= _ x i =1 n i n n 2 (3) _ xi - x = + i =1 n -1 (4) where xi is grey level of i-th pixel in the N N neighbourhood and n is total of pixels in N N neighbourhood. 7. Grow the seed pixels to its neighbour's pixels. Compare the grey level of the seed pixel with its neighbour's pixel. Include the neighbour pixel into the region if it satisfy one of the conditions listed below (Romberg et al., 1997): a. If the gradient of the pixel is less than 95% of the equalized histogram AND the grey level of the pixel is less or equal to the preselected threshold. b. If the gradient of the pixel is more than or equal to 95% of the equalized histogram AND the grey level of the pixel is not more than or equal to one standard deviation away from the region mean. 8. If the neighbour pixel is included into the region: a. Add one (1) to Total of pixels in the region value. b. Add original grey level of the neighbour pixel to Total of grey level for all pixels in the region value. 9. Set the neighbour pixel, which is added to the region in Step (7) as a new seed pixel. 10. Repeat Step (6) to (9) until all pixels have been considered to be grown or the pixel cannot be grown anymore. 11. Calculate the value of the size and grey level of the region according to Equation (1) and (2) respectively. For Step (7) in the proposed algorithm, there are three possible ways for seed pixel to grow as shown in Figure 3(a), (b) and (c) respectively. (a) (b) (c) Figure 3: The seed pixel growing towards (a) its 4 adjacent neighbours (b) its 4 diagonal neighbours and (c) its 8 surrounding neighbours. 64 Seeded Region Growing Features Extraction Algorithm 3. Methodology and Materials In this study, the SRGFE algorithm is used to extract the size and grey level of two cervical cells' structures; the nucleus and the cytoplasm. Therefore, the original SRGFE algorithm needs to be modified. Two thresholds must be determined by the user, which represent threshold value for the nucleus and the cytoplasm respectively. The modification is made in the Step (2) of the SRGFE algorithm. For initial seed pixel determination as in Step (3), the mouse must be clicked in the nucleus regions of the cell of interest as shown in Figure 4. Thus, the growing process will start in the nucleus regions. Step (4) to (11) of the SRGFE algorithm needs to be repeated, which the first and second implementation will extract the nucleus and cytoplasm features respectively. For extraction process for both structures, the initial seed pixel is set to location of the clicking mouse by the user. certified cytotechnologist from HUSM using an image analyser. In the current study, the size of nucleus and cytoplasm that are calculated by SRGFE algorithm are represented by total number of pixels, while cytotechnologist calculated the size of nucleus and cytoplasm in micrometer. However, the colour of nucleus and cytoplasm that are determined by SRGFE algorithm and cytotechnologist are same, which are in grey level value. The current study determined the accuracy of the features extraction using the proposed SRGFE algorithm by comparing with those done by the cytotechnologist. The comparison is done using correlation The test. relationship is described as strong if the correlation value is higher than 0.8, moderate if equal or more than 0.5 but less than 0.8 and weak if less than 0.5 (Devore, 2000). 4. Results and Discussion Initial seed pixel Figure 4: The location of initial seed pixel for extraction of cervical cells' features. 350 images of cervical cells (161 normal cells, 93 LSIL cells and 96 HSIL cells) were used to determine the capability and the suitability of the SRGFE algorithm to extract the size and grey level of the nucleus and cytoplasm. The images have been captured from Pap smear samples. The samples were provided by Hospital Universiti Sains Malaysia (HUSM). The cells features were also extracted manually by experienced and The proposed SRGFE algorithm was implemented on 350 images of cervical cells, which were taken from Pap smear samples. Figure 5, 6 and 7 show the feature extraction result using SRGFE algorithm for three samples called CervixCell1, CervixCell2 and CervixCell3 respectively. Image (a) shows the original image, while image (b) shows the image after applying SRGFE algorithm. For image (b), the black region (grey level of 0) represents the nucleus region and the grey region (grey level of 127) represents the cytoplasm region that both were extracted by SRGFE algorithm. The white region (grey level of 255) represents the unwanted region (background region). Table 1 shows the results of features extraction of those images using SRGFE algorithm. International Journal of The Computer, the Internet and Management Vol. 13#1 (January April, 2005) pp 61 -70 65 N. A. Mat-Isa, M. Y. Mashor, N. H. Othman (a) Original CervixCell1 image (b) CervixCell1 image after applying SRGFE Figure 5: Results of features extraction using SRGFE algorithm for CervixCell1 image. (a) Original CervixCell2 image (b) CervixCell2 image after applying SRGFE Figure 6: Results of features extraction using SRGFE algorithm for CervixCell2 image. (a) Original CervixCell3 image (b) CervixCell3 image after applying SRGFE Figure 7: Results of features extraction using SRGFE algorithm for CervixCell3 image. 66 Seeded Region Growing Features Extraction Algorithm Table 1: Results of features extraction using SRGFE algorithm Data Type Size of nucleus Size of cytoplasm Grey level of nucleus Grey level of cytoplasm CervixCell CervixCell 2 CervixCell 3 1 3531 3201 4261 pixels pixels pixels 14027 19562 15790 pixels pixels pixels 146.88 139.38 149.22 nucleus, size of cytoplasm, grey level of nucleus and grey level of cytoplasm respectively. For data size, the value of size extracted using SRGFE algorithm is calculated in total of pixels, while for size extracted manually, the value is calculated in micrometer. The results in Table 2 and Figure 8 show that SRGFE algorithm extracts the cervical cells' features with accuracy as good as manual technique. The nucleus size, cytoplasm size and cytoplasm grey level show correlation higher than 0.95 and depicts very strong linear relationship between both methods. Correlation test for data of nucleus grey level is slightly lower, 0.884525, which is still within the strong linear relationship range. Superior correlation test suggests that the proposed SRGFE algorithm is a good feature extraction technique. The application in Pap smear would be able to assist cytopathologists for better cervical cancer screening by providing accurate value of size and grey level of nucleus and cytoplasm of cervical cells. Table 2: Results for correlation test. Data Type Size of nucleus Size of cytoplasm Grey level of nucleus Grey level of cytoplasm Correlation Value 0.973237 0.963314 0.884525 0.953263 180.76 165.73 169.27 With reference to Figures 5, 6 and 7, it can be observed that the SRGFE algorithm has a high ability to extract the nucleus and cytoplasm size of the cervical cells that closely represents the original images. The shape and size of both cervical cells structures are maintained. As mentioned in the previous section, the accuracy of the features extraction using the proposed SRGFE algorithm was compared with those manually done by the cytotechnologist using correlation test. The correlation test results between data extracted using SRGFE algorithm and data extracted manually by cytotechnologist are shown in Table 2. Figure 8(a), (b), (c) and (c) show plotted graph of data extracted using SRGFE algorithm versus data extracted manually by cytotechnologist, where each graph represents data for size of SRGFE 20000 15000 10000 5000 0 0 100 200 300 400 500 Manual Extraction (a) Size of nucleus International Journal of The Computer, the Internet and Management Vol. 13#1 (January April, 2005) pp 61 -70 67 N. A. Mat-Isa, M. Y. Mashor, N. H. Othman 200000 SRGFE 150000 100000 50000 0 0 5000 10000 15000 Manual extraction (b) Size of cytoplasm 200 SRGFE 160 120 80 80 100 120 140 160 180 200 Manual Extraction (c) Grey level of nucleus 260 220 SRGFE 180 140 100 80 100 120 140 160 180 200 220 240 260 Manual Ectraction (d) Grey level of cytoplasm Figure 8: Graph of data extracted using SRGFE versus data extracted manually by cytotechnologist. 68 Seeded Region Growing Features Extraction Algorithm 5. Conclusion The SRGFE algorithm has been proposed as features extraction technique for digital images. The current study used the proposed algorithm to extract 4 cervical cells features; size of nucleus and cytoplasm, and grey level of nucleus and cytoplasm. The data extracted using SRGFE algorithm gave high correlation value when compared with data extracted manually by cytotechnologist using image analyser. The strong linear relationship between both types of data clearly shows that the SRGFE algorithm is suitable to be used to extract cell features. The SRGFE algorithm, when applied to Pap smear could assist the cytopathologists in cervical cancer screening by providing accurate value of size and grey level of nucleus and cytoplasm. References [1] Adami, H. O., Ponten, J., Sparen, P., Bergstrom, R., Gustafsson, L. & Friberg, L. G. (1994). "Survival Trend After Invasive Cervical Cancer Diagnosis in Sweden Before and After Cytologic Screening". Cancer. 73(1). 140-147. Breen, N., Wagener, D. K., Brown, M. L., Davis, W. W. & Barbash, R. B. (2001). "Progress in Cancer Screening Over a Decade: Results of Cancer Screening From the 1987, 1992 and 1998 National Health Interview Surveys". Journal of the National Cancer Institute. 93(22). 17041713. Chen, C. W., Luo, J. & Parker, K. J. (1998). "Image Segmentation via Adaptive K-Mean Clustering and Knowledge-Based Morphological Operations with Biomedical Applications". IEEE Transaction on Image Processing. 7(12).1673-1683. Chitre, Y, Dhawan, A. P. & Moskowitz. (1993). "Artificial Neural Network Based [2] [3] [4] Classification of Mammogramic Microclassification Using Image Structure Feature". International Journal...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Minnesota - DELAG - 002
Module Delivery TasksProgramming and Related Tasks TaskDevelop Marketing Website Develop marketing sites.WhoCSHComments/Questions Freedemo site links to the Heathcare Professional Series demo page (learners can link to register from there) or to the
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/visualN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN#M.visual.G.frameC #man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit#dia
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN# class/viewN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN#V.view.editorC#man_variable_card# # identifier#module# last_modified#name#summary#description#see_also#inherit#defa
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/vectorN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN#M.vector.G.copyC# #man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit#dia
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN# class/textN# referenceC# hash_table#refer#sizeO#I#xN#bothI#&sN#M.text.G.pointedC #man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit#diag
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/table_rowN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN#M.table_row.S.ini tialiseC#man_method_card# identifier#module# last_modified#name#summary#description#see_also#i
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/socketN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN#M.socket.G.peer_n ameC#man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/resize_gestureN# referenceC# hash_table#refer#sizeO#I#xN#bothI# sN#V.resize_gesture.v_modeC#man_variable_card# # identifier#module# last_modified#name#summary#description#se
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/processN# referenceC# hash_table#refer#sizeO#I#xN#bothI#! sN#M.process.S.killedC#man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit#
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN# class/pceN# referenceC# hash_table#refer#sizeO#I#xN#bothI#AsN# V.pce.versionC#man_variable_card# # identifier#module# last_modified#name#summary#description#see_also#inherit#defa
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/int_itemN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN# C.int_itemC#man_class_card# # identifier#module# last_modified#name#summary#description#see_also#inherit#user_in
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/grboxN# referenceC# hash_table#refer#sizeO#I#xN#bothI#sN#C.grboxC#man_c lass_card# # identifier#module# last_modified#name#summary#description#see_also#inherit#user_inte rfa
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/displayN# referenceC# hash_table#refer#sizeO#I#xN#bothI#8sN#R.display.label_f ontC#man_resource_card# # identifier#module# last_modified#name#summary#description#see_also#in
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/click_gestureN# referenceC# hash_table#refer#sizeO#I#xaI#sN#M.click_gesture.S.dragC# #man_method_card# identifier#module# last_modified#name#summary#description#see_also#inh
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/chainN# referenceC# hash_table#refer#sizeO#I#xN#bothI#5sN#M.chain.S.beforeC #man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit#diag
MIT - I - 386
#PCE version 4#C# man_module#name#space#id_table#modified# current_idO#I#xN#class/bitmapN# referenceC# hash_table#refer#sizeO#I#xN#bothI# sN#M.bitmap.S.loadC#man_method_card# identifier#module# last_modified#name#summary#description#see_also#inherit#diag
BU - MATH - 341
confract+factor.nb11+1 2n = 12007001 12007001< "NumberTheory`ContinuedFractions`" In the program below we compute the values H-1L ^ Hk + 1L * q@k + 1D that satisfy num@kD ^ 2 = H-1L ^ Hk + 1L * q@k + 1D Hmod nL, where num@kD is the numerator of the k
Lake County - ECE - 567
ECE 567 COMMUNICATION NETWORK ANALYSIS PROBLEM SET 4FALL 2006 Due Wednesday, October 18Topics: M/G/1 (with vacation or priority, TDMA/FDMA), G/M/1, G/G/1 queues. Recommended reading: Kleinrock, Vol. 1, Section 5.3-5.8 pp. 174-216; Chapter 6 pp. 241-259;
Lake County - ECE - 567
ECE 567 COMMUNICATION NETWORK ANALYSIS PROBLEM SET 2FALL 2006 Due Wednesday, September 20Topics: renewal theory, classification of Markov processes, Markov queueing systems, method of phases Assigned reading: Sections 1.7-1.13 of the notes. Additional r
San Jose State - TEC - 302
Cheet Sheet MS 302 Test 1 1. Theorem (Interior Angles of a Polygon). sum of angles = (n - 2)180 . 2. Theorem (Heron's Formula). If a triangle has sides a, b, and c, let s= then A= 3. Theorem (Exterior Angle of a Triangle). An exterior angle equals the sum
Messenger - TD - 2602
enA imAging: seeing The inVisibLeenA imaging: seeing the invisiblePontus C. Brandt, Donald G. Mitchell, Edmond C. Roelof, Stamatios M. Krimigis, Christopher P. Paranicas, Barry H. Mauk, Joachim Saur, and Robert DeMajistreIn what follows, we describe t
UMBC - ENEE - 206
Experiment 1DC Meters and MeasurementsJohn Nosek ENEE 206 Section 101 Lab Report 1 2/17/04 Objective Use a DC multimeter to measure the currents, voltages, and resistance in a resistor circuit and diode circuit. Plot the I-V characteristics of each cir
Rose-Hulman - ECE - 250
NPN SILICON PLANAR MEDIUM POWER HIGH VOLTAGE TRANSISTORISSUE 2 MARCH 1994 FEATURES * 400 Volt VCEO * 0.5 Amp continuous current * Ptot= 1 WattZTX458C BEABSOLUTE MAXIMUM RATINGS.PARAMETER Collector-Base Voltage Collector-Emitter Voltage Emitter-Base
University of Florida - WEB - 107
April 29th 2006P.K. Yonge Developmental Research School Gainesville - FloridaApril 2006 Dear Fellow Educators, The Center for School Improvement at the University of Floridas College of Education, in partnership with the North East Florida Educational C