1. A method for improving image stitch-in phenomenon, comprising the steps of:
a. inserting at least a first gray-scale line(s) into at least a scan line position of a frame within serial frames;
b. inserting at least a second gray-scale line(s) into at least a scan line position of the next frame; and
c. carry on above-mentioned steps a and b repeatedly for other frame of the serial frames until all scan line position had inserted the first gray-scale line and the second gray-scale line.
2. The method of claim 1, wherein the first gray-scale line(s) and the second gray-scale line(s) have the same gray scale.
3. The method of claim 2, wherein the first gray-scale line(s) and the second gray-scale line(s) are black line(s).
4. The method of claim 2, wherein the black line is inserted into the ith scan line position of the ith frame in a multiple of consecutive frames, wherein i being an integer number.
5. The method of claim 2, wherein j gray-scale lines are inserted into the (i*j)th to the (i+1)*j\u22121th scan line positions of the ith frame in a multiple of consecutive frames, wherein i, j being integer numbers.
6. The method of claim 1, wherein the first gray-scale line(s) and the second gray-scale line(s) have different gray scales.
7. The method of claim 6, wherein the first gray-scale line(s) are black line(s) and the second gray-scale line(s) are middle tone gray line(s).
8. The method of claim 6, wherein the first gray-scale line is inserted into the ith scan line position of the (2i)th frame and the second gray-scale line is inserted into the ith scan line position of the (2i+1)th frame in a multiple of consecutive frames, wherein i being an integer number.
9. The method of claim 6, wherein j first gray-scale lines are inserted into the (i*j)th to the (i+1)*j\u22121th scan line positions of the (2i)th frame and j second gray-scale lines are inserted into the (i*j)th to the (i+1)*j\u22121th scan line positions of the (2i+1)th frame in a multiple of consecutive frames, wherein i, j being integer numbers.
10. The method of claim 1, wherein the method further includes:
inserting a corresponding number of third gray-scale line(s) into at least a scan line position in the second next frame;
wherein the first gray-scale line, the second gray-scale line and the third gray-scale line have different gray scales.
11. The method of claim 10, wherein the first gray-scale line is a black line, the second gray-scale line is a middle tone gray line and the third gray-scale line is a white line.
12. The method of claim 10, wherein the first gray-scale line is inserted into the ith scan line position of the (3i)th frame, the second gray-scale line is inserted into the ith scan line position of the (3i+1)th frame and the third gray-scale line is inserted into the ith scan line position of the (3i+2)th frame in a multiple of consecutive frames, wherein i being an integer number.
13. The method of claim 10, wherein j first gay-scale lines are inserted into the (i*j)th to the (i+1)*j\u22121th scan line positions of the (3i)th frame, j second gay-scale lines are inserted into the (i*j)th to the (i+1)*j\u22121th scan line positions of the (3i+1)th frame and j third gay-scale lines are inserted into the (i*j)th to the (i+1)*j\u22121th scan line positions of the (3i+2)th frame in a multiple of consecutive frames, wherein i, j being integer numbers.
14. The method of claim 1, wherein the steps for improving image stitch-in phenomenon are performed once after a preset period.
15. The method of claim 1, wherein the total duration of the steps for improving image stitch-in phenomenon lasts no longer than a preset period.
16. The method of claim 1, wherein the steps are used for preventing image stitch-in phenomenon in an electronic photo frame.
17. The method of claim 16, wherein the electronic photo frame has a liquid crystal display panel.
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 computer-implemented method, comprising:
discovering a utility network, wherein a constant powered meter sends network discovery messages to find the utility network;
discovering neighboring meters, wherein the constant powered meter sends hello messages periodically; and
registering the constant powered meter with the utility network, wherein the constant powered meter sends a node registration message to a gateway.
2. The computer-implemented method of claim 1, wherein discovering the utility network further comprises:
scanning one or more channels for an active network; and
waiting for network discovery acknowledgment messages from one or more of the neighboring meters and the gateway.
3. The computer-implemented method of claim 2, wherein discovering the neighboring meters further comprises receiving sate information from one or more of the neighboring meters, and maintaining a neighbor table.
4. The computer-implemented method of claim 2, wherein registering the constant powered meter further comprises waiting for registration acknowledgment messages.
5. The computer-implemented method of claim 3, further comprising removing a neighbor entry from the neighbor table when data is not received over a predetermined time period from a neighbor associated with the neighbor entry.
6. The computer-implemented method of claim 5, further comprising discovering a second utility network when the constant powered meter determines all neighbors associated with the neighbor table are not active.
7. The computer-implemented method of claim 6, further comprising receiving neighbor discovery acknowledgement messages indicating that one or more of the neighboring devices has a valid path to the gateway.
8. The computer-implemented method of claim 1, further comprising:
providing the gateway with information regarding the neighboring meters;
receiving routing information from the gateway; and
receiving optimized settings from the gateway.
9. The computer-implemented method of claim 1, further comprising communicating with a battery powered meter and passing a battery powered node registration message to the gateway.
10. The computer-implemented method of claim 1, further comprising discovering the utility network when the gateway can not be reached.
11. A system, comprising:
a utility network;
a constant powered meter communicating via the utility network;
a battery powered meter associated with the constant powered meter; and
a gateway communicating via the utility network, wherein the constant powered meter is configured to discover the utility network, send network discovery messages to find the utility network, discover neighboring meters, send hello messages periodically, register with the utility network, and send a node registration message to a gateway.
12. The system of claim 11, wherein the constant powered meter scans one or more channels for an active network; and waits for network discovery acknowledgment messages from one or more of the neighboring meters and the gateway.
13. The system of claim 12, wherein the constant powered meter includes a neighbor table.
14. The system of claim 12, wherein the constant powered meter waits for registration acknowledgment messages.
15. The system of claim 13, wherein the constant powered meter removes a neighbor entry from the neighbor table when data is not received over a predetermined time period from a neighbor associated with the neighbor entry.
16. The system of claim 15, wherein the constant powered meter discovers a second utility network when all neighbors associated with the neighbor table are not active.
17. The system of claim 16, wherein the constant powered meter receives neighbor discovery acknowledgement messages indicating that one or more of the neighboring devices has a valid path to the gateway.
18. The system of claim 11, wherein the constant powered meter provides the gateway with information regarding the neighboring meters; receives routing information from the gateway; and receives system settings from the gateway.
19. The system of claim 11, wherein the constant powered meter communicates with a battery powered meter and passes a battery powered node registration message to the gateway.
20. The system of claim 11, wherein the constant powered meter discovers the utility network when the gateway can not be reached.
21. The system of claim 11, wherein the constant powered meter discovers other utility networks by channel scanning, and initiates a set of procedures with which it migrates to an alternate utility network.
22. The system of claim 11, wherein the neighboring meters initiate a set of procedures to notify the utility network and the gateway that the constant powered meter is no longer part of the utility network.