<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JGIS</journal-id><journal-title-group><journal-title>Journal of Geographic Information System</journal-title></journal-title-group><issn pub-type="epub">2151-1950</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jgis.2013.51009</article-id><article-id pub-id-type="publisher-id">JGIS-27927</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Earth&amp;Environmental Sciences</subject></subj-group></article-categories><title-group><article-title>
 
 
  The Multiresolution Image Format
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>itusz</surname><given-names>Bugya</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Ákos</surname><given-names>Halmai</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>University of Pécs Doctoral School of Earth Sciences, Pécs, Hungary</addr-line></aff><aff id="aff1"><addr-line>University of Pécs Institute of Geography, Pécs, Hungary</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>titusz@gamma.ttk.pte.hu(IB)</email>;<email>halmaia@gamma.ttk.pte.hu(ÁH)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>21</day><month>02</month><year>2013</year></pub-date><volume>05</volume><issue>01</issue><fpage>87</fpage><lpage>95</lpage><history><date date-type="received"><day>September</day>	<month>25,</month>	<year>2012</year></date><date date-type="rev-recd"><day>October</day>	<month>28,</month>	<year>2012</year>	</date><date date-type="accepted"><day>November</day>	<month>29,</month>	<year>2012</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
   In this paper we present a new method and file format which allows to create, store and manipulate multiresolution raster images. “Classic” raster images are built up by rasters (pixels) where in the same image each raster (pixel) has the same size. Multiresolution raster image (mri) are unlike the “classic” raster images. An mri file is a regular text file, conformed xml 1.0 standard and allows: 1) to store raster based images with different resolution in the same file and in the same time (i.e., allows to contain rasters with different size in the same image); 2) to export easily any part of the image as a separate raster image and to import an image as a part of a raster; 3) to define geographical reference for a raster image and use this image as a raster based GIS model; 4) to perform computations (i.e., image manipulation) on the content of the file. It is an important characteristic of the mri format that mathematical operations could be performed always in the same resolution as the current resolution of the given part of the image. To confirm this statement we present how to perform a convolution on an mri file. 
 
</p></abstract><kwd-group><kwd>Multiresolution; Image Storing; Raster; GIS</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Raster based data storage is a common way in the image processing and manipulating. It is widely used by spatial informatics systems too, as “raster based data model”.</p><p>There are many raster based file formats nowadays, but at least in one point all of them are very similar to each other: the image contained by the file, has only one resolution on the entire image. This means that number of pixels of the image unambiguously can be computed knowing dimensions of this image (columns and rows). When the hardware used for displaying this image also known, the actual resolution can be defined as DPI.</p><p>Hence, because the resolution in the separate parts of an image can not be changed, there is no way to store image data with different resolution in the same image. In case where two or more different resolution raster image of the same object is to be used, separate images with the adequate resolution has to be created—one file for each resolution, or at least one layer for each resolution.</p><p>An example should help to expose the problem.</p><p>Let there be a raster based map (spatial model) that contains data of a valley and it has a resolution of 10 &#215; 10 meters and in the mid-line of this valley a watercourse. The aim is to survey its surround in more detailed than the valley itself, e.g. in 1 &#215; 1 meter resolution. There are only two options to store results in the same raster file.</p><p>• The first choice is to reduce the resolution of the more detailed parts of the image, to fit data to low resolution parts of map. This makes the detailed surveying itself pointless.</p><p>• The other way is to improve the resolution of the low resolution parts to fit to those more detailed areas.</p><p>In latter case, the low resolution rasters will be resampled and new rasters will be created, using an adequate interpolation method. This is the commonly used method, for it gives the possibility to use the results of surveying and the previously existing image data in the same time and in the same file. Disadvantage of this solution is the need for more memory, more CPU-time and more storage capacity.</p><p>Our research gives a possible solution for this question and for similar cases too.</p><p>Peucker et al. (1978) [<xref ref-type="bibr" rid="scirp.27927-ref1">1</xref>] recognized the same problem in the field of the digital terrain representation. Their famous article “The Triangulated Irregular Network” gives a good solution to store and represent non-equally spaced vector (elevation) data. But there was no significant precedent found in scientific papers on multiresolution image (raster-based) format, presented in this paper.</p></sec><sec id="s2"><title>2. Multiresolution Image Container File Format</title><p>Multiresolution image format (mri)1 is an ASCII XML file, conformed to xml version 1.0 (see detailed technical description in Bray et al. 2008) [<xref ref-type="bibr" rid="scirp.27927-ref2">2</xref>]. We chose the xml standard, because it is an open, crossplatform format, and also widely used in the field of geomatics, in most cases to represent vector based data (Antoniou &amp; Tsoulos 2006) [<xref ref-type="bibr" rid="scirp.27927-ref3">3</xref>]. The mri format allows to create and use multiresolution parts in the same file and in the same time (see Figures 1 and 2). It also allows taking mathematical operations (image processing) on data with different resolutions, handling different resolutions rasters (pixels) as a uniform array.</p><p>Essential characteristics of this format is, that each sub-resolution can easily be exported as a separate image and also simple to attach a more detailed dataset to any raster of the image.</p><p>The mri format allows to store information as raster based GIS data with the adequate spatial references or simple image data without any spatial references. This means, that the same dataset can be handled as a simple raster image or if it is needed, as a raster based, georeferenced GIS model.</p><p>Mri is a hierarchically structured format: each resolution is a resolution-level and each resolution-level might have a sub-resolution. Iteration is allowed, hence theoretically it is not limited the number of sub-resolutions. The base thought is, that a raster image can be defined not only as a matrix, but as a hierarchically structured vectors too, when each line of a raster image is a vector and any vector can be linked to any other vector using a properly defined pointer in the file. As xml is itself a hierarchical language with links and pointers, mri format</p><p>were defined as an regular text file conformed to xml standard.</p><p>The base resolution (highest-level resolution) of an image named as resolution 0 (zero). Resolution 0 is a quadratic-shape raster image, where there are M columns &#215; N rows and each raster (cell) have to contain exactly one attribute data or at least a NO_DATA notes.</p><p>Any raster of Resolution 0 may have a sub-resolution, named as resolution 1. This means that there is an attribute dataset attached to the given raster of Resolution 0, which represents the inner part of this raster. Resolution 1 characterized by its size as m columns &#215; n rows. Similarly to resolution 0, each raster have to contain exactly one attribute data or at least a NO_DATA notes.</p><p>Resolution 1 may also have a sub-resolution, named as Resolution 2, and so on.</p><p>Each raster can only have the same sub-resolution on the same resolution-level. This means, that when a raster exists on resolution-level 0 with sub-resolution resolution 1, other raster on resolution-level 0, can only have the same resolution 1. For example, if a raster of resolution-level resolution 0 have a sub-resolution 40 &#215; 40 (resolution 1), then any other raster of resolution 0 can only have a sub-resolution 40 &#215; 40.</p><p>Please note that resolution of resolution-levels can differs, so it is possible to define different resolution for each resolution-level separately.</p><p>Now, below it is an mri file, that contains data of raster image b of <xref ref-type="fig" rid="fig2">Figure 2</xref>. on page 3 and its explanation.</p><p>&#160;</p><p><img src="9-8401186\2b23aa47-fd5c-4632-aecf-f48c48cd39d0.jpg" /></p><p>• Lines 1 to 4:</p><p>General xml notes.</p><p>• Line 5:</p><p>Geographical metadata. If exists, data follows in the file, have to be interpreted as a raster based GIS model. If not exists (i.e., the tag is not in the file), data has to be interpreted as a raster image, without any spatial reference.</p><p>Geographical metadata is very similar to the header of a standard ESRI ASCII raster file, hence the conversion from ESRI ASCII to mri and vice versa becomes a simple process.</p><p>EPSG—EPSG code of used projection system.</p><p>XLLCorner—X coordinate of the lower left corner of the image.</p><p>YLLCorner—Y coordinate of the lower left corner of the image.</p><p>Height2—The real height of a raster, in units defined by the used projection system.</p><p>Width—The real width of a raster, in units defined by the projection system in use.</p><p>• Line 6:</p><p>Rasters—Signs the begin of all resolution’s raster attribute data. It always has to be ended by /Rasters at the end of definition of all raster attribute data of all resolutions (see: Line 27).</p><p>• Line 7 - 10:</p><p>Definition of a resolution.</p><p>Raster—Beginning of definition of a resolution. Has to be closed by/Raster (see: Line 10).</p><p>RES—Level of resolution. Always has to be followed by an integer as parameter. An mri type raster image always has to contain a base level resolution (named as “resolution zero”) and its parameter is 0 (zero).</p><p>ID—Identifier of the attribute data series contained by the given Raster. The parameter is an integer, defined by the user or the creator of the file.</p><p>MyBaseRaster—Identifier of the parent resolution level. In case where RES = 0, it has a parameter—1 (because resolution zero has no parent resolution). In any other case the parameter is equal to the parameter of RES of the parent resolution level.</p><p>Name—Name of the resolution, given by the user. Free formed character string.</p><p>Columns—Number of the columns.</p><p>Rows—Number of the rows.</p><p>FromX—Denotes the number of the column in which the parent raster of the given resolution can be found. If value of RES is zero, FromX must be 1.</p><p>FromY—Denotes the number of the row in which the parent raster of the given resolution is to be found. If value of RES is zero, FromY must be 1.</p><p>NO_DATA—Integer, value of the raster cells with no data.</p><p>Data—Attribute data series. Each number shows the attribute data of a raster. Numbers are written one after the other, separated by a semicolon. The last character has to be a semicolon, white spaces are ignored. The first number is the attribute data of the upper left raster and the last number is the same of the lower right raster. Attribute data read from left to right, draws the matrix row by row from left to right, top to bottom.</p><p>All data structures are white-space independent, hence 10;11;12;13;20;21;22;23;30;31;32;33;40;41;42;43;will be the same as</p><p>&#160; <img src="9-8401186\0e837eb3-4a7e-430a-a2f7-95d845b4d323.jpg" /></p><p>• Line 11 - 14:</p><p>Definition of a sub-resolution. The structure is the same as shown in lines 7 - 10. Now RES is equal to 1 which shows that it is a first level sub-resolution, and ID and Name are also different. Value of MyBaseRaster (0) refers to Resolution 0, as parent resolution. As it can be read from values of Columns and Rows, it is a 3 &#215; 3 matrix, a sub-matrix (sub-resolution) of the raster which has coordinates X = 2; Y = 2 of Resolution zero.</p><p>• Line 15 - 18:</p><p>• Second sub-resolution level, sub-resolution of Resolution 1. Interpretation is the same as above.</p><p>• Line 19 - 22:</p><p>First level sub-resolution of the raster in resolution zero, where X = 2; Y = 3.</p><p>• Line 23 - 26:</p><p>First level sub-resolution of the raster in resolution zero, where X = 2; Y = 4.</p><p>• Line 27:</p><p>Closing tag of definition for all resolutions.</p><p>• Line 28:</p><p>End of file tag.</p><sec id="s2_1"><title>2.1. Data Exchange</title><p>Mri format allows to exchange attribute data between other files using a simple text editor. It also allows to handle a sub-resolution as a separate image in a separate file, or to insert a content of an image in the mri file as a sub-resolution.</p><sec id="s2_1_1"><title>2.1.1. Data Extract from an Mri File</title><p>Let us aim to create a new, raster based GIS file using a sub-resolution level 1, where ID = 1 (it is defined in lines 11 - 15 in the example). In this case the operations are as follows.</p><p>• Step 1 Copying of lines 11 - 14 to a new, empty file.</p><disp-formula id="scirp.27927-formula155188"><graphic  xlink:href="9-8401186\23081c3a-0025-43e3-8570-fc6c7fe4794d.jpg"  xlink:type="simple"/></disp-formula><p>• Step 2 Using informations of mri file contained in Geography tag (line 5 in the example) and values of parameters Columns, Rows, FromX, FromY and NO_DATA of sub-resolution, has to create an ESRI ASCII type header for the new file.</p><p><img src="9-8401186\b4f59442-9b85-4c4f-a8f6-c6326766fd7c.jpg" /></p><p>If XLLCorner—L<sub>x</sub></p><p>YLLCorner—L<sub>y</sub></p><p>Height—h Width—w From X—S<sub>x</sub></p><p>From Y—S<sub>y</sub></p><p>then</p><disp-formula id="scirp.27927-formula155189"><label>(1)</label><graphic position="anchor" xlink:href="9-8401186\644bf606-6776-4a54-9317-3f980e40a2ae.jpg"  xlink:type="simple"/></disp-formula><p>when x = X is one of the coordinates of the lower left corner in the new file.</p><p>Furthetmore</p><disp-formula id="scirp.27927-formula155190"><label>(2)</label><graphic position="anchor" xlink:href="9-8401186\cdc59138-67ad-428f-bd06-69e7064d922a.jpg"  xlink:type="simple"/></disp-formula><p>when y = Y is the other coordinate of the lower left corner in the new file. Using the actual values of the example on the page 5 , x = 581,000 and y = 81,000.</p><p><img src="9-8401186\0728ace2-7db7-4fad-a76e-35b29706371e.jpg" /></p><p>• Step 3 The creating of the attribute data for ESRI ASCII grid by using data in Data tag of mri file. Since the mri file uses semicolons to separate data, and ESRI ASCII grid uses spaces, hence required to change semicolons to spaces, but other data conversion (or structural conversion) is not necessary.</p><p><img src="9-8401186\452892d2-9038-4e23-a082-79baf7e40602.jpg" /></p><p>The result is an ESRI ASCII grid:</p></sec><sec id="s2_1_2"><title>2.1.2. Data Insert into an Mri File</title><p>Goal-matrix is the matrix the data series has to be inserted, while the source-matrix is the source of the data series. In the actual sample the goal-matrix is the file presented on page 5, and the source-matrix is as follows:</p><p>ncols 4</p><p>&#160; <img src="9-8401186\c93171be-044c-400b-99c6-dfec84cf0533.jpg" /></p><p>To create a sub-resolution using source dataset, there has to be Columns, Rows, FromX, FromY and Nodata defined.</p><p>Now,</p><p><img src="9-8401186\ec93a43c-2f3c-4961-9492-dbe0d42517ee.jpg" /></p><p><img src="9-8401186\31172bf9-64a1-4640-9327-5e092fef639f.jpg" /></p><p><img src="9-8401186\559c88eb-8553-481b-9ec9-d5b8892a82fd.jpg" /></p><p>Data series itself remains the same, but numbers ha convolution matrix which is no larger than 2m + 1 &#215; 2n + 1 as to be separated by a semicolon and the last character also has to be a semicolon.</p><p>Using resultant values, sub-resolution can be defined as follows:</p><p><img src="9-8401186\68accceb-0192-4279-a66e-8f2973f1712f.jpg" /></p><p><img src="9-8401186\96310445-7c72-4ecb-bc69-97fa8db3ee29.jpg" /></p><p>Copying this text into the original mri file (page 5 .), the result will be a new sub-resolution of raster X = 4, Y = 2 in resolution level RES 0.</p></sec></sec></sec><sec id="s3"><title>3. Mathematical Operations—Convolving a Multiresolution Image</title><p>Mri format allows to perform mathematical operations on image. In this paper convolution will only be presented, because it is a complex and general method in the field of raster image processing. It is an important characteristic of mri format, that results of a convolution will be the same resolution as the original matrix had.</p><p>The following example presents a way to apply a convolution matrix to determine average of attribute data of cells.</p><p>Equations presented has one significant limitation: a convolution matrix that is not larger than 2m + 1 &#215; 2n + 1 can only be used. However it is easily can be overpassed using equations of Part 3.2 .</p><sec id="s3_1"><title>3.1. Denominations</title><p>For example, when convolution matrix is on the bottom right corner of the sub-resolution, section A, B, E and F has to be considered.</p></sec><sec id="s3_2"><title>3.2. General Convolution for Resolution 0</title><p>The following equations show how to convolve a regular (non-multiresolution) images, when image is M &#215; N and convolving matrix is J &#215; K (see <xref ref-type="fig" rid="fig3">Figure 3</xref>).</p><disp-formula id="scirp.27927-formula155191"><label>(3)</label><graphic position="anchor" xlink:href="9-8401186\7ba41848-1d17-4443-9154-399228f06013.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155192"><label>(4)</label><graphic position="anchor" xlink:href="9-8401186\444ce57e-ea3b-4a25-beb7-0889c173e8ce.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155193"><label>(5)</label><graphic position="anchor" xlink:href="9-8401186\f5a77eb1-b9c7-42e5-9808-dd2588f118fc.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3"><title>3.3. Convolution for Sub-Resolution</title><p>Convolution of multiresolution parts of an image differs from the convolution of a simple raster image. Our first task is to define all the possible areas (see <xref ref-type="fig" rid="fig4">Figure 4</xref>). The second step is to give the equations for each section (see parts from 3.3.2 to 3.3.11).</p><p>The equation of an area describes how to compute the required result. These equations are built up from sepa-</p><p>rate vectors. Each vector is a unique line (cells one after the other from left to right) in the given section.</p><p>Let us assume that the aim is to compute the average of attribute data of cells under the convolution matrix. Then each equation will be the sum of a vector and the sum of all vectors divided by the number of cells of convolution matrix (j &#215; k, see <xref ref-type="fig" rid="fig5">Figure 5</xref>) giving the searched result.</p><p>Each section (area) has its own equation-system and its own parameters a, b and i in the equations). Equations and parameters can be traced back to the parameters and equations of section “A”, as it is presented later (equations following the arrows).</p><p>After solving equations in Parts 3.3.1 to 3.3.10, the next step is to compute the result of equation in part 3.3.11. It is the average wanted, and it gives the result of the convolution.</p><p>Equation-system has to be iterated as the matrix passes on the sub-resolution.</p><p>In the following, to understand what equations makes, it is useful to studying <xref ref-type="fig" rid="fig4">Figure 4</xref>-6.</p><sec id="s3_3_1"><title>3.3.1. Common Rules</title><disp-formula id="scirp.27927-formula155194"><label>(6)</label><graphic position="anchor" xlink:href="9-8401186\64e749c4-d864-4246-b705-f754192db94e.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_2"><title>3.3.2. Segment “A” (I)</title><disp-formula id="scirp.27927-formula155195"><label>(7)</label><graphic position="anchor" xlink:href="9-8401186\c7af914f-69b4-456d-8370-d0296339b323.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155196"><label>(8)</label><graphic position="anchor" xlink:href="9-8401186\980285d2-35b4-4178-9605-9fe37c4c713d.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155197"><label>(9)</label><graphic position="anchor" xlink:href="9-8401186\b0afd38e-ee21-4efd-873f-6851b9bf48dc.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_3"><title>3.3.3. Segment “B” (I + 1)</title><disp-formula id="scirp.27927-formula155198"><label>(10)</label><graphic position="anchor" xlink:href="9-8401186\a52a1a39-014b-4c48-bbbc-e5e641b71851.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155199"><label>(11)</label><graphic position="anchor" xlink:href="9-8401186\dd6363d7-f778-4641-8097-7e7c958ed56d.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155200"><label>(12)</label><graphic position="anchor" xlink:href="9-8401186\76855abc-68a8-440f-98a2-7b4f5336d530.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\d6eaf665-67cd-4fe5-9eee-c7bed6018d0e.jpg" /></p><disp-formula id="scirp.27927-formula155201"><label>(13)</label><graphic position="anchor" xlink:href="9-8401186\a3cf9ecc-9172-432e-86e4-20b273636417.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_4"><title>3.3.4. Segment “C” (I − M)</title><disp-formula id="scirp.27927-formula155202"><label>(14)</label><graphic position="anchor" xlink:href="9-8401186\f7de1ab5-41fe-4473-a13f-ff95553d0d6a.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155203"><label>(15)</label><graphic position="anchor" xlink:href="9-8401186\8a08e2e8-09e1-4068-a29f-575838ec15a2.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155204"><label>(16)</label><graphic position="anchor" xlink:href="9-8401186\08b69db2-13d2-44a0-9b76-ce7398a6b8e1.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\35b5d6a8-e0d1-4ec5-930f-166f49ebb363.jpg" /></p><disp-formula id="scirp.27927-formula155205"><label>(17)</label><graphic position="anchor" xlink:href="9-8401186\41c462eb-46ad-4f3f-9835-deede261873a.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_5"><title>3.3.5. Segment “D” (I + 1 − M)</title><disp-formula id="scirp.27927-formula155206"><label>(18)</label><graphic position="anchor" xlink:href="9-8401186\07db23bc-fe65-4c60-9576-7e48a6e1f4ff.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155207"><label>(19)</label><graphic position="anchor" xlink:href="9-8401186\8162e38e-0d07-42de-a70e-2812613cface.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155208"><label>(20)</label><graphic position="anchor" xlink:href="9-8401186\215556ba-9c16-45c5-8228-6dcf36c826aa.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\79037a05-81fe-4fd5-97f3-cbecbd7170e7.jpg" /></p><disp-formula id="scirp.27927-formula155209"><label>(21)</label><graphic position="anchor" xlink:href="9-8401186\fc6bed5b-f856-4c1f-80ad-fa0cb900adcd.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_6"><title>3.3.6. Segment “E” (I + M)</title><disp-formula id="scirp.27927-formula155210"><label>(23)</label><graphic position="anchor" xlink:href="9-8401186\f13f35c0-501c-4a1d-bad4-aacd44e0f1eb.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155211"><label>(24)</label><graphic position="anchor" xlink:href="9-8401186\3f8a892b-fc74-4067-b794-d2d7698d79f1.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\48e4c00a-e55e-4ebb-bfea-f7bb408cbbbb.jpg" /></p><disp-formula id="scirp.27927-formula155212"><label>(25)</label><graphic position="anchor" xlink:href="9-8401186\2717fd3a-5c7c-47f7-975d-5665e7076df4.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\0ecccc3e-abe7-421a-9249-40d226f98df5.jpg" /></p><disp-formula id="scirp.27927-formula155213"><label>(26)</label><graphic position="anchor" xlink:href="9-8401186\9b9881d9-1b67-425a-92a8-e0ddf1d4b3b5.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_7"><title>3.3.7. Segment “F” (I + 1 + M)</title><disp-formula id="scirp.27927-formula155214"><label>(27)</label><graphic position="anchor" xlink:href="9-8401186\b992d7b1-8273-4766-9a72-632edf49ff16.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\24d0ac18-f53e-4251-a120-0fdbaf727464.jpg" /></p><disp-formula id="scirp.27927-formula155215"><label>(28)</label><graphic position="anchor" xlink:href="9-8401186\c3f5e7d4-c5ed-4638-9df2-b6de6824eaad.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\41ab05f4-aa37-47b3-8f14-f4a3d186c0c2.jpg" /></p><disp-formula id="scirp.27927-formula155216"><label>(29)</label><graphic position="anchor" xlink:href="9-8401186\b2ecc937-6dd4-4935-96f5-ce93ed72513d.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\701cdd3b-9394-4b7e-9903-1d077530f9b0.jpg" /></p><disp-formula id="scirp.27927-formula155217"><label>(30)</label><graphic position="anchor" xlink:href="9-8401186\68804c7d-5b4c-43cd-ba9a-739f306d8cfd.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_8"><title>3.3.8. Segment “G” (I − 1)</title><disp-formula id="scirp.27927-formula155218"><label>(31)</label><graphic position="anchor" xlink:href="9-8401186\9789c28a-c611-43f2-975e-ae38af4e1170.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155219"><label>(32)</label><graphic position="anchor" xlink:href="9-8401186\3bcb6487-5e1d-44c3-9bb2-2e2ab1cfabc9.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155220"><label>(33)</label><graphic position="anchor" xlink:href="9-8401186\497bb9d9-f336-4370-b5b5-6b3d18c055aa.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\227b6314-3d1f-4bd6-aef1-ffa8f4d96b79.jpg" /></p><disp-formula id="scirp.27927-formula155221"><label>(34)</label><graphic position="anchor" xlink:href="9-8401186\197c8a22-3a1a-4433-8f53-1546b07fcd58.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_9"><title>3.3.9. Segment “H” (I − 1 − M)</title><disp-formula id="scirp.27927-formula155222"><label>(35)</label><graphic position="anchor" xlink:href="9-8401186\e2ecc322-ad4e-4e6b-8c46-8fe9987364cc.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155223"><label>(36)</label><graphic position="anchor" xlink:href="9-8401186\f3070946-8d62-48ec-896a-2355b765a4a0.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155224"><label>(37)</label><graphic position="anchor" xlink:href="9-8401186\b43f6d32-8b4e-46d4-a855-7a3f83229d22.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\6c7a30e8-df01-4e1f-ba6b-0872deff5f72.jpg" /></p><disp-formula id="scirp.27927-formula155225"><label>(38)</label><graphic position="anchor" xlink:href="9-8401186\0a8182e9-2e2c-4f25-a7ea-4c4e7ded9750.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_10"><title>3.3.10. Segment “I” (I − 1 + M)</title><disp-formula id="scirp.27927-formula155226"><label>(39)</label><graphic position="anchor" xlink:href="9-8401186\6e511b49-05a3-430a-9c47-42823ea33934.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155227"><label>(40)</label><graphic position="anchor" xlink:href="9-8401186\d6e34aac-267f-426c-a495-5707fae6fd98.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.27927-formula155228"><label>(41)</label><graphic position="anchor" xlink:href="9-8401186\09a7db15-3d4e-4359-8e3f-090e2e468273.jpg"  xlink:type="simple"/></disp-formula><p><img src="9-8401186\d5e1dba7-83c4-4f48-a960-f9247afd37a9.jpg" /></p><disp-formula id="scirp.27927-formula155229"><label>(42)</label><graphic position="anchor" xlink:href="9-8401186\b356a6d3-0c5b-40a8-ba51-42f49ab4ef33.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s3_3_11"><title>3.3.11. Average for i</title><disp-formula id="scirp.27927-formula155230"><label>(43)</label><graphic position="anchor" xlink:href="9-8401186\6fe67f2d-4faa-46df-b9cf-bd440a652b65.jpg"  xlink:type="simple"/></disp-formula></sec></sec></sec><sec id="s4"><title>4. Converting an Mrifile into Vector Format</title><p>Mri format allows raster-vector conversion, because contains enough data to determinate the center point of each raster cell of each sub-resolution. Current value of parameters XLLCorner, YLLCorner, Height, Width, MyBaseRaster, Columns, Rows, FromX, FromY, NO_DATA, are always known, and they makes possible to compute the center point of every raster cell (<xref ref-type="fig" rid="fig7">Figure 7</xref>). The simplest way is probably to create an ASCII point vector file. Resultant vector based model can be used as usual, creating—for example—a TIN-model for 3D visualization.</p></sec><sec id="s5"><title>5. Further Ways of Development</title><p>Multi color resolution in the same image: each subresolution should have its own color model. Practically it only would be a tag in the xml file that contains the color model used. It allows using raster images with different color-model in the same image, so there is no need to convert separate images to the same color-model before importing it. For example:</p><p><img src="9-8401186\f753ab95-2b4d-41bb-baf9-ad5fe6946d4a.jpg" /></p><p>In this case it is possible to use several color model in the same image, but only one can be used by sub-resolutions. Let might prove to be an important question, how to perform computations when two or more different model have to be considered at the same time?</p><p>Extended multiresolution: each sub-resolution should have different resolutions. This would give the maximum flexibility in the practice; on the other hand there would be many problems in the field of image analysis and image processing. The storage of attribute data would be very simple in the file structure presented in this paper, because xml tag allow to define different resolutions by the using sub-resoultions.</p><p>The question naturally arises, how to make computations (for example: convolution) when rasters with different sub-resolutions are adjacent? What to do when its quotation is not an integer?</p><p>3D mri. This would be very useful in 3D GIS, for example in the field of geological modeling, or meteorological modeling. The basis idea is the same as in the 2D mri, and the file structure would be similar. The main problem is the mathematical background, equations and thoughts presented in this paper probably would be inadequate in this case.</p></sec><sec id="s6"><title>6. Summary</title><p>In the field of surveying and GIS based spatial analysis it is a common problem to use a raster images simultaneously with two or more different resolution. This problem can be divided in two parts: storing of the image and perform mathematical operations on it.</p><p>Our research gives a possible solution for this situation, because multiresolution image format (mri) allows</p><p>• to store raster based images with different resolution in the same file and in the same time;</p><p>• to import or export easily any part of the image as a separate image;</p><p>• to define geographical reference for a raster image and use this image as a raster based GIS model;</p><p>• to perform computations (i.e., image manipulation) on the content of the file.</p><p>Moreover, mri format allows a wide compatibility and interoperatibility, since it is a text file, conformed to xml 1.0 standard.</p><p>As we have shown it is possible to perform mathematical operations on an mri file, presented an algorithm and the proper equations to execute a convolution and we alluded to the possibility of conversion a multiresolution raster into vector format.</p><p>In the practice, mri format should be very useful, not only in the field of GIS, but also in the field of the general image storing and processing. Mri allows to take multiresolutional photos and videos, or security cameras, when only a moving object has to be stored using the full resolution while the background may be stored with lower resolution.</p><p>As for further development of mri format, we suggested three main point:</p><p>• multi color resolution• extendend multiresolution• 3D multiresolution.</p><p>Naturally, any further ways of development of mri format and ideas would be appreciated by the authors.</p></sec><sec id="s7"><title>7. Acknowledgements</title><p>Many thanks to Mr. PERE L&#225;szl&#243; programmer, mathematician (Blum Software Engineering Ltd., Hungary), for thought-provoking reviews, constructive comments and the linguistic support.</p></sec><sec id="s8"><title>REFERENCES</title></sec><sec id="s9"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.27927-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">T. K. Peucker, R. J. Fowler, J. J. Little and D. M. Mark, “The Triangulated Irregular Network,” Proceedings of the ASP-ACSM Symposium on DTM's, St. Louis, 1978, pp. 516-540.</mixed-citation></ref><ref id="scirp.27927-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">T. Bray, J. Paoli, C. M. Sperberg-McQueen, E. Maler and Y. Fran?ois, “Extensible Markup Language (XML) 1.0 (Fifth Edition),” 2008.  
http://www.w3.org/TR/2008/REC-xml-20081126/ </mixed-citation></ref><ref id="scirp.27927-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">B. Antoniou and L. Tsoulos, “The Potential of XML Encoding in Geomatics Converting Raster Images to XML and SVG,” Computers &amp; Geosciences, Vol. 32, No. 2, 2006, pp. 184-194. doi:10.1016/j.cageo.2005.06.004</mixed-citation></ref></ref-list></back></article>