Author: claimsbot

1-22. (cancelled)
23. A canister or upright vacuum cleaner comprising:
a) a vacuum cleaner head having a dirty air inlet;
b) a first cyclonic stage in fluid flow communication with the dirty air inlet and with a source of suction, the first cyclonic stage having at least one upstream cyclone which has an associated upstream particle collector;
c) a second cyclonic cleaning stage comprising a plurality of downstream cyclones in parallel which have an associated downstream particle collector, each downstream cyclone having an air exit; and,
d) a filter positioned downstream from the second cyclonic cleaning stage and in fluid flow communication with each downstream cyclone air exit.
24. The canister or upright vacuum cleaner of claim 23 wherein the downstream cyclone air exits extend to a manifold and the manifold has an air exit which is in fluid flow communication with the filter.
25. The canister or upright vacuum cleaner of claim 24 wherein the filter is a HEPA filter.
26. The canister or upright vacuum cleaner of claim 23 wherein the first cyclonic stage has an air exit and the second cyclonic cleaning stage has an air inlet and the vacuum cleaner further comprises a passage extending from the first cyclonic stage air exit to the second cyclonic stage air inlet.
27. The canister or upright vacuum cleaner of claim 26 wherein the passage narrows in the downstream direction.
28. The canister or upright vacuum cleaner of claim 26 wherein the passage narrows from the first cyclonic stage air exit to the second cyclonic stage air inlet.
29. The canister or upright vacuum cleaner of claim 26 wherein a filter is not positioned in the passage.
30. The canister or upright vacuum cleaner of claim 26 wherein the passage is configured to inhibit particulate matter from settling out in the passage.
31. The canister or upright vacuum cleaner of claim 23 further comprising a single dirt collection chamber for the second cyclonic stage.
32. The canister or upright vacuum cleaner of claim 23 wherein the first cyclonic cleaning stage comprises a single cyclone.
33. A canister or upright vacuum cleaner comprising:
a) a vacuum cleaner head having a dirty air inlet;
b) a first cyclonic stage in fluid flow communication with the dirty air inlet and with a source of suction, the first cyclonic stage having at least one upstream cyclone which has an associated upstream particle collector and an air exit;
c) a second cyclonic cleaning stage comprising an air inlet and a plurality of downstream cyclones in parallel which have an associated downstream particle collector, the downstream cyclones each having an air exit; and,
d) a passage extending from the first cyclonic stage air exit to the second cyclonic stage air inlet wherein a filter is not positioned in the passage.
34. The canister or upright vacuum cleaner of claim 33 wherein the passage narrows in the downstream direction.
35. The canister or upright vacuum cleaner of claim 33 wherein the passage narrows from the first cyclonic stage air exit to the second cyclonic stage air inlet.
36. The canister or upright vacuum cleaner of claim 33 further comprising a filter positioned downstream from the second cyclonic cleaning stage and in fluid flow communication with each downstream cyclone air exit.
37. The canister or upright vacuum cleaner of claim 36 wherein the downstream cyclone air exits extend to a manifold and the manifold has an air exit which is in fluid flow communication with the filter.
38. The canister or upright vacuum cleaner of claim 33 further comprising a single dirt collection chamber for the second cyclonic stage.
39. The canister or upright vacuum cleaner of claim 33 wherein the first cyclonic cleaning stage comprises a single cyclone.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method of transmuting (i) image data, meaning data representing an image, in the form of pixels having both positional point coordinates and color values, into (ii) another form of data representing the same image, for purposes including image display, the method comprising:
from the image data, defining contour data representing the image in terms of points on contours connecting multiple points each of which points has the same color value to within a predetermined tolerance, the total number of different contours being determined as the minimum required to provide an interpolated fit between contours that will keep error in any visual representation of the image from the contour data below a predetermined threshold error; and
displaying the image from the contour data;
wherein by action of the defining the image data in the form of pixels is transmuted into a new from of data, called contour data, having the form of contours each of which connects multiple points having the same color value to within the predetermined tolerance;
wherein insofar as some image points of identical color values need not both appear on any contours, then the contour data is first-abbreviated, or first-compressed, from the image data from which it is derived.
2. The method according to claim 1
wherein the predetermined tolerance to which the contours aggregating the contour data are defined is of such magnitude as permits that at least some contours will be defined surrounding one or more points having the same color value to within the predetermined tolerance; and
wherein insofar as surrounded points need not be, and are not, included within the contour data, then the contour data is further second-abbreviated, or second-compressed, from the image data from which it is derived.
3. The method according to claim 2 further comprising:
fitting curves, or splines, along the contours in order that the number of points required to represent the contours is reduced;
wherein by this fitting of splines of reduced number of points, the contour data is yet further third-abbreviated, or third-compressed, from the image data from which it is derived.
4. The method according to claim 3 further comprising:
defining the fitted curves, or splines, in terms of a reduced number of points, called control points, along the lengths thereof;
wherein by defining of the fitted curves, or splines, in terms of a further reduced number of control points, the contour data is yet further fourth-abbreviated, or fourth-compressed, from the image data from which it is derived;
wherein the contour data is in reduced from the pixel data from which it is derived nonetheless to representing the same image.
5. The method according to claim 1
wherein the predetermined threshold error, to which threshold error any error in any visual representation of the image from the contour data will be below, is set in consideration of human perception in detecting error in a visual image reconstituted from the contour data.
6. The method according to claim 1
wherein the defining transpires in a computer;
wherein the displaying transpires within an image processor remote from the computer;
wherein, between the defining and the displaying, the contour data is of necessity communicated from the computer to the remote image processor;
wherein, because the contour data is compressed, bandwidth in communication from the computer to the remote image processor is conserved.
7. A method of compressing an initial data structure, wherein the initial data structure defines an image as an array of pixel elements, the method comprising:
providing an error threshold;
generating a new data structure defining a plurality of contours, wherein for at least some of the contours each contour has a color value that is constant to within a tolerance; and
adding information to the new data structure that defines additional contours until an interpolative error between the contours is below the error threshold.
8. The method of claim 7, wherein the error threshold is an error that is based upon the visible limit of observing the interpolative error.
9. The method of claim 7, wherein generating the new data structure includes defining contours that at least partially surround regions of a substantially constant color value.
10. The method of claim 7, further comprising eliminating anomalous pixel data from the initial data structure prior to generating the new data structure.
11. The method of claim 7, further comprising calculating an interpolation of the color between two contours and wherein the interpolative error is an error associated with the difference between the original color versus position between the two boundaries and the interpolation of the color.
12. The method of claim 11, wherein the interpolation is selected to be compatible with a video processing system.
13. The method of claim 7, wherein the new data structure defines each contour as a plurality of connected curves.
14. The method of claim 13, wherein the new data structure defines each curve as a plurality of control points.
15. The method of claim 13, wherein the new data structure defines endpoints for each of the curves.
16. The method of claim 15, wherein the new data structure defines cross-connects that couple endpoints of curves together to define primitives.
17. The method of claim 7, wherein at least some of the contours define maxima or minima for the color values within a region of the image having high rates of color change.
18. The method of claim 7, wherein having a color value constant to within a tolerance is keeping a color difference below a color difference tolerance.
19. The method of claim 7, wherein the color difference is the root mean weighted square difference of three color components.
20. A method of compressing a first data structure wherein the initial data structure defines an image as an array of pixel elements, the method comprising:
generating a second data structure defining a plurality of contours wherein generating the data structure for each of at least some of the plurality of contours includes:
identifying individual points along the contour, the points having a color value that is constant to within a tolerance;
fitting at least one curve to the contour; and
storing control points that define the at least one curve.
21. The method of claim 20, wherein the individual points are found by carrying out a color interpolation between pixels of the first data structure.
22. The method of claim 20, wherein the number of curve defining points is substantially less than the number of individual points.
23. The method of claim 20, wherein the number of curve defining points are the minimum number of points required to specify at least one curve.
24. The method of claim 20, wherein the at least one curve includes a plurality of curves connected end to end, with one of the curve defining points at each end of each curve.
25. The method of claim 20, wherein the at least one curve includes a plurality of curves connected end to end, wherein each curve is either linear, quadratic, or higher order.
26. The method of claim 20, wherein generating the data structure for each of at least some of the contours includes:
identifying individual points along the contour, the points having a color value that is minimized or maximized;
fitting at least one curve to the contour; and
storing control points that define the at least one curve.
27. A method of compressing a first data structure wherein the initial data structure defines an image having both positional point coordinates and color values as an array of pixel elements, the method comprising:
first generating a new data structure that defines from the initial data structure a plurality of primitives, each of at least some of the primitives bounded by a plurality of contour curves connecting multiple points each of which points has the same color value to within a predetermined tolerance, the total number of different contour curves being determined as the minimum required to provide an interpolated fit between curves that will keep error in any visual representation of the image from the new data structure below a predetermined threshold error,
second generating at least one cross connect that couples one contour curve to another contour curve.
28. The method of claim 27, wherein the first generating is of a contour curve that is a linear or higher order curve.
29. The method of claim 27, wherein the second generating is of a cross connect that is a linear curve.
30. The method of claim 27, wherein at least one primitive is defined by two contour curves on two opposing sides and two cross connects that each couple the two contour curves.
31. The method of claim 27, wherein the data structure defines two curve defining points for each cross connect, wherein each of the two curve defining points is also a curve defining point for a contour.
32. A computer program stored in a computer-readable medium, for processing a data structure representing an image, in the form of pixels having both positional point coordinates and color values
wherein the collective pixels define a plurality of contours wherein the contours define some regions of substantially constant color and some regions of varying color; and
wherein the number of contours are determined as the minimum required to provide an interpolated fit between contours that will keep error in any visual representation of the image from the pixel data below a predetermined threshold error.
33. The data structure of claim 32, wherein at least one region of varying color is defined by two adjacent contours wherein a color difference between the contours is selected to reduce an interpolative color error between the contours to below an error threshold.
34. The data structure of claim 32, wherein the contours are selected based on an interpolative function and wherein the interpolative function is selected to optimize performance with a video processing system.
35. The data structure of claim 32, wherein at least some of the contours define maxima or minima for the color values within a region of the image having high rates of color change.
36. The data structure of claim 32, wherein at least some of the contours are contours having a substantially constant color value.
37. The data structure of claim 32, wherein the contours are selected based on an interpolative function and wherein the interpolative function is selected to minimize transmission time over a network connection.
38. The data structure of claim 32, wherein the contours are selected based on an interpolative function and wherein the interpolative function is selected to minimize data structure file size.
39. A method of generating an image comprising:
providing a data structure defining a plurality of contours wherein the contours define some regions of substantially constant color and some regions of varying color, the total number of different contours being determined as the minimum required to provide an interpolated fit between contours that will keen error in any visual representation of the image from the data structure below a predetermined threshold error; and
defining connections between the contours to form polygons.
40. The data structure of claim 39, wherein at least one region of varying color is defined by two adjacent contours wherein a color difference between the contours is selected to reduce an interpolative color error between the contours to below an error threshold.
41. The data structure of claim 39, wherein the contours are selected based on an interpolative function and wherein the interpolative function is selected to optimize performance with a video processing system.
42. The method of claim 39, wherein at least some of the contours define maxima or minima for the color values within a region of the image having high rates of color change.
43. The method of claim 39, wherein at least some of the contours are contours having a substantially constant color value.
44. The data structure of claim 39, wherein the contours are selected based on an interpolative function and wherein the interpolative function is selected to minimize transmission time over a network connection.
45. The data structure of claim 39, wherein the contours are selected based on an interpolative function and wherein the interpolative function is selected to minimize data structure file size.
46. A method of generating an image comprising:
providing a data structure having points with the same color value within a predetermined tolerance, the points defining a plurality of contours wherein the contours define some regions of substantially constant color and some regions of varying color, and wherein the total number of different contours are determined as the minimum required to provide an interpolated fit between contours that will keep error in any visual representation of the image from the contour data below a predetermined threshold error; and
adding or removing points from the data structure based on an image magnification factor.
47. The method of claim 46, wherein the contours and points are selected to optimize performance with a video processing system.
48. The method of claim 46, wherein at least some of the contours define maxima or minima for the color values within a region of the image having high rates of color change.
49. The method of claim 46, wherein at least some of the contours are contours having a substantially constant color value.

Having thus described the preferred embodiment, the invention is now claimed to be:

1. An upright vacuum cleaner comprising:
a nozzle base having a suction inlet;
an upper housing hingedly connected to the nozzle base, the upper housing being selectively moveable between a generally vertical position and a generally inclined position;
a tube assembly disposed at least partially within the upper housing;
a receiving portion located within the nozzle base; and
a coupling member configured to be received by the receiving portion for coupling the tube assembly to the suction inlet, the coupling member having a thread segment disposed on its outer surface dimensioned to cooperate with a surface of the receiving portion, the thread segment and the cooperating surface of the receiving portion being dimensioned to urge the coupling member into a friction fit seal with the suction inlet upon less than one full rotation of the coupling member.
2. The upright vacuum cleaner according to claim 1, wherein the thread segment extends across less than one half the perimeter of the coupling member.
3. The upright vacuum cleaner according to claim 1, wherein the thread segment extends across less than one quarter the perimeter of the coupling member.
4. The upright vacuum cleaner according to claim 3, wherein the thread segment and cooperating surface of the receiving portion are dimensioned to urge the coupling member into a friction fit seal with the inlet area upon less than a half rotation of the coupling member.
5. The upright vacuum cleaner according to claim 1, wherein the coupling member is substantially cylindrical including a first axial end and a second axial end, the first axial end being tapered.
6. The upright vacuum cleaner according to claim 1, wherein the coupling member includes a finger extending from its outer peripheral surface for assisting in rotation of the coupling member.
7. The upright vacuum cleaner according to claim 1, wherein a first axial end of the coupling member is tapered and dimensioned to frictionally fit within the suction inlet and a second axial end of the coupling member is dimensioned to be supported on a rear wall of the receiving portion, the cooperating surface of the receiving portion being an inner surface of the receiving portion’s rear wall.
8. The upright vacuum cleaner according to claim 1, wherein the coupling member is substantially toroidal having a duct extending axially therethrough, an inner surface of the coupling member having a plurality of threads for threadably connecting the coupling member to the tube assembly.
9. The upright vacuum cleaner according to claim 1, wherein the thread segment is angled with respect to a plane perpendicular to an axial end of the coupling member.
10. A coupling member for connecting a hose assembly to a nozzle base of an upright vacuum cleaner comprising:
a substantially toroidal body portion having a first axial end, a second axial end, an outer sidewall, and a duct extending therethrough, said first axial end of said body being tapered; and,
a thread segment disposed on the outer sidewall of the body and extending less than 360 around a periphery of the outer sidewall of the body, the thread segment being dimensioned to rotatingly cooperate with an associated surface of the nozzle base for urging the coupling member into a friction fit seal with the associated surface.
11. The upright vacuum cleaner according to claim 10, wherein the thread segment extends less than 180 around the periphery of the outer sidewall of the body portion.
12. The upright vacuum cleaner according to claim 10, wherein the thread segment extends less than 90 around the periphery of the outer sidewall of the body portion.
13. The upright vacuum cleaner according to claim 10, further including a finger disposed on the peripheral sidewall of the body portion for assisting in rotation of the coupling member.
14. The upright vacuum cleaner according to claim 10, wherein an inner sidewall of the body portion includes a plurality of threads for threadably connecting the coupling member to an associated tube assembly.
15. The upright vacuum cleaner according to claim 10, wherein the thread segment is angled with respect to a plane perpendicular to an axial end of the body portion.
16. A method of connecting a tube assembly of an upright vacuum cleaner to an opening in a nozzle base of the vacuum cleaner, the steps comprising:
providing a coupling member having a substantially cylindrical body portion with a thread segment extending less than 360 around an outer surface of the body portion;
positioning the coupling member within a receiving portion disposed in the vacuum cleaner’s nozzle base so that a first tapered end of the coupling member is fitted within a suction inlet of the nozzle base,
rotating the coupling member less than one full rotation so that the thread segment rotatingly cooperates with a surface of the receiving portion; and
urging the tapered end of the coupling member into a friction fit seal with the suction inlet of the nozzle base through continued rotation of the coupling member.
17. The method according to claim 16, wherein the step of rotating the coupling member includes rotating the coupling member less than 90.
18. The method according to claim 16, wherein the step of positioning the coupling member further includes positioning the coupling member within the receiving portion so that a finger extending from a peripheral sidewall of the coupling member is located at approximately a 12 O’clock position.
19. The method according to claim 16, wherein the step of rotating the coupling member further includes urging a finger extending from the coupling member in one of a clockwise and counterclockwise direction.
20. A vacuum cleaner comprising:
a suction nozzle located in a housing;
a filter chamber;
a conduit fluidly connecting said suction nozzle to said filter chamber, said connector having a first end and a second end;
a connector mounted on said first end of said conduit, said connector comprising an outer surface including a thread segment; and,
a receiving portion located on said housing and communicating with said suction nozzle, said receiving portion comprising a wall having an edge which cooperates with said thread segment in order to cammingly engage said connector with said receiving portion.
21. The vacuum cleaner of claim 20 wherein said receiving portion wall edge comprises a thread segment which engages said thread segment of said connector.
22. The vacuum cleaner of claim 20 wherein said connector further comprises a first end and a second end and wherein said receiving portion further comprises a duct section which is sized to accommodate said connector first end.
23. The vacuum cleaner of claim 22 wherein said connector first end is tapered.
24. The vacuum cleaner of claim 20 wherein said connector further comprises a finger located on said outer surface.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method for displaying an ad hoc image at a venue comprising:
generating an ad hoc image data structure for the ad hoc image wherein the ad hoc image data structure comprises a plurality of a set of pixels, each set of pixels comprising one or more plurality of ad hoc image pixels;
prompting a user to enter identification information;
determine a seat location within the venue for the user based on the identification information;
providing a server configured for downloading a mobile ad hoc imaging application to a mobile device upon request to the user; and
downloading the mobile ad hoc imaging application to the user,
wherein the mobile ad hoc imaging application is configured to cause the mobile device to
receive the seat location within the venue for the user,
synchronize a display of the set of pixels comprising the one or more plurality of the ad hoc image pixels to a timing reference, and
display the set of pixels comprising the one or more plurality of the ad hoc image pixels in the venue.
2. The method of claim 1, wherein generating the ad hoc image data structure comprises adapting an image to a seating configuration of the venue to create the set of pixels associated with the seat location in the venue.
3. The method of claim 2, wherein the set of pixels is further associated with a time for displaying.
4. The method of claim 3, wherein downloading the ad hoc imaging application comprises
providing a quick response (\u201cQR\u201d) code identifying a web site providing the ad hoc imaging application and
downloading the ad hoc image application from the web site, wherein the ad hoc image application comprises the ad hoc image data structure comprising the set of pixels.
5. The method of claim 3, wherein the seat location comprises a section number, a row number, and a seat number.
6. The method of claim 5, wherein the display of the set of pixels comprises a display of one of the plurality of ad hoc image pixels associated with the seat location.
7. The method of claim 1, wherein synchronize the display of the set of pixels to the timing reference uses time maintained in the mobile device.
8. The method of claim 7, wherein the mobile ad hoc imaging application receives a time value of a time at which the display of the set of pixels is to occur.
9. The method of claim 1 wherein the mobile ad hoc imaging application is further configured to:
display a second set of pixels associated with the seat location in the venue at a second time.
10. The method of claim 5 wherein generating the ad hoc image data structure for an image comprises generating the plurality of a set of pixels for display at a plurality of times.
11. The method of claim 10, wherein generating the plurality of the set of pixels for display at the plurality of times further comprises generating the plurality of the set of pixels for the plurality of times for a plurality of seat locations.
12. A system for providing an ad hoc image displayed in a venue comprising:
a server storing an ad hoc image data structure, where the ad hoc image data structure comprises a plurality of ad hoc image pixels, the server further storing a mobile ad hoc image application configured to
prompt a user to enter identification information,
determine a seat location within the venue for the user based on the identification information, where the seat location comprises a section number, row number, and seat number,
synchronize display of one of a plurality of ad hoc image pixels on a mobile device with respect to a timing reference, and
display one of the plurality of ad hoc image pixels in the venue at a first time.
13. The system of claim 12 wherein the server is configured to email the ad hoc image data structure to a plurality of users.
14. The system of claim 12, wherein each of the plurality of ad hoc image pixels is associated with a respective seat location of the venue.
15. The system of claim 14 wherein the mobile ad hoc image application is further configured to display another one of the plurality of ad hoc image pixels in the venue at a second time.
16. The system of claim 15 wherein the mobile device comprises a smart phone.
17. An instance of computer readable media comprising instructions that when executed cause a mobile computing device to:
prompt a user to enter identification information;
determine a seat location in a venue for the user based on the identification information;
retrieve an ad hoc image data structure comprising an ad hoc image pixel associated with the seat location;
ascertain a time associated with displaying the ad hoc image pixel;
determine a current time is the time associated with displaying the ad hoc image pixel; and
display the ad hoc image pixel.
18. The instance of computer readable media comprising instructions of claim 17, further comprising instructions causing the mobile computing device to:
select another ad hoc image pixel from the ad hoc image data structure associated with the seat location;
ascertain a second time associated with displaying the another ad hoc image pixel; and
display the another ad hoc image pixel.
19. The instance of computer readable media of claim 18 wherein ascertaining the time associated with displaying the ad hoc image pixel is indicated by data stored in a mobile ad hoc imaging application.
20. The instance of computer readable media of claim 19 wherein the instructions further cause the mobile device to
receive the ad hoc image data structure as streaming data at the venue.